{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7YCXJRTQM4ZFTOUJR5XDIVCMYA","short_pith_number":"pith:7YCXJRTQ","canonical_record":{"source":{"id":"1409.0496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-01T18:10:29Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"3be7409e339546206807b58565144f492060e96fe1c90ffa78e6c96d77362aae","abstract_canon_sha256":"4180f1afecab7d80978f4b1dad9e990fe4db410717e28343447005d105c0ec31"},"schema_version":"1.0"},"canonical_sha256":"fe0574c670673259ba898f6e34544cc0233219e7f14c8c648604fc2fb386337f","source":{"kind":"arxiv","id":"1409.0496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0496","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0496v1","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0496","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"7YCXJRTQM4ZF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7YCXJRTQM4ZFTOUJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7YCXJRTQ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7YCXJRTQM4ZFTOUJR5XDIVCMYA","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-01T18:10:29Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"3be7409e339546206807b58565144f492060e96fe1c90ffa78e6c96d77362aae","abstract_canon_sha256":"4180f1afecab7d80978f4b1dad9e990fe4db410717e28343447005d105c0ec31"},"schema_version":"1.0"},"canonical_sha256":"fe0574c670673259ba898f6e34544cc0233219e7f14c8c648604fc2fb386337f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:52.664973Z","signature_b64":"g4HrvvZE9WfCMgAXiDqV1EpJ+juRxOe6GT9xOVVXagc4xro0gG425Y2HhWhmb6wRoBHxEcFroCX2Qrp8RY5vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe0574c670673259ba898f6e34544cc0233219e7f14c8c648604fc2fb386337f","last_reissued_at":"2026-05-18T02:43:52.664576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:52.664576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0496","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:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qO18/NSCGXQbZb7UJ/2CCV+p/Jo/W7LZt9cmojPdz0G7kIQV4S98/aEcNbMgmTy3veDx0pOqEAJND5+qN1sBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:07:10.003429Z"},"content_sha256":"724640f1dd17888bf82fc39289a8a26b6c4c5fa459138d7d4aae98cdd2bd5a9d","schema_version":"1.0","event_id":"sha256:724640f1dd17888bf82fc39289a8a26b6c4c5fa459138d7d4aae98cdd2bd5a9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7YCXJRTQM4ZFTOUJR5XDIVCMYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On approximate decidability of minimal programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Jason Teutsch, Marius Zimand","submitted_at":"2014-09-01T18:10:29Z","abstract_excerpt":"An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm which can correctly label 1 out of $k$ indices as either minimal or non-minimal. Our second question, regard"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0496","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:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17DTMQuxARdlqQWRSaQWMAbqGCsjuTZER/CbRHPmlGYWRFey9Lw9HGUcHb+h2nGqqosz+3hsGI5NhPsoRbiKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:07:10.003787Z"},"content_sha256":"ce37373b850c49caa1ba8e46cb8750eb020a6060702ad1facc944bd7fbc8c66f","schema_version":"1.0","event_id":"sha256:ce37373b850c49caa1ba8e46cb8750eb020a6060702ad1facc944bd7fbc8c66f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/bundle.json","state_url":"https://pith.science/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/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-21T22:07:10Z","links":{"resolver":"https://pith.science/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA","bundle":"https://pith.science/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/bundle.json","state":"https://pith.science/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YCXJRTQM4ZFTOUJR5XDIVCMYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7YCXJRTQM4ZFTOUJR5XDIVCMYA","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":"4180f1afecab7d80978f4b1dad9e990fe4db410717e28343447005d105c0ec31","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-01T18:10:29Z","title_canon_sha256":"3be7409e339546206807b58565144f492060e96fe1c90ffa78e6c96d77362aae"},"schema_version":"1.0","source":{"id":"1409.0496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0496","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0496v1","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0496","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"7YCXJRTQM4ZF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7YCXJRTQM4ZFTOUJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7YCXJRTQ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:ce37373b850c49caa1ba8e46cb8750eb020a6060702ad1facc944bd7fbc8c66f","target":"graph","created_at":"2026-05-18T02:43:52Z","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":"An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm which can correctly label 1 out of $k$ indices as either minimal or non-minimal. Our second question, regard","authors_text":"Jason Teutsch, Marius Zimand","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-01T18:10:29Z","title":"On approximate decidability of minimal programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0496","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:724640f1dd17888bf82fc39289a8a26b6c4c5fa459138d7d4aae98cdd2bd5a9d","target":"record","created_at":"2026-05-18T02:43:52Z","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":"4180f1afecab7d80978f4b1dad9e990fe4db410717e28343447005d105c0ec31","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-01T18:10:29Z","title_canon_sha256":"3be7409e339546206807b58565144f492060e96fe1c90ffa78e6c96d77362aae"},"schema_version":"1.0","source":{"id":"1409.0496","kind":"arxiv","version":1}},"canonical_sha256":"fe0574c670673259ba898f6e34544cc0233219e7f14c8c648604fc2fb386337f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe0574c670673259ba898f6e34544cc0233219e7f14c8c648604fc2fb386337f","first_computed_at":"2026-05-18T02:43:52.664576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:52.664576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g4HrvvZE9WfCMgAXiDqV1EpJ+juRxOe6GT9xOVVXagc4xro0gG425Y2HhWhmb6wRoBHxEcFroCX2Qrp8RY5vBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:52.664973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:724640f1dd17888bf82fc39289a8a26b6c4c5fa459138d7d4aae98cdd2bd5a9d","sha256:ce37373b850c49caa1ba8e46cb8750eb020a6060702ad1facc944bd7fbc8c66f"],"state_sha256":"db1cba34a9d39ae88e0fe824d70b7adf3c188ebfa3b0c7d40fa45c96333c7dde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaw/U9BqBOTFarStt0pM2g539Kjl33MqJvzejJBZbt5AcI7S4qh8cSP88y9zAUxLmrgip8SlgfTU7t1yCrV6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:07:10.005946Z","bundle_sha256":"55f0a0aebe61c4cb0c25dacdb809e99ed7ff3582a48b7b00af448e8888025828"}}