{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H25A5WU7BNKWZA44NTQCHRJJ26","short_pith_number":"pith:H25A5WU7","schema_version":"1.0","canonical_sha256":"3eba0eda9f0b556c839c6ce023c529d7a5b19d8a3f647e5d29caee27e9452742","source":{"kind":"arxiv","id":"1307.0040","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Density and Computably Enumerable Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl G. Jockusch Jr., Paul E. Schupp, Rodney G. Downey","submitted_at":"2013-06-28T22:23:50Z","abstract_excerpt":"We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural characterization of non-low c.e. degrees. In contrast, we prove that every nonzero c.e. degree contains a set which is generically computable but not coarsely computable. There is a very close connection between the computational complexity of a set and the computational complexity of its density as a real number where we measure complexity of real numbers as th"},"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":"1307.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-06-28T22:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"8e178ffe68d8d998216d213f3cbbeeea8f7ee5a278f45f6521ee0ca5d59d0e47","abstract_canon_sha256":"9cb725ff5a25d2632b8427f17957b9b9dde5d8ca03df95f96faf1b47ba423260"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.378835Z","signature_b64":"FCHrl7f6R8gvaWZAA5Pb0XJL9e9ktqNng9Mxd6/8/QvEOGkdig90l8iwlX1EeWW8/0PjB1uQDiIdVQHCWSprAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eba0eda9f0b556c839c6ce023c529d7a5b19d8a3f647e5d29caee27e9452742","last_reissued_at":"2026-05-18T03:19:34.378395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.378395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Density and Computably Enumerable Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl G. Jockusch Jr., Paul E. Schupp, Rodney G. Downey","submitted_at":"2013-06-28T22:23:50Z","abstract_excerpt":"We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural characterization of non-low c.e. degrees. In contrast, we prove that every nonzero c.e. degree contains a set which is generically computable but not coarsely computable. There is a very close connection between the computational complexity of a set and the computational complexity of its density as a real number where we measure complexity of real numbers as th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0040","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":"1307.0040","created_at":"2026-05-18T03:19:34.378469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0040v1","created_at":"2026-05-18T03:19:34.378469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0040","created_at":"2026-05-18T03:19:34.378469+00:00"},{"alias_kind":"pith_short_12","alias_value":"H25A5WU7BNKW","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H25A5WU7BNKWZA44","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H25A5WU7","created_at":"2026-05-18T12:27:46.883200+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/H25A5WU7BNKWZA44NTQCHRJJ26","json":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26.json","graph_json":"https://pith.science/api/pith-number/H25A5WU7BNKWZA44NTQCHRJJ26/graph.json","events_json":"https://pith.science/api/pith-number/H25A5WU7BNKWZA44NTQCHRJJ26/events.json","paper":"https://pith.science/paper/H25A5WU7"},"agent_actions":{"view_html":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26","download_json":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26.json","view_paper":"https://pith.science/paper/H25A5WU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0040&json=true","fetch_graph":"https://pith.science/api/pith-number/H25A5WU7BNKWZA44NTQCHRJJ26/graph.json","fetch_events":"https://pith.science/api/pith-number/H25A5WU7BNKWZA44NTQCHRJJ26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26/action/storage_attestation","attest_author":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26/action/author_attestation","sign_citation":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26/action/citation_signature","submit_replication":"https://pith.science/pith/H25A5WU7BNKWZA44NTQCHRJJ26/action/replication_record"}},"created_at":"2026-05-18T03:19:34.378469+00:00","updated_at":"2026-05-18T03:19:34.378469+00:00"}