{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U4QGJRMZTX7UBG64CSDDJ43YHR","short_pith_number":"pith:U4QGJRMZ","schema_version":"1.0","canonical_sha256":"a72064c5999dff409bdc148634f3783c44f0b688f9185f12964e3088f7d57186","source":{"kind":"arxiv","id":"1202.2582","version":2},"attestation_state":"computed","paper":{"title":"An additive version of Ramsey's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andy Parrish","submitted_at":"2012-02-12T22:54:58Z","abstract_excerpt":"We show that, for every $r, k$, there is an $n = n(r,k)$ so that any $r$-coloring of the edges of the complete graph on $[n]$ will yield a monochromatic complete subgraph on vertices ${a + \\sum_{i \\in I} d_i \\mid I \\subseteq [k]}$ for some choice of $a, d_1,..., d_k$. In particular, there is always a solution to $x_1 + ... + x_\\ell = y_1 + ... + y_\\ell$ whose induced subgraph is monochromatic."},"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":"1202.2582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-12T22:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"b8ffd1ca3f64946b6aa4c7dfd1c5284e2d8908b71452a75386104e1032fa40ff","abstract_canon_sha256":"d133a03005eb3845c89f8c0934033d09dc95dcf2d0814bcd9812b17ceb83ecdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.810975Z","signature_b64":"IhtULcaYnPMMbW1DCWBUmt+EaI32f0hGp1+juSudXS6TN8MjSasGX8BCxvgnB7Gr0fzTIq/YCCiGUJjhCxQNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72064c5999dff409bdc148634f3783c44f0b688f9185f12964e3088f7d57186","last_reissued_at":"2026-05-18T04:01:12.810365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.810365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An additive version of Ramsey's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andy Parrish","submitted_at":"2012-02-12T22:54:58Z","abstract_excerpt":"We show that, for every $r, k$, there is an $n = n(r,k)$ so that any $r$-coloring of the edges of the complete graph on $[n]$ will yield a monochromatic complete subgraph on vertices ${a + \\sum_{i \\in I} d_i \\mid I \\subseteq [k]}$ for some choice of $a, d_1,..., d_k$. In particular, there is always a solution to $x_1 + ... + x_\\ell = y_1 + ... + y_\\ell$ whose induced subgraph is monochromatic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2582","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.2582","created_at":"2026-05-18T04:01:12.810442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2582v2","created_at":"2026-05-18T04:01:12.810442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2582","created_at":"2026-05-18T04:01:12.810442+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4QGJRMZTX7U","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4QGJRMZTX7UBG64","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4QGJRMZ","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR","json":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR.json","graph_json":"https://pith.science/api/pith-number/U4QGJRMZTX7UBG64CSDDJ43YHR/graph.json","events_json":"https://pith.science/api/pith-number/U4QGJRMZTX7UBG64CSDDJ43YHR/events.json","paper":"https://pith.science/paper/U4QGJRMZ"},"agent_actions":{"view_html":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR","download_json":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR.json","view_paper":"https://pith.science/paper/U4QGJRMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2582&json=true","fetch_graph":"https://pith.science/api/pith-number/U4QGJRMZTX7UBG64CSDDJ43YHR/graph.json","fetch_events":"https://pith.science/api/pith-number/U4QGJRMZTX7UBG64CSDDJ43YHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR/action/storage_attestation","attest_author":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR/action/author_attestation","sign_citation":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR/action/citation_signature","submit_replication":"https://pith.science/pith/U4QGJRMZTX7UBG64CSDDJ43YHR/action/replication_record"}},"created_at":"2026-05-18T04:01:12.810442+00:00","updated_at":"2026-05-18T04:01:12.810442+00:00"}