{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M73V2QTLW2I3T2TLNJQYS32S3L","short_pith_number":"pith:M73V2QTL","canonical_record":{"source":{"id":"1210.0090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:06:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3cb71919226dbb8ec3aa43ee4ee3657a026231aeee68932d69605cbd7f063255","abstract_canon_sha256":"e70cbb76074e0b35a1914e9c10be60665c7368b4d6b542bdfae8942d8fcc204f"},"schema_version":"1.0"},"canonical_sha256":"67f75d426bb691b9ea6b6a61896f52dad359784a7550afcb2103583664b759c5","source":{"kind":"arxiv","id":"1210.0090","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0090","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0090v2","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0090","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"M73V2QTLW2I3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M73V2QTLW2I3T2TL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M73V2QTL","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M73V2QTLW2I3T2TLNJQYS32S3L","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:06:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3cb71919226dbb8ec3aa43ee4ee3657a026231aeee68932d69605cbd7f063255","abstract_canon_sha256":"e70cbb76074e0b35a1914e9c10be60665c7368b4d6b542bdfae8942d8fcc204f"},"schema_version":"1.0"},"canonical_sha256":"67f75d426bb691b9ea6b6a61896f52dad359784a7550afcb2103583664b759c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:47.012802Z","signature_b64":"DuOcJ9093eo/BtZyIoCDf67YHwf2d/C4mE/6Ziqs0HKwUfGHtH1d7yVmIfMoRSqExWzsf1SiYYkejS+GJ3ZlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f75d426bb691b9ea6b6a61896f52dad359784a7550afcb2103583664b759c5","last_reissued_at":"2026-05-18T03:01:47.012353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:47.012353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0090","source_version":2,"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-18T03:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdDtwyhV/1G4i5XVPqoVa6e/WSdxi7GFeToL+fBZC4JAuykGQhTHmYUYMa+vGApucEJkDkmsadrqloZqq8GADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:30:45.969986Z"},"content_sha256":"26290ea1693ecfebc25bf106581fd60b84b759f2318cfa2d20773d749ac0415d","schema_version":"1.0","event_id":"sha256:26290ea1693ecfebc25bf106581fd60b84b759f2318cfa2d20773d749ac0415d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M73V2QTLW2I3T2TLNJQYS32S3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Number of Spanning Trees in Apollonian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bin Wu, Francesc Comellas, Zhongzhi Zhang","submitted_at":"2012-09-29T10:06:05Z","abstract_excerpt":"In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic spreading, synchronization, and random walks. As Apollonian networks constitute an interesting family of maximal planar graphs which are simultaneously small-world, scale-free, Euclidean and space filling and highly clustered, the study of their spanning trees is of particular relevance. Our results allow also the calculation of the spanning tree entropy of A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0090","kind":"arxiv","version":2},"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-18T03:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZiCuhz4KnrzuFV9D3cZNSk/B1gN3YzoJDbZ08nllUxoAyn4GH4ZHaLXJaeM/eexECTuwmIDKkWLYfNwaMk/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:30:45.970346Z"},"content_sha256":"d19ba25ee4662a62b838dc7296be59433beef105dc09f0e593c68c66a07755f5","schema_version":"1.0","event_id":"sha256:d19ba25ee4662a62b838dc7296be59433beef105dc09f0e593c68c66a07755f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M73V2QTLW2I3T2TLNJQYS32S3L/bundle.json","state_url":"https://pith.science/pith/M73V2QTLW2I3T2TLNJQYS32S3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M73V2QTLW2I3T2TLNJQYS32S3L/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-06-02T14:30:45Z","links":{"resolver":"https://pith.science/pith/M73V2QTLW2I3T2TLNJQYS32S3L","bundle":"https://pith.science/pith/M73V2QTLW2I3T2TLNJQYS32S3L/bundle.json","state":"https://pith.science/pith/M73V2QTLW2I3T2TLNJQYS32S3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M73V2QTLW2I3T2TLNJQYS32S3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M73V2QTLW2I3T2TLNJQYS32S3L","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":"e70cbb76074e0b35a1914e9c10be60665c7368b4d6b542bdfae8942d8fcc204f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:06:05Z","title_canon_sha256":"3cb71919226dbb8ec3aa43ee4ee3657a026231aeee68932d69605cbd7f063255"},"schema_version":"1.0","source":{"id":"1210.0090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0090","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0090v2","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0090","created_at":"2026-05-18T03:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"M73V2QTLW2I3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M73V2QTLW2I3T2TL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M73V2QTL","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:d19ba25ee4662a62b838dc7296be59433beef105dc09f0e593c68c66a07755f5","target":"graph","created_at":"2026-05-18T03:01:47Z","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":"In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic spreading, synchronization, and random walks. As Apollonian networks constitute an interesting family of maximal planar graphs which are simultaneously small-world, scale-free, Euclidean and space filling and highly clustered, the study of their spanning trees is of particular relevance. Our results allow also the calculation of the spanning tree entropy of A","authors_text":"Bin Wu, Francesc Comellas, Zhongzhi Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:06:05Z","title":"The Number of Spanning Trees in Apollonian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0090","kind":"arxiv","version":2},"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:26290ea1693ecfebc25bf106581fd60b84b759f2318cfa2d20773d749ac0415d","target":"record","created_at":"2026-05-18T03:01:47Z","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":"e70cbb76074e0b35a1914e9c10be60665c7368b4d6b542bdfae8942d8fcc204f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:06:05Z","title_canon_sha256":"3cb71919226dbb8ec3aa43ee4ee3657a026231aeee68932d69605cbd7f063255"},"schema_version":"1.0","source":{"id":"1210.0090","kind":"arxiv","version":2}},"canonical_sha256":"67f75d426bb691b9ea6b6a61896f52dad359784a7550afcb2103583664b759c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67f75d426bb691b9ea6b6a61896f52dad359784a7550afcb2103583664b759c5","first_computed_at":"2026-05-18T03:01:47.012353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:47.012353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DuOcJ9093eo/BtZyIoCDf67YHwf2d/C4mE/6Ziqs0HKwUfGHtH1d7yVmIfMoRSqExWzsf1SiYYkejS+GJ3ZlCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:47.012802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26290ea1693ecfebc25bf106581fd60b84b759f2318cfa2d20773d749ac0415d","sha256:d19ba25ee4662a62b838dc7296be59433beef105dc09f0e593c68c66a07755f5"],"state_sha256":"7d4218d98dacabc80efdded1ea1a286e8fc16f76f9065e5f6971d6dd572bd689"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hnjcqk4MEIBehztyjoSRiczYT222jDqxCUeqf47y+DZoGOiMMvghv5UbM9iegfvT2R8CJoGyST9il2Swp5Y8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:30:45.972341Z","bundle_sha256":"49bc3d18d7a64dae6764b69a9f81b2491e20a5da9ab6887825d6447df93fea53"}}