{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HDDNU2AISIKPZILIMYOXCRRMDJ","short_pith_number":"pith:HDDNU2AI","canonical_record":{"source":{"id":"1210.0092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:43:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0b503e637a29f0b1304b77439cb7d3980c86cef8e19f10a2134f96274a44a3f","abstract_canon_sha256":"8c71c0836429eecf8d98571de2d450ce5ddfbf4bc0be99418459530d931bfd55"},"schema_version":"1.0"},"canonical_sha256":"38c6da68089214fca168661d71462c1a623ee54e995416f105313d36e151619b","source":{"kind":"arxiv","id":"1210.0092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0092","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0092v2","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0092","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"HDDNU2AISIKP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HDDNU2AISIKPZILI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HDDNU2AI","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HDDNU2AISIKPZILIMYOXCRRMDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:43:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0b503e637a29f0b1304b77439cb7d3980c86cef8e19f10a2134f96274a44a3f","abstract_canon_sha256":"8c71c0836429eecf8d98571de2d450ce5ddfbf4bc0be99418459530d931bfd55"},"schema_version":"1.0"},"canonical_sha256":"38c6da68089214fca168661d71462c1a623ee54e995416f105313d36e151619b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:54:12.549235Z","signature_b64":"yX6CymioYxuoQlA8Uj4R6CwsEoc6Ap3BZLp9eRFGBJzxf2sITupNL5cvuOuvCkFFd1cd4ini6sjtELLNfufgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38c6da68089214fca168661d71462c1a623ee54e995416f105313d36e151619b","last_reissued_at":"2026-05-18T01:54:12.548759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:54:12.548759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0092","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-18T01:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcyGNYxzHSOpRpE/ffl3aLsR2SgJ9Qt9rLCsWd+5r9XZoPwciz6JNsIE7qkpFBcgOnnen0ZRtA7Xv/aJxLbSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:33.704485Z"},"content_sha256":"a422b19788a2b21996970cb6351f48fa6ac6d04d60aed53909b9bf9cc6448180","schema_version":"1.0","event_id":"sha256:a422b19788a2b21996970cb6351f48fa6ac6d04d60aed53909b9bf9cc6448180"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HDDNU2AISIKPZILIMYOXCRRMDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alicia Miralles, Francesc Comellas, Hongxiao Liu, Zhongzhi Zhang","submitted_at":"2012-09-29T10:43:06Z","abstract_excerpt":"In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning trees is a demanding and difficult task, in particular for large graphs, and thus there is much interest in obtaining closed expressions for relevant infinite graph families. We have also calculated the sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0092","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-18T01:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SARGOfzVYdtc7LyVQACkG14JEAQUvtxUSJN8w8w4VzyG6TzQMS3KtTN1MbfRmhXxdpJ61xmeWOLZS3c9ue8xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:33.704845Z"},"content_sha256":"886c6f591d9099614578d937a50ea5f92b6d5138c4f456d7239a72ba12bae05e","schema_version":"1.0","event_id":"sha256:886c6f591d9099614578d937a50ea5f92b6d5138c4f456d7239a72ba12bae05e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/bundle.json","state_url":"https://pith.science/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/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-26T14:12:33Z","links":{"resolver":"https://pith.science/pith/HDDNU2AISIKPZILIMYOXCRRMDJ","bundle":"https://pith.science/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/bundle.json","state":"https://pith.science/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDDNU2AISIKPZILIMYOXCRRMDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HDDNU2AISIKPZILIMYOXCRRMDJ","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":"8c71c0836429eecf8d98571de2d450ce5ddfbf4bc0be99418459530d931bfd55","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:43:06Z","title_canon_sha256":"e0b503e637a29f0b1304b77439cb7d3980c86cef8e19f10a2134f96274a44a3f"},"schema_version":"1.0","source":{"id":"1210.0092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0092","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0092v2","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0092","created_at":"2026-05-18T01:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"HDDNU2AISIKP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HDDNU2AISIKPZILI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HDDNU2AI","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:886c6f591d9099614578d937a50ea5f92b6d5138c4f456d7239a72ba12bae05e","target":"graph","created_at":"2026-05-18T01:54:12Z","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 give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning trees is a demanding and difficult task, in particular for large graphs, and thus there is much interest in obtaining closed expressions for relevant infinite graph families. We have also calculated the sp","authors_text":"Alicia Miralles, Francesc Comellas, Hongxiao Liu, 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:43:06Z","title":"The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0092","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:a422b19788a2b21996970cb6351f48fa6ac6d04d60aed53909b9bf9cc6448180","target":"record","created_at":"2026-05-18T01:54:12Z","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":"8c71c0836429eecf8d98571de2d450ce5ddfbf4bc0be99418459530d931bfd55","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-29T10:43:06Z","title_canon_sha256":"e0b503e637a29f0b1304b77439cb7d3980c86cef8e19f10a2134f96274a44a3f"},"schema_version":"1.0","source":{"id":"1210.0092","kind":"arxiv","version":2}},"canonical_sha256":"38c6da68089214fca168661d71462c1a623ee54e995416f105313d36e151619b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38c6da68089214fca168661d71462c1a623ee54e995416f105313d36e151619b","first_computed_at":"2026-05-18T01:54:12.548759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:54:12.548759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yX6CymioYxuoQlA8Uj4R6CwsEoc6Ap3BZLp9eRFGBJzxf2sITupNL5cvuOuvCkFFd1cd4ini6sjtELLNfufgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:54:12.549235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a422b19788a2b21996970cb6351f48fa6ac6d04d60aed53909b9bf9cc6448180","sha256:886c6f591d9099614578d937a50ea5f92b6d5138c4f456d7239a72ba12bae05e"],"state_sha256":"35a6b5fb8c4356f44191400a788ed826d3ea4456607a96dad1c2bc304a64c760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KRgxe3/DChnWt9qIThmPMMU/qzrkOwlTJS42xu4SPMU1pKNhaHBZh/9GHqYaQLVlzFdnx+f7PzAptfiXtm7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:12:33.707687Z","bundle_sha256":"88fcb6457dc03f314f3037a2de12b9347471dccb31e3c7851cf0012cfdb4b034"}}