{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6VJA6UE764NJ42EVPZ7N4V23RY","short_pith_number":"pith:6VJA6UE7","schema_version":"1.0","canonical_sha256":"f5520f509ff71a9e68957e7ede575b8e36cd2743f41027f755c846467d63642e","source":{"kind":"arxiv","id":"1202.3128","version":1},"attestation_state":"computed","paper":{"title":"Determinants of weighted path matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kelli Talaska","submitted_at":"2012-02-14T20:06:47Z","abstract_excerpt":"We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs. The formulas are given in terms of certain flows in the graph."},"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":"1202.3128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-14T20:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"860c0d25e1e640eb7691971221f50407a8d48951164032767e19b983ac5edc14","abstract_canon_sha256":"63664c9c0ef2af8038a403c26534eb6c99f5e3e2499c550a5b6d21d9b0e35ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:24.053446Z","signature_b64":"3Jzn7lTsbmYWzWADeNGzMk+T+deT0KBIQrycfDQnPDVBeIqCJlx4LwOeUHZx2GteOp3DuOM20PysrhyHZV7vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5520f509ff71a9e68957e7ede575b8e36cd2743f41027f755c846467d63642e","last_reissued_at":"2026-05-18T04:02:24.052820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:24.052820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determinants of weighted path matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kelli Talaska","submitted_at":"2012-02-14T20:06:47Z","abstract_excerpt":"We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs. The formulas are given in terms of certain flows in the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3128","kind":"arxiv","version":1},"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":"1202.3128","created_at":"2026-05-18T04:02:24.052896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3128v1","created_at":"2026-05-18T04:02:24.052896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3128","created_at":"2026-05-18T04:02:24.052896+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VJA6UE764NJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VJA6UE764NJ42EV","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VJA6UE7","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00738","citing_title":"An Introduction to Algebraic Combinatorics","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY","json":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY.json","graph_json":"https://pith.science/api/pith-number/6VJA6UE764NJ42EVPZ7N4V23RY/graph.json","events_json":"https://pith.science/api/pith-number/6VJA6UE764NJ42EVPZ7N4V23RY/events.json","paper":"https://pith.science/paper/6VJA6UE7"},"agent_actions":{"view_html":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY","download_json":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY.json","view_paper":"https://pith.science/paper/6VJA6UE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3128&json=true","fetch_graph":"https://pith.science/api/pith-number/6VJA6UE764NJ42EVPZ7N4V23RY/graph.json","fetch_events":"https://pith.science/api/pith-number/6VJA6UE764NJ42EVPZ7N4V23RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY/action/storage_attestation","attest_author":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY/action/author_attestation","sign_citation":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY/action/citation_signature","submit_replication":"https://pith.science/pith/6VJA6UE764NJ42EVPZ7N4V23RY/action/replication_record"}},"created_at":"2026-05-18T04:02:24.052896+00:00","updated_at":"2026-05-18T04:02:24.052896+00:00"}