{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YPQAHLNURADO73ZJE2NSZSJGUH","short_pith_number":"pith:YPQAHLNU","schema_version":"1.0","canonical_sha256":"c3e003adb48806efef29269b2cc926a1fa16fb0f58ce87df951fe617190ca7e5","source":{"kind":"arxiv","id":"2305.02725","version":2},"attestation_state":"computed","paper":{"title":"Two-round Ramsey games on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Morris, Wojciech Samotij, Yahav Alon","submitted_at":"2023-05-04T10:46:48Z","abstract_excerpt":"Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, R\\\"odl, Ruci\\'nski and Tetali introduced two variants of a single-player game whose goal is to colour the edges of a~random graph, in an online fashion, so as not to create a monochromatic triangle. In the two-round variant of the game, the player is first asked to find a triangle-free colouring of the edges of a random graph $G_1$ and then extend this colouring to a triangle-free colouring of the union of $G_1$ and another (independent) random graph $G_2$, which is disclosed"},"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.02725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-04T10:46:48Z","cross_cats_sorted":[],"title_canon_sha256":"425844d5cd060ed811380eab2cb5e5a6ad057a8a8fe80afc489d319859b002af","abstract_canon_sha256":"c70b7399bbd381014c8adae19ab0d0cd2a040c5ee2928210fc241459650ba9b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.445403Z","signature_b64":"yEY6GwIBCUGJyGHYtv9LdkxHJn9SMhk947go7B3xNA7g3bYjZgQ2rvZaukS0qc0ZI9xBb3vNQKd7L4Ek1KVfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3e003adb48806efef29269b2cc926a1fa16fb0f58ce87df951fe617190ca7e5","last_reissued_at":"2026-06-23T03:13:42.444933Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.444933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-round Ramsey games on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Morris, Wojciech Samotij, Yahav Alon","submitted_at":"2023-05-04T10:46:48Z","abstract_excerpt":"Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, R\\\"odl, Ruci\\'nski and Tetali introduced two variants of a single-player game whose goal is to colour the edges of a~random graph, in an online fashion, so as not to create a monochromatic triangle. In the two-round variant of the game, the player is first asked to find a triangle-free colouring of the edges of a random graph $G_1$ and then extend this colouring to a triangle-free colouring of the union of $G_1$ and another (independent) random graph $G_2$, which is disclosed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02725","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.02725/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.02725","created_at":"2026-06-23T03:13:42.444988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02725v2","created_at":"2026-06-23T03:13:42.444988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02725","created_at":"2026-06-23T03:13:42.444988+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPQAHLNURADO","created_at":"2026-06-23T03:13:42.444988+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPQAHLNURADO73ZJ","created_at":"2026-06-23T03:13:42.444988+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPQAHLNU","created_at":"2026-06-23T03:13:42.444988+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/YPQAHLNURADO73ZJE2NSZSJGUH","json":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH.json","graph_json":"https://pith.science/api/pith-number/YPQAHLNURADO73ZJE2NSZSJGUH/graph.json","events_json":"https://pith.science/api/pith-number/YPQAHLNURADO73ZJE2NSZSJGUH/events.json","paper":"https://pith.science/paper/YPQAHLNU"},"agent_actions":{"view_html":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH","download_json":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH.json","view_paper":"https://pith.science/paper/YPQAHLNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02725&json=true","fetch_graph":"https://pith.science/api/pith-number/YPQAHLNURADO73ZJE2NSZSJGUH/graph.json","fetch_events":"https://pith.science/api/pith-number/YPQAHLNURADO73ZJE2NSZSJGUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH/action/storage_attestation","attest_author":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH/action/author_attestation","sign_citation":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH/action/citation_signature","submit_replication":"https://pith.science/pith/YPQAHLNURADO73ZJE2NSZSJGUH/action/replication_record"}},"created_at":"2026-06-23T03:13:42.444988+00:00","updated_at":"2026-06-23T03:13:42.444988+00:00"}