{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CNAMJ2MGQAXJ6VHH3CA3YWQNKI","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":"463870b5d136a24df7b71e31e6ecf11ec79c382a25fb2dc446023d06ae7dcf98","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-29T07:02:52Z","title_canon_sha256":"ee9c2a0e09dce1440d51b7517d4cd5cd4b203573f30dd96012303474989a1588"},"schema_version":"1.0","source":{"id":"1101.5675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5675","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5675v2","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5675","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"pith_short_12","alias_value":"CNAMJ2MGQAXJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CNAMJ2MGQAXJ6VHH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CNAMJ2MG","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:58743b1b5070dd64ba731b597a44f184579b7ab928617aa5dfb892b435400ffa","target":"graph","created_at":"2026-05-18T02:22:42Z","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 in a 4-uniform hypergraph is a subset of $\\lfloor\\frac{n}{4}\\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than ${n-1\\choose 3} - {3n/4 \\choose 3}$ edges then $H$ contains a perfect matching. This bound is tight and settles a conjecture of H{\\'a}n, Person and Schacht.","authors_text":"Imdadullah Khan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-29T07:02:52Z","title":"Perfect Matchings in 4-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5675","kind":"arxiv","version":2},"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:551e0749295b376a956a6690bfa7a2af8a0622da168fc56636ed72a1a404a2bd","target":"record","created_at":"2026-05-18T02:22:42Z","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":"463870b5d136a24df7b71e31e6ecf11ec79c382a25fb2dc446023d06ae7dcf98","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-29T07:02:52Z","title_canon_sha256":"ee9c2a0e09dce1440d51b7517d4cd5cd4b203573f30dd96012303474989a1588"},"schema_version":"1.0","source":{"id":"1101.5675","kind":"arxiv","version":2}},"canonical_sha256":"1340c4e986802e9f54e7d881bc5a0d5231eb2995b056d7a78cca98fbf49b1409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1340c4e986802e9f54e7d881bc5a0d5231eb2995b056d7a78cca98fbf49b1409","first_computed_at":"2026-05-18T02:22:42.113333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:42.113333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxfzPkwh4N7AIm61p4g+o0CvenPJ61MrEjWbZ3gg+gVyUJVS+t3/Zgn1Z5+9llD8VhCb1GGhUTNx+6oGpxrUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:42.114015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:551e0749295b376a956a6690bfa7a2af8a0622da168fc56636ed72a1a404a2bd","sha256:58743b1b5070dd64ba731b597a44f184579b7ab928617aa5dfb892b435400ffa"],"state_sha256":"9303ead201a608cfb6561be72b10a0ff28507ce9738290d861b1bd68d0d9885a"}