{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JPNHDHN4UX5KSQ6IQRTFM3MBFW","short_pith_number":"pith:JPNHDHN4","schema_version":"1.0","canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","source":{"kind":"arxiv","id":"1601.01891","version":1},"attestation_state":"computed","paper":{"title":"Ramsey's Theorem for Pairs and $k$ Colors as a Sub-Classical Principle of Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Silvia Steila, Stefano Berardi","submitted_at":"2016-01-08T14:57:57Z","abstract_excerpt":"The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \\geq 2$, Ramsey's Theorem for pairs and recursive assignments of $k$ colors is equivalent to the Limited Lesser Principle of Omniscience for $\\Sigma^0_3$ formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinite $k$-ary tree there is some $i < k$ and some branch with infinitely many c"},"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":"1601.01891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-01-08T14:57:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"384e29b21ae334e2fc239155e7e840fc232625ef17fc25e05145ffc927771701","abstract_canon_sha256":"ca434b4b6147c286a05fb231393fb974bcb3691f7d91d4d06b57fc14083ca010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:11.144877Z","signature_b64":"hk+TLJybpPqQQOW239qkdraMmMkStnk70yoY+ewOiK5pyvWCiFvkRqJJASiCM3sYe3COV/DbvG5cbZkSCGMKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","last_reissued_at":"2026-05-18T01:23:11.144345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:11.144345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey's Theorem for Pairs and $k$ Colors as a Sub-Classical Principle of Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Silvia Steila, Stefano Berardi","submitted_at":"2016-01-08T14:57:57Z","abstract_excerpt":"The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \\geq 2$, Ramsey's Theorem for pairs and recursive assignments of $k$ colors is equivalent to the Limited Lesser Principle of Omniscience for $\\Sigma^0_3$ formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinite $k$-ary tree there is some $i < k$ and some branch with infinitely many c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01891","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":"1601.01891","created_at":"2026-05-18T01:23:11.144410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01891v1","created_at":"2026-05-18T01:23:11.144410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01891","created_at":"2026-05-18T01:23:11.144410+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPNHDHN4UX5K","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPNHDHN4UX5KSQ6I","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPNHDHN4","created_at":"2026-05-18T12:30:25.849896+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/JPNHDHN4UX5KSQ6IQRTFM3MBFW","json":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW.json","graph_json":"https://pith.science/api/pith-number/JPNHDHN4UX5KSQ6IQRTFM3MBFW/graph.json","events_json":"https://pith.science/api/pith-number/JPNHDHN4UX5KSQ6IQRTFM3MBFW/events.json","paper":"https://pith.science/paper/JPNHDHN4"},"agent_actions":{"view_html":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW","download_json":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW.json","view_paper":"https://pith.science/paper/JPNHDHN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01891&json=true","fetch_graph":"https://pith.science/api/pith-number/JPNHDHN4UX5KSQ6IQRTFM3MBFW/graph.json","fetch_events":"https://pith.science/api/pith-number/JPNHDHN4UX5KSQ6IQRTFM3MBFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/action/storage_attestation","attest_author":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/action/author_attestation","sign_citation":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/action/citation_signature","submit_replication":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/action/replication_record"}},"created_at":"2026-05-18T01:23:11.144410+00:00","updated_at":"2026-05-18T01:23:11.144410+00:00"}