{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CKKL6O5NIBYJAXWUEVFOFUR3NA","short_pith_number":"pith:CKKL6O5N","schema_version":"1.0","canonical_sha256":"1294bf3bad4070905ed4254ae2d23b680e1c53ccfb4d8c3a50ad205a6caa3342","source":{"kind":"arxiv","id":"2606.12776","version":1},"attestation_state":"computed","paper":{"title":"An AI Proof of 18-Variable Undecidability for Diophantine Equations over $\\mathbb Z[i]$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Junfeng Li, Yuchen Ding","submitted_at":"2026-06-11T00:39:01Z","abstract_excerpt":"This paper presents an AI proof that there is no algorithm deciding whether a polynomial equation over the Gaussian integers in $18$ unknowns has a solution. The proof improves the $20$-unknown theorem of Matiyasevich and Sun. It follows their rationality criterion and integer test, but saves two variables: the clearing-denominator variable is avoided by imposing two integer conditions, and the remaining nonzero condition is absorbed into the relation-combining lemma by the one-variable gadget $(2R+1)(3R+1)$."},"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":"2606.12776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-11T00:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"7064c7b52c30d15144ffa7e5474e550d35d7607bcf8ff403e79e48605abf0acc","abstract_canon_sha256":"a981ebebcc1179bb0dd4e30092f009298c8b29d7f334832d93c98b8f3a3508a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:50.480998Z","signature_b64":"jcKgxiQOgtHS4dWUBbRkOeycrmYEIMIfzGu2CadIIJq1LTpEidETp4O9v+RG2tejkwZdM9+uI76HiEZ/we1lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1294bf3bad4070905ed4254ae2d23b680e1c53ccfb4d8c3a50ad205a6caa3342","last_reissued_at":"2026-06-12T01:08:50.480089Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:50.480089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An AI Proof of 18-Variable Undecidability for Diophantine Equations over $\\mathbb Z[i]$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Junfeng Li, Yuchen Ding","submitted_at":"2026-06-11T00:39:01Z","abstract_excerpt":"This paper presents an AI proof that there is no algorithm deciding whether a polynomial equation over the Gaussian integers in $18$ unknowns has a solution. The proof improves the $20$-unknown theorem of Matiyasevich and Sun. It follows their rationality criterion and integer test, but saves two variables: the clearing-denominator variable is avoided by imposing two integer conditions, and the remaining nonzero condition is absorbed into the relation-combining lemma by the one-variable gadget $(2R+1)(3R+1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12776","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/2606.12776/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":"2606.12776","created_at":"2026-06-12T01:08:50.480247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12776v1","created_at":"2026-06-12T01:08:50.480247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12776","created_at":"2026-06-12T01:08:50.480247+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKKL6O5NIBYJ","created_at":"2026-06-12T01:08:50.480247+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKKL6O5NIBYJAXWU","created_at":"2026-06-12T01:08:50.480247+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKKL6O5N","created_at":"2026-06-12T01:08:50.480247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03992","citing_title":"On Diophantine equations over the integer rings of quadratic fields","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA","json":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA.json","graph_json":"https://pith.science/api/pith-number/CKKL6O5NIBYJAXWUEVFOFUR3NA/graph.json","events_json":"https://pith.science/api/pith-number/CKKL6O5NIBYJAXWUEVFOFUR3NA/events.json","paper":"https://pith.science/paper/CKKL6O5N"},"agent_actions":{"view_html":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA","download_json":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA.json","view_paper":"https://pith.science/paper/CKKL6O5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12776&json=true","fetch_graph":"https://pith.science/api/pith-number/CKKL6O5NIBYJAXWUEVFOFUR3NA/graph.json","fetch_events":"https://pith.science/api/pith-number/CKKL6O5NIBYJAXWUEVFOFUR3NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA/action/storage_attestation","attest_author":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA/action/author_attestation","sign_citation":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA/action/citation_signature","submit_replication":"https://pith.science/pith/CKKL6O5NIBYJAXWUEVFOFUR3NA/action/replication_record"}},"created_at":"2026-06-12T01:08:50.480247+00:00","updated_at":"2026-06-12T01:08:50.480247+00:00"}