{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DPDEZU2PLO5AARKZQTZ4D7FZKR","short_pith_number":"pith:DPDEZU2P","canonical_record":{"source":{"id":"1807.02313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T08:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"9f51276f9034e7644225a09075e293c5630f8dabd3ccc02e9c4a887b93ee0611","abstract_canon_sha256":"4e7e3c451662e64bdb7740f3b4138e0c616e554d056f665775e21f6f4c3c65f9"},"schema_version":"1.0"},"canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","source":{"kind":"arxiv","id":"1807.02313","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02313","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02313v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02313","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"DPDEZU2PLO5A","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPDEZU2PLO5AARKZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPDEZU2P","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DPDEZU2PLO5AARKZQTZ4D7FZKR","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T08:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"9f51276f9034e7644225a09075e293c5630f8dabd3ccc02e9c4a887b93ee0611","abstract_canon_sha256":"4e7e3c451662e64bdb7740f3b4138e0c616e554d056f665775e21f6f4c3c65f9"},"schema_version":"1.0"},"canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.426869Z","signature_b64":"K+ST9SQAvf0B5cyHX7G5sCj2S87PMtUiSwXajpVZKEqC6NztCcOEaysdjXZ3QyJcGg1EDTmv+ylU/z+T9gbWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","last_reissued_at":"2026-05-18T00:11:22.426310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.426310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02313","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zluo3EZq+0OjAZXgyiVyT2PVnsLhyLAy1yFLtv2Z2cK+o4ez2ETKpQYmkXRzt1x+qCLFlkC5cBcvOlEgiJ6BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:28:32.735678Z"},"content_sha256":"9061d9bbd18c181bfc9d3a66d0d6f1de410730a4332e569201b9eac8deb05346","schema_version":"1.0","event_id":"sha256:9061d9bbd18c181bfc9d3a66d0d6f1de410730a4332e569201b9eac8deb05346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DPDEZU2PLO5AARKZQTZ4D7FZKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey goodness of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov","submitted_at":"2018-07-06T08:41:24Z","abstract_excerpt":"Given a pair of graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest $N$ such that every red-blue coloring of the edges of the complete graph $K_N$ contains a red copy of $G$ or a blue copy of $H$. If a graph $G$ is connected, it is well known and easy to show that $R(G,H) \\geq (|G|-1)(\\chi(H)-1)+\\sigma(H)$, where $\\chi(H)$ is the chromatic number of $H$ and $\\sigma(H)$ is the size of the smallest color class in a $\\chi(H)$-coloring of $H$. A graph $G$ is called $H$-good if $R(G,H)= (|G|-1)(\\chi(H)-1)+\\sigma(H)$. The notion of Ramsey goodness was introduced by Burr and Erd\\H{o}s in 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02313","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:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQ1IDWrwNW8Si2eA3HpWiFC8SqidpD52qFSSBE8YaTkxHRVZTZJpHZCXUrb+frj1MJ/CPUoHp+ucgCQMVBeWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:28:32.736288Z"},"content_sha256":"68e3632fa70aa289ea66b2fcd183b2c79c4abe488093c033d74d35e10026970a","schema_version":"1.0","event_id":"sha256:68e3632fa70aa289ea66b2fcd183b2c79c4abe488093c033d74d35e10026970a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/bundle.json","state_url":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/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-05-31T10:28:32Z","links":{"resolver":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR","bundle":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/bundle.json","state":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DPDEZU2PLO5AARKZQTZ4D7FZKR","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":"4e7e3c451662e64bdb7740f3b4138e0c616e554d056f665775e21f6f4c3c65f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T08:41:24Z","title_canon_sha256":"9f51276f9034e7644225a09075e293c5630f8dabd3ccc02e9c4a887b93ee0611"},"schema_version":"1.0","source":{"id":"1807.02313","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02313","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02313v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02313","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"DPDEZU2PLO5A","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPDEZU2PLO5AARKZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPDEZU2P","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:68e3632fa70aa289ea66b2fcd183b2c79c4abe488093c033d74d35e10026970a","target":"graph","created_at":"2026-05-18T00:11:22Z","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":"Given a pair of graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest $N$ such that every red-blue coloring of the edges of the complete graph $K_N$ contains a red copy of $G$ or a blue copy of $H$. If a graph $G$ is connected, it is well known and easy to show that $R(G,H) \\geq (|G|-1)(\\chi(H)-1)+\\sigma(H)$, where $\\chi(H)$ is the chromatic number of $H$ and $\\sigma(H)$ is the size of the smallest color class in a $\\chi(H)$-coloring of $H$. A graph $G$ is called $H$-good if $R(G,H)= (|G|-1)(\\chi(H)-1)+\\sigma(H)$. The notion of Ramsey goodness was introduced by Burr and Erd\\H{o}s in 1","authors_text":"Alexey Pokrovskiy, Benny Sudakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T08:41:24Z","title":"Ramsey goodness of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02313","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:9061d9bbd18c181bfc9d3a66d0d6f1de410730a4332e569201b9eac8deb05346","target":"record","created_at":"2026-05-18T00:11:22Z","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":"4e7e3c451662e64bdb7740f3b4138e0c616e554d056f665775e21f6f4c3c65f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T08:41:24Z","title_canon_sha256":"9f51276f9034e7644225a09075e293c5630f8dabd3ccc02e9c4a887b93ee0611"},"schema_version":"1.0","source":{"id":"1807.02313","kind":"arxiv","version":1}},"canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","first_computed_at":"2026-05-18T00:11:22.426310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:22.426310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K+ST9SQAvf0B5cyHX7G5sCj2S87PMtUiSwXajpVZKEqC6NztCcOEaysdjXZ3QyJcGg1EDTmv+ylU/z+T9gbWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:22.426869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02313","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9061d9bbd18c181bfc9d3a66d0d6f1de410730a4332e569201b9eac8deb05346","sha256:68e3632fa70aa289ea66b2fcd183b2c79c4abe488093c033d74d35e10026970a"],"state_sha256":"825583c55d72a8bea00380eb0f63b895f48462ba6bf1a82f4968d2039865f8fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMmhhV3Vq1Hx5/Wr9OWW9B75NIzHd82AIfgSNN0idVsZts+hbxy7fzJ83m2pcb5w6stVAH5+hRPWjIaHVkSEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:28:32.742590Z","bundle_sha256":"be0e1c6543ad6713437447da56dfde0051169d43caba1ac64d66819fe27dd58e"}}