{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PGI5CY6QO4J36RML252ITTI4S5","short_pith_number":"pith:PGI5CY6Q","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"},"canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","source":{"kind":"arxiv","id":"2507.11359","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11359","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11359v4","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11359","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"PGI5CY6QO4J3","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_16","alias_value":"PGI5CY6QO4J36RML","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_8","alias_value":"PGI5CY6Q","created_at":"2026-07-30T01:19:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PGI5CY6QO4J36RML252ITTI4S5","target":"record","payload":{"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"},"canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","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"},"source_kind":"arxiv","source_id":"2507.11359","source_version":4,"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-07-30T01:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dsusq9pl2llF3bT4rxy1//1XDKqAF2QyqDSnurpGvM31TAUdLHRmn4ThLUoF1fpTD4xKr7WzdSb64+8PdYR5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:08:48.432490Z"},"content_sha256":"49877de39998b5ac14724dcaab2bafcc67fdc3070008fbfe7d6440951f46fa91","schema_version":"1.0","event_id":"sha256:49877de39998b5ac14724dcaab2bafcc67fdc3070008fbfe7d6440951f46fa91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PGI5CY6QO4J36RML252ITTI4S5","target":"graph","payload":{"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"},"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-07-30T01:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kngOkQd5se7jttfHjrERoGae4gyEzkBOn19KJ48c3bEHfOB+bsRKMTx/t/d4lYmpl+blyauqKHs+0BUBSUFhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:08:48.433341Z"},"content_sha256":"d381dd4bb55f9b80bcba74371a24267c12259713235d42c1ea4e2506adbc26b9","schema_version":"1.0","event_id":"sha256:d381dd4bb55f9b80bcba74371a24267c12259713235d42c1ea4e2506adbc26b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/bundle.json","state_url":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGI5CY6QO4J36RML252ITTI4S5/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-08-10T12:08:48Z","links":{"resolver":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5","bundle":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/bundle.json","state":"https://pith.science/pith/PGI5CY6QO4J36RML252ITTI4S5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGI5CY6QO4J36RML252ITTI4S5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PGI5CY6QO4J36RML252ITTI4S5","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":"1098ef773ef216a31e6b2134d5a7416705145e3c2182a937dc046c51e2b346c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T14:28:14Z","title_canon_sha256":"860b7e8879aab4e1217495026ff7463a7e6467946dddcc0b5e0a39f3dc358ff7"},"schema_version":"1.0","source":{"id":"2507.11359","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11359","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11359v4","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11359","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"PGI5CY6QO4J3","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_16","alias_value":"PGI5CY6QO4J36RML","created_at":"2026-07-30T01:19:00Z"},{"alias_kind":"pith_short_8","alias_value":"PGI5CY6Q","created_at":"2026-07-30T01:19:00Z"}],"graph_snapshots":[{"event_id":"sha256:d381dd4bb55f9b80bcba74371a24267c12259713235d42c1ea4e2506adbc26b9","target":"graph","created_at":"2026-07-30T01:19:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jie Han, Jingwen Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T14:28:14Z","title":"Perfect Matchings in Random Sparsifications of Dense Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11359","kind":"arxiv","version":4},"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:49877de39998b5ac14724dcaab2bafcc67fdc3070008fbfe7d6440951f46fa91","target":"record","created_at":"2026-07-30T01:19:00Z","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":"1098ef773ef216a31e6b2134d5a7416705145e3c2182a937dc046c51e2b346c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T14:28:14Z","title_canon_sha256":"860b7e8879aab4e1217495026ff7463a7e6467946dddcc0b5e0a39f3dc358ff7"},"schema_version":"1.0","source":{"id":"2507.11359","kind":"arxiv","version":4}},"canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7991d163d07713bf458bd77489cd1c97550a3942a3d8d7554bf52e46fcdb26b8","first_computed_at":"2026-07-30T01:19:00.790790Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:19:00.790790Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2507.11359","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49877de39998b5ac14724dcaab2bafcc67fdc3070008fbfe7d6440951f46fa91","sha256:d381dd4bb55f9b80bcba74371a24267c12259713235d42c1ea4e2506adbc26b9"],"state_sha256":"77df1af88016f2d2c0787ffd7bc7cb2739b217a020c4459ca13c55bf6fc35614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wb8qxHaYLr2QubBzXGS+h0nZxDNLfxsDsf3xxDoFh5illK2xgT5/kqVKab8LIMpbI/kE1+cQaNll2GcMDD3wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:08:48.439767Z","bundle_sha256":"e38e0f328583bfc0f0313d15685f610b7f22200e467044d8072d88bc23b78270"}}