{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TYPUK5LJJBYSN25ZKJQZKZFL2W","short_pith_number":"pith:TYPUK5LJ","schema_version":"1.0","canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","source":{"kind":"arxiv","id":"1601.07158","version":1},"attestation_state":"computed","paper":{"title":"As Easy as $\\mathbb Q$: Hilbert's Tenth Problem for Subrings of the Rationals and Number Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.NT","authors_text":"Alexandra Shlapentokh, Jennifer Park, Kirsten Eisentraeger, Russell Miller","submitted_at":"2016-01-26T20:38:39Z","abstract_excerpt":"Hilbert's Tenth Problem over the field $\\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\\mathbb Q$ having the property that Hilbert's Tenth Problem for $R$, denoted $HTP(R)$, is Turing equivalent to $HTP(\\mathbb Q)$.\n  We are able to put several additional constraints on the rings $R$ that we construct. Given any computable nonnegative real number $r \\leq 1$ we construct such a ring $R = Z[\\frac1p : p \\in S]$ with $S$ a set of primes of lower density $r$. W"},"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":"1601.07158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-26T20:38:39Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"250c9f7baa998051ae89756c36b4e3304dba2dc4d6db8c6a47f98449c31f6033","abstract_canon_sha256":"41bb5c9a7f686aff9f52defbba248a1f46e4481efb1bccfe4764a800b2914fff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.499991Z","signature_b64":"uBR+Z98zIw7xq25P0MDRda4aPSmEDhfxxx9YccsFt6Rq5Q5ezGBuVpuduyxA1EuiVda1fcWVx0n4wNVty234Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","last_reissued_at":"2026-05-18T00:24:02.499560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.499560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"As Easy as $\\mathbb Q$: Hilbert's Tenth Problem for Subrings of the Rationals and Number Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.NT","authors_text":"Alexandra Shlapentokh, Jennifer Park, Kirsten Eisentraeger, Russell Miller","submitted_at":"2016-01-26T20:38:39Z","abstract_excerpt":"Hilbert's Tenth Problem over the field $\\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\\mathbb Q$ having the property that Hilbert's Tenth Problem for $R$, denoted $HTP(R)$, is Turing equivalent to $HTP(\\mathbb Q)$.\n  We are able to put several additional constraints on the rings $R$ that we construct. Given any computable nonnegative real number $r \\leq 1$ we construct such a ring $R = Z[\\frac1p : p \\in S]$ with $S$ a set of primes of lower density $r$. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07158","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":"1601.07158","created_at":"2026-05-18T00:24:02.499620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07158v1","created_at":"2026-05-18T00:24:02.499620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07158","created_at":"2026-05-18T00:24:02.499620+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYPUK5LJJBYS","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYPUK5LJJBYSN25Z","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYPUK5LJ","created_at":"2026-05-18T12:30:46.583412+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/TYPUK5LJJBYSN25ZKJQZKZFL2W","json":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W.json","graph_json":"https://pith.science/api/pith-number/TYPUK5LJJBYSN25ZKJQZKZFL2W/graph.json","events_json":"https://pith.science/api/pith-number/TYPUK5LJJBYSN25ZKJQZKZFL2W/events.json","paper":"https://pith.science/paper/TYPUK5LJ"},"agent_actions":{"view_html":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W","download_json":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W.json","view_paper":"https://pith.science/paper/TYPUK5LJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07158&json=true","fetch_graph":"https://pith.science/api/pith-number/TYPUK5LJJBYSN25ZKJQZKZFL2W/graph.json","fetch_events":"https://pith.science/api/pith-number/TYPUK5LJJBYSN25ZKJQZKZFL2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/action/storage_attestation","attest_author":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/action/author_attestation","sign_citation":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/action/citation_signature","submit_replication":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/action/replication_record"}},"created_at":"2026-05-18T00:24:02.499620+00:00","updated_at":"2026-05-18T00:24:02.499620+00:00"}