{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M7LYDEIO62BETDUAQEEKV6JEV4","short_pith_number":"pith:M7LYDEIO","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"},"canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","source":{"kind":"arxiv","id":"1307.2608","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M7LYDEIO62BETDUAQEEKV6JEV4","target":"record","payload":{"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"},"canonical_sha256":"67d781910ef682498e808108aaf924af23b1b0174c1b2b8b8a48dbda287287ea","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"},"source_kind":"arxiv","source_id":"1307.2608","source_version":2,"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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNeldYYhBX7zi96nG8zIud9xUZIVaHsXx+30rNpTjyMPJ1HGVo073fRRnjcAqLpuMdYcwl4Rtr1Vx/dGz5/YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:22:44.478243Z"},"content_sha256":"605908615f8edf9953c261670a075ab1e622d9ae2209a2a29165164370f4470d","schema_version":"1.0","event_id":"sha256:605908615f8edf9953c261670a075ab1e622d9ae2209a2a29165164370f4470d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M7LYDEIO62BETDUAQEEKV6JEV4","target":"graph","payload":{"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"},"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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OFsiqZYeTYAxtwiqUPiup+kC2jHqgpPX82oqZ9uWFpICpI87XMHP/Pty5VkUoqbfYf7XY6MUR4GhsdW0kvCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:22:44.478635Z"},"content_sha256":"090158872968a10b7504906453e1888d708a41a541fadc97af1c62d7bee963b6","schema_version":"1.0","event_id":"sha256:090158872968a10b7504906453e1888d708a41a541fadc97af1c62d7bee963b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/bundle.json","state_url":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7LYDEIO62BETDUAQEEKV6JEV4/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-05-30T18:22:44Z","links":{"resolver":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4","bundle":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/bundle.json","state":"https://pith.science/pith/M7LYDEIO62BETDUAQEEKV6JEV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7LYDEIO62BETDUAQEEKV6JEV4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/fgXN1ma/4XIV0fCdTYdpv4FaTM/yyrXW8EUDo+hd25Q5//grdr4KPWZO3idSNycr1KxlhDLADkc242HyMdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:22:44.480772Z","bundle_sha256":"0652e902793215f8ec6332ca0b9bbe1db415f609c80654085d23f5712080ac52"}}