{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JJEGP5PJCUB3QXOLIELVPA6APJ","short_pith_number":"pith:JJEGP5PJ","schema_version":"1.0","canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","source":{"kind":"arxiv","id":"1307.3810","version":2},"attestation_state":"computed","paper":{"title":"Counting rooted forests in a network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math-ph","math.MP"],"primary_cat":"math.SP","authors_text":"Oliver Knill","submitted_at":"2013-07-15T02:44:05Z","abstract_excerpt":"We use a recently found generalization of the Cauchy-Binet theorem to give a new proof of the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L. More generally, we show that det(1+k L) is the number of rooted edge-k-colored spanning forests in G. If a forest with an even number of edges is called even, then det(1-L) is the difference between even and odd rooted spanning forests in G."},"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":"1307.3810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-07-15T02:44:05Z","cross_cats_sorted":["cs.DM","cs.SI","math-ph","math.MP"],"title_canon_sha256":"d4f24f9aaf560153adde8a78e6463d6c2b54ebe1d8ce3e1a19164793e95141ea","abstract_canon_sha256":"cf9d85298d0c69f9cd361bac960c495330e8ec0982a833807e50e76f293a516b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.675460Z","signature_b64":"TRrKS9wiXkMhuZk5stKJFZNQytDi6XEYGAd0dmYOJCw++nIOLJhUkG/h3/B+pFGIgkTTPO5Nb9EbzkmqXI8zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","last_reissued_at":"2026-05-18T03:18:07.674678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.674678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting rooted forests in a network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math-ph","math.MP"],"primary_cat":"math.SP","authors_text":"Oliver Knill","submitted_at":"2013-07-15T02:44:05Z","abstract_excerpt":"We use a recently found generalization of the Cauchy-Binet theorem to give a new proof of the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L. More generally, we show that det(1+k L) is the number of rooted edge-k-colored spanning forests in G. If a forest with an even number of edges is called even, then det(1-L) is the difference between even and odd rooted spanning forests in G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3810","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":"1307.3810","created_at":"2026-05-18T03:18:07.674812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3810v2","created_at":"2026-05-18T03:18:07.674812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3810","created_at":"2026-05-18T03:18:07.674812+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJEGP5PJCUB3","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJEGP5PJCUB3QXOL","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJEGP5PJ","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02635","citing_title":"The number of rooted forests in circulant graphs","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ","json":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ.json","graph_json":"https://pith.science/api/pith-number/JJEGP5PJCUB3QXOLIELVPA6APJ/graph.json","events_json":"https://pith.science/api/pith-number/JJEGP5PJCUB3QXOLIELVPA6APJ/events.json","paper":"https://pith.science/paper/JJEGP5PJ"},"agent_actions":{"view_html":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ","download_json":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ.json","view_paper":"https://pith.science/paper/JJEGP5PJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3810&json=true","fetch_graph":"https://pith.science/api/pith-number/JJEGP5PJCUB3QXOLIELVPA6APJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JJEGP5PJCUB3QXOLIELVPA6APJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/action/storage_attestation","attest_author":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/action/author_attestation","sign_citation":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/action/citation_signature","submit_replication":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/action/replication_record"}},"created_at":"2026-05-18T03:18:07.674812+00:00","updated_at":"2026-05-18T03:18:07.674812+00:00"}