<｜begin▁of▁sentence｜>### Instruction:
Given a star graph with 10 peripheral nodes (star_graph(10)), could you compute the second order centrality using NetworkX and identify the node with the lowest second order centrality value? This computation is for nodes' importance evaluation based on their centrality in an undirected and connected graph.
### Response:
import networkx as nx

G = nx.star_graph(10)
soc = nx.second_order_centrality(G)

print(sorted(soc.items(), key=lambda x: x[1])[0][0])  # pick first id
# 0
<|EOT|>
