{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGKMKFD5SNR2FLHARJQVYRTPXB","short_pith_number":"pith:GGKMKFD5","schema_version":"1.0","canonical_sha256":"3194c5147d9363a2ace08a615c466fb86d4c36ae299529cb072d9ce9d0425d3e","source":{"kind":"arxiv","id":"1405.6077","version":1},"attestation_state":"computed","paper":{"title":"Move ordering and communities in complex networks describing the game of go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B. Georgeot, O. Giraud, V. Kandiah","submitted_at":"2014-05-23T14:38:04Z","abstract_excerpt":"We analyze the game of go from the point of view of complex networks. We construct three different directed networks of increasing complexity, defining nodes as local patterns on plaquettes of increasing sizes, and links as actual successions of these patterns in databases of real games. We discuss the peculiarities of these networks compared to other types of networks. We explore the ranking vectors and community structure of the networks and show that this approach enables to extract groups of moves with common strategic properties. We also investigate different networks built from games wit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.6077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-05-23T14:38:04Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0b38b5ec77a4d0cba317f488f94cd80d2e34f8f31e639c976b7ffa373c71195a","abstract_canon_sha256":"872ee843f9eac11b42d92b06c6658454b0105b94e6d813fa6845fe198f3f41fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:25.432714Z","signature_b64":"EsI2o6llOXYFT+Z6XkS2PDV+UHUas5orR6qC+tcPwN3SM3BcZEuxBgbfyFS7kliA0LmpBkn04p+wwLIKfOh/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3194c5147d9363a2ace08a615c466fb86d4c36ae299529cb072d9ce9d0425d3e","last_reissued_at":"2026-05-18T02:39:25.432063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:25.432063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Move ordering and communities in complex networks describing the game of go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B. Georgeot, O. Giraud, V. Kandiah","submitted_at":"2014-05-23T14:38:04Z","abstract_excerpt":"We analyze the game of go from the point of view of complex networks. We construct three different directed networks of increasing complexity, defining nodes as local patterns on plaquettes of increasing sizes, and links as actual successions of these patterns in databases of real games. We discuss the peculiarities of these networks compared to other types of networks. We explore the ranking vectors and community structure of the networks and show that this approach enables to extract groups of moves with common strategic properties. We also investigate different networks built from games wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6077","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6077","created_at":"2026-05-18T02:39:25.432155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6077v1","created_at":"2026-05-18T02:39:25.432155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6077","created_at":"2026-05-18T02:39:25.432155+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGKMKFD5SNR2","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGKMKFD5SNR2FLHA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGKMKFD5","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB","json":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB.json","graph_json":"https://pith.science/api/pith-number/GGKMKFD5SNR2FLHARJQVYRTPXB/graph.json","events_json":"https://pith.science/api/pith-number/GGKMKFD5SNR2FLHARJQVYRTPXB/events.json","paper":"https://pith.science/paper/GGKMKFD5"},"agent_actions":{"view_html":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB","download_json":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB.json","view_paper":"https://pith.science/paper/GGKMKFD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6077&json=true","fetch_graph":"https://pith.science/api/pith-number/GGKMKFD5SNR2FLHARJQVYRTPXB/graph.json","fetch_events":"https://pith.science/api/pith-number/GGKMKFD5SNR2FLHARJQVYRTPXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB/action/storage_attestation","attest_author":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB/action/author_attestation","sign_citation":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB/action/citation_signature","submit_replication":"https://pith.science/pith/GGKMKFD5SNR2FLHARJQVYRTPXB/action/replication_record"}},"created_at":"2026-05-18T02:39:25.432155+00:00","updated_at":"2026-05-18T02:39:25.432155+00:00"}