{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3OIM4AW6QSVKNCZZDP5XHEN2ZF","short_pith_number":"pith:3OIM4AW6","canonical_record":{"source":{"id":"1408.1465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-07T02:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"a159681a6edd76761f5f7133236a515f9be8a41d39c153377448ce8566329ae6","abstract_canon_sha256":"0398af891dd661e08c9392b001425a6ec80fcc6856b78a04b0ae1dcb4ac3aa8d"},"schema_version":"1.0"},"canonical_sha256":"db90ce02de84aaa68b391bfb7391bac949758e5f0f47f605ead0f52ef6d54f76","source":{"kind":"arxiv","id":"1408.1465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1465","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1465v2","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1465","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"3OIM4AW6QSVK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3OIM4AW6QSVKNCZZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3OIM4AW6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3OIM4AW6QSVKNCZZDP5XHEN2ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-07T02:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"a159681a6edd76761f5f7133236a515f9be8a41d39c153377448ce8566329ae6","abstract_canon_sha256":"0398af891dd661e08c9392b001425a6ec80fcc6856b78a04b0ae1dcb4ac3aa8d"},"schema_version":"1.0"},"canonical_sha256":"db90ce02de84aaa68b391bfb7391bac949758e5f0f47f605ead0f52ef6d54f76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.243249Z","signature_b64":"mmyd+eaUGIKr5/GZ39dV4Pzq7NIJXlr9kLNgTImgXb1HTE2IRoUaLbKEmG1jzEmVGyG8kyMXyW5zmX9nB+KfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db90ce02de84aaa68b391bfb7391bac949758e5f0f47f605ead0f52ef6d54f76","last_reissued_at":"2026-05-18T00:50:02.242564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.242564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1465","source_version":2,"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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3r27sUBShXIaOw4ZT/XMaon0tYDO4nQY5CLEbsVHx0VLntNGrVadlvZ00IG7G6Zq2MMb5n0gO8l8903CdgaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:40:40.068366Z"},"content_sha256":"9ae58816aed651c611c63236aaeadf07e79c309eb86db039d6d228198f135c2d","schema_version":"1.0","event_id":"sha256:9ae58816aed651c611c63236aaeadf07e79c309eb86db039d6d228198f135c2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3OIM4AW6QSVKNCZZDP5XHEN2ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Definability Strength of Combinatorial Principles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Wei Wang","submitted_at":"2014-08-07T02:14:37Z","abstract_excerpt":"We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramsey's Theorem for colorings of pairs could help in simplifying the definitions of some $\\Delta^0_2$ sets, while some others could not. We also investigate some consequences of Ramsey's Theorem for colorings of longer tuples. These results of definability strength have some interesting consequences in reverse mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1465","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"},"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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfPtFbnFeqkStBEB/9MAlI/zkeze8HkI+KLdC4qkT6Z+mIwHWMZRbKOPBkTMsS+20n1xuHGQNgJSn2o7REqRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:40:40.069092Z"},"content_sha256":"9580c07db200b06577c624b338c2e8ceb28729cfa2e79e0658bd8448262b0434","schema_version":"1.0","event_id":"sha256:9580c07db200b06577c624b338c2e8ceb28729cfa2e79e0658bd8448262b0434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/bundle.json","state_url":"https://pith.science/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/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-06-08T20:40:40Z","links":{"resolver":"https://pith.science/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF","bundle":"https://pith.science/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/bundle.json","state":"https://pith.science/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OIM4AW6QSVKNCZZDP5XHEN2ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3OIM4AW6QSVKNCZZDP5XHEN2ZF","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":"0398af891dd661e08c9392b001425a6ec80fcc6856b78a04b0ae1dcb4ac3aa8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-07T02:14:37Z","title_canon_sha256":"a159681a6edd76761f5f7133236a515f9be8a41d39c153377448ce8566329ae6"},"schema_version":"1.0","source":{"id":"1408.1465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1465","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1465v2","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1465","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"3OIM4AW6QSVK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3OIM4AW6QSVKNCZZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3OIM4AW6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:9580c07db200b06577c624b338c2e8ceb28729cfa2e79e0658bd8448262b0434","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramsey's Theorem for colorings of pairs could help in simplifying the definitions of some $\\Delta^0_2$ sets, while some others could not. We also investigate some consequences of Ramsey's Theorem for colorings of longer tuples. These results of definability strength have some interesting consequences in reverse mat","authors_text":"Wei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-07T02:14:37Z","title":"The Definability Strength of Combinatorial Principles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1465","kind":"arxiv","version":2},"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:9ae58816aed651c611c63236aaeadf07e79c309eb86db039d6d228198f135c2d","target":"record","created_at":"2026-05-18T00:50:02Z","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":"0398af891dd661e08c9392b001425a6ec80fcc6856b78a04b0ae1dcb4ac3aa8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-07T02:14:37Z","title_canon_sha256":"a159681a6edd76761f5f7133236a515f9be8a41d39c153377448ce8566329ae6"},"schema_version":"1.0","source":{"id":"1408.1465","kind":"arxiv","version":2}},"canonical_sha256":"db90ce02de84aaa68b391bfb7391bac949758e5f0f47f605ead0f52ef6d54f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db90ce02de84aaa68b391bfb7391bac949758e5f0f47f605ead0f52ef6d54f76","first_computed_at":"2026-05-18T00:50:02.242564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.242564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmyd+eaUGIKr5/GZ39dV4Pzq7NIJXlr9kLNgTImgXb1HTE2IRoUaLbKEmG1jzEmVGyG8kyMXyW5zmX9nB+KfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.243249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae58816aed651c611c63236aaeadf07e79c309eb86db039d6d228198f135c2d","sha256:9580c07db200b06577c624b338c2e8ceb28729cfa2e79e0658bd8448262b0434"],"state_sha256":"e4093d001cab0e2f9ecad80c30ade66d136ed106b99076f13a42f209807d0fa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SS8Xo2qfLUs3CNUTayKU+Zyine9if4L08qRC1QJ3TzAZzYhqkgmim0WzjiroJbktynMTQQy3cpISXxOr4VqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:40:40.073012Z","bundle_sha256":"c329a35eab9d0b5177f00a5e9d15154894356a41cd6103512c645268e3f02872"}}