{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:C5O2X7MLPDDBQSNBDDYCFNZUWQ","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":"e8d74222c2390cf50a9b5e401e12118eeaead2febd60a727cea1608245a824f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:10:10Z","title_canon_sha256":"0a5c174dc56348ff5fae536ddf156ba4a157843ace1fda47416616a6bf2b028c"},"schema_version":"1.0","source":{"id":"0907.4761","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4761","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4761v2","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4761","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"C5O2X7MLPDDB","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"C5O2X7MLPDDBQSNB","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"C5O2X7ML","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:a7750c04287bce7c2f1e7a6f079213ae0eee7ef1f38d1365eda514bb7f4d0ec5","target":"graph","created_at":"2026-05-18T03:50:11Z","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":"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","authors_text":"Farbod Shokrieh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:10:10Z","title":"Chip-Firing Games, $G$-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4761","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:b0e50110cac3400eb305689dcb234e68134a684e99d2bd904a00cbe80977aba2","target":"record","created_at":"2026-05-18T03:50:11Z","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":"e8d74222c2390cf50a9b5e401e12118eeaead2febd60a727cea1608245a824f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:10:10Z","title_canon_sha256":"0a5c174dc56348ff5fae536ddf156ba4a157843ace1fda47416616a6bf2b028c"},"schema_version":"1.0","source":{"id":"0907.4761","kind":"arxiv","version":2}},"canonical_sha256":"175dabfd8b78c61849a118f022b734b4024690328efd0f3b6709f93b3fdac5e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"175dabfd8b78c61849a118f022b734b4024690328efd0f3b6709f93b3fdac5e7","first_computed_at":"2026-05-18T03:50:11.215159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:11.215159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xwTW+3JJ3GnUbGd/7TB6HRarlAqRGjBTsiKvb7c3hlGE+7RF+yfatl9yPixn8zYyhlJGrj5mF9aRmI7DplSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:11.215769Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.4761","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0e50110cac3400eb305689dcb234e68134a684e99d2bd904a00cbe80977aba2","sha256:a7750c04287bce7c2f1e7a6f079213ae0eee7ef1f38d1365eda514bb7f4d0ec5"],"state_sha256":"99ab24cec0b6c165a4ee678e1881c271199df598cb2571dc74638570b21a19e9"}