{"as_of":"2026-08-10T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee4aa551cd3c67df0054e2dec92c9ebdc3e119402dfda0c140fbd275c2b664ce","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:44:06.534952Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T17:19:48.533188Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.14650","snapshot_observed_at":"2026-07-31T17:19:48.533188Z","title":"Horinaga and T","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28120","last_updated":"2026-07-30T12:29:15Z","snapshot_observed_at":"2026-08-09T11:44:31.494204Z","submitted_at":"2026-07-30T12:29:15Z","title":"Approximate sampling from decoded quantum interferometry via Markov chain Monte Carlo methods","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T17:19:48.533188Z"},"links":{"cited_paper":"/paper/2607.14650","citing_paper":"/paper/2607.28120"},"observation_digest":"sha256:9b54d4e03b218f34402bad13576fa2367dec82e9f8ae0ab6c2987549bfa00fd0","observation_id":"a425b91c-510a-412e-aa9f-286c475a1501","resolution":{"observed_at":"2026-07-31T17:19:48.533188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.14650/citation-record","integrity":"/paper/2607.14650/integrity","json":"/paper/2607.14650/citation-record.json","paper":"/paper/2607.14650"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.202077Z","title":"[CHK26] Soham Chatterjee, Prahladh Harsha, and Mrinal Kumar","venue":null,"work_id":null,"year":2040},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.202077Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:faeeefcc2b9598d20835dad5a4dd9e57ce1a4769ff690a61219f006a0e739668","observation_id":"1a0deda8-d766-42fb-9405-62ab806f1783","resolution":{"observed_at":"2026-08-02T01:44:05.202077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.620979Z","title":"An improvement upon the bounds for the local leakage resilience of shamir’s secret sharing scheme","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.620979Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:76632e6b924ba79746c78be9e51936209ea628c904594da589f4c71641196f69","observation_id":"4ba1517e-aa38-4f51-9247-f81196b9c8ba","resolution":{"observed_at":"2026-08-02T01:44:05.620979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.878500Z","title":"[Lin10] Yehuda Lindell","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.878500Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:de7c00e0cdd5660b7fe15c30d956eefb3070ad92e870be686187ef7a7703a155","observation_id":"e6fb6ce4-7dc1-41f9-b6ad-9af5a4fa478d","resolution":{"observed_at":"2026-08-02T01:44:05.878500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.151824Z","title":"Maji, Anat Paskin-Cherniavsky, Tom Suad, and Mingyuan Wang","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.151824Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:e5a05eb062452b143a772216cd8c2226a17abda3bd7d4a2c2257b5c652fccf09","observation_id":"f0112efe-83bb-4333-838c-6974c1a2e9fe","resolution":{"observed_at":"2026-08-02T01:44:06.151824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.224047Z","title":"51 [Ngu24] Hai H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.224047Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:2538aeb56e045211cda8cc98b33659e484661506628125b5f44db781dd7ed201","observation_id":"ec592eca-e3c7-464f-aaa2-b0670340cf59","resolution":{"observed_at":"2026-08-02T01:44:06.224047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.303290Z","title":"A decade of lattice cryptography","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.303290Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:5f33778c6679020b3942708a2f8dfe75c377c0bb5f362fd2b3178656e280408e","observation_id":"652c1388-4c2d-42e5-b8d4-ee91c31a8e1a","resolution":{"observed_at":"2026-08-02T01:44:06.303290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.09533","last_updated":"2026-04-10T17:50:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-10T17:50:46Z","title":"On Worst-Case Optimal Polynomial Intersection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.09533","snapshot_observed_at":"2026-08-02T01:44:06.471089Z","title":"[vDHI06] Wim van Dam, Sean Hallgren, and Lawrence Ip","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.471089Z"},"links":{"cited_paper":"/paper/2604.09533","citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:4036b63db8820a198a6109ea62807ad004a03a8b0794f207c84455ea27d82ef0","observation_id":"380da320-4f19-4dcf-89e6-cd251ddbd45e","resolution":{"observed_at":"2026-08-02T01:44:06.471089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.534952Z","title":"How to record quantum queries, and applications to quantum indiffer- entiability","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.534952Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:1cebc418ba8cb78733a9d1e785db6b165fe411107ffb8c8c363fd08b8f92b2a0","observation_id":"0b0040a4-5f6e-411c-ae51-247e8cdc8f41","resolution":{"observed_at":"2026-08-02T01:44:06.534952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.401745Z","title":"Efficient public key encryption based on ideal lattices","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.401745Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:485d21a8d02475dbb75b70b15bccd8e01b3437cb1a39e662a431c9604ff7cc47","observation_id":"5fe69fea-0693-4085-a80a-006355464411","resolution":{"observed_at":"2026-08-02T01:44:06.401745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.120862Z","title":"On the quantum equivalence betweens|lwe⟩and isis","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.120862Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:6ceba3935442609f72d28174dfe322dab5ad7da89643525e80aa48b648fe5626","observation_id":"54d29caa-63eb-4a78-9866-c23bf4843525","resolution":{"observed_at":"2026-08-02T01:44:05.120862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.988011Z","title":"[LPR13] Vadim Lyubashevsky, Chris Peikert, and Oded Regev","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.988011Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:839012259e38aa9de3996ebcfabef4319027cb1fee5f575c3bcf89368f34d22d","observation_id":"79cf90ea-18e8-4716-b393-6bceed0ae1ed","resolution":{"observed_at":"2026-08-02T01:44:05.988011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:06.067444Z","title":"Maji, Hai H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:06.067444Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:b8a7be4667829846900642fd4134e8e53481d9e4bb62f65cc264208be08cb098","observation_id":"b222778f-fba0-4afd-b028-67c00d961764","resolution":{"observed_at":"2026-08-02T01:44:06.067444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:04.994659Z","title":"Learning with errors and extrapolated dihedral cosets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:04.994659Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:a5c803d536f52ed53a320ed9cc4e9a1ec30e727cb8415de2dfda6eb23cb6220c","observation_id":"b3006a52-28e6-4a80-8564-9b4c0a5411f6","resolution":{"observed_at":"2026-08-02T01:44:04.994659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.445960Z","title":"The quantum decoding problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.445960Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:a7289f26a8e20db568f2ab1aad82d26c47722dca7a12cf568825c9052aaf0b1e","observation_id":"e90c67f1-b1a1-4d4b-a5b1-aa393597fdd3","resolution":{"observed_at":"2026-08-02T01:44:05.445960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.762027Z","title":"New bounds on the local leakage resilience of Shamir’s secret sharing scheme","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.762027Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:202db7e54ccfd57f99f5228498dad5ff4a33a36b3337bf82fa177e51f02c6bb0","observation_id":"9b6a1523-74b2-484f-b2f1-c633afd3742c","resolution":{"observed_at":"2026-08-02T01:44:05.762027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:04.870234Z","title":"[BDG+26] Pierre Briaud, Itai Dinur, Riddhi Ghosal, Aayush Jain, Paul Lou, and Amit Sahai","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:04.870234Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:1c4bddc71ef05458344609c3caa5f389f228f38854d611e95ee5ca2b454c31ad","observation_id":"c28ebed8-d7dc-4410-8819-24cf55747549","resolution":{"observed_at":"2026-08-02T01:44:04.870234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:44:05.359474Z","title":"Quantum algorithms for variants of average-case lattice problems via filtering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:05.359474Z"},"links":{"citing_paper":"/paper/2607.14650"},"observation_digest":"sha256:3b882621fbbfe4398a7d41e39c6b9c701ac47784d0487d00573aab8848e0c25f","observation_id":"e5c5d94a-f2cb-44ab-a0cf-be0406f4bdbb","resolution":{"observed_at":"2026-08-02T01:44:05.359474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.14650","last_updated":"2026-07-16T07:18:57Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T01:44:02.597935Z","submitted_at":"2026-07-16T07:18:57Z","title":"Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2607.14650."}