{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7AVVYPY74BRS6RJE6RZWYQOLOK","short_pith_number":"pith:7AVVYPY7","schema_version":"1.0","canonical_sha256":"f82b5c3f1fe0632f4524f4736c41cb72af7e8d2064d749cadab3bdc18ecff9f2","source":{"kind":"arxiv","id":"1505.01340","version":1},"attestation_state":"computed","paper":{"title":"Universality and Almost Decidability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cristian S. Calude, Damien Desfontaines","submitted_at":"2015-05-06T12:32:07Z","abstract_excerpt":"We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions whose halting sets are generic (negligible, i.e. have density zero) and (not) almost decidable. One result - namely"},"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":"1505.01340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-06T12:32:07Z","cross_cats_sorted":[],"title_canon_sha256":"da3f5a63b9df0342017c1cdb597ca789e850eaff93f7588f8667097ff588e380","abstract_canon_sha256":"cdfeaa709e98552924d27c433210ca4a8152aee0acdd3ce3e287340b6fd0925b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.706294Z","signature_b64":"w+j/9pQ9Ke6d4TUqtYsvmorJ5EEsdMNqq/Y2Fl6ATp2NGoYpI32vKb27lu8jEuvLfSgXSgVBgO16NU/m70n1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f82b5c3f1fe0632f4524f4736c41cb72af7e8d2064d749cadab3bdc18ecff9f2","last_reissued_at":"2026-05-18T02:16:49.705550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.705550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality and Almost Decidability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cristian S. Calude, Damien Desfontaines","submitted_at":"2015-05-06T12:32:07Z","abstract_excerpt":"We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions whose halting sets are generic (negligible, i.e. have density zero) and (not) almost decidable. One result - namely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01340","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01340","created_at":"2026-05-18T02:16:49.705701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01340v1","created_at":"2026-05-18T02:16:49.705701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01340","created_at":"2026-05-18T02:16:49.705701+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AVVYPY74BRS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AVVYPY74BRS6RJE","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AVVYPY7","created_at":"2026-05-18T12:29:07.941421+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/7AVVYPY74BRS6RJE6RZWYQOLOK","json":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK.json","graph_json":"https://pith.science/api/pith-number/7AVVYPY74BRS6RJE6RZWYQOLOK/graph.json","events_json":"https://pith.science/api/pith-number/7AVVYPY74BRS6RJE6RZWYQOLOK/events.json","paper":"https://pith.science/paper/7AVVYPY7"},"agent_actions":{"view_html":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK","download_json":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK.json","view_paper":"https://pith.science/paper/7AVVYPY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01340&json=true","fetch_graph":"https://pith.science/api/pith-number/7AVVYPY74BRS6RJE6RZWYQOLOK/graph.json","fetch_events":"https://pith.science/api/pith-number/7AVVYPY74BRS6RJE6RZWYQOLOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK/action/storage_attestation","attest_author":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK/action/author_attestation","sign_citation":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK/action/citation_signature","submit_replication":"https://pith.science/pith/7AVVYPY74BRS6RJE6RZWYQOLOK/action/replication_record"}},"created_at":"2026-05-18T02:16:49.705701+00:00","updated_at":"2026-05-18T02:16:49.705701+00:00"}