{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PGI5CY6QO4J36RML252ITTI4S5","short_pith_number":"pith:PGI5CY6Q","schema_version":"1.0","canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","source":{"kind":"arxiv","id":"2507.11359","version":4},"attestation_state":"computed","paper":{"title":"Perfect Matchings in Random Sparsifications of Dense Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Jingwen Zhao","submitted_at":"2025-07-15T14:28:14Z","abstract_excerpt":"Given \\(1\\le\\ell <k \\) and \\(\\delta\\geq 0\\), let \\(\\mathbf{PM}(k,\\ell,\\delta)\\) be the decision problem for the existence of perfect matchings in \\(n\\)-vertex \\(k\\)-uniform hypergraphs with minimum \\(\\ell\\)-degree at least \\(\\delta\\binom{n-\\ell}{k-\\ell}\\). For \\(k\\geq 3\\), \\(\\mathbf{PM}(k,\\ell,0)\\) was one of the first NP-complete problems identified by Karp. Keevash, Knox and Mycroft conjectured that \\(\\mathbf{PM}(k,\\ell,\\delta)\\) is in P for every \\(\\delta>1-(1-1/k)^{k-\\ell}\\) and this was recently verified by the work of Gan--Han, together with a very recent work of Fu et al.\n  In this pape"},"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":"2507.11359","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T14:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"860b7e8879aab4e1217495026ff7463a7e6467946dddcc0b5e0a39f3dc358ff7","abstract_canon_sha256":"1098ef773ef216a31e6b2134d5a7416705145e3c2182a937dc046c51e2b346c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","last_reissued_at":"2026-07-30T01:19:00.790790Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:00.790790Z"},"graph_snapshot":{"paper":{"title":"Perfect Matchings in Random Sparsifications of Dense Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Jingwen Zhao","submitted_at":"2025-07-15T14:28:14Z","abstract_excerpt":"Given \\(1\\le\\ell <k \\) and \\(\\delta\\geq 0\\), let \\(\\mathbf{PM}(k,\\ell,\\delta)\\) be the decision problem for the existence of perfect matchings in \\(n\\)-vertex \\(k\\)-uniform hypergraphs with minimum \\(\\ell\\)-degree at least \\(\\delta\\binom{n-\\ell}{k-\\ell}\\). For \\(k\\geq 3\\), \\(\\mathbf{PM}(k,\\ell,0)\\) was one of the first NP-complete problems identified by Karp. Keevash, Knox and Mycroft conjectured that \\(\\mathbf{PM}(k,\\ell,\\delta)\\) is in P for every \\(\\delta>1-(1-1/k)^{k-\\ell}\\) and this was recently verified by the work of Gan--Han, together with a very recent work of Fu et al.\n  In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11359","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11359/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.11359","created_at":"2026-07-30T01:19:00.795942+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11359v4","created_at":"2026-07-30T01:19:00.795942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11359","created_at":"2026-07-30T01:19:00.795942+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGI5CY6QO4J3","created_at":"2026-07-30T01:19:00.795942+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGI5CY6QO4J36RML","created_at":"2026-07-30T01:19:00.795942+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGI5CY6Q","created_at":"2026-07-30T01:19:00.795942+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/PGI5CY6QO4J36RML252ITTI4S5","json":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5.json","graph_json":"https://pith.science/api/pith-number/PGI5CY6QO4J36RML252ITTI4S5/graph.json","events_json":"https://pith.science/api/pith-number/PGI5CY6QO4J36RML252ITTI4S5/events.json","paper":"https://pith.science/paper/PGI5CY6Q"},"agent_actions":{"view_html":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5","download_json":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5.json","view_paper":"https://pith.science/paper/PGI5CY6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11359&json=true","fetch_graph":"https://pith.science/api/pith-number/PGI5CY6QO4J36RML252ITTI4S5/graph.json","fetch_events":"https://pith.science/api/pith-number/PGI5CY6QO4J36RML252ITTI4S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/action/storage_attestation","attest_author":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/action/author_attestation","sign_citation":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/action/citation_signature","submit_replication":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/action/replication_record"}},"created_at":"2026-07-30T01:19:00.795942+00:00","updated_at":"2026-07-30T01:19:00.795942+00:00"}