{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M7LYDEIO62BETDUAQEEKV6JEV4","short_pith_number":"pith:M7LYDEIO","schema_version":"1.0","canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","source":{"kind":"arxiv","id":"1307.2608","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-time perfect matchings in dense hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fiachra Knox, Peter Keevash, Richard Mycroft","submitted_at":"2013-07-09T22:00:06Z","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"},"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":"1307.2608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T22:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"b91bf2312bc7f2313ce007802097d3a5ab2edf21bdb87e790e48321cd37ac028","abstract_canon_sha256":"074b443bf762fb62a2487016e04be6a0dca37e22865371df487976a9a63c9925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.905871Z","signature_b64":"4HG6cUOEGMk6DHSg1zVAXXkY9Uo1zjew2FwX/d8urADI6Lw9WGaj2QwDo902lyWrJt/X59pd8nVG8lOIQoyOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","last_reissued_at":"2026-05-18T01:33:16.905378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.905378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time perfect matchings in dense hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fiachra Knox, Peter Keevash, Richard Mycroft","submitted_at":"2013-07-09T22:00:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2608","kind":"arxiv","version":2},"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":"1307.2608","created_at":"2026-05-18T01:33:16.905467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2608v2","created_at":"2026-05-18T01:33:16.905467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2608","created_at":"2026-05-18T01:33:16.905467+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7LYDEIO62BE","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7LYDEIO62BETDUA","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7LYDEIO","created_at":"2026-05-18T12:27:51.066281+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/M7LYDEIO62BETDUAQEEKV6JEV4","json":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4.json","graph_json":"https://pith.science/api/pith-number/M7LYDEIO62BETDUAQEEKV6JEV4/graph.json","events_json":"https://pith.science/api/pith-number/M7LYDEIO62BETDUAQEEKV6JEV4/events.json","paper":"https://pith.science/paper/M7LYDEIO"},"agent_actions":{"view_html":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4","download_json":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4.json","view_paper":"https://pith.science/paper/M7LYDEIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2608&json=true","fetch_graph":"https://pith.science/api/pith-number/M7LYDEIO62BETDUAQEEKV6JEV4/graph.json","fetch_events":"https://pith.science/api/pith-number/M7LYDEIO62BETDUAQEEKV6JEV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/action/storage_attestation","attest_author":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/action/author_attestation","sign_citation":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/action/citation_signature","submit_replication":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/action/replication_record"}},"created_at":"2026-05-18T01:33:16.905467+00:00","updated_at":"2026-05-18T01:33:16.905467+00:00"}