{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2PORGTUQFNWYZJPXPDBK266S2X","short_pith_number":"pith:2PORGTUQ","canonical_record":{"source":{"id":"1207.7033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-30T18:36:25Z","cross_cats_sorted":["math.CO","math.SP"],"title_canon_sha256":"9bd1b437b079409415015fd8bae91dda7519d9e0db5f82dd07c2143f248d47b5","abstract_canon_sha256":"bb846cafd1749b49780b0db71a7dfa036533e88913bf1b7e8b7d23c22109d6da"},"schema_version":"1.0"},"canonical_sha256":"d3dd134e902b6d8ca5f778c2ad7bd2d5e63e2720b224dc434ce83baf947df987","source":{"kind":"arxiv","id":"1207.7033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7033","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7033v2","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7033","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"2PORGTUQFNWY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PORGTUQFNWYZJPX","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PORGTUQ","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2PORGTUQFNWYZJPXPDBK266S2X","target":"record","payload":{"canonical_record":{"source":{"id":"1207.7033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-30T18:36:25Z","cross_cats_sorted":["math.CO","math.SP"],"title_canon_sha256":"9bd1b437b079409415015fd8bae91dda7519d9e0db5f82dd07c2143f248d47b5","abstract_canon_sha256":"bb846cafd1749b49780b0db71a7dfa036533e88913bf1b7e8b7d23c22109d6da"},"schema_version":"1.0"},"canonical_sha256":"d3dd134e902b6d8ca5f778c2ad7bd2d5e63e2720b224dc434ce83baf947df987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:35.650734Z","signature_b64":"XkON4L+OKNRoTMFozH9QestWQeSHkmh70Daw6lbyGR2vj1/kNctCkPJJK3zYBu9AwpaoRC1Dfzx+YoZdaoz6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3dd134e902b6d8ca5f778c2ad7bd2d5e63e2720b224dc434ce83baf947df987","last_reissued_at":"2026-05-18T03:49:35.650087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:35.650087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.7033","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxxBkdmSSnYJQprEYOJl4jgbcA9l/5vBwy+Qk63zivh4xKSGfWLeN3C2OB6Nq8FZ84aXU/wdRjM3434ENWlQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:10:00.494175Z"},"content_sha256":"df5c963c5b978f239700a957478de35d04a141c90caeea7098d3b2312939a6c0","schema_version":"1.0","event_id":"sha256:df5c963c5b978f239700a957478de35d04a141c90caeea7098d3b2312939a6c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2PORGTUQFNWYZJPXPDBK266S2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Beginner's Guide to Counting Spanning Trees in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.SP"],"primary_cat":"cs.DM","authors_text":"Saad Quader","submitted_at":"2012-07-30T18:36:25Z","abstract_excerpt":"(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix. This is a 165 year old result in graph theory and the proof is conceptually simple. However, the elegance of this result is it connects many apparently unrelated concepts in linear algebra and graph theory. Our motivation behind this work was to make the proof accessible to anyone with beginner\\slash intermediate grasp of linear algebra. Therefore in this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7033","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dm92Gki4IXsPiYg+qga0cDAnSxDdIx6fuV0GQEu5ZQVkSuqpg0Qixp4VBDpt3RRX805txCA3cZtS/1rh6PhrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:10:00.494858Z"},"content_sha256":"7937abce421cc72a993b4971ce56dc309afb2800600b2f5fdcd0c3f87a8e9a48","schema_version":"1.0","event_id":"sha256:7937abce421cc72a993b4971ce56dc309afb2800600b2f5fdcd0c3f87a8e9a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PORGTUQFNWYZJPXPDBK266S2X/bundle.json","state_url":"https://pith.science/pith/2PORGTUQFNWYZJPXPDBK266S2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PORGTUQFNWYZJPXPDBK266S2X/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-28T22:10:00Z","links":{"resolver":"https://pith.science/pith/2PORGTUQFNWYZJPXPDBK266S2X","bundle":"https://pith.science/pith/2PORGTUQFNWYZJPXPDBK266S2X/bundle.json","state":"https://pith.science/pith/2PORGTUQFNWYZJPXPDBK266S2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PORGTUQFNWYZJPXPDBK266S2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2PORGTUQFNWYZJPXPDBK266S2X","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":"bb846cafd1749b49780b0db71a7dfa036533e88913bf1b7e8b7d23c22109d6da","cross_cats_sorted":["math.CO","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-30T18:36:25Z","title_canon_sha256":"9bd1b437b079409415015fd8bae91dda7519d9e0db5f82dd07c2143f248d47b5"},"schema_version":"1.0","source":{"id":"1207.7033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7033","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7033v2","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7033","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"2PORGTUQFNWY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PORGTUQFNWYZJPX","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PORGTUQ","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7937abce421cc72a993b4971ce56dc309afb2800600b2f5fdcd0c3f87a8e9a48","target":"graph","created_at":"2026-05-18T03:49:35Z","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":"(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix. This is a 165 year old result in graph theory and the proof is conceptually simple. However, the elegance of this result is it connects many apparently unrelated concepts in linear algebra and graph theory. Our motivation behind this work was to make the proof accessible to anyone with beginner\\slash intermediate grasp of linear algebra. Therefore in this paper","authors_text":"Saad Quader","cross_cats":["math.CO","math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-30T18:36:25Z","title":"A Beginner's Guide to Counting Spanning Trees in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7033","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:df5c963c5b978f239700a957478de35d04a141c90caeea7098d3b2312939a6c0","target":"record","created_at":"2026-05-18T03:49:35Z","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":"bb846cafd1749b49780b0db71a7dfa036533e88913bf1b7e8b7d23c22109d6da","cross_cats_sorted":["math.CO","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-30T18:36:25Z","title_canon_sha256":"9bd1b437b079409415015fd8bae91dda7519d9e0db5f82dd07c2143f248d47b5"},"schema_version":"1.0","source":{"id":"1207.7033","kind":"arxiv","version":2}},"canonical_sha256":"d3dd134e902b6d8ca5f778c2ad7bd2d5e63e2720b224dc434ce83baf947df987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3dd134e902b6d8ca5f778c2ad7bd2d5e63e2720b224dc434ce83baf947df987","first_computed_at":"2026-05-18T03:49:35.650087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:35.650087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkON4L+OKNRoTMFozH9QestWQeSHkmh70Daw6lbyGR2vj1/kNctCkPJJK3zYBu9AwpaoRC1Dfzx+YoZdaoz6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:35.650734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.7033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df5c963c5b978f239700a957478de35d04a141c90caeea7098d3b2312939a6c0","sha256:7937abce421cc72a993b4971ce56dc309afb2800600b2f5fdcd0c3f87a8e9a48"],"state_sha256":"137919dfea493ed8fb504e2a556e3dff6b95f745eb45701e68505e39c6ae3452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKbdw5WboEMMgWH/CazlTcB7m/+28KgQPEOl25h7TXzmpp8bHK9Bnc7Ahrr94x4ozkLM6hAbEn6FN6/fHPN+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:10:00.498441Z","bundle_sha256":"5f9ff29069ea64294d902632577e35eb1c981ebb14d612d7fbcc6b92de8526ed"}}