{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P7EQWRP45MA4M336KJWTBNQEFH","short_pith_number":"pith:P7EQWRP4","schema_version":"1.0","canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","source":{"kind":"arxiv","id":"1701.07348","version":1},"attestation_state":"computed","paper":{"title":"On the size-Ramsey number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Farideh Khoeini, Gholam Reza Omidi, Ramin Javadi","submitted_at":"2017-01-25T15:13:15Z","abstract_excerpt":"For given graphs $G_1,\\ldots,G_k$, the size-Ramsey number $\\hat{R}(G_1,\\ldots,G_k)$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $k$-edge coloring of $H$ with colors $1,\\ldots,k$, $ H $ contains a monochromatic copy of $G_i$ of color $i$ for some $1\\leq i\\leq k$. We denote $\\hat{R}(G_1,\\ldots,G_k)$ by $\\hat{R}_{k}(G)$ when $G_1=\\cdots=G_k=G$. Haxell, Kohayakawa and \\L{}uczak showed that the size Ramsey number of a cycle $C_n$ is linear in $n$ i.e. $\\hat{R}_{k}(C_{n})\\leq c_k n$ for some constant $c_k$. Their proof, is based on the regularity le"},"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":"1701.07348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T15:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"2e40d27194d350db668ae342d683611b32bd5e5f6945d16fcbe875bd24279cba","abstract_canon_sha256":"6cfe42e7e44d9b41afd207636849289310fe665ce85257e470b0c2cc54c1aa84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:04.800347Z","signature_b64":"kJQyWg0d1GIlQiUJ5+1fEiZwnFpTh4kb553Y7fWa6ZS7iV8KpvKEXntrW8YpXkW/wC5bziEEn8L6FnXmH+VpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","last_reissued_at":"2026-05-18T00:52:04.799776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:04.799776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the size-Ramsey number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Farideh Khoeini, Gholam Reza Omidi, Ramin Javadi","submitted_at":"2017-01-25T15:13:15Z","abstract_excerpt":"For given graphs $G_1,\\ldots,G_k$, the size-Ramsey number $\\hat{R}(G_1,\\ldots,G_k)$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $k$-edge coloring of $H$ with colors $1,\\ldots,k$, $ H $ contains a monochromatic copy of $G_i$ of color $i$ for some $1\\leq i\\leq k$. We denote $\\hat{R}(G_1,\\ldots,G_k)$ by $\\hat{R}_{k}(G)$ when $G_1=\\cdots=G_k=G$. Haxell, Kohayakawa and \\L{}uczak showed that the size Ramsey number of a cycle $C_n$ is linear in $n$ i.e. $\\hat{R}_{k}(C_{n})\\leq c_k n$ for some constant $c_k$. Their proof, is based on the regularity le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07348","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":""},"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":"1701.07348","created_at":"2026-05-18T00:52:04.799856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07348v1","created_at":"2026-05-18T00:52:04.799856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07348","created_at":"2026-05-18T00:52:04.799856+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7EQWRP45MA4","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7EQWRP45MA4M336","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7EQWRP4","created_at":"2026-05-18T12:31:37.085036+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/P7EQWRP45MA4M336KJWTBNQEFH","json":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH.json","graph_json":"https://pith.science/api/pith-number/P7EQWRP45MA4M336KJWTBNQEFH/graph.json","events_json":"https://pith.science/api/pith-number/P7EQWRP45MA4M336KJWTBNQEFH/events.json","paper":"https://pith.science/paper/P7EQWRP4"},"agent_actions":{"view_html":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH","download_json":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH.json","view_paper":"https://pith.science/paper/P7EQWRP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07348&json=true","fetch_graph":"https://pith.science/api/pith-number/P7EQWRP45MA4M336KJWTBNQEFH/graph.json","fetch_events":"https://pith.science/api/pith-number/P7EQWRP45MA4M336KJWTBNQEFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/action/storage_attestation","attest_author":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/action/author_attestation","sign_citation":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/action/citation_signature","submit_replication":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/action/replication_record"}},"created_at":"2026-05-18T00:52:04.799856+00:00","updated_at":"2026-05-18T00:52:04.799856+00:00"}