{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LDRXS3B3LCWVYSLEGLIU473DCX","short_pith_number":"pith:LDRXS3B3","schema_version":"1.0","canonical_sha256":"58e3796c3b58ad5c496432d14e7f6315f0931d2f6f02e621d3f86cae11957cfe","source":{"kind":"arxiv","id":"1001.4028","version":3},"attestation_state":"computed","paper":{"title":"Spanning forests and the vector bundle Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Richard Kenyon","submitted_at":"2010-01-22T15:43:14Z","abstract_excerpt":"The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial interpretation of their determinants in terms of so-called cycle rooted spanning forests (CRSFs). We construct natural measures on CRSFs for which the edges form a determinantal process. This theory gives a natural generalization of the spanning tree process adapted to graphs embedded on surfaces. We give a number of other applications, for example, we compu"},"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":"1001.4028","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-22T15:43:14Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"507246d89078560c2c44001bec0ac4d88509f6f7d6410d0114ebfbc3778602e0","abstract_canon_sha256":"bf2dcadc6884fc3ba0a57e91f1feecc12f31465288b8bf2712e0ac8686579d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:46.346184Z","signature_b64":"if0UP9ZmKoTx2SPtumlxW5/QjWPxtDnas46cIS/KaQrisUWLEmwJEiGL6RcAJ8rmI1aEJdPCGIklWyx6A9rEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58e3796c3b58ad5c496432d14e7f6315f0931d2f6f02e621d3f86cae11957cfe","last_reissued_at":"2026-05-18T04:06:46.345536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:46.345536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning forests and the vector bundle Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Richard Kenyon","submitted_at":"2010-01-22T15:43:14Z","abstract_excerpt":"The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial interpretation of their determinants in terms of so-called cycle rooted spanning forests (CRSFs). We construct natural measures on CRSFs for which the edges form a determinantal process. This theory gives a natural generalization of the spanning tree process adapted to graphs embedded on surfaces. We give a number of other applications, for example, we compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4028","kind":"arxiv","version":3},"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":"1001.4028","created_at":"2026-05-18T04:06:46.345638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4028v3","created_at":"2026-05-18T04:06:46.345638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4028","created_at":"2026-05-18T04:06:46.345638+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDRXS3B3LCWV","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDRXS3B3LCWVYSLE","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDRXS3B3","created_at":"2026-05-18T12:26:10.704358+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/LDRXS3B3LCWVYSLEGLIU473DCX","json":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX.json","graph_json":"https://pith.science/api/pith-number/LDRXS3B3LCWVYSLEGLIU473DCX/graph.json","events_json":"https://pith.science/api/pith-number/LDRXS3B3LCWVYSLEGLIU473DCX/events.json","paper":"https://pith.science/paper/LDRXS3B3"},"agent_actions":{"view_html":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX","download_json":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX.json","view_paper":"https://pith.science/paper/LDRXS3B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4028&json=true","fetch_graph":"https://pith.science/api/pith-number/LDRXS3B3LCWVYSLEGLIU473DCX/graph.json","fetch_events":"https://pith.science/api/pith-number/LDRXS3B3LCWVYSLEGLIU473DCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX/action/storage_attestation","attest_author":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX/action/author_attestation","sign_citation":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX/action/citation_signature","submit_replication":"https://pith.science/pith/LDRXS3B3LCWVYSLEGLIU473DCX/action/replication_record"}},"created_at":"2026-05-18T04:06:46.345638+00:00","updated_at":"2026-05-18T04:06:46.345638+00:00"}