{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DW2HNQXPGVI3ST5HMRRX4F7FPZ","short_pith_number":"pith:DW2HNQXP","canonical_record":{"source":{"id":"1811.07172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-17T14:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"64d6d8169b9c7b166dfe00fab8a88b74f71c23ac5d12a02a160fbba82f7dbf0d","abstract_canon_sha256":"4a954c19bf3a3718dfb98a89fb79e5142a0a82f96ad14e04cc417a34787cd1ae"},"schema_version":"1.0"},"canonical_sha256":"1db476c2ef3551b94fa764637e17e57e5bb530568f25d7cab80ae187ef6bd604","source":{"kind":"arxiv","id":"1811.07172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07172","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07172v1","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07172","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"DW2HNQXPGVI3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DW2HNQXPGVI3ST5H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DW2HNQXP","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DW2HNQXPGVI3ST5HMRRX4F7FPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-17T14:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"64d6d8169b9c7b166dfe00fab8a88b74f71c23ac5d12a02a160fbba82f7dbf0d","abstract_canon_sha256":"4a954c19bf3a3718dfb98a89fb79e5142a0a82f96ad14e04cc417a34787cd1ae"},"schema_version":"1.0"},"canonical_sha256":"1db476c2ef3551b94fa764637e17e57e5bb530568f25d7cab80ae187ef6bd604","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:28.725301Z","signature_b64":"tr1AF4zDs2vyw76bVFA9Gk/mryUaAjOiNrtYXQirkjakKECUaJclIVQN66N66+U1Ft7V4/7AzN9KPvNLoeYHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1db476c2ef3551b94fa764637e17e57e5bb530568f25d7cab80ae187ef6bd604","last_reissued_at":"2026-05-18T00:00:28.724697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:28.724697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07172","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-18T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c51Gq5E6R5gGKoII+0o6wN4cYisT+Ay3Q/9s/6dSZytm5jb+KdUK+J7IzPwYYraoOC0S/538I+h5vnIKolPjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:59.626423Z"},"content_sha256":"797c4abeed970c6ae163c02b24149a104e15fc3e54d0da1fc1abb875b38bac3c","schema_version":"1.0","event_id":"sha256:797c4abeed970c6ae163c02b24149a104e15fc3e54d0da1fc1abb875b38bac3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DW2HNQXPGVI3ST5HMRRX4F7FPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dense computability, upper cones, and minimal pairs","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, Eric P. Astor","submitted_at":"2018-11-17T14:51:41Z","abstract_excerpt":"This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \\omega \\to \\omega$ is a partial function $f$ on $\\omega$ such that $\\left\\{n : f(n) = g(n)\\right\\}$ has density $1$. We define $g$ to be densely computable if it has a partial computable dense description $f$. Several previous authors have studied the stronger notions of generic computability and coarse computability, which correspond respectively to requiring in addition that $g$ and $f$ agree on the domain of $f$, and to requiring that $f$ be total. Strengthening the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07172","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-18T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OJ747mh285itnUJln5oFoJaHxg9NYjDkRNMid0WL1KG3zguAKiLaA4iqyv7AyTNML1NrBMwdDj1ueyLAufJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:32:59.626773Z"},"content_sha256":"483e9dbdee07f608e2788dfa7cf9b799e52cd771e30004f64224149a0381f7ef","schema_version":"1.0","event_id":"sha256:483e9dbdee07f608e2788dfa7cf9b799e52cd771e30004f64224149a0381f7ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/bundle.json","state_url":"https://pith.science/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/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-01T11:32:59Z","links":{"resolver":"https://pith.science/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ","bundle":"https://pith.science/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/bundle.json","state":"https://pith.science/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW2HNQXPGVI3ST5HMRRX4F7FPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DW2HNQXPGVI3ST5HMRRX4F7FPZ","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":"4a954c19bf3a3718dfb98a89fb79e5142a0a82f96ad14e04cc417a34787cd1ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-17T14:51:41Z","title_canon_sha256":"64d6d8169b9c7b166dfe00fab8a88b74f71c23ac5d12a02a160fbba82f7dbf0d"},"schema_version":"1.0","source":{"id":"1811.07172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07172","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07172v1","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07172","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"DW2HNQXPGVI3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DW2HNQXPGVI3ST5H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DW2HNQXP","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:483e9dbdee07f608e2788dfa7cf9b799e52cd771e30004f64224149a0381f7ef","target":"graph","created_at":"2026-05-18T00:00:28Z","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":"This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \\omega \\to \\omega$ is a partial function $f$ on $\\omega$ such that $\\left\\{n : f(n) = g(n)\\right\\}$ has density $1$. We define $g$ to be densely computable if it has a partial computable dense description $f$. Several previous authors have studied the stronger notions of generic computability and coarse computability, which correspond respectively to requiring in addition that $g$ and $f$ agree on the domain of $f$, and to requiring that $f$ be total. Strengthening the","authors_text":"Carl G. Jockusch Jr, Denis R. Hirschfeldt, Eric P. Astor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-17T14:51:41Z","title":"Dense computability, upper cones, and minimal pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07172","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:797c4abeed970c6ae163c02b24149a104e15fc3e54d0da1fc1abb875b38bac3c","target":"record","created_at":"2026-05-18T00:00:28Z","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":"4a954c19bf3a3718dfb98a89fb79e5142a0a82f96ad14e04cc417a34787cd1ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-17T14:51:41Z","title_canon_sha256":"64d6d8169b9c7b166dfe00fab8a88b74f71c23ac5d12a02a160fbba82f7dbf0d"},"schema_version":"1.0","source":{"id":"1811.07172","kind":"arxiv","version":1}},"canonical_sha256":"1db476c2ef3551b94fa764637e17e57e5bb530568f25d7cab80ae187ef6bd604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1db476c2ef3551b94fa764637e17e57e5bb530568f25d7cab80ae187ef6bd604","first_computed_at":"2026-05-18T00:00:28.724697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:28.724697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tr1AF4zDs2vyw76bVFA9Gk/mryUaAjOiNrtYXQirkjakKECUaJclIVQN66N66+U1Ft7V4/7AzN9KPvNLoeYHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:28.725301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:797c4abeed970c6ae163c02b24149a104e15fc3e54d0da1fc1abb875b38bac3c","sha256:483e9dbdee07f608e2788dfa7cf9b799e52cd771e30004f64224149a0381f7ef"],"state_sha256":"e91c8e10ad17006591509c84080602ecff79e26d6ad8b660489e9f3d3a9e80a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URz6nSlwzJTZ4OPLDaJ2WXK1RQcx3fJXW67glosL9TstB2NVFi5ITeUUsEz0AXikFMxiWaCzvgNL+5GwqEMbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:32:59.628892Z","bundle_sha256":"0da3a6a12be0b13faf9be9306f688a76aab5559abdee121d19eec1896c5b40f7"}}