{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q3VMC45BZDW7JXPAJBG4MSPPAN","short_pith_number":"pith:Q3VMC45B","schema_version":"1.0","canonical_sha256":"86eac173a1c8edf4dde0484dc649ef036563e7c013422410acc768401f75c9d0","source":{"kind":"arxiv","id":"1402.3747","version":1},"attestation_state":"computed","paper":{"title":"The Generic Degrees of Density-1 Sets, and Characterization of the Hyperarithmetic Reals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Gregory Igusa","submitted_at":"2014-02-16T02:38:43Z","abstract_excerpt":"A generic computation of a subset $A$ of $\\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory, where it has been noticed that frequently, it is more important to know how difficult a type of problem is in the general case than how difficult it is in the worst case. When we study this concept from a recursion theoretic point of view, to create a transitive relationship, we are forced to consider oracles that sometimes fail to give answers when asked que"},"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":"1402.3747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-02-16T02:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"ae4dee8acc6d39faa5ed44f4b72448f46a453104c9574d0ab02c86706ba59095","abstract_canon_sha256":"85aecf715bf9582ef7ac2ddd5ba5bba11d8a1e58677097981e49ce8766136c61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.721367Z","signature_b64":"CDnFLLd92nQ4DuUfoZosTmoYelaN4uKGgrheubIMu3QrH0oqOusYVgS6CWBEDsw14LOZto7XzKrQsWUPzOp0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86eac173a1c8edf4dde0484dc649ef036563e7c013422410acc768401f75c9d0","last_reissued_at":"2026-05-18T02:58:55.720718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.720718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Generic Degrees of Density-1 Sets, and Characterization of the Hyperarithmetic Reals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Gregory Igusa","submitted_at":"2014-02-16T02:38:43Z","abstract_excerpt":"A generic computation of a subset $A$ of $\\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory, where it has been noticed that frequently, it is more important to know how difficult a type of problem is in the general case than how difficult it is in the worst case. When we study this concept from a recursion theoretic point of view, to create a transitive relationship, we are forced to consider oracles that sometimes fail to give answers when asked que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3747","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":"1402.3747","created_at":"2026-05-18T02:58:55.720817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3747v1","created_at":"2026-05-18T02:58:55.720817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3747","created_at":"2026-05-18T02:58:55.720817+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3VMC45BZDW7","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3VMC45BZDW7JXPA","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3VMC45B","created_at":"2026-05-18T12:28:43.426989+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/Q3VMC45BZDW7JXPAJBG4MSPPAN","json":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN.json","graph_json":"https://pith.science/api/pith-number/Q3VMC45BZDW7JXPAJBG4MSPPAN/graph.json","events_json":"https://pith.science/api/pith-number/Q3VMC45BZDW7JXPAJBG4MSPPAN/events.json","paper":"https://pith.science/paper/Q3VMC45B"},"agent_actions":{"view_html":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN","download_json":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN.json","view_paper":"https://pith.science/paper/Q3VMC45B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3747&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3VMC45BZDW7JXPAJBG4MSPPAN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3VMC45BZDW7JXPAJBG4MSPPAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN/action/storage_attestation","attest_author":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN/action/author_attestation","sign_citation":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN/action/citation_signature","submit_replication":"https://pith.science/pith/Q3VMC45BZDW7JXPAJBG4MSPPAN/action/replication_record"}},"created_at":"2026-05-18T02:58:55.720817+00:00","updated_at":"2026-05-18T02:58:55.720817+00:00"}