{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BZND3FGUKTSJ6LNTJKJF7CRIKR","short_pith_number":"pith:BZND3FGU","schema_version":"1.0","canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","source":{"kind":"arxiv","id":"1306.0322","version":3},"attestation_state":"computed","paper":{"title":"Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.IT","q-bio.MN"],"primary_cat":"cs.IT","authors_text":"Ard A. Louis, Fernando Soler-Toscano, Hector Zenil, Kamaludin Dingle","submitted_at":"2013-06-03T08:36:11Z","abstract_excerpt":"We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That K and the size of the group of automorphisms of a graph are correlated opens up interesting connections to problems in computational geometry, and thus connects several measures and concepts from complexity science. We show that approximations of K characterise synthetic and natural networks by their generating mechanisms, assigning lower algorithmic randomn"},"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":"1306.0322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-03T08:36:11Z","cross_cats_sorted":["cs.CC","cs.CG","math.IT","q-bio.MN"],"title_canon_sha256":"8ed58af6ef86f3818b9ea7f4651435e75afbcfa4bc9b5fbaf9db0c4418f1a0a1","abstract_canon_sha256":"12920a7dcfbdae2c43aa03a24530e484afbdd0b990a71ff85911c0d91a8d838d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:38.652500Z","signature_b64":"lGjjNWWoCW4/6p4LvF4oJmqyM47MTToG5Zx4nRpRK6LjqwMCejYkzbLHAHYaBtphe3/X2m3aNN5x58f1RXcvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","last_reissued_at":"2026-05-18T01:49:38.652053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:38.652053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.IT","q-bio.MN"],"primary_cat":"cs.IT","authors_text":"Ard A. Louis, Fernando Soler-Toscano, Hector Zenil, Kamaludin Dingle","submitted_at":"2013-06-03T08:36:11Z","abstract_excerpt":"We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That K and the size of the group of automorphisms of a graph are correlated opens up interesting connections to problems in computational geometry, and thus connects several measures and concepts from complexity science. We show that approximations of K characterise synthetic and natural networks by their generating mechanisms, assigning lower algorithmic randomn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0322","kind":"arxiv","version":3},"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":"1306.0322","created_at":"2026-05-18T01:49:38.652122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0322v3","created_at":"2026-05-18T01:49:38.652122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0322","created_at":"2026-05-18T01:49:38.652122+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZND3FGUKTSJ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZND3FGUKTSJ6LNT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZND3FGU","created_at":"2026-05-18T12:27:40.988391+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/BZND3FGUKTSJ6LNTJKJF7CRIKR","json":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR.json","graph_json":"https://pith.science/api/pith-number/BZND3FGUKTSJ6LNTJKJF7CRIKR/graph.json","events_json":"https://pith.science/api/pith-number/BZND3FGUKTSJ6LNTJKJF7CRIKR/events.json","paper":"https://pith.science/paper/BZND3FGU"},"agent_actions":{"view_html":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR","download_json":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR.json","view_paper":"https://pith.science/paper/BZND3FGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0322&json=true","fetch_graph":"https://pith.science/api/pith-number/BZND3FGUKTSJ6LNTJKJF7CRIKR/graph.json","fetch_events":"https://pith.science/api/pith-number/BZND3FGUKTSJ6LNTJKJF7CRIKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/action/storage_attestation","attest_author":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/action/author_attestation","sign_citation":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/action/citation_signature","submit_replication":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/action/replication_record"}},"created_at":"2026-05-18T01:49:38.652122+00:00","updated_at":"2026-05-18T01:49:38.652122+00:00"}