{"as_of":"2026-08-12T21:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7699bb96cebebc946d9f686696f6c3a771d895141abe4b78ca1760706e6219fe","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T06:00:58.842641Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.08888/citation-record","integrity":"/paper/2607.08888/integrity","json":"/paper/2607.08888/citation-record.json","paper":"/paper/2607.08888"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:00:58.842641Z","title":"Impossibility of succinct quantum proofs for collision-freeness","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:a69edffa078ca3b9ff7e83ef3f417bbadb74878481db6a87e1c9fda7e27ad3d3","observation_id":"324ef86e-1f99-4d81-8e67-d7610314f5e2","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum lower bounds for approximate counting via Laurent polynomials","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:8b1a94ff5820c82e16b50029206d1df5cfd2964e4d24b29ab88884b49bd20ad3","observation_id":"4bda98d5-7c00-4346-aa73-98918c53f408","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:1050191a9fb293f29635006b592f6ec5f8a30363c66faf4484226e29514c9d28","observation_id":"cce2ac2b-706d-4f51-8969-bc7fec730abf","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum lower bounds for the collision and the element distinctness problems","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:59c065e2e0d7bc673a547e53b37596c91e551119018a7b3461100d607d6f3e53","observation_id":"2e6fa37f-d9ae-4c05-8ca6-325ca5f5c911","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum lower bounds by polynomials","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:ddee420278b5347e87775c14e919efc5ada13a4ba87d9f28856222ce0ed631d9","observation_id":"9265197a-24b4-4976-a86e-a5cea90fb282","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Bounds for small-error and zero-error quantum algorithms","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:3afc04c82497c1eef47019adc950118ed0210fb8ab806099ff1847c135fa262c","observation_id":"593de891-f272-4b03-8008-9462106df0a2","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Batch proofs are statistically hiding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:434f6078d5572c25ebcff512ed7c52dcb21ddf376f42770d0098d623bbac5617","observation_id":"0ecb3d88-075a-46a3-9d4a-8400fe40ccc2","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"The polynomial method strikes back: Tight quantum query bounds via dual polynomials","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:49756dbdf6f66bab4a9ec9efab0c3939c075a862cb516b32c6f23b3ce7baf65e","observation_id":"369e8b98-b0a8-4ca5-ace2-bf12e8f90d92","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Dual lower bounds for approximate degree and M arkov-- B ernstein inequalities","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:49e5cfa36a59dd8ac28a05ef995fef376b96ac96e5651e8b1fe8b5fda703250a","observation_id":"bf28397d-b9ef-4076-9b2d-e105c94654fb","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Hardness amplification and the approximate degree of constant-depth circuits","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:083acb20de1b90ac148ec6fb1fcf938639d07b2bbecd5dc8a645986eba0d5e94","observation_id":"64b76637-883a-4e68-b7a9-4be2095f025a","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"The large-error approximate degree of AC^0","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:c68e22a2b61b0ee2829b6c9be093e0c0f9a005dbc8946eb381baa5f03104333e","observation_id":"f7a98e64-ad4b-46df-a5da-98989682c867","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Approximate degree in classical and quantum computing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:9f78d3bb9a15c6892835c4f303075036c979f0f7051e2f04c2f5d7de7aeb06a6","observation_id":"529c0e4f-6476-444a-935a-7b9323eb1599","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Non-interactive batch arguments for NP from standard assumptions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:e1a609ad301f734eeee2089347d5a4e1cc8aad02897b9196ee128d9f99949697","observation_id":"aed46dd8-9312-4a6d-b95e-2d69269965cb","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Snargs for P from LWE","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:160f44300b46d495a8fb3cff3bf196f396aab38cf438c10934f76b1bc2ef93ca","observation_id":"92907515-b297-4b2c-95ed-a26fb9afdab5","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Non-interactive zero-knowledge from non-interactive batch arguments","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:218efffcbdae8313d8f6d60c336b59bc2e1bc50db7f7cd5026fd17a1f2d3cfac","observation_id":"625c9071-d7b7-4894-a78d-336f346f0b99","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Rate-1 non-interactive arguments for batch- NP and applications","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:146e4ddbb96c3f170885ec50950e4586b496227ef45901614ccbf7b652da2d2f","observation_id":"23a6664e-e66d-4f9c-8322-3d9f8e273943","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum proofs of proximity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:952d4eae999fe9b064e0b5907e80356d870e48829d592f0ffa5421325941f184","observation_id":"7db44cf8-04d7-4dbc-8dfc-f4dfa73eebff","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Succinct arguments for batch qma and friends under 8 rounds","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:a9d9601b4b74c4bdd0139c818c09e74ce805d8c8e19b9b0643049f0037b2b905","observation_id":"f297dfb2-1a15-4ebf-819b-8ef5952f4e4b","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:ec064e764829358362708bfbc55b385a36cdfec8258ad2fc6c54d7d4536603de","observation_id":"047f333a-aa2c-483d-a205-f3052dec71b7","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum search on bounded-error inputs","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:d71beac0e757db348d31cf0ad05cd38e2cdcefb59e8ca08f1bb4d8c7bf48ef2a","observation_id":"68ed2fdf-defb-4d7c-af4b-885450e6fee0","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"On A rthur M erlin games in communication complexity","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:2e934245c29cb41a630ab948d77119d4834e8ddad6882bc3cff0ec0e40004809","observation_id":"99a6a2a1-ba7f-47a4-af0d-c3405602d0ab","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Boosting batch arguments and ram delegation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:7ba6b050a9f83455f66f3ac4d1046438576e880e6e602753818876d17b2d799a","observation_id":"1d5b298d-5ef6-49a6-a14e-a25cf904f893","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"How to delegate computations publicly","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:da1e38623e2b961f66033f0af47b990f97656bd8f6c22496b14ad93bb14661b6","observation_id":"c0ec939b-96cc-4b6c-bcf6-12668d12344d","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Batch verification for statistical zero knowledge proofs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:d28f0712dfc990527b91e70aedf448d3622d36f8ad52f29ab4ef8bd59c5f6864","observation_id":"87221750-ccd2-47db-b31c-123b08786196","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Public-coin statistical zero-knowledge batch verification against malicious verifiers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:abe0995a1fd5185ec5fcd46f91529a8a435799392f0b679c8f763698e344fa13","observation_id":"69f0c45e-e89c-441b-8d14-89a5521ac681","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Doubly-efficient batch verification in statistical zero-knowledge","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:e810c875db2d266c8bebd02ba866b8d9b91b82cfa370c73e46af5cce89e9e391","observation_id":"a76d43ae-3834-47b0-860d-2459f8f528ae","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Somewhere statistical soundness, post-quantum security, and SNARGs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:384328a049165fbf540a08bfe0cb82ea5d5387cdda0d6880c223d43cf3dd080e","observation_id":"480fccb3-dfa3-44e7-9bed-9795c525119a","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Lower bounds in communication complexity based on factorization norms","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:c2afa8d3d25855766506df91aa28318c58e8e22220592a380af59540629a1537","observation_id":"0ae4a027-a7f4-4413-8ce7-210975aed508","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Strong batching for non-interactive statistical zero-knowledge","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:ebb6b9621c5fe4d532fbb9b651e235586acd8552eb1e6dc7f8eadc366f761495","observation_id":"34b5d91d-624c-4bd7-b65c-5a2a917661b6","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Mande, Justin Thaler, and Shuchen Zhu","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:ad235b92a060a0a3cadab45ee24f48cf75ed4c21fcc68ee7aad156d968201e63","observation_id":"867dbb05-ad15-4ef4-afa2-e9a16a833922","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Quantum A rthur- M erlin games","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:ba49673ade9b3870d7030f8a21352f1dfb74056a14001659aae56b6e22055a68","observation_id":"fccf4c28-1e0c-45ec-869c-94f838424018","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.01945","last_updated":"2025-09-02T04:33:09Z","snapshot_observed_at":"2026-08-06T12:12:03.120440Z","submitted_at":"2025-09-02T04:33:09Z","title":"Quantum Statistical Witness Indistinguishability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.01945","snapshot_observed_at":"2026-07-13T06:00:58.842641Z","title":"Quantum statistical witness indistinguishability","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"cited_paper":"/paper/2509.01945","citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:7f03199d3669a18bf7458e1ba873172138d63c7816a98a60938151515680cc18","observation_id":"262d2c92-5e8b-4d8d-8ef9-73b26dae5ad4","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Batch verification and proofs of proximity with polylog overhead","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:53afa443033f726feb2ec28f4a8b55fdf0bf8d98239a0102bd0763c837c1fbfc","observation_id":"37276557-e86f-4dc6-a133-0f092699096f","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Constant-round interactive proofs for delegating computation","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:d520beed5c374286d4edaa3112eac14bac2f50db21f2ca3ee6bb34cf845e8e3d","observation_id":"ca803d29-0a88-4823-9b3c-722932bea59a","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Rothblum, and Ron D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:c43804f1a3c72319d939b0c3af08e932c0eb196e7568b10403579c5c0f171996","observation_id":"e61c68b6-38ee-4376-9341-26d58286c6b3","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"On the power of quantum proofs","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:dfc1ac92495aa5e5b3c0a5d5f60ede82bf400e8d161d75558092682d831f55e5","observation_id":"c4d3634d-66b1-4810-9c8f-0c9e88157680","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:a7d1a5b7be9a4469feb51e7e08d04c2276cb83f1add22cb9e57b68c608112c78","observation_id":"f2c5ef03-0b21-4a5e-a945-5ef34e46843d","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:132560eac18c454e5a424bf65b41c4c46d5d44608b57141dbdc81056de6bae4f","observation_id":"b0b28bc0-b71e-4bf4-a676-a6a8f050c427","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:cff024e0b083ec96e776722f7539856b30420f4f8d97afad39ada7e9afee6655","observation_id":"a5c1d4ab-ff5d-4163-917d-e877222bb469","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:da7f691a9954eb66cdd873811aed5bc406e95d97646eb3a5ae69feb308f01684","observation_id":"ca1c4df8-2236-4751-b0ac-ef5c63cf3c74","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Sherstov and Justin Thaler","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:f2dee5f14988dabcfe41a8b1699964d56263a9b5178d0715d8c370b7e0c8b1f0","observation_id":"b39a5547-c949-4f33-afd9-a92e9fbfc10b","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","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-07-13T06:00:58.842641Z","title":"Batch arguments for NP and more from standard bilinear group assumptions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-13T06:00:58.842641Z"},"links":{"citing_paper":"/paper/2607.08888"},"observation_digest":"sha256:070790b923bbb00f799d5f4d33278d3944f98d9fb5c715d19b3ff8c7b8ab51f7","observation_id":"2680acd1-6c56-4c64-a4bf-b69d7783a759","resolution":{"observed_at":"2026-07-13T06:00:58.842641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.08888","last_updated":"2026-07-09T19:26:15Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-03T17:40:37.324041Z","submitted_at":"2026-07-09T19:26:15Z","title":"QMA Lower Bounds for Batch Verification via Approximate Degree"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.08888."}