{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WWWJNFD6PNXC3C2JLS5KT5P4FJ","short_pith_number":"pith:WWWJNFD6","canonical_record":{"source":{"id":"1005.3926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-21T10:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"13ff71990b7c023d1fcbb3570e68e1cd4beca081b842ea32d26960be2077646a","abstract_canon_sha256":"fcd51296079f3282d26aa2778def4d77b1cee39a80e850c2f1d4721b6f7c344c"},"schema_version":"1.0"},"canonical_sha256":"b5ac96947e7b6e2d8b495cbaa9f5fc2a78acd762b1c55889297ceae4631f7cc0","source":{"kind":"arxiv","id":"1005.3926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.3926","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1005.3926v2","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.3926","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"WWWJNFD6PNXC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWWJNFD6PNXC3C2J","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWWJNFD6","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WWWJNFD6PNXC3C2JLS5KT5P4FJ","target":"record","payload":{"canonical_record":{"source":{"id":"1005.3926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-21T10:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"13ff71990b7c023d1fcbb3570e68e1cd4beca081b842ea32d26960be2077646a","abstract_canon_sha256":"fcd51296079f3282d26aa2778def4d77b1cee39a80e850c2f1d4721b6f7c344c"},"schema_version":"1.0"},"canonical_sha256":"b5ac96947e7b6e2d8b495cbaa9f5fc2a78acd762b1c55889297ceae4631f7cc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:54.622842Z","signature_b64":"7S2+v9/AzI9reN/FWfGjtcX4Ws+FUg13VCntuHQ+NI1lWVNrVXBBQ/s9llnyGaPUebroNV6yJ/n/hYihYB4iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ac96947e7b6e2d8b495cbaa9f5fc2a78acd762b1c55889297ceae4631f7cc0","last_reissued_at":"2026-05-18T04:41:54.622341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:54.622341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.3926","source_version":2,"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-18T04:41:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGgc4RzUsu0sJP8NdTdNR90D5QRkDVYEZ31/T89bg2wNnxk/t8p085lV8LoBmu6mHBSAE9r/BLDceORkt0psDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:19.640260Z"},"content_sha256":"be3b79c95d16e69487653b63941cf8d95b5e20d3bcb0be20516cec271873c77f","schema_version":"1.0","event_id":"sha256:be3b79c95d16e69487653b63941cf8d95b5e20d3bcb0be20516cec271873c77f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WWWJNFD6PNXC3C2JLS5KT5P4FJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Multi-coloured Ramsey Numbers of Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozef Skokan, Mikl\\'os Simonovits, Tomasz {\\L}uczak","submitted_at":"2010-05-21T10:28:52Z","abstract_excerpt":"For a graph $L$ and an integer $k\\geq 2$, $R_k(L)$ denotes the smallest integer $N$ for which for any edge-colouring of the complete graph $K_N$ by $k$ colours there exists a colour $i$ for which the corresponding colour class contains $L$ as a subgraph.\n  Bondy and Erd\\H{o}s conjectured that for an odd cycle $C_n$ on $n$ vertices, $$R_k(C_n) = 2^{k-1}(n-1)+1 \\text{for $n>3$.}$$ They proved the case when $k=2$ and also provided an upper bound $R_k(C_n)\\leq (k+2)!n$. Recently, this conjecture has been verified for $k=3$ if $n$ is large. In this note, we prove that for every integer $k\\geq 4$, $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.3926","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":""},"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-18T04:41:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qitPPscquB+NBlJAp6GnGC/tPVf4qR4GICrt9SZ97nY06ZNVz0+e1ngSH9nl6XvOhqq3uHUmHVtqEZkm2uddAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:24:19.640625Z"},"content_sha256":"2985a6510b319d4920de75b3de687addba1389bba288d5054ba91a0f7c6a6a50","schema_version":"1.0","event_id":"sha256:2985a6510b319d4920de75b3de687addba1389bba288d5054ba91a0f7c6a6a50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/bundle.json","state_url":"https://pith.science/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/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-01T08:24:19Z","links":{"resolver":"https://pith.science/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ","bundle":"https://pith.science/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/bundle.json","state":"https://pith.science/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWWJNFD6PNXC3C2JLS5KT5P4FJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WWWJNFD6PNXC3C2JLS5KT5P4FJ","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":"fcd51296079f3282d26aa2778def4d77b1cee39a80e850c2f1d4721b6f7c344c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-21T10:28:52Z","title_canon_sha256":"13ff71990b7c023d1fcbb3570e68e1cd4beca081b842ea32d26960be2077646a"},"schema_version":"1.0","source":{"id":"1005.3926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.3926","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1005.3926v2","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.3926","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"WWWJNFD6PNXC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWWJNFD6PNXC3C2J","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWWJNFD6","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:2985a6510b319d4920de75b3de687addba1389bba288d5054ba91a0f7c6a6a50","target":"graph","created_at":"2026-05-18T04:41:54Z","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 a graph $L$ and an integer $k\\geq 2$, $R_k(L)$ denotes the smallest integer $N$ for which for any edge-colouring of the complete graph $K_N$ by $k$ colours there exists a colour $i$ for which the corresponding colour class contains $L$ as a subgraph.\n  Bondy and Erd\\H{o}s conjectured that for an odd cycle $C_n$ on $n$ vertices, $$R_k(C_n) = 2^{k-1}(n-1)+1 \\text{for $n>3$.}$$ They proved the case when $k=2$ and also provided an upper bound $R_k(C_n)\\leq (k+2)!n$. Recently, this conjecture has been verified for $k=3$ if $n$ is large. In this note, we prove that for every integer $k\\geq 4$, $","authors_text":"Jozef Skokan, Mikl\\'os Simonovits, Tomasz {\\L}uczak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-21T10:28:52Z","title":"On the Multi-coloured Ramsey Numbers of Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.3926","kind":"arxiv","version":2},"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:be3b79c95d16e69487653b63941cf8d95b5e20d3bcb0be20516cec271873c77f","target":"record","created_at":"2026-05-18T04:41:54Z","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":"fcd51296079f3282d26aa2778def4d77b1cee39a80e850c2f1d4721b6f7c344c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-21T10:28:52Z","title_canon_sha256":"13ff71990b7c023d1fcbb3570e68e1cd4beca081b842ea32d26960be2077646a"},"schema_version":"1.0","source":{"id":"1005.3926","kind":"arxiv","version":2}},"canonical_sha256":"b5ac96947e7b6e2d8b495cbaa9f5fc2a78acd762b1c55889297ceae4631f7cc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5ac96947e7b6e2d8b495cbaa9f5fc2a78acd762b1c55889297ceae4631f7cc0","first_computed_at":"2026-05-18T04:41:54.622341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:54.622341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7S2+v9/AzI9reN/FWfGjtcX4Ws+FUg13VCntuHQ+NI1lWVNrVXBBQ/s9llnyGaPUebroNV6yJ/n/hYihYB4iDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:54.622842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.3926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be3b79c95d16e69487653b63941cf8d95b5e20d3bcb0be20516cec271873c77f","sha256:2985a6510b319d4920de75b3de687addba1389bba288d5054ba91a0f7c6a6a50"],"state_sha256":"03d23cbdfb2767ef55f9b47a114f4581dcea2167dcc2e9c6095863d18809bb02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmSklExPXTej1hcZucJl1CtrwAjQuMad7t/SjLQUpbxAhiW5Ws4dhrQqfgbJv+xV9dejEIWiAoiUVH/n6lDhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:24:19.642539Z","bundle_sha256":"0c8f7ee3f919b86d83a2768ab8ccc6eff61ab18c5f13422ac7ca9c3a58e18d89"}}