{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:NC7GTMGJCBJ3C4CB4QOGR3YP7M","short_pith_number":"pith:NC7GTMGJ","schema_version":"1.0","canonical_sha256":"68be69b0c91053b17041e41c68ef0ffb3d900e66d1e8db5c8b8c92a9a6300b22","source":{"kind":"arxiv","id":"0802.2576","version":2},"attestation_state":"computed","paper":{"title":"Simplicial matrix-tree theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Art M. Duval, Caroline J. Klivans, Jeremy L. Martin","submitted_at":"2008-02-19T02:04:49Z","abstract_excerpt":"We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Laplacian matrix of $\\Delta$. As in the graphic case, one can obtain a more finely weighted generating function for simplicial spanning trees by assigning an indeterminate to each vertex of $\\Delta$ and replaci"},"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":"0802.2576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-02-19T02:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"e79c77e598a1cba77fd4e920f773d4d322661bb8a8fa686c706e361c3214f7df","abstract_canon_sha256":"7a31f4835c66b4db52f72cb09135a4595ba453b27232d9bdce01c930be0eef43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:49.446689Z","signature_b64":"RsEuLf+AmkBH2//eNI7zmQtgm+r/q07RK/cbqcQ6/Wxmlyr7FsJ0+A5mjZFlq2X+mW6NfXA78g+YcZrEKcWVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68be69b0c91053b17041e41c68ef0ffb3d900e66d1e8db5c8b8c92a9a6300b22","last_reissued_at":"2026-05-18T04:11:49.446192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:49.446192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial matrix-tree theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Art M. Duval, Caroline J. Klivans, Jeremy L. Martin","submitted_at":"2008-02-19T02:04:49Z","abstract_excerpt":"We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Laplacian matrix of $\\Delta$. As in the graphic case, one can obtain a more finely weighted generating function for simplicial spanning trees by assigning an indeterminate to each vertex of $\\Delta$ and replaci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2576","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":"0802.2576","created_at":"2026-05-18T04:11:49.446268+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.2576v2","created_at":"2026-05-18T04:11:49.446268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2576","created_at":"2026-05-18T04:11:49.446268+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC7GTMGJCBJ3","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC7GTMGJCBJ3C4CB","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC7GTMGJ","created_at":"2026-05-18T12:25:57.157939+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/NC7GTMGJCBJ3C4CB4QOGR3YP7M","json":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M.json","graph_json":"https://pith.science/api/pith-number/NC7GTMGJCBJ3C4CB4QOGR3YP7M/graph.json","events_json":"https://pith.science/api/pith-number/NC7GTMGJCBJ3C4CB4QOGR3YP7M/events.json","paper":"https://pith.science/paper/NC7GTMGJ"},"agent_actions":{"view_html":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M","download_json":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M.json","view_paper":"https://pith.science/paper/NC7GTMGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.2576&json=true","fetch_graph":"https://pith.science/api/pith-number/NC7GTMGJCBJ3C4CB4QOGR3YP7M/graph.json","fetch_events":"https://pith.science/api/pith-number/NC7GTMGJCBJ3C4CB4QOGR3YP7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M/action/storage_attestation","attest_author":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M/action/author_attestation","sign_citation":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M/action/citation_signature","submit_replication":"https://pith.science/pith/NC7GTMGJCBJ3C4CB4QOGR3YP7M/action/replication_record"}},"created_at":"2026-05-18T04:11:49.446268+00:00","updated_at":"2026-05-18T04:11:49.446268+00:00"}