{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5KWGDRRQ7C4FVISRHPHBV5XC3E","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":"3aedb20f762136495d1a32c3bad4e3f9dee70a5fccd2b84fd8d43e9157349ca1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-16T17:47:31Z","title_canon_sha256":"43c9dfec5430c8d250290c9487c1130e3a02ab0253271ef86a827c2d464a174e"},"schema_version":"1.0","source":{"id":"2308.08535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.08535","created_at":"2026-07-05T09:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"2308.08535v2","created_at":"2026-07-05T09:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08535","created_at":"2026-07-05T09:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"5KWGDRRQ7C4F","created_at":"2026-07-05T09:01:25Z"},{"alias_kind":"pith_short_16","alias_value":"5KWGDRRQ7C4FVISR","created_at":"2026-07-05T09:01:25Z"},{"alias_kind":"pith_short_8","alias_value":"5KWGDRRQ","created_at":"2026-07-05T09:01:25Z"}],"graph_snapshots":[{"event_id":"sha256:a00daaf3ed305a71f89441ebf4276c9877ccef468e668ba47233ec40ceed2ff8","target":"graph","created_at":"2026-07-05T09:01:25Z","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/2308.08535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ and $H$ be hypergraphs on $n$ vertices, and suppose $H$ has large enough minimum degree to necessarily contain a copy of $G$ as a subgraph. We give a general method to randomly embed $G$ into $H$ with good \"spread\". More precisely, for a wide class of $G$, we find a randomised embedding $f\\colon G\\hookrightarrow H$ with the following property: for every $s$, for any partial embedding $f'$ of $s$ vertices of $G$ into $H$, the probability that $f$ extends $f'$ is at most $O(1/n)^s$. This is a common generalisation of several streams of research surrounding the classical Dirac-type proble","authors_text":"Alexey Pokrovskiy, Alp M\\\"uyesser, Tom Kelly","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-16T17:47:31Z","title":"Optimal spread for spanning subgraphs of Dirac hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08535","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:9b78e9f55b7cc40ca55ba93e3fd81ee0cb693fd4ba793c1d3ed76a6938780bd2","target":"record","created_at":"2026-07-05T09:01:25Z","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":"3aedb20f762136495d1a32c3bad4e3f9dee70a5fccd2b84fd8d43e9157349ca1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-16T17:47:31Z","title_canon_sha256":"43c9dfec5430c8d250290c9487c1130e3a02ab0253271ef86a827c2d464a174e"},"schema_version":"1.0","source":{"id":"2308.08535","kind":"arxiv","version":2}},"canonical_sha256":"eaac61c630f8b85aa2513bce1af6e2d93d1d4f0999c8d986099b871d8eafa40a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaac61c630f8b85aa2513bce1af6e2d93d1d4f0999c8d986099b871d8eafa40a","first_computed_at":"2026-07-05T09:01:25.319169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:01:25.319169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XID9Z4XwVfgLsxQsaMXC11OgXLE3IOkct9pD9Oe1RaKkhYdNhJv3Fei4LwAIaH7KGgBza00S3VnkMusXI8LlBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:01:25.319669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.08535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b78e9f55b7cc40ca55ba93e3fd81ee0cb693fd4ba793c1d3ed76a6938780bd2","sha256:a00daaf3ed305a71f89441ebf4276c9877ccef468e668ba47233ec40ceed2ff8"],"state_sha256":"61accd10bc34b8c74bde8126efaa3b2dc95cd6836c7f7b1a0e186d144a52d9b0"}