{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CA5IIDAE2MGSSKIGRYB6LERJLV","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":"1ce22facac052b0ea28ea69a38471131dff3f9f495747a1b37d7429712bd1141","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T16:55:15Z","title_canon_sha256":"09c38e4243935f67c7c164a90a2123fc9e6eeba26b12265a1eeb9ba3e172af57"},"schema_version":"1.0","source":{"id":"2409.06640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.06640","created_at":"2026-07-05T09:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"2409.06640v1","created_at":"2026-07-05T09:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06640","created_at":"2026-07-05T09:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"CA5IIDAE2MGS","created_at":"2026-07-05T09:05:27Z"},{"alias_kind":"pith_short_16","alias_value":"CA5IIDAE2MGSSKIG","created_at":"2026-07-05T09:05:27Z"},{"alias_kind":"pith_short_8","alias_value":"CA5IIDAE","created_at":"2026-07-05T09:05:27Z"}],"graph_snapshots":[{"event_id":"sha256:0aefa95fe274389e9b06cc6de343c489a18fec31bae0e66b3bece37c3c187ca9","target":"graph","created_at":"2026-07-05T09:05:27Z","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/2409.06640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A seminal result of Koml\\'os, S\\'ark\\\"ozy, and Szemer\\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended this result to show that such graphs G in fact support an optimally spread distribution on copies of a given T, which implies, using the recent breakthroughs on the Kahn-Kalai conjecture, the robustness result that T is a subgraph of sparse random subgraphs of G as well. Pham, Sah, Sawhney, and Simkin construct their optimally spread distribution by following","authors_text":"Alp M\\\"uyesser, Cl\\'ement Legrand-Duchesne, Paul Bastide","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T16:55:15Z","title":"Random embeddings of bounded degree trees with optimal spread"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06640","kind":"arxiv","version":1},"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:803d3fc621affca3f304effa297890ed9e6150de7c3e4e0f1310bb9ea684ce7f","target":"record","created_at":"2026-07-05T09:05:27Z","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":"1ce22facac052b0ea28ea69a38471131dff3f9f495747a1b37d7429712bd1141","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T16:55:15Z","title_canon_sha256":"09c38e4243935f67c7c164a90a2123fc9e6eeba26b12265a1eeb9ba3e172af57"},"schema_version":"1.0","source":{"id":"2409.06640","kind":"arxiv","version":1}},"canonical_sha256":"103a840c04d30d2929068e03e592295d6a69eb0093f7165beeb413941f4e1613","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"103a840c04d30d2929068e03e592295d6a69eb0093f7165beeb413941f4e1613","first_computed_at":"2026-07-05T09:05:27.517987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:05:27.517987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u6N1KVBSNQGbNzp+aBSskwAEsWc9RbpBPNiAF7mOPyKdmVjEG2bGxwRgmoJQjO1gaKpJg5qIGzwgtuS/Gu4mAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:05:27.518526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.06640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:803d3fc621affca3f304effa297890ed9e6150de7c3e4e0f1310bb9ea684ce7f","sha256:0aefa95fe274389e9b06cc6de343c489a18fec31bae0e66b3bece37c3c187ca9"],"state_sha256":"fc7ba16438364389bde58221af4cc4634b1978dc7b0ae0a7a4bdb11cf63d2fb3"}