{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TNGZDWYB6LYZ3QLLD7MZKFXJP2","short_pith_number":"pith:TNGZDWYB","schema_version":"1.0","canonical_sha256":"9b4d91db01f2f19dc16b1fd99516e97e8d714fcc0f0c8cdaea82057a220cfce3","source":{"kind":"arxiv","id":"1501.07424","version":2},"attestation_state":"computed","paper":{"title":"Somewhere over the rainbow Ramsey theorem for pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Ludovic Patey","submitted_at":"2015-01-29T12:03:02Z","abstract_excerpt":"The rainbow Ramsey theorem states that every coloring of tuples where each color is used a bounded number of times has an infinite subdomain on which no color appears twice. The restriction of the statement to colorings over pairs (RRT22) admits several characterizations: it is equivalent to finding an infinite subset of a 2-random, to diagonalizing against Turing machines with the halting set as oracle... In this paper we study principles that are closely related to the rainbow Ramsey theorem, the Erd\\H{o}s Moser theorem and the thin set theorem within the framework of reverse mathematics. We"},"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":"1501.07424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-01-29T12:03:02Z","cross_cats_sorted":[],"title_canon_sha256":"1e700bef276a2b69aa1b129f49c0e839845b7d87375f2611d96df4f5cf2151f9","abstract_canon_sha256":"f16a47517ac2fb00ac3770a2de0011600a671dcf0a2206a10e2843ad63ce82d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:20.145391Z","signature_b64":"mpRq4v1J7IzvdiQ8HrPtMnUzlmXsHCkFXWfbRwBdZd1dFIHMUW1sgU9LyzEfrIrIL/pqFuhem9Pqi+cXobJUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4d91db01f2f19dc16b1fd99516e97e8d714fcc0f0c8cdaea82057a220cfce3","last_reissued_at":"2026-05-18T02:28:20.144769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:20.144769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Somewhere over the rainbow Ramsey theorem for pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Ludovic Patey","submitted_at":"2015-01-29T12:03:02Z","abstract_excerpt":"The rainbow Ramsey theorem states that every coloring of tuples where each color is used a bounded number of times has an infinite subdomain on which no color appears twice. The restriction of the statement to colorings over pairs (RRT22) admits several characterizations: it is equivalent to finding an infinite subset of a 2-random, to diagonalizing against Turing machines with the halting set as oracle... In this paper we study principles that are closely related to the rainbow Ramsey theorem, the Erd\\H{o}s Moser theorem and the thin set theorem within the framework of reverse mathematics. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07424","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":"1501.07424","created_at":"2026-05-18T02:28:20.144879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07424v2","created_at":"2026-05-18T02:28:20.144879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07424","created_at":"2026-05-18T02:28:20.144879+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNGZDWYB6LYZ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNGZDWYB6LYZ3QLL","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNGZDWYB","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11598","citing_title":"Ramsey-like theorems for the Schreier barrier","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2","json":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2.json","graph_json":"https://pith.science/api/pith-number/TNGZDWYB6LYZ3QLLD7MZKFXJP2/graph.json","events_json":"https://pith.science/api/pith-number/TNGZDWYB6LYZ3QLLD7MZKFXJP2/events.json","paper":"https://pith.science/paper/TNGZDWYB"},"agent_actions":{"view_html":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2","download_json":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2.json","view_paper":"https://pith.science/paper/TNGZDWYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07424&json=true","fetch_graph":"https://pith.science/api/pith-number/TNGZDWYB6LYZ3QLLD7MZKFXJP2/graph.json","fetch_events":"https://pith.science/api/pith-number/TNGZDWYB6LYZ3QLLD7MZKFXJP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2/action/storage_attestation","attest_author":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2/action/author_attestation","sign_citation":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2/action/citation_signature","submit_replication":"https://pith.science/pith/TNGZDWYB6LYZ3QLLD7MZKFXJP2/action/replication_record"}},"created_at":"2026-05-18T02:28:20.144879+00:00","updated_at":"2026-05-18T02:28:20.144879+00:00"}