{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZJNOCN4QIAVKXW7467CLGE2XLH","short_pith_number":"pith:ZJNOCN4Q","schema_version":"1.0","canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","source":{"kind":"arxiv","id":"1810.05889","version":1},"attestation_state":"computed","paper":{"title":"A New [Combinatorial] Proof of the Commutativity of Matching Polynomials for Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Herring, Corbin Groothuis, Eric Stucky, Garner Cochran, Ranjan Rohatgi","submitted_at":"2018-10-13T16:47:58Z","abstract_excerpt":"We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a vertex, and the matching polynomial of $G$ is a generating function encoding the numbers of matchings in $G$ of each size. The $d$-matching polynomial is a weighted average of matching polynomials of degree-$d$ covers, and was introduced in a paper of Hall, Puder, and Sawin. Let $\\mathcal{C}_n$ and $\\mathcal{P}_n$ denote the respective matching polynomials of t"},"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":"1810.05889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T16:47:58Z","cross_cats_sorted":[],"title_canon_sha256":"c4908aeadf1a3efc9b5a7ef91d56ebb6ab323bbae6a1f4c0608c714d3a99e62f","abstract_canon_sha256":"843f2935b9c4f15d7ac1bc35bb6e682a7216562d2867c7ae7df8c5159c610656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.686602Z","signature_b64":"KD7WJrG7J89nhd1KJ/Y+eThWgw0V1og0pIr7jPJq/r2ZR+tmvcGu/U0DGxRvqKcgb7do1XvZRMbTbrRJGz/hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","last_reissued_at":"2026-05-18T00:03:26.686201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.686201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New [Combinatorial] Proof of the Commutativity of Matching Polynomials for Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Herring, Corbin Groothuis, Eric Stucky, Garner Cochran, Ranjan Rohatgi","submitted_at":"2018-10-13T16:47:58Z","abstract_excerpt":"We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a vertex, and the matching polynomial of $G$ is a generating function encoding the numbers of matchings in $G$ of each size. The $d$-matching polynomial is a weighted average of matching polynomials of degree-$d$ covers, and was introduced in a paper of Hall, Puder, and Sawin. Let $\\mathcal{C}_n$ and $\\mathcal{P}_n$ denote the respective matching polynomials of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05889","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":"1810.05889","created_at":"2026-05-18T00:03:26.686261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05889v1","created_at":"2026-05-18T00:03:26.686261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05889","created_at":"2026-05-18T00:03:26.686261+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJNOCN4QIAVK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJNOCN4QIAVKXW74","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJNOCN4Q","created_at":"2026-05-18T12:33:07.085635+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/ZJNOCN4QIAVKXW7467CLGE2XLH","json":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH.json","graph_json":"https://pith.science/api/pith-number/ZJNOCN4QIAVKXW7467CLGE2XLH/graph.json","events_json":"https://pith.science/api/pith-number/ZJNOCN4QIAVKXW7467CLGE2XLH/events.json","paper":"https://pith.science/paper/ZJNOCN4Q"},"agent_actions":{"view_html":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH","download_json":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH.json","view_paper":"https://pith.science/paper/ZJNOCN4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05889&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJNOCN4QIAVKXW7467CLGE2XLH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJNOCN4QIAVKXW7467CLGE2XLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/action/storage_attestation","attest_author":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/action/author_attestation","sign_citation":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/action/citation_signature","submit_replication":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/action/replication_record"}},"created_at":"2026-05-18T00:03:26.686261+00:00","updated_at":"2026-05-18T00:03:26.686261+00:00"}