{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EZYLHNDQC5UXXU5QCCL64VOV43","short_pith_number":"pith:EZYLHNDQ","canonical_record":{"source":{"id":"2211.01325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-02T17:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"f886971d66aca74f2170a9b3cb9460d5e27e123a853c106c7690aa91a7327131","abstract_canon_sha256":"50275d75d2e2484f36336fa1ee35f060503a236a9f444318a402ebf5f529e709"},"schema_version":"1.0"},"canonical_sha256":"2670b3b47017697bd3b01097ee55d5e6f981ca31d402c0072f6b9aa5d44a1e4d","source":{"kind":"arxiv","id":"2211.01325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01325","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01325v2","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01325","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_12","alias_value":"EZYLHNDQC5UX","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZYLHNDQC5UXXU5Q","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZYLHNDQ","created_at":"2026-07-05T08:08:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EZYLHNDQC5UXXU5QCCL64VOV43","target":"record","payload":{"canonical_record":{"source":{"id":"2211.01325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-02T17:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"f886971d66aca74f2170a9b3cb9460d5e27e123a853c106c7690aa91a7327131","abstract_canon_sha256":"50275d75d2e2484f36336fa1ee35f060503a236a9f444318a402ebf5f529e709"},"schema_version":"1.0"},"canonical_sha256":"2670b3b47017697bd3b01097ee55d5e6f981ca31d402c0072f6b9aa5d44a1e4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:15.533348Z","signature_b64":"DC/VL6POWd++PHmItRXqoC3OqX6Nrlxwhrz53zcYmFuznywGy/9vb+mRKN4L3eEnzfW/W5pm6dGs9PtQMc1CDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2670b3b47017697bd3b01097ee55d5e6f981ca31d402c0072f6b9aa5d44a1e4d","last_reissued_at":"2026-07-05T08:08:15.532872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:15.532872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.01325","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-07-05T08:08:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5eZqbrwnnzz6CC/2Ii8pHzXWpwbuUiLHIwuPLTH6O/knJStBFw5yMpL0cVVA8uJBSaiIvtAwaeAc2JN6KUkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:27:24.458216Z"},"content_sha256":"af954f355c26fcb00b7e8bb9c73bbe7ee9eccd5878e4f231571773bffb89be99","schema_version":"1.0","event_id":"sha256:af954f355c26fcb00b7e8bb9c73bbe7ee9eccd5878e4f231571773bffb89be99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EZYLHNDQC5UXXU5QCCL64VOV43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect matchings in random sparsifications of Dirac hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Dong Yeap Kang, Tom Kelly, Vincent Pfenninger","submitted_at":"2022-11-02T17:44:30Z","abstract_excerpt":"For all integers $n \\geq k > d \\geq 1$, let $m_{d}(k,n)$ be the minimum integer $D \\geq 0$ such that every $k$-uniform $n$-vertex hypergraph $\\mathcal H$ with minimum $d$-degree $\\delta_{d}(\\mathcal H)$ at least $D$ has an optimal matching. For every fixed integer $k \\geq 3$, we show that for $n \\in k \\mathbb{N}$ and $p = \\Omega(n^{-k+1} \\log n)$, if $\\mathcal H$ is an $n$-vertex $k$-uniform hypergraph with $\\delta_{k-1}(\\mathcal H) \\geq m_{k-1}(k,n)$, then a.a.s.\\ its $p$-random subhypergraph $\\mathcal H_p$ contains a perfect matching. Moreover, for every fixed integer $d < k$ and $\\gamma > 0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01325","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.01325/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-05T08:08:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0y8SvBbodM5lXt05vQz2k7OyyX+BmrcmuWIAQFi/m9r5vALmA+EgbAEv7hKbU2IExqFK83iUVzARy+5aVGbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:27:24.458722Z"},"content_sha256":"6df1a0201dc184e3d99f6a8268e0764b725aadb5f26ade8b78003935e26fe5bf","schema_version":"1.0","event_id":"sha256:6df1a0201dc184e3d99f6a8268e0764b725aadb5f26ade8b78003935e26fe5bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZYLHNDQC5UXXU5QCCL64VOV43/bundle.json","state_url":"https://pith.science/pith/EZYLHNDQC5UXXU5QCCL64VOV43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZYLHNDQC5UXXU5QCCL64VOV43/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-15T10:27:24Z","links":{"resolver":"https://pith.science/pith/EZYLHNDQC5UXXU5QCCL64VOV43","bundle":"https://pith.science/pith/EZYLHNDQC5UXXU5QCCL64VOV43/bundle.json","state":"https://pith.science/pith/EZYLHNDQC5UXXU5QCCL64VOV43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZYLHNDQC5UXXU5QCCL64VOV43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EZYLHNDQC5UXXU5QCCL64VOV43","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":"50275d75d2e2484f36336fa1ee35f060503a236a9f444318a402ebf5f529e709","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-02T17:44:30Z","title_canon_sha256":"f886971d66aca74f2170a9b3cb9460d5e27e123a853c106c7690aa91a7327131"},"schema_version":"1.0","source":{"id":"2211.01325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01325","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01325v2","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01325","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_12","alias_value":"EZYLHNDQC5UX","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZYLHNDQC5UXXU5Q","created_at":"2026-07-05T08:08:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZYLHNDQ","created_at":"2026-07-05T08:08:15Z"}],"graph_snapshots":[{"event_id":"sha256:6df1a0201dc184e3d99f6a8268e0764b725aadb5f26ade8b78003935e26fe5bf","target":"graph","created_at":"2026-07-05T08:08:15Z","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/2211.01325/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For all integers $n \\geq k > d \\geq 1$, let $m_{d}(k,n)$ be the minimum integer $D \\geq 0$ such that every $k$-uniform $n$-vertex hypergraph $\\mathcal H$ with minimum $d$-degree $\\delta_{d}(\\mathcal H)$ at least $D$ has an optimal matching. For every fixed integer $k \\geq 3$, we show that for $n \\in k \\mathbb{N}$ and $p = \\Omega(n^{-k+1} \\log n)$, if $\\mathcal H$ is an $n$-vertex $k$-uniform hypergraph with $\\delta_{k-1}(\\mathcal H) \\geq m_{k-1}(k,n)$, then a.a.s.\\ its $p$-random subhypergraph $\\mathcal H_p$ contains a perfect matching. Moreover, for every fixed integer $d < k$ and $\\gamma > 0","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Dong Yeap Kang, Tom Kelly, Vincent Pfenninger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-02T17:44:30Z","title":"Perfect matchings in random sparsifications of Dirac hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01325","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:af954f355c26fcb00b7e8bb9c73bbe7ee9eccd5878e4f231571773bffb89be99","target":"record","created_at":"2026-07-05T08:08:15Z","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":"50275d75d2e2484f36336fa1ee35f060503a236a9f444318a402ebf5f529e709","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-02T17:44:30Z","title_canon_sha256":"f886971d66aca74f2170a9b3cb9460d5e27e123a853c106c7690aa91a7327131"},"schema_version":"1.0","source":{"id":"2211.01325","kind":"arxiv","version":2}},"canonical_sha256":"2670b3b47017697bd3b01097ee55d5e6f981ca31d402c0072f6b9aa5d44a1e4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2670b3b47017697bd3b01097ee55d5e6f981ca31d402c0072f6b9aa5d44a1e4d","first_computed_at":"2026-07-05T08:08:15.532872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:08:15.532872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DC/VL6POWd++PHmItRXqoC3OqX6Nrlxwhrz53zcYmFuznywGy/9vb+mRKN4L3eEnzfW/W5pm6dGs9PtQMc1CDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:08:15.533348Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.01325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af954f355c26fcb00b7e8bb9c73bbe7ee9eccd5878e4f231571773bffb89be99","sha256:6df1a0201dc184e3d99f6a8268e0764b725aadb5f26ade8b78003935e26fe5bf"],"state_sha256":"0e374ec77eff80605cb4c5c838a58aae3610df4e0d157aaa2cfa54fde245152f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lylIi5lnTCl8/QfH0KmmvHJa5naKP7T5g/k16Lw47mrVQK187JUKQbKxmJdxcuQHr2g8J3PXKsuw0v4w13HUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:27:24.462989Z","bundle_sha256":"64830e62f73526b102eacc0bba6e9a2958545232c6835bf55bfe6661b4299646"}}