{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MVM6CU64CQSOMX4S5T625X2MG3","short_pith_number":"pith:MVM6CU64","schema_version":"1.0","canonical_sha256":"6559e153dc1424e65f92ecfdaedf4c36ce7080aad4778e64380818576bb6fdb2","source":{"kind":"arxiv","id":"1208.4125","version":2},"attestation_state":"computed","paper":{"title":"Counting Spanning Trees of Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Donniell E. Fishkind, Stephen R. Chestnut","submitted_at":"2012-08-20T21:24:37Z","abstract_excerpt":"Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold graphs, and using Merris' Theorem and the Matrix Tree Theorem, there is a strikingly simple formula for counting the number of spanning trees in a threshold graph on $n$ vertices; it is simply the product, over $i=2,3, ...,n-1$, of the number of vertices of degree at least $i$. In this manuscript, we provide a direct combinatorial proof for this formula which d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1208.4125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-20T21:24:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dbd79e81be8e974523051b794228e9053ae0ea7b20386a1e4ce1bd1d094c190e","abstract_canon_sha256":"6c27a69d940c859d7c3543fddb094f5dc85ec5208590c59a2654bb410118cc92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:58.026488Z","signature_b64":"oVEX0KrOKKHGKOHoudoIExfTSDfJBSXQn4iRcBUwRi5a/KIIDFm/iAFHTkFyfG9tyJxWilB2pLa1AH2+JMKvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6559e153dc1424e65f92ecfdaedf4c36ce7080aad4778e64380818576bb6fdb2","last_reissued_at":"2026-05-18T03:36:58.026043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:58.026043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Spanning Trees of Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Donniell E. Fishkind, Stephen R. Chestnut","submitted_at":"2012-08-20T21:24:37Z","abstract_excerpt":"Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold graphs, and using Merris' Theorem and the Matrix Tree Theorem, there is a strikingly simple formula for counting the number of spanning trees in a threshold graph on $n$ vertices; it is simply the product, over $i=2,3, ...,n-1$, of the number of vertices of degree at least $i$. In this manuscript, we provide a direct combinatorial proof for this formula which d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4125","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.4125","created_at":"2026-05-18T03:36:58.026113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4125v2","created_at":"2026-05-18T03:36:58.026113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4125","created_at":"2026-05-18T03:36:58.026113+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVM6CU64CQSO","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVM6CU64CQSOMX4S","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVM6CU64","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3","json":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3.json","graph_json":"https://pith.science/api/pith-number/MVM6CU64CQSOMX4S5T625X2MG3/graph.json","events_json":"https://pith.science/api/pith-number/MVM6CU64CQSOMX4S5T625X2MG3/events.json","paper":"https://pith.science/paper/MVM6CU64"},"agent_actions":{"view_html":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3","download_json":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3.json","view_paper":"https://pith.science/paper/MVM6CU64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4125&json=true","fetch_graph":"https://pith.science/api/pith-number/MVM6CU64CQSOMX4S5T625X2MG3/graph.json","fetch_events":"https://pith.science/api/pith-number/MVM6CU64CQSOMX4S5T625X2MG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3/action/storage_attestation","attest_author":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3/action/author_attestation","sign_citation":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3/action/citation_signature","submit_replication":"https://pith.science/pith/MVM6CU64CQSOMX4S5T625X2MG3/action/replication_record"}},"created_at":"2026-05-18T03:36:58.026113+00:00","updated_at":"2026-05-18T03:36:58.026113+00:00"}