{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MKW6U2QAW62WTZEOVVRDIDXFG7","short_pith_number":"pith:MKW6U2QA","schema_version":"1.0","canonical_sha256":"62adea6a00b7b569e48ead62340ee537c9d76ae9d001bb95d0dfab48b31f128f","source":{"kind":"arxiv","id":"1811.06160","version":1},"attestation_state":"computed","paper":{"title":"Intersecting Families of Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Lindzey","submitted_at":"2018-11-15T03:54:29Z","abstract_excerpt":"A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \\in \\mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) - 1)!!$ for sufficiently large $n$, and that equality holds if and only if the family is composed of all perfect matchings that contain a fixed set of $t$ disjoint edges. This is an asymptotic version of a conjecture of Godsil and Meagher that can be seen as the non-bipartite analogue of the Deza-Frankl conjecture proven by Ellis, Friedgut, and Pilpel."},"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":"1811.06160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-15T03:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"64098f857b75deb745b1bfbb985067a6818105a18d4e3a81a319734949bb7bb0","abstract_canon_sha256":"4939ad598f25dd80bf8e05124656e2ae076eb3e9729e53d2b66ba8ef8e3276a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.487378Z","signature_b64":"2zAcDbj30TFuH3HmHN+PawKMksJExSUhSJ9J7ow/elJj8HMmIHZeCo2yFp1WKRuXQGCxypUIPei0yMA1WfH9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62adea6a00b7b569e48ead62340ee537c9d76ae9d001bb95d0dfab48b31f128f","last_reissued_at":"2026-05-18T00:00:38.486896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.486896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersecting Families of Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Lindzey","submitted_at":"2018-11-15T03:54:29Z","abstract_excerpt":"A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \\in \\mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) - 1)!!$ for sufficiently large $n$, and that equality holds if and only if the family is composed of all perfect matchings that contain a fixed set of $t$ disjoint edges. This is an asymptotic version of a conjecture of Godsil and Meagher that can be seen as the non-bipartite analogue of the Deza-Frankl conjecture proven by Ellis, Friedgut, and Pilpel."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06160","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":"1811.06160","created_at":"2026-05-18T00:00:38.486961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06160v1","created_at":"2026-05-18T00:00:38.486961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06160","created_at":"2026-05-18T00:00:38.486961+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKW6U2QAW62W","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKW6U2QAW62WTZEO","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKW6U2QA","created_at":"2026-05-18T12:32:37.024351+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/MKW6U2QAW62WTZEOVVRDIDXFG7","json":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7.json","graph_json":"https://pith.science/api/pith-number/MKW6U2QAW62WTZEOVVRDIDXFG7/graph.json","events_json":"https://pith.science/api/pith-number/MKW6U2QAW62WTZEOVVRDIDXFG7/events.json","paper":"https://pith.science/paper/MKW6U2QA"},"agent_actions":{"view_html":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7","download_json":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7.json","view_paper":"https://pith.science/paper/MKW6U2QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06160&json=true","fetch_graph":"https://pith.science/api/pith-number/MKW6U2QAW62WTZEOVVRDIDXFG7/graph.json","fetch_events":"https://pith.science/api/pith-number/MKW6U2QAW62WTZEOVVRDIDXFG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7/action/storage_attestation","attest_author":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7/action/author_attestation","sign_citation":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7/action/citation_signature","submit_replication":"https://pith.science/pith/MKW6U2QAW62WTZEOVVRDIDXFG7/action/replication_record"}},"created_at":"2026-05-18T00:00:38.486961+00:00","updated_at":"2026-05-18T00:00:38.486961+00:00"}