{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MI5P3XA6UB367BWMDY3PEH5DGY","short_pith_number":"pith:MI5P3XA6","schema_version":"1.0","canonical_sha256":"623afddc1ea077ef86cc1e36f21fa3362b9f5df387d653ae02d685769c0d3b54","source":{"kind":"arxiv","id":"2606.30548","version":1},"attestation_state":"computed","paper":{"title":"The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asier Calbet R\\'ipodas, Joseph Hyde, Victor Falgas-Ravry","submitted_at":"2026-06-29T16:47:45Z","abstract_excerpt":"For $r \\geq 2$ and graphs $H_1, \\ldots, H_r, G$, we say that $G$ is $(H_1, \\ldots, H_r)$ vertex-Ramsey, or $(H_1, \\ldots, H_r)_v$-Ramsey, if whenever we colour the vertices of $G$ with colours from the set $[r]=\\{1,2, \\ldots, r\\}$ there exists $j \\in [r]$ such that some copy of $H_j$ in $G$ is monochromatic in colour $j$. Given any fixed collection of graphs $H_1, \\ldots, H_r$, Luczak, Ruci\\'{n}ski and Voigt and Kreuter determined in the 1990s the threshold edge probability $p$ at which the binomial random graph $G(n,p)$ becomes $(H_1, \\ldots, H_r)_v$-Ramsey. More recently, Das, Morris and Tre"},"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":"2606.30548","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T16:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"812ba9936b0ceb45e3c1df2be6e03d46486a432786a51b6fc37879d7159c5034","abstract_canon_sha256":"15b0c0b2c4de0b52a449fc9604abde9cad2f87a5e3c3c4e4254ef6809898570d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:18:19.990177Z","signature_b64":"rxkHrQFBewWCfkGTzd2bgJb7PsWsHnNrl+1k2U1Kdvb0FirZnb7iqO2EVjr0ym2Ib1SDRr9chNyW2rDGhXrTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"623afddc1ea077ef86cc1e36f21fa3362b9f5df387d653ae02d685769c0d3b54","last_reissued_at":"2026-06-30T02:18:19.989608Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:18:19.989608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asier Calbet R\\'ipodas, Joseph Hyde, Victor Falgas-Ravry","submitted_at":"2026-06-29T16:47:45Z","abstract_excerpt":"For $r \\geq 2$ and graphs $H_1, \\ldots, H_r, G$, we say that $G$ is $(H_1, \\ldots, H_r)$ vertex-Ramsey, or $(H_1, \\ldots, H_r)_v$-Ramsey, if whenever we colour the vertices of $G$ with colours from the set $[r]=\\{1,2, \\ldots, r\\}$ there exists $j \\in [r]$ such that some copy of $H_j$ in $G$ is monochromatic in colour $j$. Given any fixed collection of graphs $H_1, \\ldots, H_r$, Luczak, Ruci\\'{n}ski and Voigt and Kreuter determined in the 1990s the threshold edge probability $p$ at which the binomial random graph $G(n,p)$ becomes $(H_1, \\ldots, H_r)_v$-Ramsey. More recently, Das, Morris and Tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30548","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/2606.30548/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":"2606.30548","created_at":"2026-06-30T02:18:19.989689+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30548v1","created_at":"2026-06-30T02:18:19.989689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30548","created_at":"2026-06-30T02:18:19.989689+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI5P3XA6UB36","created_at":"2026-06-30T02:18:19.989689+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI5P3XA6UB367BWM","created_at":"2026-06-30T02:18:19.989689+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI5P3XA6","created_at":"2026-06-30T02:18:19.989689+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/MI5P3XA6UB367BWMDY3PEH5DGY","json":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY.json","graph_json":"https://pith.science/api/pith-number/MI5P3XA6UB367BWMDY3PEH5DGY/graph.json","events_json":"https://pith.science/api/pith-number/MI5P3XA6UB367BWMDY3PEH5DGY/events.json","paper":"https://pith.science/paper/MI5P3XA6"},"agent_actions":{"view_html":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY","download_json":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY.json","view_paper":"https://pith.science/paper/MI5P3XA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30548&json=true","fetch_graph":"https://pith.science/api/pith-number/MI5P3XA6UB367BWMDY3PEH5DGY/graph.json","fetch_events":"https://pith.science/api/pith-number/MI5P3XA6UB367BWMDY3PEH5DGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY/action/storage_attestation","attest_author":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY/action/author_attestation","sign_citation":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY/action/citation_signature","submit_replication":"https://pith.science/pith/MI5P3XA6UB367BWMDY3PEH5DGY/action/replication_record"}},"created_at":"2026-06-30T02:18:19.989689+00:00","updated_at":"2026-06-30T02:18:19.989689+00:00"}