{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P7EQWRP45MA4M336KJWTBNQEFH","short_pith_number":"pith:P7EQWRP4","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"},"canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","source":{"kind":"arxiv","id":"1701.07348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07348","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07348v1","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07348","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"P7EQWRP45MA4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7EQWRP45MA4M336","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7EQWRP4","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P7EQWRP45MA4M336KJWTBNQEFH","target":"record","payload":{"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"},"canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","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"},"source_kind":"arxiv","source_id":"1701.07348","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgYKiMl0dth8TTWj6gvqJHIAKxPI5M5aMcCCdEUWSkKlHeyWuDiGOZ8RzwarL/aKBAgZFlEKs7fkUnSH2+6OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:01:07.407562Z"},"content_sha256":"90f5de21ea51a00f7656f382bb4da367f7f7744a992aeff2c0b03cd036c0e033","schema_version":"1.0","event_id":"sha256:90f5de21ea51a00f7656f382bb4da367f7f7744a992aeff2c0b03cd036c0e033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P7EQWRP45MA4M336KJWTBNQEFH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yU3Z01L7MkZ8ebNl+msvs0EHmwI55H37dg/Lt0SYo+R9PMvxfQ5H5B/HeqxzsDa6WmojHSoIeR9ygpss9E15Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:01:07.407908Z"},"content_sha256":"cd712d3b83e14ffb52143d8e8595bd976ec6659349b1836aee52fd7ec0105d42","schema_version":"1.0","event_id":"sha256:cd712d3b83e14ffb52143d8e8595bd976ec6659349b1836aee52fd7ec0105d42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/bundle.json","state_url":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7EQWRP45MA4M336KJWTBNQEFH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T08:01:07Z","links":{"resolver":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH","bundle":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/bundle.json","state":"https://pith.science/pith/P7EQWRP45MA4M336KJWTBNQEFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7EQWRP45MA4M336KJWTBNQEFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P7EQWRP45MA4M336KJWTBNQEFH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6cfe42e7e44d9b41afd207636849289310fe665ce85257e470b0c2cc54c1aa84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T15:13:15Z","title_canon_sha256":"2e40d27194d350db668ae342d683611b32bd5e5f6945d16fcbe875bd24279cba"},"schema_version":"1.0","source":{"id":"1701.07348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07348","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07348v1","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07348","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"P7EQWRP45MA4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7EQWRP45MA4M336","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7EQWRP4","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:cd712d3b83e14ffb52143d8e8595bd976ec6659349b1836aee52fd7ec0105d42","target":"graph","created_at":"2026-05-18T00:52:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexey Pokrovskiy, Farideh Khoeini, Gholam Reza Omidi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T15:13:15Z","title":"On the size-Ramsey number of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07348","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90f5de21ea51a00f7656f382bb4da367f7f7744a992aeff2c0b03cd036c0e033","target":"record","created_at":"2026-05-18T00:52:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6cfe42e7e44d9b41afd207636849289310fe665ce85257e470b0c2cc54c1aa84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T15:13:15Z","title_canon_sha256":"2e40d27194d350db668ae342d683611b32bd5e5f6945d16fcbe875bd24279cba"},"schema_version":"1.0","source":{"id":"1701.07348","kind":"arxiv","version":1}},"canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fc90b45fceb01c66f7e526d30b60429cb7be18ac31fac8bf0d8f6cfd921d23a","first_computed_at":"2026-05-18T00:52:04.799776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:04.799776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kJQyWg0d1GIlQiUJ5+1fEiZwnFpTh4kb553Y7fWa6ZS7iV8KpvKEXntrW8YpXkW/wC5bziEEn8L6FnXmH+VpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:04.800347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90f5de21ea51a00f7656f382bb4da367f7f7744a992aeff2c0b03cd036c0e033","sha256:cd712d3b83e14ffb52143d8e8595bd976ec6659349b1836aee52fd7ec0105d42"],"state_sha256":"a68ad5b741026635c4686a1df334806805064c51b77b1277d4b673d62781dc96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XklNLwX/SsQyhjXZ60miG6dy7I22wIDzweVwPZU6UBVidqqiX3+1Izy6fp0tU/YPb2XubI0M+JolYKNwIpUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:01:07.409904Z","bundle_sha256":"71512efd4bf102ffcb694f78c7bad47291d9c1f43ade0b766aebcad4af0c101c"}}