{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JJEGP5PJCUB3QXOLIELVPA6APJ","short_pith_number":"pith:JJEGP5PJ","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"},"canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","source":{"kind":"arxiv","id":"1307.3810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3810","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3810v2","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3810","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJEGP5PJCUB3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JJEGP5PJCUB3QXOL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JJEGP5PJ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JJEGP5PJCUB3QXOLIELVPA6APJ","target":"record","payload":{"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"},"canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","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"},"source_kind":"arxiv","source_id":"1307.3810","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzMIPLYow0ReoAwQeUJlwjyZ/ZlwOTQPelWERpK/ZYSw/byzZgGmRUuPOjw1EezvMFaTMhI3qEitWspU87KtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:03:55.359793Z"},"content_sha256":"8135cf81c8201c7b161af85aaf15e4091dc8365bd1d957909caf5879ed521304","schema_version":"1.0","event_id":"sha256:8135cf81c8201c7b161af85aaf15e4091dc8365bd1d957909caf5879ed521304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JJEGP5PJCUB3QXOLIELVPA6APJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UtsRSGMC/6ztTMILUNu2s5dz4J+f5FkWFVq+r54DTEoqW0LzngAHsEMLY1ZQ+jqd/bqRHt4XWKyCX+76USdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:03:55.360542Z"},"content_sha256":"54dbf2f1f9817c47da7ca3eb711d0dfb1d85aa61c41aacfc2d405502b42eddf5","schema_version":"1.0","event_id":"sha256:54dbf2f1f9817c47da7ca3eb711d0dfb1d85aa61c41aacfc2d405502b42eddf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/bundle.json","state_url":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:03:55Z","links":{"resolver":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ","bundle":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/bundle.json","state":"https://pith.science/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJEGP5PJCUB3QXOLIELVPA6APJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JJEGP5PJCUB3QXOLIELVPA6APJ","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":"cf9d85298d0c69f9cd361bac960c495330e8ec0982a833807e50e76f293a516b","cross_cats_sorted":["cs.DM","cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-07-15T02:44:05Z","title_canon_sha256":"d4f24f9aaf560153adde8a78e6463d6c2b54ebe1d8ce3e1a19164793e95141ea"},"schema_version":"1.0","source":{"id":"1307.3810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3810","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3810v2","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3810","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJEGP5PJCUB3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JJEGP5PJCUB3QXOL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JJEGP5PJ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:54dbf2f1f9817c47da7ca3eb711d0dfb1d85aa61c41aacfc2d405502b42eddf5","target":"graph","created_at":"2026-05-18T03:18:07Z","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":"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.","authors_text":"Oliver Knill","cross_cats":["cs.DM","cs.SI","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-07-15T02:44:05Z","title":"Counting rooted forests in a network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3810","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:8135cf81c8201c7b161af85aaf15e4091dc8365bd1d957909caf5879ed521304","target":"record","created_at":"2026-05-18T03:18:07Z","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":"cf9d85298d0c69f9cd361bac960c495330e8ec0982a833807e50e76f293a516b","cross_cats_sorted":["cs.DM","cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-07-15T02:44:05Z","title_canon_sha256":"d4f24f9aaf560153adde8a78e6463d6c2b54ebe1d8ce3e1a19164793e95141ea"},"schema_version":"1.0","source":{"id":"1307.3810","kind":"arxiv","version":2}},"canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a4867f5e91503b85dcb41175783c07a5b60ccd881cac30c93c3d172bc5a3a37","first_computed_at":"2026-05-18T03:18:07.674678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.674678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRrKS9wiXkMhuZk5stKJFZNQytDi6XEYGAd0dmYOJCw++nIOLJhUkG/h3/B+pFGIgkTTPO5Nb9EbzkmqXI8zAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.675460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8135cf81c8201c7b161af85aaf15e4091dc8365bd1d957909caf5879ed521304","sha256:54dbf2f1f9817c47da7ca3eb711d0dfb1d85aa61c41aacfc2d405502b42eddf5"],"state_sha256":"064f5d4e4cf9c6a3aa416f71db4129b33379232a039c6b082ee6735703438c55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adrBqjqrXAl9+R89g4oereIQeYvX+RiEXHmAH8Y9/qWWIPvKEtkBMniZFOsOTYF+1MshLAeNxknePFumiOanBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:03:55.364493Z","bundle_sha256":"a73f08e6e6a8e0ff866eddc110ac579b95216d82bcfe40a18b76ce9d04174882"}}