{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BUJZERAOGGWV3ZYGIL345TWIXA","short_pith_number":"pith:BUJZERAO","schema_version":"1.0","canonical_sha256":"0d1392440e31ad5de70642f7cecec8b837c9ef46e87d9cd3ded1f72cd6f41aa7","source":{"kind":"arxiv","id":"2607.28606","version":1},"attestation_state":"computed","paper":{"title":"$\\mathbb Q\\setminus\\mathbb Z$ is diophantine over $\\mathbb Q$ with $7$ unknowns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2026-07-30T17:56:28Z","abstract_excerpt":"In 2016 J. Koenigsmann proved that $\\mathbb Q\\setminus\\mathbb Z$ is diophantine over $\\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\\ldots,x_{n})\\in\\mathbb Z[t,x_1,\\ldots,x_{n}]$ such that for any rational number $t$ we have $$t\\not\\in\\mathbb Z\\iff \\exists x_1,\\ldots,x_{n}\\in\\mathbb Q\\,[P(t,x_1,\\ldots,x_{n})=0].$$ In this paper we show that we may take $n=7$ which improves the previous record $n=10$ obtained by Daans in 2024. (Actually we even extend this to any global field.) This, together with a previous result of Z.-W. Sun, implies that there is no algorithm to decide for any $F(x_1,\\ld"},"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":"2607.28606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-07-30T17:56:28Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"c3b56774bd3326adc0db2219c5f657b9cdb38924351949d40bfbfc4fb01a1c3e","abstract_canon_sha256":"53ca6b63733a6374a192719d9f0a405624ae8ffbf974dc1ae269c2ef89dcf380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1392440e31ad5de70642f7cecec8b837c9ef46e87d9cd3ded1f72cd6f41aa7","last_reissued_at":"2026-07-31T01:39:04.949841Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:39:04.949841Z"},"graph_snapshot":{"paper":{"title":"$\\mathbb Q\\setminus\\mathbb Z$ is diophantine over $\\mathbb Q$ with $7$ unknowns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2026-07-30T17:56:28Z","abstract_excerpt":"In 2016 J. Koenigsmann proved that $\\mathbb Q\\setminus\\mathbb Z$ is diophantine over $\\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\\ldots,x_{n})\\in\\mathbb Z[t,x_1,\\ldots,x_{n}]$ such that for any rational number $t$ we have $$t\\not\\in\\mathbb Z\\iff \\exists x_1,\\ldots,x_{n}\\in\\mathbb Q\\,[P(t,x_1,\\ldots,x_{n})=0].$$ In this paper we show that we may take $n=7$ which improves the previous record $n=10$ obtained by Daans in 2024. (Actually we even extend this to any global field.) This, together with a previous result of Z.-W. Sun, implies that there is no algorithm to decide for any $F(x_1,\\ld"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28606","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28606/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.28606","created_at":"2026-07-31T01:39:04.953023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28606v1","created_at":"2026-07-31T01:39:04.953023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28606","created_at":"2026-07-31T01:39:04.953023+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUJZERAOGGWV","created_at":"2026-07-31T01:39:04.953023+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUJZERAOGGWV3ZYG","created_at":"2026-07-31T01:39:04.953023+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUJZERAO","created_at":"2026-07-31T01:39:04.953023+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/BUJZERAOGGWV3ZYGIL345TWIXA","json":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA.json","graph_json":"https://pith.science/api/pith-number/BUJZERAOGGWV3ZYGIL345TWIXA/graph.json","events_json":"https://pith.science/api/pith-number/BUJZERAOGGWV3ZYGIL345TWIXA/events.json","paper":"https://pith.science/paper/BUJZERAO"},"agent_actions":{"view_html":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA","download_json":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA.json","view_paper":"https://pith.science/paper/BUJZERAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28606&json=true","fetch_graph":"https://pith.science/api/pith-number/BUJZERAOGGWV3ZYGIL345TWIXA/graph.json","fetch_events":"https://pith.science/api/pith-number/BUJZERAOGGWV3ZYGIL345TWIXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA/action/storage_attestation","attest_author":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA/action/author_attestation","sign_citation":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA/action/citation_signature","submit_replication":"https://pith.science/pith/BUJZERAOGGWV3ZYGIL345TWIXA/action/replication_record"}},"created_at":"2026-07-31T01:39:04.953023+00:00","updated_at":"2026-07-31T01:39:04.953023+00:00"}