{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VM6YVUPLLPK2MNBVVK4BQ6WEB4","short_pith_number":"pith:VM6YVUPL","canonical_record":{"source":{"id":"1801.04128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T10:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"b3af4a41459e9356e339db23289051a05908cc6007bd034d7ad9b02174865cdf","abstract_canon_sha256":"95fc10eee0bfb2974533aabb3d0356c293cf35984ead511680982984150ed870"},"schema_version":"1.0"},"canonical_sha256":"ab3d8ad1eb5bd5a63435aab8187ac40f28f8a76468802f60573e6a49d27a83fa","source":{"kind":"arxiv","id":"1801.04128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04128","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04128v1","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04128","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"VM6YVUPLLPK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VM6YVUPLLPK2MNBV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VM6YVUPL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VM6YVUPLLPK2MNBVVK4BQ6WEB4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T10:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"b3af4a41459e9356e339db23289051a05908cc6007bd034d7ad9b02174865cdf","abstract_canon_sha256":"95fc10eee0bfb2974533aabb3d0356c293cf35984ead511680982984150ed870"},"schema_version":"1.0"},"canonical_sha256":"ab3d8ad1eb5bd5a63435aab8187ac40f28f8a76468802f60573e6a49d27a83fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:11.785687Z","signature_b64":"LJyLvpFNGYLRZYVrUEYQ/HdMW7vg19Au/EktwvpblkJT/M43lFjP9aPjpHI+fAjEK9B77STcerLcQCJK2i94Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab3d8ad1eb5bd5a63435aab8187ac40f28f8a76468802f60573e6a49d27a83fa","last_reissued_at":"2026-05-18T00:26:11.785068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:11.785068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04128","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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLZPzmJXIR9bnaA+Vj8Cc+L1vu/rU5mA82Z87HjBsRpS5rpyWRCLKZIOc7RLMJ5RP09PxbG7EAEOjRodmp3jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:30.136728Z"},"content_sha256":"24edf457c417763eb8a2220c148df41f718613065868f2e43b09337c29b8d851","schema_version":"1.0","event_id":"sha256:24edf457c417763eb8a2220c148df41f718613065868f2e43b09337c29b8d851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VM6YVUPLLPK2MNBVVK4BQ6WEB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds on the multicolor Ramsey numbers of paths and even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charlotte Knierim, Pascal Su","submitted_at":"2018-01-12T10:42:43Z","abstract_excerpt":"We study the multicolor Ramsey numbers for paths and even cycles, $R_k(P_n)$ and $R_k(C_n)$, which are the smallest integers $N$ such that every coloring of the complete graph $K_N$ has a monochromatic copy of $P_n$ or $C_n$ respectively. For a long time, $R_k(P_n)$ has only been known to lie between $(k-1+o(1))n$ and $(k + o(1))n$. A recent breakthrough by S\\'ark\\\"ozy and later improvement by Davies, Jenssen and Roberts give an upper bound of $(k - \\frac{1}{4} + o(1))n$. We improve the upper bound to $(k - \\frac{1}{2}+ o(1))n$. Our approach uses structural insights in connected graphs without"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04128","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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5i2pEco2pOcnKmTIT5aFZ13wV9oAUyFoTMVnpva60ktAYpJSvWrIyAFUVgFhyOx8DT+uBPd3+wvEPb8LEINBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:30.137073Z"},"content_sha256":"d090a73617d88a5e7a9d16f8569c9ace7e69306c6f19e40a6bd18b97b7f09005","schema_version":"1.0","event_id":"sha256:d090a73617d88a5e7a9d16f8569c9ace7e69306c6f19e40a6bd18b97b7f09005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/bundle.json","state_url":"https://pith.science/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/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-25T18:55:30Z","links":{"resolver":"https://pith.science/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4","bundle":"https://pith.science/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/bundle.json","state":"https://pith.science/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VM6YVUPLLPK2MNBVVK4BQ6WEB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VM6YVUPLLPK2MNBVVK4BQ6WEB4","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":"95fc10eee0bfb2974533aabb3d0356c293cf35984ead511680982984150ed870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T10:42:43Z","title_canon_sha256":"b3af4a41459e9356e339db23289051a05908cc6007bd034d7ad9b02174865cdf"},"schema_version":"1.0","source":{"id":"1801.04128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04128","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04128v1","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04128","created_at":"2026-05-18T00:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"VM6YVUPLLPK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VM6YVUPLLPK2MNBV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VM6YVUPL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:d090a73617d88a5e7a9d16f8569c9ace7e69306c6f19e40a6bd18b97b7f09005","target":"graph","created_at":"2026-05-18T00:26:11Z","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":"We study the multicolor Ramsey numbers for paths and even cycles, $R_k(P_n)$ and $R_k(C_n)$, which are the smallest integers $N$ such that every coloring of the complete graph $K_N$ has a monochromatic copy of $P_n$ or $C_n$ respectively. For a long time, $R_k(P_n)$ has only been known to lie between $(k-1+o(1))n$ and $(k + o(1))n$. A recent breakthrough by S\\'ark\\\"ozy and later improvement by Davies, Jenssen and Roberts give an upper bound of $(k - \\frac{1}{4} + o(1))n$. We improve the upper bound to $(k - \\frac{1}{2}+ o(1))n$. Our approach uses structural insights in connected graphs without","authors_text":"Charlotte Knierim, Pascal Su","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T10:42:43Z","title":"Improved bounds on the multicolor Ramsey numbers of paths and even cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04128","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:24edf457c417763eb8a2220c148df41f718613065868f2e43b09337c29b8d851","target":"record","created_at":"2026-05-18T00:26:11Z","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":"95fc10eee0bfb2974533aabb3d0356c293cf35984ead511680982984150ed870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T10:42:43Z","title_canon_sha256":"b3af4a41459e9356e339db23289051a05908cc6007bd034d7ad9b02174865cdf"},"schema_version":"1.0","source":{"id":"1801.04128","kind":"arxiv","version":1}},"canonical_sha256":"ab3d8ad1eb5bd5a63435aab8187ac40f28f8a76468802f60573e6a49d27a83fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab3d8ad1eb5bd5a63435aab8187ac40f28f8a76468802f60573e6a49d27a83fa","first_computed_at":"2026-05-18T00:26:11.785068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:11.785068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LJyLvpFNGYLRZYVrUEYQ/HdMW7vg19Au/EktwvpblkJT/M43lFjP9aPjpHI+fAjEK9B77STcerLcQCJK2i94Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:11.785687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24edf457c417763eb8a2220c148df41f718613065868f2e43b09337c29b8d851","sha256:d090a73617d88a5e7a9d16f8569c9ace7e69306c6f19e40a6bd18b97b7f09005"],"state_sha256":"ff8db725d31e6c3a5e38a587121402f695f50e93e68882edf5dd4e80a6c2d9bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf7BzBA9XKpJw83+HdvzHSU4F3av4vhcwWdh4Z5cqf4q1mKyZPI2eFmMjGUtV4mAkgDNsHSamezvRrbyw2ufCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:55:30.139075Z","bundle_sha256":"72394e462b43b4d2aead11a2dbf715376407ce043fc182063840da23d3cb0255"}}