{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q3BEO6GS24QYWJENHS3D4267IR","short_pith_number":"pith:Q3BEO6GS","canonical_record":{"source":{"id":"2605.13980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T18:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"83766f2db151ee9544b04b2cbd08f1152ef565d48245ae2f50aba990a04005c4","abstract_canon_sha256":"8b5e600c58b8ca3c537b0d3ea5a0ee86981c5b76710e95d8d77a95e6db77c6f3"},"schema_version":"1.0"},"canonical_sha256":"86c24778d2d7218b248d3cb63e6bdf446ba8fd9ad6e0079bdb77ebd4779567f3","source":{"kind":"arxiv","id":"2605.13980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13980","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13980v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13980","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q3BEO6GS24QY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3BEO6GS24QYWJEN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3BEO6GS","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q3BEO6GS24QYWJENHS3D4267IR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T18:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"83766f2db151ee9544b04b2cbd08f1152ef565d48245ae2f50aba990a04005c4","abstract_canon_sha256":"8b5e600c58b8ca3c537b0d3ea5a0ee86981c5b76710e95d8d77a95e6db77c6f3"},"schema_version":"1.0"},"canonical_sha256":"86c24778d2d7218b248d3cb63e6bdf446ba8fd9ad6e0079bdb77ebd4779567f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:13.388130Z","signature_b64":"BdAWWevg5d9Tk7eR4u2CrfMYzcWDLSlCGM26fGqGuSKoYAubxtpzh94oPWV7bwS7LqWFpmcRT5AT32EswHuQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c24778d2d7218b248d3cb63e6bdf446ba8fd9ad6e0079bdb77ebd4779567f3","last_reissued_at":"2026-05-17T23:39:13.387462Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:13.387462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13980","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-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljs7RTl7n23Zmf5bW1flLBTsche9HY7nod0AyXI8XRjrpcjDcLAsI/VB07EKLno3REI0QLfgfAHvc8CopkB8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:56.315533Z"},"content_sha256":"ff84438986e1efbfc912dae4148da2b2b198412c22d95d3a6abf112951c7032b","schema_version":"1.0","event_id":"sha256:ff84438986e1efbfc912dae4148da2b2b198412c22d95d3a6abf112951c7032b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q3BEO6GS24QYWJENHS3D4267IR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gabriel Escrig, M. A. Martin-Delgado","submitted_at":"2026-05-13T18:01:01Z","abstract_excerpt":"Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the worst case. In this work, we introduce a fully reversible quantum algorithmic framework tailored to solve arbitrary polynomial Diophantine equations over bounded integer domains. The core of our approach is the explicit, gate-level synthesis of an evaluation oracle for amplitude amplification. By coherently evaluating polynomial constraints via in-place two's"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The overall spatial complexity is bounded by q = O((n + d²)log₂ N) logical qubits ... quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the in-place two's complement arithmetic and routing operations into a single recycled accumulator can be synthesized gate-by-gate without introducing hidden overhead or non-reversibility for arbitrary polynomial degrees and coefficient sizes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"69f4d62f9940aab135971e965c124e95092f1069202c263e377a4932300e968b"},"source":{"id":"2605.13980","kind":"arxiv","version":1},"verdict":{"id":"90359a2f-0ac8-4e09-9fb8-3fe11b5fe113","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:45:11.390233Z","strongest_claim":"The overall spatial complexity is bounded by q = O((n + d²)log₂ N) logical qubits ... quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions.","one_line_summary":"Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the in-place two's complement arithmetic and routing operations into a single recycled accumulator can be synthesized gate-by-gate without introducing hidden overhead or non-reversibility for arbitrary polynomial degrees and coefficient sizes.","pith_extraction_headline":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits."},"references":{"count":39,"sample":[{"doi":"","year":null,"title":"Let the variablex i be encoded in aw- bit register,|x i,w−1","work_id":"f260fbbb-7f01-4d0c-9f97-4d441c8af91c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Instead of a variable controlling its own shifted addition, the qubits ofx i act as controls for the logically shifted additions of the dis- joint registerx j","work_id":"aa672101-3a16-4249-a79e-62c6af7839c0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Specifically, we adopt the BBHT search strategy [22]","work_id":"f2584ed2-ab2c-4128-bd80-0016c34a6956","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Quantum Counting Alternatively, when the primary goal is to deter- mine the exact number of solutions, the operatorGis integrated into a Quantum Counting framework [23]. This framework interpretsGas a","work_id":"46710932-ed1f-4d8f-a30c-7ebeddae3728","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1975,"title":"G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, 4th ed. (Oxford University Press, 1975)","work_id":"cdb55880-6e1f-492b-a09b-eac201d84997","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":39,"snapshot_sha256":"be29028249c2ada3cad499e9bdffbaf2e2e25d85dac27f663e68916b96e4fb79","internal_anchors":3},"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":"90359a2f-0ac8-4e09-9fb8-3fe11b5fe113"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzTgMYdkiGs5soBA/lzo//qjA+02h5tSKBnhBtsyEzYHbfJquvbSf+Xa+4OJEoPdfLRJCth8z973cBZflSMVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:56.316687Z"},"content_sha256":"bc48e3209003b0cba185be2dad9eb22697c14f21cf6f406524b5ae15248dea30","schema_version":"1.0","event_id":"sha256:bc48e3209003b0cba185be2dad9eb22697c14f21cf6f406524b5ae15248dea30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3BEO6GS24QYWJENHS3D4267IR/bundle.json","state_url":"https://pith.science/pith/Q3BEO6GS24QYWJENHS3D4267IR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3BEO6GS24QYWJENHS3D4267IR/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-08T15:38:56Z","links":{"resolver":"https://pith.science/pith/Q3BEO6GS24QYWJENHS3D4267IR","bundle":"https://pith.science/pith/Q3BEO6GS24QYWJENHS3D4267IR/bundle.json","state":"https://pith.science/pith/Q3BEO6GS24QYWJENHS3D4267IR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3BEO6GS24QYWJENHS3D4267IR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q3BEO6GS24QYWJENHS3D4267IR","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":"8b5e600c58b8ca3c537b0d3ea5a0ee86981c5b76710e95d8d77a95e6db77c6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T18:01:01Z","title_canon_sha256":"83766f2db151ee9544b04b2cbd08f1152ef565d48245ae2f50aba990a04005c4"},"schema_version":"1.0","source":{"id":"2605.13980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13980","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13980v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13980","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"Q3BEO6GS24QY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3BEO6GS24QYWJEN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3BEO6GS","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bc48e3209003b0cba185be2dad9eb22697c14f21cf6f406524b5ae15248dea30","target":"graph","created_at":"2026-05-17T23:39:13Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The overall spatial complexity is bounded by q = O((n + d²)log₂ N) logical qubits ... quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the in-place two's complement arithmetic and routing operations into a single recycled accumulator can be synthesized gate-by-gate without introducing hidden overhead or non-reversibility for arbitrary polynomial degrees and coefficient sizes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits."}],"snapshot_sha256":"69f4d62f9940aab135971e965c124e95092f1069202c263e377a4932300e968b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the worst case. In this work, we introduce a fully reversible quantum algorithmic framework tailored to solve arbitrary polynomial Diophantine equations over bounded integer domains. The core of our approach is the explicit, gate-level synthesis of an evaluation oracle for amplitude amplification. By coherently evaluating polynomial constraints via in-place two's","authors_text":"Gabriel Escrig, M. A. Martin-Delgado","cross_cats":[],"headline":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T18:01:01Z","title":"From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems"},"references":{"count":39,"internal_anchors":3,"resolved_work":39,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Let the variablex i be encoded in aw- bit register,|x i,w−1","work_id":"f260fbbb-7f01-4d0c-9f97-4d441c8af91c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Instead of a variable controlling its own shifted addition, the qubits ofx i act as controls for the logically shifted additions of the dis- joint registerx j","work_id":"aa672101-3a16-4249-a79e-62c6af7839c0","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Specifically, we adopt the BBHT search strategy [22]","work_id":"f2584ed2-ab2c-4128-bd80-0016c34a6956","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Quantum Counting Alternatively, when the primary goal is to deter- mine the exact number of solutions, the operatorGis integrated into a Quantum Counting framework [23]. This framework interpretsGas a","work_id":"46710932-ed1f-4d8f-a30c-7ebeddae3728","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, 4th ed. (Oxford University Press, 1975)","work_id":"cdb55880-6e1f-492b-a09b-eac201d84997","year":1975}],"snapshot_sha256":"be29028249c2ada3cad499e9bdffbaf2e2e25d85dac27f663e68916b96e4fb79"},"source":{"id":"2605.13980","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T05:45:11.390233Z","id":"90359a2f-0ac8-4e09-9fb8-3fe11b5fe113","model_set":{"reader":"grok-4.3"},"one_line_summary":"Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A reversible quantum oracle framework solves bounded Diophantine equations with quadratic speedup and O((n + d²) log N) qubits.","strongest_claim":"The overall spatial complexity is bounded by q = O((n + d²)log₂ N) logical qubits ... quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions.","weakest_assumption":"That the in-place two's complement arithmetic and routing operations into a single recycled accumulator can be synthesized gate-by-gate without introducing hidden overhead or non-reversibility for arbitrary polynomial degrees and coefficient sizes."}},"verdict_id":"90359a2f-0ac8-4e09-9fb8-3fe11b5fe113"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff84438986e1efbfc912dae4148da2b2b198412c22d95d3a6abf112951c7032b","target":"record","created_at":"2026-05-17T23:39:13Z","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":"8b5e600c58b8ca3c537b0d3ea5a0ee86981c5b76710e95d8d77a95e6db77c6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T18:01:01Z","title_canon_sha256":"83766f2db151ee9544b04b2cbd08f1152ef565d48245ae2f50aba990a04005c4"},"schema_version":"1.0","source":{"id":"2605.13980","kind":"arxiv","version":1}},"canonical_sha256":"86c24778d2d7218b248d3cb63e6bdf446ba8fd9ad6e0079bdb77ebd4779567f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86c24778d2d7218b248d3cb63e6bdf446ba8fd9ad6e0079bdb77ebd4779567f3","first_computed_at":"2026-05-17T23:39:13.387462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:13.387462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BdAWWevg5d9Tk7eR4u2CrfMYzcWDLSlCGM26fGqGuSKoYAubxtpzh94oPWV7bwS7LqWFpmcRT5AT32EswHuQBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:13.388130Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff84438986e1efbfc912dae4148da2b2b198412c22d95d3a6abf112951c7032b","sha256:bc48e3209003b0cba185be2dad9eb22697c14f21cf6f406524b5ae15248dea30"],"state_sha256":"40e8e4990ef4d87c676df5d1c0280c5aa4c5ddbc7ff27a0ec0c2730cbf2e2862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h87p0nl1npaZ4Kr05ExymZzzBxWu5FF9d0rhvXG0shDc79LRwb97WwpKPlgJcM3AIJXzMwMmUUzuVMgflqsSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:38:56.321231Z","bundle_sha256":"03ee8a2ec1da144cf68d45adbfec96abc09a11d7635a6fd4debd9244cde213fc"}}