{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RDXTSFQ25P562EBO5HNACBL7VM","short_pith_number":"pith:RDXTSFQ2","schema_version":"1.0","canonical_sha256":"88ef39161aebfbed102ee9da01057fab350a19c28b4d9ddb82863e3d82264ff8","source":{"kind":"arxiv","id":"1508.02245","version":2},"attestation_state":"computed","paper":{"title":"Higher determinants and the matrix-tree theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yurii Burman","submitted_at":"2015-08-10T13:48:25Z","abstract_excerpt":"The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to present a generalization of the (nonsymmetric) matrix-tree theorem containing no trees and essentially no matrices. Instead of trees we consider acyclic directed graphs with a prescribed set of sinks, and instead of determinant, a polynomial invariant of the matrix determined by directed graph such that any two vertices of the same connected component are mut"},"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":"1508.02245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T13:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"62868d0fcaae30e1fb3a7ae5e4ee2c33197aaa94bf404170b53432162f8c3a60","abstract_canon_sha256":"74881cf2d828cfea051c409ebdedd8bd78e5802f6542d4fb838df321014e5f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:14.499899Z","signature_b64":"iLRe2lBq+WwtMoIKkrbz8HxNV5ssThrpRXlZz5tE6WXaiMeuk9vT5RTuGv2Yl6yRggJuAaCjMA1nRRA2HHB8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ef39161aebfbed102ee9da01057fab350a19c28b4d9ddb82863e3d82264ff8","last_reissued_at":"2026-05-18T00:55:14.499431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:14.499431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher determinants and the matrix-tree theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yurii Burman","submitted_at":"2015-08-10T13:48:25Z","abstract_excerpt":"The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to present a generalization of the (nonsymmetric) matrix-tree theorem containing no trees and essentially no matrices. Instead of trees we consider acyclic directed graphs with a prescribed set of sinks, and instead of determinant, a polynomial invariant of the matrix determined by directed graph such that any two vertices of the same connected component are mut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02245","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":"1508.02245","created_at":"2026-05-18T00:55:14.499506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02245v2","created_at":"2026-05-18T00:55:14.499506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02245","created_at":"2026-05-18T00:55:14.499506+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDXTSFQ25P56","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDXTSFQ25P562EBO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDXTSFQ2","created_at":"2026-05-18T12:29:39.896362+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/RDXTSFQ25P562EBO5HNACBL7VM","json":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM.json","graph_json":"https://pith.science/api/pith-number/RDXTSFQ25P562EBO5HNACBL7VM/graph.json","events_json":"https://pith.science/api/pith-number/RDXTSFQ25P562EBO5HNACBL7VM/events.json","paper":"https://pith.science/paper/RDXTSFQ2"},"agent_actions":{"view_html":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM","download_json":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM.json","view_paper":"https://pith.science/paper/RDXTSFQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02245&json=true","fetch_graph":"https://pith.science/api/pith-number/RDXTSFQ25P562EBO5HNACBL7VM/graph.json","fetch_events":"https://pith.science/api/pith-number/RDXTSFQ25P562EBO5HNACBL7VM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM/action/storage_attestation","attest_author":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM/action/author_attestation","sign_citation":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM/action/citation_signature","submit_replication":"https://pith.science/pith/RDXTSFQ25P562EBO5HNACBL7VM/action/replication_record"}},"created_at":"2026-05-18T00:55:14.499506+00:00","updated_at":"2026-05-18T00:55:14.499506+00:00"}