{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7AMXMVMM5HSPKRPI2HEZ2MVLZ5","short_pith_number":"pith:7AMXMVMM","canonical_record":{"source":{"id":"1505.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-08T01:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"4d04e6750d8caa68473a4457c3939e7cfc29eaf48e6a76cdf1b689f92e6350ea","abstract_canon_sha256":"67c936d676b81ae282118f9d649398ae544d91fd33084d268615177f52fdbbf6"},"schema_version":"1.0"},"canonical_sha256":"f81976558ce9e4f545e8d1c99d32abcf5a33f81c19c5a08596645c104912cbca","source":{"kind":"arxiv","id":"1505.01901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01901","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01901v1","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01901","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"7AMXMVMM5HSP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"7AMXMVMM5HSPKRPI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"7AMXMVMM","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7AMXMVMM5HSPKRPI2HEZ2MVLZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-08T01:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"4d04e6750d8caa68473a4457c3939e7cfc29eaf48e6a76cdf1b689f92e6350ea","abstract_canon_sha256":"67c936d676b81ae282118f9d649398ae544d91fd33084d268615177f52fdbbf6"},"schema_version":"1.0"},"canonical_sha256":"f81976558ce9e4f545e8d1c99d32abcf5a33f81c19c5a08596645c104912cbca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:38.572909Z","signature_b64":"Ruzz2rFJ4tz23nRXDxnUwg4uqqzTKxs/AY3v51slILJDKKuylV9k8RvDkHo47dI9cZpa4HUByLWQXELReaJgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f81976558ce9e4f545e8d1c99d32abcf5a33f81c19c5a08596645c104912cbca","last_reissued_at":"2026-05-18T02:16:38.572272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:38.572272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01901","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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqGamF6M6VRzcjBYIXNDBv0qbeBni6uqovuaHJVyYg6lNqUv2NJqtpoifxMhMRTdGRul18bwfHpe7eNyCIbiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:44:57.967918Z"},"content_sha256":"549db3689a21f524ad331b16c42315433c2dc975cb525b49d56da1bf42a4d3ae","schema_version":"1.0","event_id":"sha256:549db3689a21f524ad331b16c42315433c2dc975cb525b49d56da1bf42a4d3ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7AMXMVMM5HSPKRPI2HEZ2MVLZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic density and the coarse computability bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Carl G. Jockusch, Denis R. Hirschfeldt, Jr., Paul E. Schupp, Timothy H. McNicholl","submitted_at":"2015-05-08T01:15:16Z","abstract_excerpt":"For $r \\in [0,1]$ we say that a set $A \\subseteq \\omega$ is \\emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\\{n : C(n) = A(n)\\}$ has lower density at least $r$. Let $\\gamma(A) = \\sup \\{r : A \\hbox{ is coarsely computable at density } r\\}$. We study the interactions of these concepts with Turing reducibility. For example, we show that if $r \\in (0,1]$ there are sets $A_0, A_1$ such that $\\gamma(A_0) = \\gamma(A_1) = r$ where $A_0$ is coarsely computable at density $r$ while $A_1$ is not coarsely computable at density $r$. We show that a real $r \\in [0,1]$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01901","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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfjUA8uHhdU+IaeRSIcKv1cnze0InrcJDgKUBZqObG4vXMi+j0dTU9JmjhRoFfrVTU1DQSOBIaeZKEmX+ctHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:44:57.968666Z"},"content_sha256":"6b5a3eff15fa529028d5870d36ce1bde8c3e45f59b7f774bfc89307e2ce218e0","schema_version":"1.0","event_id":"sha256:6b5a3eff15fa529028d5870d36ce1bde8c3e45f59b7f774bfc89307e2ce218e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/bundle.json","state_url":"https://pith.science/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/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-11T08:44:57Z","links":{"resolver":"https://pith.science/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5","bundle":"https://pith.science/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/bundle.json","state":"https://pith.science/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AMXMVMM5HSPKRPI2HEZ2MVLZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7AMXMVMM5HSPKRPI2HEZ2MVLZ5","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":"67c936d676b81ae282118f9d649398ae544d91fd33084d268615177f52fdbbf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-08T01:15:16Z","title_canon_sha256":"4d04e6750d8caa68473a4457c3939e7cfc29eaf48e6a76cdf1b689f92e6350ea"},"schema_version":"1.0","source":{"id":"1505.01901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01901","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01901v1","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01901","created_at":"2026-05-18T02:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"7AMXMVMM5HSP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"7AMXMVMM5HSPKRPI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"7AMXMVMM","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:6b5a3eff15fa529028d5870d36ce1bde8c3e45f59b7f774bfc89307e2ce218e0","target":"graph","created_at":"2026-05-18T02:16:38Z","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":"For $r \\in [0,1]$ we say that a set $A \\subseteq \\omega$ is \\emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\\{n : C(n) = A(n)\\}$ has lower density at least $r$. Let $\\gamma(A) = \\sup \\{r : A \\hbox{ is coarsely computable at density } r\\}$. We study the interactions of these concepts with Turing reducibility. For example, we show that if $r \\in (0,1]$ there are sets $A_0, A_1$ such that $\\gamma(A_0) = \\gamma(A_1) = r$ where $A_0$ is coarsely computable at density $r$ while $A_1$ is not coarsely computable at density $r$. We show that a real $r \\in [0,1]$ is","authors_text":"Carl G. Jockusch, Denis R. Hirschfeldt, Jr., Paul E. Schupp, Timothy H. McNicholl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-08T01:15:16Z","title":"Asymptotic density and the coarse computability bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01901","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:549db3689a21f524ad331b16c42315433c2dc975cb525b49d56da1bf42a4d3ae","target":"record","created_at":"2026-05-18T02:16:38Z","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":"67c936d676b81ae282118f9d649398ae544d91fd33084d268615177f52fdbbf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-05-08T01:15:16Z","title_canon_sha256":"4d04e6750d8caa68473a4457c3939e7cfc29eaf48e6a76cdf1b689f92e6350ea"},"schema_version":"1.0","source":{"id":"1505.01901","kind":"arxiv","version":1}},"canonical_sha256":"f81976558ce9e4f545e8d1c99d32abcf5a33f81c19c5a08596645c104912cbca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f81976558ce9e4f545e8d1c99d32abcf5a33f81c19c5a08596645c104912cbca","first_computed_at":"2026-05-18T02:16:38.572272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:38.572272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ruzz2rFJ4tz23nRXDxnUwg4uqqzTKxs/AY3v51slILJDKKuylV9k8RvDkHo47dI9cZpa4HUByLWQXELReaJgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:38.572909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:549db3689a21f524ad331b16c42315433c2dc975cb525b49d56da1bf42a4d3ae","sha256:6b5a3eff15fa529028d5870d36ce1bde8c3e45f59b7f774bfc89307e2ce218e0"],"state_sha256":"631e509a17db9e896e31573640bf60e1d1e218e33af6e077e842f0b0555b9fc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPSav2aSdvno8dPuwYAICA3tvrT9PK61VIC0ftivUGMsN41GuNRs3GxtAznd9lzqtzGiMvp1hIl7LVaXaKJbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:44:57.972639Z","bundle_sha256":"997f82d49566df2aeebd0ecb4bf13c13264ed44fc577325c4c76fb90119808bf"}}