{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CA5IIDAE2MGSSKIGRYB6LERJLV","short_pith_number":"pith:CA5IIDAE","schema_version":"1.0","canonical_sha256":"103a840c04d30d2929068e03e592295d6a69eb0093f7165beeb413941f4e1613","source":{"kind":"arxiv","id":"2409.06640","version":1},"attestation_state":"computed","paper":{"title":"Random embeddings of bounded degree trees with optimal spread","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Cl\\'ement Legrand-Duchesne, Paul Bastide","submitted_at":"2024-09-10T16:55:15Z","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"},"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":"2409.06640","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T16:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"09c38e4243935f67c7c164a90a2123fc9e6eeba26b12265a1eeb9ba3e172af57","abstract_canon_sha256":"1ce22facac052b0ea28ea69a38471131dff3f9f495747a1b37d7429712bd1141"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:27.518526Z","signature_b64":"u6N1KVBSNQGbNzp+aBSskwAEsWc9RbpBPNiAF7mOPyKdmVjEG2bGxwRgmoJQjO1gaKpJg5qIGzwgtuS/Gu4mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103a840c04d30d2929068e03e592295d6a69eb0093f7165beeb413941f4e1613","last_reissued_at":"2026-07-05T09:05:27.517987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:27.517987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random embeddings of bounded degree trees with optimal spread","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Cl\\'ement Legrand-Duchesne, Paul Bastide","submitted_at":"2024-09-10T16:55:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06640","kind":"arxiv","version":1},"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/2409.06640/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":"2409.06640","created_at":"2026-07-05T09:05:27.518058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06640v1","created_at":"2026-07-05T09:05:27.518058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06640","created_at":"2026-07-05T09:05:27.518058+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA5IIDAE2MGS","created_at":"2026-07-05T09:05:27.518058+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA5IIDAE2MGSSKIG","created_at":"2026-07-05T09:05:27.518058+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA5IIDAE","created_at":"2026-07-05T09:05:27.518058+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17911","citing_title":"Dirac's theorem and the switch geometry of perfect matchings","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV","json":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV.json","graph_json":"https://pith.science/api/pith-number/CA5IIDAE2MGSSKIGRYB6LERJLV/graph.json","events_json":"https://pith.science/api/pith-number/CA5IIDAE2MGSSKIGRYB6LERJLV/events.json","paper":"https://pith.science/paper/CA5IIDAE"},"agent_actions":{"view_html":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV","download_json":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV.json","view_paper":"https://pith.science/paper/CA5IIDAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06640&json=true","fetch_graph":"https://pith.science/api/pith-number/CA5IIDAE2MGSSKIGRYB6LERJLV/graph.json","fetch_events":"https://pith.science/api/pith-number/CA5IIDAE2MGSSKIGRYB6LERJLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV/action/storage_attestation","attest_author":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV/action/author_attestation","sign_citation":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV/action/citation_signature","submit_replication":"https://pith.science/pith/CA5IIDAE2MGSSKIGRYB6LERJLV/action/replication_record"}},"created_at":"2026-07-05T09:05:27.518058+00:00","updated_at":"2026-07-05T09:05:27.518058+00:00"}