{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BZND3FGUKTSJ6LNTJKJF7CRIKR","short_pith_number":"pith:BZND3FGU","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"},"canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","source":{"kind":"arxiv","id":"1306.0322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0322","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0322v3","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0322","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"BZND3FGUKTSJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BZND3FGUKTSJ6LNT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BZND3FGU","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BZND3FGUKTSJ6LNTJKJF7CRIKR","target":"record","payload":{"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"},"canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","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"},"source_kind":"arxiv","source_id":"1306.0322","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NMvhpNwTd4mk1lUQK533LoeafYfVOFSSqJHM/7Gwz1ux7vlH4lL8gIsDYhnqFF619moc2t1Wv+N88/o0xzqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:42:07.484540Z"},"content_sha256":"f3c93b3886d021b8a1112cf9df9678aab6e65e53520faae2ba2eaaca57036b51","schema_version":"1.0","event_id":"sha256:f3c93b3886d021b8a1112cf9df9678aab6e65e53520faae2ba2eaaca57036b51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BZND3FGUKTSJ6LNTJKJF7CRIKR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjOyR5DEyO6lkhbVs3tR+VgaNKxO72Qd2HAHNHc6FcywZ29/T7CMEtfFvFERdCbaMuZoUvrk4flvJ3axWra+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:42:07.485185Z"},"content_sha256":"e1abc28cb6e0ac0fcd9818d02169ac6af341d3d1ce2c94f4316669401f4fd8b5","schema_version":"1.0","event_id":"sha256:e1abc28cb6e0ac0fcd9818d02169ac6af341d3d1ce2c94f4316669401f4fd8b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/bundle.json","state_url":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T22:42:07Z","links":{"resolver":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR","bundle":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/bundle.json","state":"https://pith.science/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZND3FGUKTSJ6LNTJKJF7CRIKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BZND3FGUKTSJ6LNTJKJF7CRIKR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"12920a7dcfbdae2c43aa03a24530e484afbdd0b990a71ff85911c0d91a8d838d","cross_cats_sorted":["cs.CC","cs.CG","math.IT","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-03T08:36:11Z","title_canon_sha256":"8ed58af6ef86f3818b9ea7f4651435e75afbcfa4bc9b5fbaf9db0c4418f1a0a1"},"schema_version":"1.0","source":{"id":"1306.0322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0322","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0322v3","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0322","created_at":"2026-05-18T01:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"BZND3FGUKTSJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BZND3FGUKTSJ6LNT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BZND3FGU","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e1abc28cb6e0ac0fcd9818d02169ac6af341d3d1ce2c94f4316669401f4fd8b5","target":"graph","created_at":"2026-05-18T01:49:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ard A. Louis, Fernando Soler-Toscano, Hector Zenil, Kamaludin Dingle","cross_cats":["cs.CC","cs.CG","math.IT","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-03T08:36:11Z","title":"Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0322","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f3c93b3886d021b8a1112cf9df9678aab6e65e53520faae2ba2eaaca57036b51","target":"record","created_at":"2026-05-18T01:49:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"12920a7dcfbdae2c43aa03a24530e484afbdd0b990a71ff85911c0d91a8d838d","cross_cats_sorted":["cs.CC","cs.CG","math.IT","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-03T08:36:11Z","title_canon_sha256":"8ed58af6ef86f3818b9ea7f4651435e75afbcfa4bc9b5fbaf9db0c4418f1a0a1"},"schema_version":"1.0","source":{"id":"1306.0322","kind":"arxiv","version":3}},"canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e5a3d94d454e49f2db34a925f8a2854724d697b12f0a0cd8df44944c01e90f0","first_computed_at":"2026-05-18T01:49:38.652053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:38.652053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGjjNWWoCW4/6p4LvF4oJmqyM47MTToG5Zx4nRpRK6LjqwMCejYkzbLHAHYaBtphe3/X2m3aNN5x58f1RXcvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:38.652500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3c93b3886d021b8a1112cf9df9678aab6e65e53520faae2ba2eaaca57036b51","sha256:e1abc28cb6e0ac0fcd9818d02169ac6af341d3d1ce2c94f4316669401f4fd8b5"],"state_sha256":"fb05d0e781559d10af0a813d54995f4fb9c0ba09520d1a00e7300fedfebdfb8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOHFtVyVtyVWt9PTFSVfbNZR56IUJ+b0XLFF42T4waQlVmy9elEey/wu787978OqKAfWqaoZYfm+EEuAYoKGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:42:07.488882Z","bundle_sha256":"52b93171fce7996d1bdfc469567dc51217d941190a5a620a1689deccb56a67de"}}