{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M4GT5N6YIBYKVNRYGSOUSJXFGI","short_pith_number":"pith:M4GT5N6Y","schema_version":"1.0","canonical_sha256":"670d3eb7d84070aab638349d4926e53212a8396bae52359d7769f906ea7d211e","source":{"kind":"arxiv","id":"2305.19964","version":2},"attestation_state":"computed","paper":{"title":"The list-Ramsey threshold for families of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eden Kuperwasser, Wojciech Samotij","submitted_at":"2023-05-31T15:52:13Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\\mathcal{F}$. The threshold for the classic Ramsey property in the binomial random graph, where $\\mathcal{F}$ consists of one graph, was located in the celebrated work of R\\\"odl and Ruci\\'nski.\n  In this paper, we offer a twofold generalisation to the R\\\"odl--Ruci\\'nski theorem. First, we show that the list-colouring version of the property has the same threshold. Second, we extend this result to finite fam"},"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":"2305.19964","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-31T15:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"03bcbc2635424811a7f14531493c3739535ef7aff8fb3db50ee6429fabc269aa","abstract_canon_sha256":"d4f2300bb07c1393671b7952c1a3d3b5ba37238c2f25aa68d78491fbc7a2cca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:36.467824Z","signature_b64":"tDiLWsjWM4GqLVnXC9rmG4bggMaTvjmwsCPRFvI10KiXzhsUNDlRgp1yJzTjwM7YakkimA2U2Z+e/NXgFlkNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670d3eb7d84070aab638349d4926e53212a8396bae52359d7769f906ea7d211e","last_reissued_at":"2026-07-05T09:40:36.467430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:36.467430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The list-Ramsey threshold for families of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eden Kuperwasser, Wojciech Samotij","submitted_at":"2023-05-31T15:52:13Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\\mathcal{F}$. The threshold for the classic Ramsey property in the binomial random graph, where $\\mathcal{F}$ consists of one graph, was located in the celebrated work of R\\\"odl and Ruci\\'nski.\n  In this paper, we offer a twofold generalisation to the R\\\"odl--Ruci\\'nski theorem. First, we show that the list-colouring version of the property has the same threshold. Second, we extend this result to finite fam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.19964","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/2305.19964/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":"2305.19964","created_at":"2026-07-05T09:40:36.467483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.19964v2","created_at":"2026-07-05T09:40:36.467483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.19964","created_at":"2026-07-05T09:40:36.467483+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4GT5N6YIBYK","created_at":"2026-07-05T09:40:36.467483+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4GT5N6YIBYKVNRY","created_at":"2026-07-05T09:40:36.467483+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4GT5N6Y","created_at":"2026-07-05T09:40:36.467483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI","json":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI.json","graph_json":"https://pith.science/api/pith-number/M4GT5N6YIBYKVNRYGSOUSJXFGI/graph.json","events_json":"https://pith.science/api/pith-number/M4GT5N6YIBYKVNRYGSOUSJXFGI/events.json","paper":"https://pith.science/paper/M4GT5N6Y"},"agent_actions":{"view_html":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI","download_json":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI.json","view_paper":"https://pith.science/paper/M4GT5N6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.19964&json=true","fetch_graph":"https://pith.science/api/pith-number/M4GT5N6YIBYKVNRYGSOUSJXFGI/graph.json","fetch_events":"https://pith.science/api/pith-number/M4GT5N6YIBYKVNRYGSOUSJXFGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI/action/storage_attestation","attest_author":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI/action/author_attestation","sign_citation":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI/action/citation_signature","submit_replication":"https://pith.science/pith/M4GT5N6YIBYKVNRYGSOUSJXFGI/action/replication_record"}},"created_at":"2026-07-05T09:40:36.467483+00:00","updated_at":"2026-07-05T09:40:36.467483+00:00"}