{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WGLAVJSTFLTMKN2N4Q73BUQOAL","short_pith_number":"pith:WGLAVJST","schema_version":"1.0","canonical_sha256":"b1960aa6532ae6c5374de43fb0d20e02c2b706e458094d0e03e7acf4a4bc0f82","source":{"kind":"arxiv","id":"1804.09809","version":3},"attestation_state":"computed","paper":{"title":"The reverse mathematics of Hindman's theorem for sums of exactly two elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Barbara F. Csima, Carl G. Jockusch, Damir D. Dzhafarov, Denis R. Hirschfeldt, Jr., Linda Brown Westrick, Reed Solomon","submitted_at":"2018-04-25T21:40:25Z","abstract_excerpt":"Hindman's Theorem (HT) states that for every coloring of $\\mathbb N$ with finitely many colors, there is an infinite set $H \\subseteq \\mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation of restricted versions of HT from the computability-theoretic and reverse-mathematical perspectives has been a productive line of research recently. In particular, HT$^{\\leqslant n}_k$ is the restriction of HT to sums of at most $n$ many elements, with at most $k$ colors allowed, and HT$^{=n}_k$ is the restriction of HT to sums of \\emph{exactly} $n$ many ele"},"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":"1804.09809","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-04-25T21:40:25Z","cross_cats_sorted":[],"title_canon_sha256":"f267d769e3ab0b89fcabfc6cfd72f0e8b97333aeb982fbcdd892d9ac2ccbd4cd","abstract_canon_sha256":"25dd9d39d3240d65877e824044eb156cedbbf8714111fc6af4f2fc73e725a633"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:44.018599Z","signature_b64":"WOcpssIrR7OrFR5rIlbkSc14TLtEW1cutGdVLOvKs2fXX6m30ntyJY8LltBJX7MfBRmeP/M0SWIOw/EeWTycCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1960aa6532ae6c5374de43fb0d20e02c2b706e458094d0e03e7acf4a4bc0f82","last_reissued_at":"2026-05-18T00:14:44.018212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:44.018212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The reverse mathematics of Hindman's theorem for sums of exactly two elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Barbara F. Csima, Carl G. Jockusch, Damir D. Dzhafarov, Denis R. Hirschfeldt, Jr., Linda Brown Westrick, Reed Solomon","submitted_at":"2018-04-25T21:40:25Z","abstract_excerpt":"Hindman's Theorem (HT) states that for every coloring of $\\mathbb N$ with finitely many colors, there is an infinite set $H \\subseteq \\mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation of restricted versions of HT from the computability-theoretic and reverse-mathematical perspectives has been a productive line of research recently. In particular, HT$^{\\leqslant n}_k$ is the restriction of HT to sums of at most $n$ many elements, with at most $k$ colors allowed, and HT$^{=n}_k$ is the restriction of HT to sums of \\emph{exactly} $n$ many ele"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09809","kind":"arxiv","version":3},"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":"1804.09809","created_at":"2026-05-18T00:14:44.018267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09809v3","created_at":"2026-05-18T00:14:44.018267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09809","created_at":"2026-05-18T00:14:44.018267+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGLAVJSTFLTM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGLAVJSTFLTMKN2N","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGLAVJST","created_at":"2026-05-18T12:32:59.047623+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/WGLAVJSTFLTMKN2N4Q73BUQOAL","json":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL.json","graph_json":"https://pith.science/api/pith-number/WGLAVJSTFLTMKN2N4Q73BUQOAL/graph.json","events_json":"https://pith.science/api/pith-number/WGLAVJSTFLTMKN2N4Q73BUQOAL/events.json","paper":"https://pith.science/paper/WGLAVJST"},"agent_actions":{"view_html":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL","download_json":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL.json","view_paper":"https://pith.science/paper/WGLAVJST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09809&json=true","fetch_graph":"https://pith.science/api/pith-number/WGLAVJSTFLTMKN2N4Q73BUQOAL/graph.json","fetch_events":"https://pith.science/api/pith-number/WGLAVJSTFLTMKN2N4Q73BUQOAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL/action/storage_attestation","attest_author":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL/action/author_attestation","sign_citation":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL/action/citation_signature","submit_replication":"https://pith.science/pith/WGLAVJSTFLTMKN2N4Q73BUQOAL/action/replication_record"}},"created_at":"2026-05-18T00:14:44.018267+00:00","updated_at":"2026-05-18T00:14:44.018267+00:00"}