{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7TIN4UUHO26X6AMCSPLLPUYE6S","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":"67bb865a465109f0609f8c393bd4c2a72bfa1532a9d681dd295837a261a6460f","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T12:00:38Z","title_canon_sha256":"6f494c4a2c50f1440d2076fda6adf049d09fde0c95474f5345cfd4c027909b88"},"schema_version":"1.0","source":{"id":"1602.01996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01996","created_at":"2026-05-18T01:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01996v1","created_at":"2026-05-18T01:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01996","created_at":"2026-05-18T01:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"7TIN4UUHO26X","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7TIN4UUHO26X6AMC","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7TIN4UUH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:acfa185b531ca63b5a83083d1b1dc32376fbe54234b2d8b69f7ca72eec989711","target":"graph","created_at":"2026-05-18T01:08: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":"Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal is given in Theorem \\ref{thm:maintheoremfull}. We show how spectral decimation implies the existence of the asymptotic complexity constant and obtain some bounds for it. Examples calculated include the Sierpinski Gasket, a non post critically finite analog of the Sierpinski Gasket, the Diamond fractal, and the Hexagasket. For each example, the a","authors_text":"Jason A. Anema, Konstantinos Tsougkas","cross_cats":["math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T12:00:38Z","title":"Counting spanning trees on fractal graphs and their asymptotic complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01996","kind":"arxiv","version":1},"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:e8b979c8b3f7e6675559e39aec8206702e55e06fb7cb588f20414e0bbe741943","target":"record","created_at":"2026-05-18T01:08: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":"67bb865a465109f0609f8c393bd4c2a72bfa1532a9d681dd295837a261a6460f","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T12:00:38Z","title_canon_sha256":"6f494c4a2c50f1440d2076fda6adf049d09fde0c95474f5345cfd4c027909b88"},"schema_version":"1.0","source":{"id":"1602.01996","kind":"arxiv","version":1}},"canonical_sha256":"fcd0de528776bd7f018293d6b7d304f4aa3d936c26647ea88d273cafc92c8c04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcd0de528776bd7f018293d6b7d304f4aa3d936c26647ea88d273cafc92c8c04","first_computed_at":"2026-05-18T01:08:12.027967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:12.027967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8DkFixlyuPDefLEwkD4K8Vptevs9O+KMXS+p7xB+Hw6SHVPxRvngfFIkcZd94jEsyS+rkK2v6z6T2gbLhb3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:12.028424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8b979c8b3f7e6675559e39aec8206702e55e06fb7cb588f20414e0bbe741943","sha256:acfa185b531ca63b5a83083d1b1dc32376fbe54234b2d8b69f7ca72eec989711"],"state_sha256":"ffde37f53a908f079741c8a8ab1ae23e1c30bbeb321d18b54f4826c6b10ce305"}