{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PDUB4FT5JQJQD424K3CXIRAGXO","short_pith_number":"pith:PDUB4FT5","schema_version":"1.0","canonical_sha256":"78e81e167d4c1301f35c56c5744406bb9e0f05f339832c1295387eabf01ec53e","source":{"kind":"arxiv","id":"1210.4937","version":2},"attestation_state":"computed","paper":{"title":"From Bi-immunity to Absolute Undecidability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day, Laurent Bienvenu (LIAFA), Rupert H\\\"olzl (LIAFA)","submitted_at":"2012-10-17T20:02:04Z","abstract_excerpt":"An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether, unlike the case for bi-immunity, there is an absolutely undecidable set in every non-zero Turing degree. We provide a positive answer to this question by applying techniques from coding theory. We show how to use Walsh-Hadamard codes to build a truth-table functional which maps any sequence A to a sequence B, such that given any restriction of B to a set of posi"},"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":"1210.4937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-10-17T20:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"256a62a32b11283fc60a74b507f08130c25e4afc3489c989d2e0a45ede3457a6","abstract_canon_sha256":"cb9cb37c9e1922a86d24cb7ce053318e33eb9936f8de51f04113e5b641766e26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:25.545092Z","signature_b64":"VKfd7+YDR0YJhuZCa1vr8CRulp3b0xMl7YucZ66dAEOsHH5CkBm1Z/kQurasN7VQrl+FHzJR4sp9L8DLExP5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78e81e167d4c1301f35c56c5744406bb9e0f05f339832c1295387eabf01ec53e","last_reissued_at":"2026-05-18T03:30:25.544514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:25.544514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Bi-immunity to Absolute Undecidability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day, Laurent Bienvenu (LIAFA), Rupert H\\\"olzl (LIAFA)","submitted_at":"2012-10-17T20:02:04Z","abstract_excerpt":"An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether, unlike the case for bi-immunity, there is an absolutely undecidable set in every non-zero Turing degree. We provide a positive answer to this question by applying techniques from coding theory. We show how to use Walsh-Hadamard codes to build a truth-table functional which maps any sequence A to a sequence B, such that given any restriction of B to a set of posi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4937","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4937","created_at":"2026-05-18T03:30:25.544613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4937v2","created_at":"2026-05-18T03:30:25.544613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4937","created_at":"2026-05-18T03:30:25.544613+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDUB4FT5JQJQ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDUB4FT5JQJQD424","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDUB4FT5","created_at":"2026-05-18T12:27:18.751474+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/PDUB4FT5JQJQD424K3CXIRAGXO","json":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO.json","graph_json":"https://pith.science/api/pith-number/PDUB4FT5JQJQD424K3CXIRAGXO/graph.json","events_json":"https://pith.science/api/pith-number/PDUB4FT5JQJQD424K3CXIRAGXO/events.json","paper":"https://pith.science/paper/PDUB4FT5"},"agent_actions":{"view_html":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO","download_json":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO.json","view_paper":"https://pith.science/paper/PDUB4FT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4937&json=true","fetch_graph":"https://pith.science/api/pith-number/PDUB4FT5JQJQD424K3CXIRAGXO/graph.json","fetch_events":"https://pith.science/api/pith-number/PDUB4FT5JQJQD424K3CXIRAGXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO/action/storage_attestation","attest_author":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO/action/author_attestation","sign_citation":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO/action/citation_signature","submit_replication":"https://pith.science/pith/PDUB4FT5JQJQD424K3CXIRAGXO/action/replication_record"}},"created_at":"2026-05-18T03:30:25.544613+00:00","updated_at":"2026-05-18T03:30:25.544613+00:00"}