{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6WNWPARQ2CMYMCXJO2TZYLMLK6","short_pith_number":"pith:6WNWPARQ","schema_version":"1.0","canonical_sha256":"f59b678230d099860ae976a79c2d8b57840d6c323a579ad4b3af6bf2484dc0de","source":{"kind":"arxiv","id":"1505.01707","version":1},"attestation_state":"computed","paper":{"title":"Coarse Reducibility and Algorithmic Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl G. Jockusch Jr., Denis R. Hirschfeldt, Paul E. Schupp, Rutger Kuyper","submitted_at":"2015-05-07T13:56:34Z","abstract_excerpt":"A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense. We show that if A is 1-random and B is computable from every coarse description D of A, then B is K-trivial, which implies that if A is in fact weakly 2-random then B is computable. Our main tool is a kind of compactness theorem for cone-avoiding descriptions, which also all"},"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.01707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-07T13:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"544238640b2ede83196fdbcaad337c7ad5929ae588de72b59ef26ad895c3015e","abstract_canon_sha256":"928cdaa6ce908993f32bc0fb480fe54d35eb27d8d34b9c2db2b9ef945b1baa8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:40.261622Z","signature_b64":"GBZEaip8eSWqdivtlRDGu3udBQ0ZopwVLw9jIAn0PRvy9I4eltz2WkVCLYjMgqgR9Qm169yZqPCTBE8spg1AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f59b678230d099860ae976a79c2d8b57840d6c323a579ad4b3af6bf2484dc0de","last_reissued_at":"2026-05-18T02:16:40.261048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:40.261048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse Reducibility and Algorithmic Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl G. Jockusch Jr., Denis R. Hirschfeldt, Paul E. Schupp, Rutger Kuyper","submitted_at":"2015-05-07T13:56:34Z","abstract_excerpt":"A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense. We show that if A is 1-random and B is computable from every coarse description D of A, then B is K-trivial, which implies that if A is in fact weakly 2-random then B is computable. Our main tool is a kind of compactness theorem for cone-avoiding descriptions, which also all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01707","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.01707","created_at":"2026-05-18T02:16:40.261152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01707v1","created_at":"2026-05-18T02:16:40.261152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01707","created_at":"2026-05-18T02:16:40.261152+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WNWPARQ2CMY","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WNWPARQ2CMYMCXJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WNWPARQ","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/6WNWPARQ2CMYMCXJO2TZYLMLK6","json":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6.json","graph_json":"https://pith.science/api/pith-number/6WNWPARQ2CMYMCXJO2TZYLMLK6/graph.json","events_json":"https://pith.science/api/pith-number/6WNWPARQ2CMYMCXJO2TZYLMLK6/events.json","paper":"https://pith.science/paper/6WNWPARQ"},"agent_actions":{"view_html":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6","download_json":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6.json","view_paper":"https://pith.science/paper/6WNWPARQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01707&json=true","fetch_graph":"https://pith.science/api/pith-number/6WNWPARQ2CMYMCXJO2TZYLMLK6/graph.json","fetch_events":"https://pith.science/api/pith-number/6WNWPARQ2CMYMCXJO2TZYLMLK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6/action/storage_attestation","attest_author":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6/action/author_attestation","sign_citation":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6/action/citation_signature","submit_replication":"https://pith.science/pith/6WNWPARQ2CMYMCXJO2TZYLMLK6/action/replication_record"}},"created_at":"2026-05-18T02:16:40.261152+00:00","updated_at":"2026-05-18T02:16:40.261152+00:00"}