{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E3B3CS5Q22LAQGRD7IZHY5A5WD","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":"3b35050f38ddcc6691c36ea83fe2723cec62229bab89f99934c62f6cff15a7d5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-27T15:58:41Z","title_canon_sha256":"da4b6f132806cb4477425c3631bb64d8dca69ea8e962832007cd18fdf17108b3"},"schema_version":"1.0","source":{"id":"1510.07949","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07949","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07949v2","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07949","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"E3B3CS5Q22LA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E3B3CS5Q22LAQGRD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E3B3CS5Q","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7e5ccac2f3f3a17b5bedea50f0bb9839e4817814be86f0b5fad2f5b933dc1698","target":"graph","created_at":"2026-05-18T01:17:52Z","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":"The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of spanning trees and the study of their properties remain a challenge, particularly for large networks. In this paper, we study the num- ber and degree distribution of the spanning trees in the Hanoi graph. We first establish recursion relations between the number of spanning trees and other spanning subgraphs of the Hanoi graph, from which we find an exact an","authors_text":"Francesc Comellas, Mingyun Li, Shunqi Wu, Zhongzhi Zhang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-27T15:58:41Z","title":"The number and degree distribution of spanning trees in the Tower of Hanoi graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07949","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:f9fe675a642fd738b3c53ff820674312c4ef13858218fc70379faab705874251","target":"record","created_at":"2026-05-18T01:17:52Z","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":"3b35050f38ddcc6691c36ea83fe2723cec62229bab89f99934c62f6cff15a7d5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-27T15:58:41Z","title_canon_sha256":"da4b6f132806cb4477425c3631bb64d8dca69ea8e962832007cd18fdf17108b3"},"schema_version":"1.0","source":{"id":"1510.07949","kind":"arxiv","version":2}},"canonical_sha256":"26c3b14bb0d696081a23fa327c741db0c63d21f9b9fac3827ae79d2a474c7d4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26c3b14bb0d696081a23fa327c741db0c63d21f9b9fac3827ae79d2a474c7d4e","first_computed_at":"2026-05-18T01:17:52.335965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:52.335965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcVJk/7WjS3DtBcOJvUlfMNk3ZGQwRfl7qNES4OaFG8z2GJp8+vNjsv2qpNPAMAphqIGik2Aasm6PEloZ+gHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:52.336575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07949","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9fe675a642fd738b3c53ff820674312c4ef13858218fc70379faab705874251","sha256:7e5ccac2f3f3a17b5bedea50f0bb9839e4817814be86f0b5fad2f5b933dc1698"],"state_sha256":"1049bc5849573699d829894efe0b324aff1d1ae10ff0ac4c7a985d4b4a1b72d8"}