{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPDEZU2PLO5AARKZQTZ4D7FZKR","short_pith_number":"pith:DPDEZU2P","schema_version":"1.0","canonical_sha256":"1bc64cd34f5bba00455984f3c1fcb9545a0f86de504075e29f6135f74df6662a","source":{"kind":"arxiv","id":"1807.02313","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.02313","created_at":"2026-05-18T00:11:22.426415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02313v1","created_at":"2026-05-18T00:11:22.426415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02313","created_at":"2026-05-18T00:11:22.426415+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPDEZU2PLO5A","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPDEZU2PLO5AARKZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPDEZU2P","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09185","citing_title":"The size Ramsey number of graphs with bounded treewidth","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR","json":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR.json","graph_json":"https://pith.science/api/pith-number/DPDEZU2PLO5AARKZQTZ4D7FZKR/graph.json","events_json":"https://pith.science/api/pith-number/DPDEZU2PLO5AARKZQTZ4D7FZKR/events.json","paper":"https://pith.science/paper/DPDEZU2P"},"agent_actions":{"view_html":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR","download_json":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR.json","view_paper":"https://pith.science/paper/DPDEZU2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02313&json=true","fetch_graph":"https://pith.science/api/pith-number/DPDEZU2PLO5AARKZQTZ4D7FZKR/graph.json","fetch_events":"https://pith.science/api/pith-number/DPDEZU2PLO5AARKZQTZ4D7FZKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/action/storage_attestation","attest_author":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/action/author_attestation","sign_citation":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/action/citation_signature","submit_replication":"https://pith.science/pith/DPDEZU2PLO5AARKZQTZ4D7FZKR/action/replication_record"}},"created_at":"2026-05-18T00:11:22.426415+00:00","updated_at":"2026-05-18T00:11:22.426415+00:00"}