{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5V2PALNSNRWR4XULVZWP26J3S6","short_pith_number":"pith:5V2PALNS","canonical_record":{"source":{"id":"1502.02545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-02-09T16:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"dfbb6e316935820c71af2a2e8ca5c065188556f1edae1f19f62a6ee9d84c0aa0","abstract_canon_sha256":"f8a3fc1be13944cbe29aa0a08f918806e15acb95f03740fe950dbd065659073a"},"schema_version":"1.0"},"canonical_sha256":"ed74f02db26c6d1e5e8bae6cfd793b97bc9e5a7af57e4740162340e11e63925a","source":{"kind":"arxiv","id":"1502.02545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02545","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02545v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02545","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"5V2PALNSNRWR","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5V2PALNSNRWR4XUL","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5V2PALNS","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5V2PALNSNRWR4XULVZWP26J3S6","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-02-09T16:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"dfbb6e316935820c71af2a2e8ca5c065188556f1edae1f19f62a6ee9d84c0aa0","abstract_canon_sha256":"f8a3fc1be13944cbe29aa0a08f918806e15acb95f03740fe950dbd065659073a"},"schema_version":"1.0"},"canonical_sha256":"ed74f02db26c6d1e5e8bae6cfd793b97bc9e5a7af57e4740162340e11e63925a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:41.950685Z","signature_b64":"ORypcWvYFn+Sd/kLYy4oD3seLmejGpJD+E5XCnfAQ/SpBRQJeCpMxYuOGgS/l3JiUw6uwo/IMTnRSG0oQHdHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed74f02db26c6d1e5e8bae6cfd793b97bc9e5a7af57e4740162340e11e63925a","last_reissued_at":"2026-05-18T02:27:41.949855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:41.949855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02545","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-18T02:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urluRiK6Uy/8zYld7wnmd3Ua2mUdy2RXPRTtjh3OTAXCSucbBcKd8NLQwWp3Ldtg43GaGX5maT6/e+EmoEwSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:20:57.564815Z"},"content_sha256":"4d4cec41b3b155682ee23eedde365faa47602b81dfd0080ba31b313277de6147","schema_version":"1.0","event_id":"sha256:4d4cec41b3b155682ee23eedde365faa47602b81dfd0080ba31b313277de6147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5V2PALNSNRWR4XULVZWP26J3S6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Always Decidable Propositional Forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2015-02-09T16:25:56Z","abstract_excerpt":"We ask the following question: If all instantiations of a propositional formula $A(x_1,...,x_n)$ in $n$ propositional variables are decidable in some sufficiently strong recursive theory, does it follow that $A$ is tautological or contradictory? and answer it in the affirmative. We also consider the following related question: Suppose that for some propositional formula $A(x_1,...,x_n)$, there is a Turing program $P$ such that $P([\\phi_{1}],...,[\\phi_{n}])\\downarrow=1$ iff $\\mathbb{N}\\models A(\\phi_{1},...,\\phi_{n})$ and otherwise $P([\\phi_{1}],...,[\\phi_{n}])\\downarrow=0$ (where $[\\phi]$ deno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02545","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-18T02:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdCccuo4GJNWUvAMc+RGnjnft9/Daq7xp6SUg9JHPTZSHG29eRPm/e36w85gUi02rC3r1/AzWx+wEciOvqCfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:20:57.565164Z"},"content_sha256":"5096f5ce76d2af8b76796ba05f7ba435d4544631b7e9fc07c5ea6f0792f49086","schema_version":"1.0","event_id":"sha256:5096f5ce76d2af8b76796ba05f7ba435d4544631b7e9fc07c5ea6f0792f49086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5V2PALNSNRWR4XULVZWP26J3S6/bundle.json","state_url":"https://pith.science/pith/5V2PALNSNRWR4XULVZWP26J3S6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5V2PALNSNRWR4XULVZWP26J3S6/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-30T20:20:57Z","links":{"resolver":"https://pith.science/pith/5V2PALNSNRWR4XULVZWP26J3S6","bundle":"https://pith.science/pith/5V2PALNSNRWR4XULVZWP26J3S6/bundle.json","state":"https://pith.science/pith/5V2PALNSNRWR4XULVZWP26J3S6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5V2PALNSNRWR4XULVZWP26J3S6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5V2PALNSNRWR4XULVZWP26J3S6","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":"f8a3fc1be13944cbe29aa0a08f918806e15acb95f03740fe950dbd065659073a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-02-09T16:25:56Z","title_canon_sha256":"dfbb6e316935820c71af2a2e8ca5c065188556f1edae1f19f62a6ee9d84c0aa0"},"schema_version":"1.0","source":{"id":"1502.02545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02545","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02545v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02545","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"5V2PALNSNRWR","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5V2PALNSNRWR4XUL","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5V2PALNS","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:5096f5ce76d2af8b76796ba05f7ba435d4544631b7e9fc07c5ea6f0792f49086","target":"graph","created_at":"2026-05-18T02:27:41Z","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 ask the following question: If all instantiations of a propositional formula $A(x_1,...,x_n)$ in $n$ propositional variables are decidable in some sufficiently strong recursive theory, does it follow that $A$ is tautological or contradictory? and answer it in the affirmative. We also consider the following related question: Suppose that for some propositional formula $A(x_1,...,x_n)$, there is a Turing program $P$ such that $P([\\phi_{1}],...,[\\phi_{n}])\\downarrow=1$ iff $\\mathbb{N}\\models A(\\phi_{1},...,\\phi_{n})$ and otherwise $P([\\phi_{1}],...,[\\phi_{n}])\\downarrow=0$ (where $[\\phi]$ deno","authors_text":"Merlin Carl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-02-09T16:25:56Z","title":"A Note on Always Decidable Propositional Forms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02545","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:4d4cec41b3b155682ee23eedde365faa47602b81dfd0080ba31b313277de6147","target":"record","created_at":"2026-05-18T02:27:41Z","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":"f8a3fc1be13944cbe29aa0a08f918806e15acb95f03740fe950dbd065659073a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-02-09T16:25:56Z","title_canon_sha256":"dfbb6e316935820c71af2a2e8ca5c065188556f1edae1f19f62a6ee9d84c0aa0"},"schema_version":"1.0","source":{"id":"1502.02545","kind":"arxiv","version":1}},"canonical_sha256":"ed74f02db26c6d1e5e8bae6cfd793b97bc9e5a7af57e4740162340e11e63925a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed74f02db26c6d1e5e8bae6cfd793b97bc9e5a7af57e4740162340e11e63925a","first_computed_at":"2026-05-18T02:27:41.949855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:41.949855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ORypcWvYFn+Sd/kLYy4oD3seLmejGpJD+E5XCnfAQ/SpBRQJeCpMxYuOGgS/l3JiUw6uwo/IMTnRSG0oQHdHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:41.950685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d4cec41b3b155682ee23eedde365faa47602b81dfd0080ba31b313277de6147","sha256:5096f5ce76d2af8b76796ba05f7ba435d4544631b7e9fc07c5ea6f0792f49086"],"state_sha256":"84477c5ac5fc4b482718e372c4257fbf397a43e225de39d71ae90bd072a133a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQfTv5ql1otdAl+D/GX5eRbV00kozqST5SPbgNIvcHR/C1Df3PdkYrIbnzC96NvJP+yNVbWqhAnRXtrRM0HpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:20:57.567232Z","bundle_sha256":"c809d79d1af71ef206bd33ffada0cb8101c4ded9eebe93a122926d990bff1feb"}}