{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M7LYDEIO62BETDUAQEEKV6JEV4","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":"074b443bf762fb62a2487016e04be6a0dca37e22865371df487976a9a63c9925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T22:00:06Z","title_canon_sha256":"b91bf2312bc7f2313ce007802097d3a5ab2edf21bdb87e790e48321cd37ac028"},"schema_version":"1.0","source":{"id":"1307.2608","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2608","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2608v2","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2608","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"M7LYDEIO62BE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M7LYDEIO62BETDUA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M7LYDEIO","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:090158872968a10b7504906453e1888d708a41a541fadc97af1c62d7bee963b6","target":"graph","created_at":"2026-05-18T01:33:16Z","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":"Let $H$ be a $k$-graph on $n$ vertices, with minimum codegree at least $n/k + cn$ for some fixed $c > 0$. In this paper we construct a polynomial-time algorithm which finds either a perfect matching in $H$ or a certificate that none exists. This essentially solves a problem of Karpi\\'nski, Ruci\\'nski and Szyma\\'nska; Szyma\\'nska previously showed that this problem is NP-hard for a minimum codegree of $n/k - cn$. Our algorithm relies on a theoretical result of independent interest, in which we characterise any such hypergraph with no perfect matching using a family of lattice-based construction","authors_text":"Fiachra Knox, Peter Keevash, Richard Mycroft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T22:00:06Z","title":"Polynomial-time perfect matchings in dense hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2608","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:605908615f8edf9953c261670a075ab1e622d9ae2209a2a29165164370f4470d","target":"record","created_at":"2026-05-18T01:33:16Z","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":"074b443bf762fb62a2487016e04be6a0dca37e22865371df487976a9a63c9925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T22:00:06Z","title_canon_sha256":"b91bf2312bc7f2313ce007802097d3a5ab2edf21bdb87e790e48321cd37ac028"},"schema_version":"1.0","source":{"id":"1307.2608","kind":"arxiv","version":2}},"canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","first_computed_at":"2026-05-18T01:33:16.905378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:16.905378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HG6cUOEGMk6DHSg1zVAXXkY9Uo1zjew2FwX/d8urADI6Lw9WGaj2QwDo902lyWrJt/X59pd8nVG8lOIQoyOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:16.905871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2608","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:605908615f8edf9953c261670a075ab1e622d9ae2209a2a29165164370f4470d","sha256:090158872968a10b7504906453e1888d708a41a541fadc97af1c62d7bee963b6"],"state_sha256":"33e5fdc7ab177e3ab54b85c2430682507c1e69266a1acfeb2d18d47930f1430f"}