{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TRAXTRO4NOQOIZME3YR7PASTNB","short_pith_number":"pith:TRAXTRO4","canonical_record":{"source":{"id":"1409.2057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T20:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"606097ceec42587c5af269c9a2664488cc0e8dcb1e21a2222d8274c07fbf5244","abstract_canon_sha256":"b17182d2bf73543f8f3f2bf56ab502e57c0a74c9f7ef075de6168bedfed164d9"},"schema_version":"1.0"},"canonical_sha256":"9c4179c5dc6ba0e46584de23f78253684829879a2d64298b67d0a0392829153e","source":{"kind":"arxiv","id":"1409.2057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2057","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2057v1","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2057","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"TRAXTRO4NOQO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TRAXTRO4NOQOIZME","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TRAXTRO4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TRAXTRO4NOQOIZME3YR7PASTNB","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T20:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"606097ceec42587c5af269c9a2664488cc0e8dcb1e21a2222d8274c07fbf5244","abstract_canon_sha256":"b17182d2bf73543f8f3f2bf56ab502e57c0a74c9f7ef075de6168bedfed164d9"},"schema_version":"1.0"},"canonical_sha256":"9c4179c5dc6ba0e46584de23f78253684829879a2d64298b67d0a0392829153e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:18.018930Z","signature_b64":"nr9eWYURSQAoYa9LqLxbNU2ZVvlsQJzUHcfrFDZC1C5uLjHx1AKBMrc25Z15Vbw1nRHC4cj0hRhsNV+fe4HOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c4179c5dc6ba0e46584de23f78253684829879a2d64298b67d0a0392829153e","last_reissued_at":"2026-05-18T02:43:18.018498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:18.018498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2057","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-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouJ/Rsld7dG9Qj7UUgCDm++viCsPnibuLwON7SgYZ6LLQOs8FZOZ9nMoSYWXslCNfF28LhlQKzv6AKsIDkiJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:59:18.356024Z"},"content_sha256":"3f9dbdaf0f55d3920b0780446d01e54607a2a85e2e40f88176a4f9366f4898e1","schema_version":"1.0","event_id":"sha256:3f9dbdaf0f55d3920b0780446d01e54607a2a85e2e40f88176a4f9366f4898e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TRAXTRO4NOQOIZME3YR7PASTNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Ko-Rado for Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Lindzey","submitted_at":"2014-09-06T20:54:21Z","abstract_excerpt":"A perfect matching of a complete graph $K_{2n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $\\mathcal{F}$ is family of intersecting perfect matchings of $K_{2n}$, then $|\\mathcal{F}| \\leq (2(n-1) - 1)!!$ and if equality holds, then $\\mathcal{F} = \\mathcal{F}_{ij}$ where $ \\mathcal{F}_{ij}$ is the family of all perfect matchings of $K_{2n}$ that contain some fixed edge $ij$. We give a short algebraic proof of this result, resolving a question of Godsil and Meagher. Along the way, we show that if a family $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2057","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-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AA4HcKRFXhDps/maFXiBDlCWkkFtUoKa4EmNBhOr4iaFY2drf5c0eBlmoHtsaikF4cfJw9wkFWs8PDx70YFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:59:18.356387Z"},"content_sha256":"e6b585fa6087f3e65041676e710a2469695348210750feaefc5fadc46fc3cb3b","schema_version":"1.0","event_id":"sha256:e6b585fa6087f3e65041676e710a2469695348210750feaefc5fadc46fc3cb3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRAXTRO4NOQOIZME3YR7PASTNB/bundle.json","state_url":"https://pith.science/pith/TRAXTRO4NOQOIZME3YR7PASTNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRAXTRO4NOQOIZME3YR7PASTNB/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-23T19:59:18Z","links":{"resolver":"https://pith.science/pith/TRAXTRO4NOQOIZME3YR7PASTNB","bundle":"https://pith.science/pith/TRAXTRO4NOQOIZME3YR7PASTNB/bundle.json","state":"https://pith.science/pith/TRAXTRO4NOQOIZME3YR7PASTNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRAXTRO4NOQOIZME3YR7PASTNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TRAXTRO4NOQOIZME3YR7PASTNB","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":"b17182d2bf73543f8f3f2bf56ab502e57c0a74c9f7ef075de6168bedfed164d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T20:54:21Z","title_canon_sha256":"606097ceec42587c5af269c9a2664488cc0e8dcb1e21a2222d8274c07fbf5244"},"schema_version":"1.0","source":{"id":"1409.2057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2057","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2057v1","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2057","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"TRAXTRO4NOQO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TRAXTRO4NOQOIZME","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TRAXTRO4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:e6b585fa6087f3e65041676e710a2469695348210750feaefc5fadc46fc3cb3b","target":"graph","created_at":"2026-05-18T02:43:18Z","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":"A perfect matching of a complete graph $K_{2n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $\\mathcal{F}$ is family of intersecting perfect matchings of $K_{2n}$, then $|\\mathcal{F}| \\leq (2(n-1) - 1)!!$ and if equality holds, then $\\mathcal{F} = \\mathcal{F}_{ij}$ where $ \\mathcal{F}_{ij}$ is the family of all perfect matchings of $K_{2n}$ that contain some fixed edge $ij$. We give a short algebraic proof of this result, resolving a question of Godsil and Meagher. Along the way, we show that if a family $\\ma","authors_text":"Nathan Lindzey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T20:54:21Z","title":"Erd\\H{o}s-Ko-Rado for Perfect Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2057","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:3f9dbdaf0f55d3920b0780446d01e54607a2a85e2e40f88176a4f9366f4898e1","target":"record","created_at":"2026-05-18T02:43:18Z","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":"b17182d2bf73543f8f3f2bf56ab502e57c0a74c9f7ef075de6168bedfed164d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T20:54:21Z","title_canon_sha256":"606097ceec42587c5af269c9a2664488cc0e8dcb1e21a2222d8274c07fbf5244"},"schema_version":"1.0","source":{"id":"1409.2057","kind":"arxiv","version":1}},"canonical_sha256":"9c4179c5dc6ba0e46584de23f78253684829879a2d64298b67d0a0392829153e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c4179c5dc6ba0e46584de23f78253684829879a2d64298b67d0a0392829153e","first_computed_at":"2026-05-18T02:43:18.018498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:18.018498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nr9eWYURSQAoYa9LqLxbNU2ZVvlsQJzUHcfrFDZC1C5uLjHx1AKBMrc25Z15Vbw1nRHC4cj0hRhsNV+fe4HOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:18.018930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f9dbdaf0f55d3920b0780446d01e54607a2a85e2e40f88176a4f9366f4898e1","sha256:e6b585fa6087f3e65041676e710a2469695348210750feaefc5fadc46fc3cb3b"],"state_sha256":"7fe035be28dce55bfdf3508c0aafd0aa1b4d5ab55fdbe8226a0e61710563e5cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRrjluYJJOQZ9cSR1tkVhe+UriCVSABJnw49ktdZSA2ZlgJRLehfew89LkUw+aleJxbcnSu0ekClrNdTnvxbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:59:18.358347Z","bundle_sha256":"52b9704b217b178c5f63caaff04b1b3879b40ff1cdfcfbd397e56bc813d95cac"}}