{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TYPUK5LJJBYSN25ZKJQZKZFL2W","short_pith_number":"pith:TYPUK5LJ","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"},"canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","source":{"kind":"arxiv","id":"1601.07158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07158","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07158v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07158","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"TYPUK5LJJBYS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYPUK5LJJBYSN25Z","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYPUK5LJ","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TYPUK5LJJBYSN25ZKJQZKZFL2W","target":"record","payload":{"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"},"canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","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"},"source_kind":"arxiv","source_id":"1601.07158","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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWZ6LjUXElqT734DFGeycBdcDJC8tLLxj99sHLEYnoxJVF3ko/S+djiHKTUSJk/m6smJPkSzA3YCxb5ALrtLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:27.297092Z"},"content_sha256":"385afe8ba7057a8b9f2eff5e307ffa9d38c04746daa21e3cc25528599545cecf","schema_version":"1.0","event_id":"sha256:385afe8ba7057a8b9f2eff5e307ffa9d38c04746daa21e3cc25528599545cecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TYPUK5LJJBYSN25ZKJQZKZFL2W","target":"graph","payload":{"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"},"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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1h3J+Pii5RnhHG/jsPwfcjJVW9mdbj5Zo7uETpIznxIxhH5CF3Lb2ESmDmKCfHGGppeym+0QUrF6D7tFKkeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:27.297463Z"},"content_sha256":"ae6897c228b00ebfd9c782846d6a95c7fd702445fd7dee99d63dbf60fb48efe1","schema_version":"1.0","event_id":"sha256:ae6897c228b00ebfd9c782846d6a95c7fd702445fd7dee99d63dbf60fb48efe1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/bundle.json","state_url":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/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-03T21:03:27Z","links":{"resolver":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W","bundle":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/bundle.json","state":"https://pith.science/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYPUK5LJJBYSN25ZKJQZKZFL2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TYPUK5LJJBYSN25ZKJQZKZFL2W","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":"41bb5c9a7f686aff9f52defbba248a1f46e4481efb1bccfe4764a800b2914fff","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-26T20:38:39Z","title_canon_sha256":"250c9f7baa998051ae89756c36b4e3304dba2dc4d6db8c6a47f98449c31f6033"},"schema_version":"1.0","source":{"id":"1601.07158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07158","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07158v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07158","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"TYPUK5LJJBYS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYPUK5LJJBYSN25Z","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYPUK5LJ","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ae6897c228b00ebfd9c782846d6a95c7fd702445fd7dee99d63dbf60fb48efe1","target":"graph","created_at":"2026-05-18T00:24:02Z","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":"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","authors_text":"Alexandra Shlapentokh, Jennifer Park, Kirsten Eisentraeger, Russell Miller","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-26T20:38:39Z","title":"As Easy as $\\mathbb Q$: Hilbert's Tenth Problem for Subrings of the Rationals and Number Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07158","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:385afe8ba7057a8b9f2eff5e307ffa9d38c04746daa21e3cc25528599545cecf","target":"record","created_at":"2026-05-18T00:24:02Z","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":"41bb5c9a7f686aff9f52defbba248a1f46e4481efb1bccfe4764a800b2914fff","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-26T20:38:39Z","title_canon_sha256":"250c9f7baa998051ae89756c36b4e3304dba2dc4d6db8c6a47f98449c31f6033"},"schema_version":"1.0","source":{"id":"1601.07158","kind":"arxiv","version":1}},"canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e1f457569487126ebb952619564abd58cdc5b429ccc49c16422e044a21cb6fe","first_computed_at":"2026-05-18T00:24:02.499560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:02.499560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uBR+Z98zIw7xq25P0MDRda4aPSmEDhfxxx9YccsFt6Rq5Q5ezGBuVpuduyxA1EuiVda1fcWVx0n4wNVty234Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:02.499991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:385afe8ba7057a8b9f2eff5e307ffa9d38c04746daa21e3cc25528599545cecf","sha256:ae6897c228b00ebfd9c782846d6a95c7fd702445fd7dee99d63dbf60fb48efe1"],"state_sha256":"eeedbeba05e7c2cb9f1d35723b7354275c8a29af1ce9bc968fb41363b62caeaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSsa4K2qAMd5/mSR9+1FVpSjfx3AJfvgz/wUdCL/s5/M/JpJKQlyQI5I81VZ4GV3q4z1ZzRf/nef0jKUEKKOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:03:27.299466Z","bundle_sha256":"259c834e5f8336f76ffb055e47d15da0bbbef6b4292443ef461b2a74ee0fd861"}}