{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JPNHDHN4UX5KSQ6IQRTFM3MBFW","short_pith_number":"pith:JPNHDHN4","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"},"canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","source":{"kind":"arxiv","id":"1601.01891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01891","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01891v1","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01891","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"JPNHDHN4UX5K","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JPNHDHN4UX5KSQ6I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JPNHDHN4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JPNHDHN4UX5KSQ6IQRTFM3MBFW","target":"record","payload":{"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"},"canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","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"},"source_kind":"arxiv","source_id":"1601.01891","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OLCZ0+diHKryg4rB+GAk4jzkxaLOsAroy++PUZ8HY/zdgLLaexwLDsfMfrOkp1gh2XGSO88vYJsa35PSDSxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:53.137918Z"},"content_sha256":"e36cd9e7f7a7402659cd6d03730cf961aa269c7183497a0a0fabf8364b915d37","schema_version":"1.0","event_id":"sha256:e36cd9e7f7a7402659cd6d03730cf961aa269c7183497a0a0fabf8364b915d37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JPNHDHN4UX5KSQ6IQRTFM3MBFW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Va+ENe6+h7q+nnfsgOLGQqwAsHwpKt3P8j/q043gxEU8iMwx20vQfcdlXx9KOeFOQ5uOndRGx3K6THyQ56VlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:53.138391Z"},"content_sha256":"7d0c3fd9b33eac8e882945e15bad9fc7b155068283c7f488b485be4f6dbb3408","schema_version":"1.0","event_id":"sha256:7d0c3fd9b33eac8e882945e15bad9fc7b155068283c7f488b485be4f6dbb3408"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/bundle.json","state_url":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:30:53Z","links":{"resolver":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW","bundle":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/bundle.json","state":"https://pith.science/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPNHDHN4UX5KSQ6IQRTFM3MBFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JPNHDHN4UX5KSQ6IQRTFM3MBFW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca434b4b6147c286a05fb231393fb974bcb3691f7d91d4d06b57fc14083ca010","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-01-08T14:57:57Z","title_canon_sha256":"384e29b21ae334e2fc239155e7e840fc232625ef17fc25e05145ffc927771701"},"schema_version":"1.0","source":{"id":"1601.01891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01891","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01891v1","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01891","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"JPNHDHN4UX5K","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JPNHDHN4UX5KSQ6I","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JPNHDHN4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:7d0c3fd9b33eac8e882945e15bad9fc7b155068283c7f488b485be4f6dbb3408","target":"graph","created_at":"2026-05-18T01:23:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Silvia Steila, Stefano Berardi","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-01-08T14:57:57Z","title":"Ramsey's Theorem for Pairs and $k$ Colors as a Sub-Classical Principle of Arithmetic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01891","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e36cd9e7f7a7402659cd6d03730cf961aa269c7183497a0a0fabf8364b915d37","target":"record","created_at":"2026-05-18T01:23:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca434b4b6147c286a05fb231393fb974bcb3691f7d91d4d06b57fc14083ca010","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-01-08T14:57:57Z","title_canon_sha256":"384e29b21ae334e2fc239155e7e840fc232625ef17fc25e05145ffc927771701"},"schema_version":"1.0","source":{"id":"1601.01891","kind":"arxiv","version":1}},"canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bda719dbca5faa943c88466566d812d884b2ffb6516cd6800afa94b39e2872b","first_computed_at":"2026-05-18T01:23:11.144345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:11.144345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hk+TLJybpPqQQOW239qkdraMmMkStnk70yoY+ewOiK5pyvWCiFvkRqJJASiCM3sYe3COV/DbvG5cbZkSCGMKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:11.144877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e36cd9e7f7a7402659cd6d03730cf961aa269c7183497a0a0fabf8364b915d37","sha256:7d0c3fd9b33eac8e882945e15bad9fc7b155068283c7f488b485be4f6dbb3408"],"state_sha256":"85d40a7e6b0a8c1cda5c746eeeb759ee3576a27017475d901b633e0d8b56896f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKKdaWHrJMhzqskES3E2AL94w9kz+nJjaThFUPF5HlNfNHLgs5ECpgshrb7kFN2ZKkPvF+5KKxkcEqcOanbRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:30:53.141625Z","bundle_sha256":"cf7a14ffcc7c03e735130be81f820639264410f773420a0c338913a5fcd05b1d"}}