{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZJNOCN4QIAVKXW7467CLGE2XLH","short_pith_number":"pith:ZJNOCN4Q","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"},"canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","source":{"kind":"arxiv","id":"1810.05889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05889","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05889v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05889","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZJNOCN4QIAVK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZJNOCN4QIAVKXW74","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZJNOCN4Q","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZJNOCN4QIAVKXW7467CLGE2XLH","target":"record","payload":{"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"},"canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","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"},"source_kind":"arxiv","source_id":"1810.05889","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IZ5yj9noliTtMYllMNBMu0ZxdQA3TqpCIAxU1gyGoqUO5+Y464BjB0NFNnfB8BrN3Bh20waopUwOAEHS4ChAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:22:53.338690Z"},"content_sha256":"ef9eed34a827c246962246bca25456a02dde0db1bea13946f893a7943e78e300","schema_version":"1.0","event_id":"sha256:ef9eed34a827c246962246bca25456a02dde0db1bea13946f893a7943e78e300"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZJNOCN4QIAVKXW7467CLGE2XLH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAFFAmRCMsijjoaYrSDZsvrfHmW42NelL7QV2YdCyKxxizOViTqliB9Vl0PD2jV13mWUlMM96Orqd90cf1PVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:22:53.339038Z"},"content_sha256":"ff26f767f756ddadd806b1afa21643064927bd9a93209d0269e9d25de5b81632","schema_version":"1.0","event_id":"sha256:ff26f767f756ddadd806b1afa21643064927bd9a93209d0269e9d25de5b81632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/bundle.json","state_url":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T09:22:53Z","links":{"resolver":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH","bundle":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/bundle.json","state":"https://pith.science/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJNOCN4QIAVKXW7467CLGE2XLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZJNOCN4QIAVKXW7467CLGE2XLH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"843f2935b9c4f15d7ac1bc35bb6e682a7216562d2867c7ae7df8c5159c610656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T16:47:58Z","title_canon_sha256":"c4908aeadf1a3efc9b5a7ef91d56ebb6ab323bbae6a1f4c0608c714d3a99e62f"},"schema_version":"1.0","source":{"id":"1810.05889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05889","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05889v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05889","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZJNOCN4QIAVK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZJNOCN4QIAVKXW74","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZJNOCN4Q","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:ff26f767f756ddadd806b1afa21643064927bd9a93209d0269e9d25de5b81632","target":"graph","created_at":"2026-05-18T00:03:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Herring, Corbin Groothuis, Eric Stucky, Garner Cochran, Ranjan Rohatgi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T16:47:58Z","title":"A New [Combinatorial] Proof of the Commutativity of Matching Polynomials for Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05889","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef9eed34a827c246962246bca25456a02dde0db1bea13946f893a7943e78e300","target":"record","created_at":"2026-05-18T00:03:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"843f2935b9c4f15d7ac1bc35bb6e682a7216562d2867c7ae7df8c5159c610656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T16:47:58Z","title_canon_sha256":"c4908aeadf1a3efc9b5a7ef91d56ebb6ab323bbae6a1f4c0608c714d3a99e62f"},"schema_version":"1.0","source":{"id":"1810.05889","kind":"arxiv","version":1}},"canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca5ae13790402aabdbfcf7c4b3135759c1485b17b4f64157c0f162021aaf1e98","first_computed_at":"2026-05-18T00:03:26.686201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:26.686201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KD7WJrG7J89nhd1KJ/Y+eThWgw0V1og0pIr7jPJq/r2ZR+tmvcGu/U0DGxRvqKcgb7do1XvZRMbTbrRJGz/hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:26.686602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9eed34a827c246962246bca25456a02dde0db1bea13946f893a7943e78e300","sha256:ff26f767f756ddadd806b1afa21643064927bd9a93209d0269e9d25de5b81632"],"state_sha256":"feea18092ac4aa5e5dd0e7017475f99f7d90fed104fe30587077ed834fff8292"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2N6C6zYA14l8RVUIATK0Bf1v1v4N8mOdEj4Lf246TS6MVdv9eV3MZmePYRClhdSLR1UeA8Gw0vF5+t+BlRJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:22:53.341212Z","bundle_sha256":"bb21cb11a0ca193c604f72c10e78f24045e7eb96cac95b2d6a1dbf3147a2380e"}}