{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:C5O2X7MLPDDBQSNBDDYCFNZUWQ","short_pith_number":"pith:C5O2X7ML","schema_version":"1.0","canonical_sha256":"175dabfd8b78c61849a118f022b734b4024690328efd0f3b6709f93b3fdac5e7","source":{"kind":"arxiv","id":"0907.4761","version":2},"attestation_state":"computed","paper":{"title":"Chip-Firing Games, $G$-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farbod Shokrieh","submitted_at":"2009-07-27T20:10:10Z","abstract_excerpt":"Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical finite abelian group attached to $G$ whose order is equal to the value of same matrix determinant. More specifically, we show how one can efficiently compute a bijection between the group elements and the spanning trees of the graph. The main ingredient for computing the bijection is an efficient algorithm for finding the unique $G$-parking function (reduce"},"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":"0907.4761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:10:10Z","cross_cats_sorted":[],"title_canon_sha256":"0a5c174dc56348ff5fae536ddf156ba4a157843ace1fda47416616a6bf2b028c","abstract_canon_sha256":"e8d74222c2390cf50a9b5e401e12118eeaead2febd60a727cea1608245a824f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.215769Z","signature_b64":"2xwTW+3JJ3GnUbGd/7TB6HRarlAqRGjBTsiKvb7c3hlGE+7RF+yfatl9yPixn8zYyhlJGrj5mF9aRmI7DplSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175dabfd8b78c61849a118f022b734b4024690328efd0f3b6709f93b3fdac5e7","last_reissued_at":"2026-05-18T03:50:11.215159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.215159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chip-Firing Games, $G$-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farbod Shokrieh","submitted_at":"2009-07-27T20:10:10Z","abstract_excerpt":"Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical finite abelian group attached to $G$ whose order is equal to the value of same matrix determinant. More specifically, we show how one can efficiently compute a bijection between the group elements and the spanning trees of the graph. The main ingredient for computing the bijection is an efficient algorithm for finding the unique $G$-parking function (reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4761","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":"0907.4761","created_at":"2026-05-18T03:50:11.215248+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.4761v2","created_at":"2026-05-18T03:50:11.215248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4761","created_at":"2026-05-18T03:50:11.215248+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5O2X7MLPDDB","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5O2X7MLPDDBQSNB","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5O2X7ML","created_at":"2026-05-18T12:25:58.837520+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/C5O2X7MLPDDBQSNBDDYCFNZUWQ","json":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ.json","graph_json":"https://pith.science/api/pith-number/C5O2X7MLPDDBQSNBDDYCFNZUWQ/graph.json","events_json":"https://pith.science/api/pith-number/C5O2X7MLPDDBQSNBDDYCFNZUWQ/events.json","paper":"https://pith.science/paper/C5O2X7ML"},"agent_actions":{"view_html":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ","download_json":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ.json","view_paper":"https://pith.science/paper/C5O2X7ML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.4761&json=true","fetch_graph":"https://pith.science/api/pith-number/C5O2X7MLPDDBQSNBDDYCFNZUWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/C5O2X7MLPDDBQSNBDDYCFNZUWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ/action/storage_attestation","attest_author":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ/action/author_attestation","sign_citation":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ/action/citation_signature","submit_replication":"https://pith.science/pith/C5O2X7MLPDDBQSNBDDYCFNZUWQ/action/replication_record"}},"created_at":"2026-05-18T03:50:11.215248+00:00","updated_at":"2026-05-18T03:50:11.215248+00:00"}