{"as_of":"2026-08-09T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cd00b5a74269bf08029ea6725f8932da41e1deb66b7d8bfcc7f5d7df946e1d0","coverage":[{"denominator":98,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":98,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T06:05:38.945129Z","state":"measured"},{"denominator":98,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":98,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.08517/citation-record","integrity":"/paper/2607.08517/integrity","json":"/paper/2607.08517/citation-record.json","paper":"/paper/2607.08517"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.709491Z","title":", title =","venue":null,"work_id":"16b8257d-287f-4d9f-9eb4-f1a397c519ca","year":2002},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:0e09af6c9b3ef81ed4eb413b398d6cad92e09cb2990faf0ebd7779a30724d6a4","observation_id":"eab6d98b-942f-4b10-a82e-082ece2af69c","resolution":{"observed_at":"2026-07-10T06:06:50.710574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.696953Z","title":"Quantum Cryptanalysis of Hash and Claw-Free Functions , booktitle =","venue":null,"work_id":"defeadcd-4fc0-49e3-a2c3-33fa0d1276e4","year":1998},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:ba5281e93f812e7c628dfd2fecc31fac4377c745a8d147bd7ce3effe04811e41","observation_id":"91dffa36-aab9-4756-b5f2-12279a77c1ed","resolution":{"observed_at":"2026-07-10T06:06:50.698060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0111102","last_updated":"2001-11-20T00:38:26Z","snapshot_observed_at":"2026-08-02T13:57:52.864605Z","submitted_at":"2001-11-20T00:38:26Z","title":"Quantum Lower Bound for the Collision Problem","version":1},"cited_work":{"arxiv_id":"quant-ph/0111102","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0111102","snapshot_observed_at":"2026-07-10T06:06:50.388731Z","title":"Quantum Lower Bound for the Collision Problem","venue":"quant-ph","work_id":"c46d16eb-55b4-4e50-a8ae-5eab3c35ae9c","year":2001},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0111102","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:3dc21d1ca5440aa48e5c0601eb55f9b19c5f899190e57b5dc526a6c4207f689d","observation_id":"4d4c2df9-429f-4e8c-b1de-b48882c74050","resolution":{"observed_at":"2026-07-10T06:06:50.390445Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0112086","last_updated":"2001-12-15T06:00:58Z","snapshot_observed_at":"2026-08-06T13:02:21.414676Z","submitted_at":"2001-12-15T06:00:58Z","title":"Quantum lower bounds for the collision and the element distinctness problems","version":1},"cited_work":{"arxiv_id":"quant-ph/0112086","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0112086","snapshot_observed_at":"2026-07-10T06:06:50.388913Z","title":"Quantum lower bounds for the collision and the element distinctness problems","venue":"quant-ph","work_id":"2db215a4-aa6d-475d-9b6a-a6c6d37f35a2","year":2001},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0112086","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e35b5faca6f2108a28de65820b187245143154d7f9a450e9a2ebb5eb9e86df67","observation_id":"a1cb09e2-8e1d-4bca-b2b7-37946ca79fc3","resolution":{"observed_at":"2026-07-10T06:06:50.390253Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0311001","last_updated":"2014-04-30T17:07:30Z","snapshot_observed_at":"2026-07-07T07:13:49.512322Z","submitted_at":"2003-11-01T02:27:48Z","title":"Quantum walk algorithm for element distinctness","version":9},"cited_work":{"arxiv_id":"quant-ph/0311001","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0311001","snapshot_observed_at":"2026-07-10T06:06:50.382900Z","title":"Quantum walk algorithm for element distinctness","venue":"quant-ph","work_id":"8192f6ef-6b50-4b0a-916d-89d87e05eba0","year":2003},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0311001","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:08fdc4ffb6c8e72ce839c912e78d141b84b85fbb96cc9c9a72318ddf44c97b5c","observation_id":"68bfeda5-64af-4731-9731-6c6a8fba4579","resolution":{"observed_at":"2026-07-10T06:06:50.384240Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.676308Z","title":", title =","venue":null,"work_id":"3551ed1b-9ac1-44e7-992b-09993ac19c73","year":2002},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:498025e626001ba01f49cb93eae6beae1cab880f4760658a3301b25791ff7cac","observation_id":"7ea18d65-fda9-472f-a750-5beb64e43cef","resolution":{"observed_at":"2026-07-10T06:06:50.677460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.724559Z","title":null,"venue":null,"work_id":"44f2a03b-00d7-4365-bef1-adef716184d2","year":2008},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:902d9554f59c5db0868adf944151f70c9fa30ad46c71700a6d5439096e6b9026","observation_id":"25298229-b438-4d7c-8f20-c69ef6cde0e9","resolution":{"observed_at":"2026-07-10T06:06:50.725644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.662671Z","title":"Advances in Cryptology -- CRYPTO 2018, Part II , editor =","venue":null,"work_id":"b1ab072f-bcd6-400f-9489-c0fb0b1f6026","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:eefa25be4542d1db2b90fbc37c758a14bb6734a242c2d3b64358803466d46a71","observation_id":"4fe92ca7-e89a-4b45-9c87-3fd5320ab5a2","resolution":{"observed_at":"2026-07-10T06:06:50.664140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.695282Z","title":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages =","venue":null,"work_id":"ce87f371-3116-4f94-b550-3d92fd8167d0","year":2025},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7d908c6acfccc45d8e167c558e6ac05de670bf219c739497ca5c04203b08b742","observation_id":"0cea9cae-3654-4ab2-8745-0c84bd4f8942","resolution":{"observed_at":"2026-07-10T06:06:50.696450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.686460Z","title":"and Chakrabarti, Amit , title =","venue":null,"work_id":"9ca3145d-a700-4665-b130-ab62e61f7061","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6ca52c0b7f56042260167bc79378cc31ee098ce0735560e8e5b83e34a8901b3c","observation_id":"33cc369b-bbbd-43b9-af9b-3c2bcc2286c7","resolution":{"observed_at":"2026-07-10T06:06:50.687530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.1458","last_updated":"2013-04-04T18:30:28Z","snapshot_observed_at":"2026-07-06T03:10:25.060708Z","submitted_at":"2013-04-04T18:30:28Z","title":"How Hard is Counting Triangles in the Streaming Model","version":1},"cited_work":{"arxiv_id":"1304.1458","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.1458","snapshot_observed_at":"2026-07-10T06:06:50.370949Z","title":"How Hard is Counting Triangles in the Streaming Model","venue":"cs.DS","work_id":"e078681d-62b9-48a1-927e-7032ba4be88f","year":2013},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1304.1458","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6e4a9897bf14a2be8c583bfeb9cc143c6971075fe9284385da342ed9de1eb47e","observation_id":"7e8d8caf-57ad-4fd1-a006-9a30429e232a","resolution":{"observed_at":"2026-07-10T06:06:50.372255Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.733095Z","title":"Theoretical Computer Science , volume =","venue":null,"work_id":"f14ae0c1-24d5-4565-b158-e89bf1756d20","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:ba01900d22190815762e589cd61fd6ef415cedf640d72fbbe7a76d7fc5600de3","observation_id":"f8a16844-91e8-4b29-85c2-3d6edfa2ff5b","resolution":{"observed_at":"2026-07-10T06:06:50.734148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.721486Z","title":", title =","venue":null,"work_id":"502d20db-1884-4949-b45b-14acfd450545","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:226711f691262917361d2b34acaba22a00f2c88e0e6992f82173e7acd1743de5","observation_id":"819570a1-33fb-4693-bd36-c58414f3b449","resolution":{"observed_at":"2026-07-10T06:06:50.722671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0611209","last_updated":"2008-02-13T10:45:18Z","snapshot_observed_at":"2026-08-06T05:41:33.706313Z","submitted_at":"2006-11-20T17:35:42Z","title":"Exponential separations for one-way quantum communication complexity, with applications to cryptography","version":3},"cited_work":{"arxiv_id":"quant-ph/0611209","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0611209","snapshot_observed_at":"2026-07-10T06:06:50.443264Z","title":"Exponential separations for one-way quantum communication complexity, with applications to cryptography","venue":"quant-ph","work_id":"de3ce47b-63fd-4313-aa99-8f48466af6fd","year":2006},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0611209","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:030a85e13ddf516e50bd259b689413504cc628562915a1d36c0407eddf581786","observation_id":"1f2d3573-1ba2-4bca-9a36-2a97cbf8fd0e","resolution":{"observed_at":"2026-07-10T06:06:50.444462Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.00029","last_updated":"2022-08-09T21:16:42Z","snapshot_observed_at":"2026-07-06T13:36:51.591221Z","submitted_at":"2022-07-29T18:20:03Z","title":"Communication Complexity of Collision","version":2},"cited_work":{"arxiv_id":"2208.00029","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.00029","snapshot_observed_at":"2026-07-10T06:06:50.446531Z","title":"Communication Complexity of Collision","venue":"cs.CC","work_id":"ebf41b5b-d575-47d7-901e-83e6304b0fb5","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2208.00029","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:bb82374fc89f721a1c0969e722ec6650f6def29820cd1b1e66584312edc8d808","observation_id":"3604eafa-f4d0-406a-a7bf-042bf1b1d4e0","resolution":{"observed_at":"2026-07-10T06:06:50.447969Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.718149Z","title":"36th Computational Complexity Conference (CCC 2021) , pages =","venue":null,"work_id":"3675a4f3-86ea-4f25-abba-e2e8b3bea383","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:914d9b737f2af6805244446a289f93f12593788f77a8a5beaa1559becae55a2f","observation_id":"b6c53a13-0040-4e68-a926-6906de59d5b4","resolution":{"observed_at":"2026-07-10T06:06:50.719249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.01785","last_updated":"2021-07-14T21:58:25Z","snapshot_observed_at":"2026-08-03T12:20:10.709069Z","submitted_at":"2021-05-04T22:39:38Z","title":"An Optimal Algorithm for Triangle Counting in the Stream","version":2},"cited_work":{"arxiv_id":"2105.01785","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.01785","snapshot_observed_at":"2026-07-10T06:06:50.409585Z","title":"An Optimal Algorithm for Triangle Counting in the Stream","venue":"cs.DS","work_id":"296e3c81-c4ea-4602-bb97-3fcd7dd51352","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2105.01785","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:722f7c4b99811000a949154342a9bc8eaa1af9a9197f9f0be019be538a0b5279","observation_id":"ee641f2c-fd53-4bad-a199-d6f8c19b70e3","resolution":{"observed_at":"2026-07-10T06:06:50.415451Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04633","last_updated":"2021-11-12T23:25:52Z","snapshot_observed_at":"2026-08-03T12:20:06.616183Z","submitted_at":"2021-06-08T18:34:22Z","title":"A Quantum Advantage for a Natural Streaming Problem","version":2},"cited_work":{"arxiv_id":"2106.04633","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04633","snapshot_observed_at":"2026-07-10T06:06:50.349972Z","title":"A Quantum Advantage for a Natural Streaming Problem","venue":"quant-ph","work_id":"9668a22e-830c-4395-9050-af43637b6a85","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2106.04633","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:ae7a2319fbb1e528b683fd1b2569554c2e9e8ce4ae2a9ad9a34c34ba4f26be0e","observation_id":"614a8367-57e7-452f-aa01-71b0d59a7950","resolution":{"observed_at":"2026-07-10T06:06:50.351732Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.04995","last_updated":"2018-08-15T07:58:32Z","snapshot_observed_at":"2026-07-06T06:55:44.797065Z","submitted_at":"2018-08-15T07:58:32Z","title":"The Sketching Complexity of Graph and Hypergraph Counting","version":1},"cited_work":{"arxiv_id":"1808.04995","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.04995","snapshot_observed_at":"2026-07-10T06:06:50.419228Z","title":"The Sketching Complexity of Graph and Hypergraph Counting","venue":"cs.DS","work_id":"87d1dd0d-99e2-486f-9ab7-135233e48c5e","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1808.04995","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:024b2833a3b5e5434e1dac355b0b84c4d070e1b4f9134ee7b8a9427c9de81c93","observation_id":"ec05132b-55bb-49e2-9f71-a7b6a7c00a5b","resolution":{"observed_at":"2026-07-10T06:06:50.423588Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02066","last_updated":"2019-04-16T23:42:36Z","snapshot_observed_at":"2026-08-03T12:20:13.053063Z","submitted_at":"2016-10-06T21:00:01Z","title":"A Hybrid Sampling Scheme for Triangle Counting","version":3},"cited_work":{"arxiv_id":"1610.02066","doi":null,"metadata_source":"pith","pith_arxiv_id":"1610.02066","snapshot_observed_at":"2026-07-10T06:06:50.394305Z","title":"A Hybrid Sampling Scheme for Triangle Counting","venue":"cs.DS","work_id":"899fb144-8e69-4c2a-bbf3-94d39e8c0c33","year":2016},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1610.02066","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7f8bd1d21a549c29ea1a709f7274149671a990419e09f7ad9f3f536ae837ab78","observation_id":"0ecf9411-71f2-4c33-b3f3-e9c21bba81ca","resolution":{"observed_at":"2026-07-10T06:06:50.395551Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.02578","last_updated":"2022-01-28T15:58:35Z","snapshot_observed_at":"2026-08-05T17:38:50.030098Z","submitted_at":"2021-07-06T12:34:46Z","title":"Noisy Boolean Hidden Matching with Applications","version":2},"cited_work":{"arxiv_id":"2107.02578","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.02578","snapshot_observed_at":"2026-07-10T06:06:50.403292Z","title":"Noisy Boolean Hidden Matching with Applications","venue":"cs.DS","work_id":"aa98766a-db50-43f9-bae9-bcb6d4077462","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2107.02578","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:bdda099cebee855c2a3f6bd119485843d4f4a2f6b46f227711445683738358ea","observation_id":"434b956b-d79c-4d1a-bf81-7616d1f5e5ee","resolution":{"observed_at":"2026-07-10T06:06:50.404514Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.703545Z","title":"1991 , doi =","venue":null,"work_id":"b2e0473f-69f6-41e9-be58-ba3ed8cfbea0","year":1991},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:dfa9cf2d1b59dba48f245a7d8c126b6d25371d6d58b9da0d2d7f417e1e61795e","observation_id":"998ada90-c96b-4e87-aba8-4979d2c64030","resolution":{"observed_at":"2026-07-10T06:06:50.704684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.681057Z","title":null,"venue":null,"work_id":"6099c2db-48e3-46cc-9ca7-0fc81fba7ed3","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7edb7dc826ac6ef35abbb1e0051b0b392c7e3903390b6f3ea132119679c7b06e","observation_id":"023e8192-30f0-477a-85d0-d31c66c68a6e","resolution":{"observed_at":"2026-07-10T06:06:50.682438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.679421Z","title":"Non-Commutative Khintchine and Paley Inequalities , journal =","venue":null,"work_id":"f6fd1879-2717-440a-b1de-0b1c7cebdc72","year":1991},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d154e5f0100851738ad19b51d59e479ca93e2f173d5b7d7d1b31e88245f7e976","observation_id":"36946cb9-11bc-4986-a757-c3f207cb4d5f","resolution":{"observed_at":"2026-07-10T06:06:50.680517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1501.01571","last_updated":"2015-01-07T17:46:02Z","snapshot_observed_at":"2026-08-07T08:22:44.472326Z","submitted_at":"2015-01-07T17:46:02Z","title":"An Introduction to Matrix Concentration Inequalities","version":1},"cited_work":{"arxiv_id":"1501.01571","doi":null,"metadata_source":"pith","pith_arxiv_id":"1501.01571","snapshot_observed_at":"2026-07-10T06:06:50.370191Z","title":"An Introduction to Matrix Concentration Inequalities","venue":"math.PR","work_id":"282765c8-44cb-451c-98e8-5ceac2ec4dd9","year":2015},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1501.01571","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:ad506c174a104c89ca9569dd98c81d48f82485e8988976b7808cd7639e33415f","observation_id":"3ce7f304-eb19-4a74-a015-10da314e4f12","resolution":{"observed_at":"2026-07-10T06:06:50.371679Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.674439Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024) , pages =","venue":null,"work_id":"ec5878ef-ce82-443c-b15c-83b390ae7414","year":2024},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:89b28ba85aa0e114570576b380ec8365ef0418495adc582b5c12f17f4e62c71f","observation_id":"531907a7-d0c2-4db6-a9a8-be4eabb2ff52","resolution":{"observed_at":"2026-07-10T06:06:50.675704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.719558Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":"1d887875-c471-4884-adae-aa4f1ca95648","year":1978},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:604fb496a26d8ed2827ce9f8315e5166e9af161714e50c0bf85ebb8e0c72e66f","observation_id":"62f8865a-53a8-41f3-b5a1-2a33822a695c","resolution":{"observed_at":"2026-07-10T06:06:50.720658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.717986Z","title":"Algorithmica , volume =","venue":null,"work_id":"96cd6d10-b377-4df6-bed4-0827d49b9138","year":1997},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:49e7beb52926c60f8a34ead33ee44e1f50b1518bd3b1272c496fb8ce13022c56","observation_id":"4e026a31-febe-433e-a785-5e21c2fee611","resolution":{"observed_at":"2026-07-10T06:06:50.719062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.728575Z","title":"Ryan , title =","venue":null,"work_id":"cd677ebf-d3d6-4f4b-a8aa-5bc639b9fbcb","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:71f6da20379b6d43d40c0b7d8787e4cbdd2109c0f4227a1d6727bd962d7b9b13","observation_id":"e6663c45-7e17-4573-8457-f07fab0fe4af","resolution":{"observed_at":"2026-07-10T06:06:50.729616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1104.2882","last_updated":"2011-04-14T19:32:10Z","snapshot_observed_at":"2026-07-06T02:26:20.993680Z","submitted_at":"2011-04-14T19:32:10Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms","version":1},"cited_work":{"arxiv_id":"1104.2882","doi":null,"metadata_source":"pith","pith_arxiv_id":"1104.2882","snapshot_observed_at":"2026-07-10T06:06:50.441094Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms","venue":"cs.DS","work_id":"cbddd371-738b-4858-adcc-b9b61b237292","year":2011},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1104.2882","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d8bbfccc22e3536602a277c557068143c4d0e25e19247d87714b265ac84dcd4e","observation_id":"202dc4af-49a0-4ab3-9cd4-04d81770f404","resolution":{"observed_at":"2026-07-10T06:06:50.442494Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0310134","last_updated":"2005-12-14T19:50:15Z","snapshot_observed_at":"2026-07-07T07:13:43.425584Z","submitted_at":"2003-10-21T16:26:16Z","title":"Quantum Algorithms for the Triangle Problem","version":3},"cited_work":{"arxiv_id":"quant-ph/0310134","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0310134","snapshot_observed_at":"2026-07-10T06:06:50.416733Z","title":"Quantum Algorithms for the Triangle Problem","venue":"quant-ph","work_id":"592fc7cb-275a-436d-aa1a-e5a6a4b100e2","year":2003},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0310134","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:00e2fc887e49da38e5831522b1973ebde1f747296749dced7ae4d8fafc0917e2","observation_id":"f3324946-8cc3-4f2b-a234-00b169abe5ed","resolution":{"observed_at":"2026-07-10T06:06:50.417853Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1210.1014","last_updated":"2012-10-03T07:57:01Z","snapshot_observed_at":"2026-07-06T02:56:51.058389Z","submitted_at":"2012-10-03T07:57:01Z","title":"Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing","version":1},"cited_work":{"arxiv_id":"1210.1014","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.1014","snapshot_observed_at":"2026-07-10T06:06:50.376236Z","title":"Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing","venue":"quant-ph","work_id":"efd915a0-3a37-4bc9-951d-8e14e533bfea","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1210.1014","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:b4dfe0380c8a208d6493c6c39eb6a28770d5a8dcef618182c65b38d5f8a0379a","observation_id":"87a7bb32-f8c7-44df-bf9a-7eb0ea3ca4ea","resolution":{"observed_at":"2026-07-10T06:06:50.377479Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.0085","last_updated":"2014-09-08T06:35:43Z","snapshot_observed_at":"2026-08-03T12:19:01.514236Z","submitted_at":"2014-07-01T00:46:14Z","title":"Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments","version":2},"cited_work":{"arxiv_id":"1407.0085","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.0085","snapshot_observed_at":"2026-07-10T06:06:50.443642Z","title":"Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments","venue":"quant-ph","work_id":"a53c1859-027e-44f9-8a19-03e4f69f1ac5","year":2014},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1407.0085","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7469bc53a7264d4cd41b37ebbde2d537e7c656eb0da26c935e7f251f7ee5b2ca","observation_id":"8b7f5831-4126-4c4b-9885-62a6933bb8d7","resolution":{"observed_at":"2026-07-10T06:06:50.445066Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.682963Z","title":"SIAM Journal on Discrete Mathematics , volume =","venue":null,"work_id":"c21fafc7-c6d7-4fc8-83c5-12893c3c9b2b","year":2008},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7fb577df269d4da08472f9fe366b5ce4e3dfd9a732466e703f3558e5cc95e213","observation_id":"e7bfd54f-88fa-401f-83b8-4797560da046","resolution":{"observed_at":"2026-07-10T06:06:50.684100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1203.1952","last_updated":"2012-03-08T22:35:29Z","snapshot_observed_at":"2026-08-02T20:05:43.935458Z","submitted_at":"2012-03-08T22:35:29Z","title":"Worst-case Optimal Join Algorithms","version":1},"cited_work":{"arxiv_id":"1203.1952","doi":null,"metadata_source":"pith","pith_arxiv_id":"1203.1952","snapshot_observed_at":"2026-07-10T06:06:50.403957Z","title":"Worst-case Optimal Join Algorithms","venue":"cs.DB","work_id":"01a5e290-ef04-43af-98ec-92e5caed0a12","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1203.1952","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:939b33752baa717376dac0722386e1d7c3164d15a73997ce84240d1bf9097348","observation_id":"96e8ff36-a9c0-4fdd-b018-73de5675dce7","resolution":{"observed_at":"2026-07-10T06:06:50.408367Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.677688Z","title":"and Itzkovitz, Shalev and Kashtan, Nadav and Chklovskii, Dmitri B","venue":null,"work_id":"0569a7a6-1e0c-4d97-b3a4-33728b52dfe6","year":2002},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:f289dbbe514d7bfc2f7fa3777efe54c13e7bfd64a68556bf049be8604fc80de9","observation_id":"574e5437-c5f0-4c3e-8300-d27ff8951a68","resolution":{"observed_at":"2026-07-10T06:06:50.678791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.711120Z","title":"Experimental and Efficient Algorithms (WEA 2005) , editor =","venue":null,"work_id":"97837520-7f5c-442d-9e6a-5c2b193c512d","year":2005},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:a4c011b28b5f7355faae1d42911a51ee9264b9df1f582945e170e9ab55608c90","observation_id":"d73635f1-4cae-4ad7-b1ae-8869e89d32b4","resolution":{"observed_at":"2026-07-10T06:06:50.712215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0609116","last_updated":"2006-09-20T14:17:34Z","snapshot_observed_at":"2026-08-08T16:33:01.138602Z","submitted_at":"2006-09-20T14:17:34Z","title":"Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs","version":1},"cited_work":{"arxiv_id":"cs/0609116","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0609116","snapshot_observed_at":"2026-07-10T06:06:50.386646Z","title":"Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs","venue":"cs.DS","work_id":"a63c957c-0013-4cdd-abd8-3fc2fa805173","year":2006},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/cs/0609116","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:741979d20a2ba93c4e11ff2d7119ddb305de1712e9d3f660132bf3928481f874","observation_id":"641c4e01-67e7-43e6-a074-c748844c4e70","resolution":{"observed_at":"2026-07-10T06:06:50.387787Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.733455Z","title":"Proceedings of the 20th International Conference on World Wide Web (WWW 2011) , pages =","venue":null,"work_id":"5a840938-6af9-48de-aa84-f797d9d53726","year":2011},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:b1a15dbaed6c7fa9f24bedede6293fb372714cdf4609877c82d0cddc0f1fa9ba","observation_id":"3803a07b-428f-49c9-8985-9100f25b40ad","resolution":{"observed_at":"2026-07-10T06:06:50.734566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09061","last_updated":"2017-05-25T06:24:25Z","snapshot_observed_at":"2026-08-06T10:44:49.525825Z","submitted_at":"2017-05-25T06:24:25Z","title":"Triangle Finding and Listing in CONGEST Networks","version":1},"cited_work":{"arxiv_id":"1705.09061","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.09061","snapshot_observed_at":"2026-07-10T06:06:50.451360Z","title":"Triangle Finding and Listing in CONGEST Networks","venue":"cs.DC","work_id":"d9d1429e-72c7-4cea-b0e5-30e35a81b1fa","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1705.09061","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:17714e747dc1613965081ca4af4f644d19edbcceff7630fe20588e761c96d84f","observation_id":"abbcd4e4-57cd-4740-8b14-ad1cec9e10b9","resolution":{"observed_at":"2026-07-10T06:06:50.452475Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.719805Z","title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) , pages =","venue":null,"work_id":"2379478c-e984-403e-b92c-37cfa46a96b5","year":2019},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:3e6233e6e55e53f8b81836be0dd70db8425eef18111b8e04eb774aef9644447d","observation_id":"6c4e6f02-3bab-41c7-aede-033b2afcbfdd","resolution":{"observed_at":"2026-07-10T06:06:50.720935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.11488","last_updated":"2020-01-21T02:06:44Z","snapshot_observed_at":"2026-08-03T12:20:12.500730Z","submitted_at":"2019-08-30T00:10:08Z","title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","version":2},"cited_work":{"arxiv_id":"1908.11488","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.11488","snapshot_observed_at":"2026-07-10T06:06:50.418942Z","title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model","venue":"quant-ph","work_id":"9024a0a8-18f5-4780-803d-afddd2370e9b","year":2019},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1908.11488","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:85b72bb88c1c8c842406d5120d8565e6995acc7eb326f0776ef913671ef6f610","observation_id":"2da0d28d-ec67-4566-8a5f-5bd47656dfa4","resolution":{"observed_at":"2026-07-10T06:06:50.420193Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.716344Z","title":null,"venue":null,"work_id":"c1247cf9-08c4-4c88-9371-574d99de7e6c","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:18668b164b5a0bee04a516be544729a4245b5317a58df722566e2b740332eee5","observation_id":"34f1e8cf-ddc2-4933-a6e9-e5b78b35e6eb","resolution":{"observed_at":"2026-07-10T06:06:50.717588Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0204025","last_updated":"2002-04-10T00:47:54Z","snapshot_observed_at":"2026-07-07T07:07:41.330245Z","submitted_at":"2002-04-04T22:49:34Z","title":"Quantum communication complexity of symmetric predicates","version":2},"cited_work":{"arxiv_id":"quant-ph/0204025","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0204025","snapshot_observed_at":"2026-07-10T06:06:50.432813Z","title":"Quantum communication complexity of symmetric predicates","venue":"quant-ph","work_id":"7a2aa9c0-394b-49fd-ada5-b548f46341ab","year":2002},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0204025","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6adcca424d1a5e126b7869a8cf79b597467fd445eaade14c48299cd776711cfb","observation_id":"254df442-ceb5-4100-9648-ad5c88f9346b","resolution":{"observed_at":"2026-07-10T06:06:50.434058Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.693710Z","title":"Random Structures & Algorithms , volume =","venue":null,"work_id":"aed1c65a-a765-47db-b4c0-85db3e1c62c6","year":2009},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:37dac948cde797c5fa21aac99786a1597b2ecfba25f79bdde452f8b60df75e4e","observation_id":"bafa6a69-90f0-44b5-ba91-f612e546165d","resolution":{"observed_at":"2026-07-10T06:06:50.694795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.694562Z","title":"Foundations and Trends in Theoretical Computer Science , volume =","venue":null,"work_id":"90a08a62-0d29-4978-a859-af313c576c2d","year":2009},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:35b79545ff729e79957793aa3457f9dcc802dfe2e8502d1be65a2952fab57cac","observation_id":"2430549b-e80c-4720-97bc-0e3ff6426ce5","resolution":{"observed_at":"2026-07-10T06:06:50.695661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0906.4291","last_updated":"2009-06-23T15:51:36Z","snapshot_observed_at":"2026-08-03T12:18:23.524841Z","submitted_at":"2009-06-23T15:51:36Z","title":"The Pattern Matrix Method (Journal Version)","version":1},"cited_work":{"arxiv_id":"0906.4291","doi":null,"metadata_source":"pith","pith_arxiv_id":"0906.4291","snapshot_observed_at":"2026-07-10T06:06:50.416437Z","title":"The Pattern Matrix Method (Journal Version)","venue":"cs.CC","work_id":"24117647-6ea5-4d3d-9d67-78a0a56ddf36","year":2009},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/0906.4291","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:3f2a6b7e7cb14bafc117ba5e646ed8fe156869178dbd8ee8b564c8d5f9ff2460","observation_id":"8ae19cac-5749-4c28-aa3d-259469a55bfe","resolution":{"observed_at":"2026-07-10T06:06:50.417634Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.738549Z","title":"Transactions of the American Mathematical Society , volume =","venue":null,"work_id":"77c0fbed-a585-47f9-9b74-35a72dc488e9","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:56ff5f93a71e6d88dd07af1441e1a09235ef001236a3eaeb227bb0a8ba06f938","observation_id":"f2525df3-8c69-4fa1-89d2-3ed3c26caa6f","resolution":{"observed_at":"2026-07-10T06:06:50.739854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10099","last_updated":"2021-10-19T16:51:11Z","snapshot_observed_at":"2026-08-07T10:37:24.952401Z","submitted_at":"2021-10-19T16:51:11Z","title":"Matrix Discrepancy from Quantum Communication","version":1},"cited_work":{"arxiv_id":"2110.10099","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.10099","snapshot_observed_at":"2026-07-10T06:06:50.359132Z","title":"Matrix Discrepancy from Quantum Communication","venue":"cs.DS","work_id":"d0191607-1501-4e26-91f0-078869611920","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2110.10099","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:0f2a48f761c3020bcf54cbcf4765867d2791b3f24d5ff4e66ba9f5be0b9994e5","observation_id":"2eb39939-f6b2-4417-8ccf-c48429a42007","resolution":{"observed_at":"2026-07-10T06:06:50.360606Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03171","last_updated":"2021-11-04T21:44:53Z","snapshot_observed_at":"2026-07-06T12:05:39.208452Z","submitted_at":"2021-11-04T21:44:53Z","title":"A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent","version":1},"cited_work":{"arxiv_id":"2111.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.03171","snapshot_observed_at":"2026-07-10T06:06:50.394806Z","title":"A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent","venue":"cs.DS","work_id":"b4682f3b-f909-46c8-b551-51e7467f6f9c","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2111.03171","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:701c1e81ff03acef8bfe9e59806640a962ce8b63b63c5b23e450390858366c68","observation_id":"464749cf-ef90-46aa-8f1e-e4a2cd7006b2","resolution":{"observed_at":"2026-07-10T06:06:50.396276Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06312","last_updated":"2023-03-01T02:29:14Z","snapshot_observed_at":"2026-08-09T15:29:40.583219Z","submitted_at":"2021-08-13T16:38:45Z","title":"Matrix Concentration Inequalities and Free Probability","version":2},"cited_work":{"arxiv_id":"2108.06312","doi":null,"metadata_source":"pith","pith_arxiv_id":"2108.06312","snapshot_observed_at":"2026-07-10T06:06:50.401761Z","title":"Matrix Concentration Inequalities and Free Probability","venue":"math.PR","work_id":"ecb7b31c-03a8-4df0-8980-a13d1999e0a6","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2108.06312","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:9de47d5bb77b878f7ffdb0ab3d4d7316677390091943d33d2d9d2f3f04bc30d2","observation_id":"eee64853-8039-4ea2-a686-c1f052507eea","resolution":{"observed_at":"2026-07-10T06:06:50.402896Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.11286","last_updated":"2022-08-29T16:01:18Z","snapshot_observed_at":"2026-07-06T13:44:52.332471Z","submitted_at":"2022-08-24T03:42:44Z","title":"Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank","version":2},"cited_work":{"arxiv_id":"2208.11286","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.11286","snapshot_observed_at":"2026-07-10T06:06:50.449044Z","title":"Bansal, H","venue":"cs.DS","work_id":"4b0ab340-f9cf-4712-bcca-400272fd86f5","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2208.11286","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:4f45673b8a53cca45f5cac22bcef4c1e22d7e0fffa2f5eabea68e9e9ba7e8ce7","observation_id":"429599ac-f640-4dc0-8fb1-e36145abafbb","resolution":{"observed_at":"2026-07-10T06:06:50.450197Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0012127","last_updated":"2001-10-22T14:15:02Z","snapshot_observed_at":"2026-07-07T07:04:14.912235Z","submitted_at":"2000-12-22T13:25:25Z","title":"Strong Converse for Identification via Quantum Channels","version":2},"cited_work":{"arxiv_id":"quant-ph/0012127","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0012127","snapshot_observed_at":"2026-07-10T06:06:50.453282Z","title":"Strong Converse for Identification via Quantum Channels","venue":"quant-ph","work_id":"8fb6060a-5ef1-4cd8-aebc-41c1e5fe4cb8","year":2000},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0012127","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e0d76efa40b6110082645e491e44fa0c3880cd2be4ed74aaeed2fdb69e37bf0a","observation_id":"b117bab3-c710-47b9-b7d8-d6a5ed430d27","resolution":{"observed_at":"2026-07-10T06:06:50.454375Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-03T12:18:37.237031Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":"1004.4389","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-07-10T06:06:50.408901Z","title":"User-friendly tail bounds for sums of random matrices","venue":"math.PR","work_id":"5ed7cfb7-2d47-4240-a309-03a33eb00c8a","year":2010},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:25859a4a86d5c2241a54b6e8c9e8845b74790c01929a5609537b578a97381998","observation_id":"ef425415-fc35-4a00-98c8-248e4bb4b906","resolution":{"observed_at":"2026-07-10T06:06:50.410277Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0303138","last_updated":"2003-04-09T11:44:43Z","snapshot_observed_at":"2026-07-07T07:12:06.140640Z","submitted_at":"2003-03-22T08:07:45Z","title":"A lower bound for bounded round quantum communication complexity of set disjointness","version":2},"cited_work":{"arxiv_id":"quant-ph/0303138","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0303138","snapshot_observed_at":"2026-07-10T06:06:50.446104Z","title":"A lower bound for bounded round quantum communication complexity of set disjointness","venue":"quant-ph","work_id":"2c131c93-bb23-4d0c-a03a-78e5c19b02d6","year":2003},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0303138","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:dcf9c76fd7f654c4b5630881517de3241a70367f20ea0761004e0a92cd786a0f","observation_id":"45af46ce-9383-4aa1-a886-513ef9dee98d","resolution":{"observed_at":"2026-07-10T06:06:50.447464Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1404.3733","last_updated":"2014-04-14T20:00:28Z","snapshot_observed_at":"2026-07-06T03:41:10.318277Z","submitted_at":"2014-04-14T20:00:28Z","title":"Quantum Information Complexity and Amortized Communication","version":1},"cited_work":{"arxiv_id":"1404.3733","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.3733","snapshot_observed_at":"2026-07-10T06:06:50.399507Z","title":"Quantum Information Complexity and Amortized Communication","venue":"quant-ph","work_id":"8e857285-12d9-4dd2-9348-28259b3f2817","year":2014},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1404.3733","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:7283436914cd88fd706037b5571844d00b66088e6f89a921012b82bd172e259e","observation_id":"cd245f34-64c4-44bb-8961-96b6af853fac","resolution":{"observed_at":"2026-07-10T06:06:50.400658Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0106160","last_updated":"2002-04-15T14:49:37Z","snapshot_observed_at":"2026-07-07T07:06:16.646115Z","submitted_at":"2001-06-28T19:07:19Z","title":"Lower bounds for quantum communication complexity","version":3},"cited_work":{"arxiv_id":"quant-ph/0106160","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0106160","snapshot_observed_at":"2026-07-10T06:06:50.427732Z","title":"Lower bounds for quantum communication complexity","venue":"quant-ph","work_id":"3b67dd6c-b178-4702-b19e-d55fa7b0b2e5","year":2001},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/quant-ph/0106160","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:5eef919f0172cbafcd2ce0cf621f948288c7990e11f2b887299dda6c8a742a02","observation_id":"2ba6320b-0cfc-43cc-958b-39adcfbde5d0","resolution":{"observed_at":"2026-07-10T06:06:50.428957Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.702200Z","title":"Quantum Information & Computation , volume =","venue":null,"work_id":"2e66d9be-301e-41f2-b522-aff702060a3c","year":2009},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:9bfd0d69a90f374ce4ab7b7366a9ae2caa3de42e37aa29ca53c6ba532d7d1a47","observation_id":"cc1a1ded-455f-45cb-a5c6-1abaa38740b2","resolution":{"observed_at":"2026-07-10T06:06:50.703288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1003.1443","last_updated":"2010-03-07T08:48:25Z","snapshot_observed_at":"2026-08-03T12:18:24.284862Z","submitted_at":"2010-03-07T08:48:25Z","title":"Composition theorems in communication complexity","version":1},"cited_work":{"arxiv_id":"1003.1443","doi":null,"metadata_source":"pith","pith_arxiv_id":"1003.1443","snapshot_observed_at":"2026-07-10T06:06:50.448890Z","title":"Composition theorems in communication complexity","venue":"quant-ph","work_id":"04617640-b4a0-4c69-9b7c-22e26f16b9f2","year":2010},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1003.1443","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:2e07d0ccca5906f6c79177aaa47d60a2b0b8940360d2eadb88fcc90f64cc84b7","observation_id":"32acb3bf-657c-4229-8431-075680c86f35","resolution":{"observed_at":"2026-07-10T06:06:50.449978Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.722875Z","title":"32nd Computational Complexity Conference (CCC 2017) , pages =","venue":null,"work_id":"cb5134e8-d3f9-4941-9b82-8a01bb9ae0c2","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6cde787f076eb1dbd8f442baef4588402cdb5e933b1b3eb517ca2c75c7d8178e","observation_id":"727259db-a4a1-4d94-a9c6-5024ff818746","resolution":{"observed_at":"2026-07-10T06:06:50.723963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.731409Z","title":"Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =","venue":null,"work_id":"de2ef96d-58ff-4969-a793-0525f9e19c4e","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e2369a2294b5d96e365d21ca5db025917bea7d2f58157b08e4b8fe98651ff557","observation_id":"84f0e5bf-e327-42e4-b850-fa03dedeede1","resolution":{"observed_at":"2026-07-10T06:06:50.732580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.3164","last_updated":"2012-08-30T12:27:43Z","snapshot_observed_at":"2026-07-06T02:37:30.126020Z","submitted_at":"2011-11-14T10:13:53Z","title":"Lifts of convex sets and cone factorizations","version":2},"cited_work":{"arxiv_id":"1111.3164","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.3164","snapshot_observed_at":"2026-07-10T06:06:50.438071Z","title":"Lifts of convex sets and cone factorizations","venue":"math.OC","work_id":"15fc3be8-70db-44dc-b151-7a913d9b5194","year":2011},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1111.3164","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:850502a6874d5055f7f38412b0866efe430ca3a92166b111a53cc8dc970c9007","observation_id":"9d9f1959-9226-439f-a663-54e36c5816bd","resolution":{"observed_at":"2026-07-10T06:06:50.439813Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.4095","last_updated":"2014-07-15T18:56:01Z","snapshot_observed_at":"2026-07-06T03:49:06.526906Z","submitted_at":"2014-07-15T18:56:01Z","title":"Positive semidefinite rank","version":1},"cited_work":{"arxiv_id":"1407.4095","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.4095","snapshot_observed_at":"2026-07-10T06:06:50.397554Z","title":"Fawzi, J","venue":"math.OC","work_id":"2cab6c92-df31-49c0-8204-81fd582c02cd","year":2014},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1407.4095","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:4ee3308b42e0e65c443b642ab3f96a61c8dfe018d2245c6a217359341dd0ef5d","observation_id":"45f9839c-a890-48c2-89e0-fc2ae579a613","resolution":{"observed_at":"2026-07-10T06:06:50.399177Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.4308","last_updated":"2014-07-16T13:49:17Z","snapshot_observed_at":"2026-08-09T18:01:21.766921Z","submitted_at":"2014-07-16T13:49:17Z","title":"Some upper and lower bounds on PSD-rank","version":1},"cited_work":{"arxiv_id":"1407.4308","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.4308","snapshot_observed_at":"2026-07-10T06:06:50.430328Z","title":"Some upper and lower bounds on PSD-rank","venue":"cs.CC","work_id":"0aebd181-18e8-4e22-8112-3d179c6abb53","year":2014},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1407.4308","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:21cf9d18cc27135697ced8f919a5af8718183d8d37c9b1a43ec3fe82e19e2d58","observation_id":"0022ef86-7a75-4443-a578-874cd6ad830a","resolution":{"observed_at":"2026-07-10T06:06:50.431652Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.696337Z","title":"Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =","venue":null,"work_id":"fb659497-d320-4fe8-abb4-379df0a2be5b","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:07072ee0d90358dac250cfb2fa2f61f1672908ea8de5d366b2533b4a1e4c620a","observation_id":"f385177f-ebb8-4f8a-8176-9dbb833deaec","resolution":{"observed_at":"2026-07-10T06:06:50.697444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.691290Z","title":"Lifts of Convex Sets and Cone Factorizations , journal =","venue":null,"work_id":"19cd6134-5f72-41c6-a123-603d1120fa00","year":2013},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:2e33cea0883aaf31801dd74ea3d763ad2c8cace3e8621cc967b1fc5b11b6a999","observation_id":"3efd16ec-c385-43e8-8eed-78ab2d3a87bb","resolution":{"observed_at":"2026-07-10T06:06:50.692342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.726204Z","title":"Positive Semidefinite Rank , journal =","venue":null,"work_id":"c18e817d-e061-4d91-918b-497a5ce50086","year":2015},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:4eefefc7d119a45683234f49884d4bb581ec178f2a1cb7d47af5ea11b4d0892b","observation_id":"bc59d8e2-047e-4abd-ac0b-0f31e542f6df","resolution":{"observed_at":"2026-07-10T06:06:50.727255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.677971Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"60b1ee1a-8125-417b-a934-8ad81ca87268","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d4a3dd45cf06519b7a0e97e3ddd8fc9a553602fe2a6c103b8423b83f33b48e5e","observation_id":"31bf17aa-59f0-47db-9b04-406c3160b07d","resolution":{"observed_at":"2026-07-10T06:06:50.679241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.729784Z","title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999) , pages =","venue":null,"work_id":"418bc53c-e0dc-40df-b21f-468f51feb7b0","year":1999},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:a24285beb99ff86d6b4dd6b3afbe273d2f85cedd290401cf4609202619a5a23c","observation_id":"87b00301-7480-4deb-a426-881e2d1b9f0f","resolution":{"observed_at":"2026-07-10T06:06:50.730885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.726925Z","title":"Journal of Computer and System Sciences , volume =","venue":null,"work_id":"244b3d51-9d46-4781-b35d-8db2457e05e8","year":2004},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:50c279972db8395426470810cdf928a8baf6584306706df6401014362ecd88aa","observation_id":"9c1570a4-afa0-4db0-a717-b87e32ba7b7d","resolution":{"observed_at":"2026-07-10T06:06:50.727992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.723275Z","title":"Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) , series =","venue":null,"work_id":"68a14f78-56ad-4a2a-b5a8-91923f0341e5","year":2005},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:eea11fc9ea3e26362ff42a30a5b9dc473b9359a6a36a39c4df872cf0386640f8","observation_id":"76b035c7-54e3-454b-ad2f-709544441df5","resolution":{"observed_at":"2026-07-10T06:06:50.724699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.701916Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":"1dd33d13-1541-4e53-8a75-bdfc9ebf21b1","year":2007},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e326224f6586e37ba6dce7152c1a6f6171046bf3e3cbd5e511df0c3a20b9f82f","observation_id":"30c06fb4-b221-4f50-8436-91c4179531c3","resolution":{"observed_at":"2026-07-10T06:06:50.703005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.730106Z","title":"Proceedings of the 32nd Computational Complexity Conference (CCC 2017) , series =","venue":null,"work_id":"92f7edb3-b14f-45c5-a3c9-c0fa741430ab","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:bb4cafa63162a486bb4b9dbaeb0fd654e23fe290d28b24ebd95d107fa7db0c72","observation_id":"caab8634-97a1-4029-84a7-116a2736dad3","resolution":{"observed_at":"2026-07-10T06:06:50.731152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.725258Z","title":"Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2022) , pages =","venue":null,"work_id":"2e31782d-ec97-4e05-8dcf-85dd9cbd9450","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:5eb4cb3142390035900a74814df090fa44d2cb29118ea705a69e3c4f9eb56b07","observation_id":"1cd6f368-4214-4ab9-8f6c-4afd300eee4d","resolution":{"observed_at":"2026-07-10T06:06:50.726416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.735091Z","title":"A hypercontractive inequality for matrix-valued functions with applications to quantum computing and","venue":null,"work_id":"a15c998c-604a-4800-b24a-2daa2f1994fe","year":2008},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:9ceb366cbc6a377e0640d0cfbd2075016bee78a1c2f258f3d55ede16949e3d7c","observation_id":"f93f6c76-993b-42b5-b6bf-5fe5cd8497eb","resolution":{"observed_at":"2026-07-10T06:06:50.736211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.683338Z","title":"Matrix hypercontractivity, streaming algorithms and","venue":null,"work_id":"50d133af-03a6-42ef-9fa8-dcd3449e5de9","year":2024},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:845518006f00fa2f21eff12139b142dc5d4ffe204475b6242b807be2b06beb7c","observation_id":"b6384d4e-3f72-4466-b467-ec753d89d1d0","resolution":{"observed_at":"2026-07-10T06:06:50.684830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.712416Z","title":"The Quantum and Classical Streaming Complexity of Quantum and Classical","venue":null,"work_id":"4e9cecd9-c761-4ffc-89d2-4641f21f4764","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:e9cfef3e265035fc16069c22df4dd733e1d6ec179d197c8607fb82bff40d2828","observation_id":"584a0bfc-0ea8-4504-befc-be4ec93a2947","resolution":{"observed_at":"2026-07-10T06:06:50.713514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.734742Z","title":"Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (STOC) , pages=","venue":null,"work_id":"8bf3529b-38c8-4c9e-977c-71eb241dac81","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:2387b376a6b52640cb4bf0511deb5a34c41c31b87cc68b1a635b31dcb819dde5","observation_id":"3b067662-7700-40ad-b4f7-6d41a280142a","resolution":{"observed_at":"2026-07-10T06:06:50.735957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.709089Z","title":"Advances in Cryptology -- CRYPTO 2018 , pages=","venue":null,"work_id":"ef887033-e103-4622-96cd-5094150a0315","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6eb17982ee3d2f18341e0ae667ce94ba0486cc13434e149198a588cecd3b276d","observation_id":"bcaf22d1-b767-4d86-9aba-3c7821d0a875","resolution":{"observed_at":"2026-07-10T06:06:50.710260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.714596Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":"e3a83ebc-7856-4e11-8d34-12fb853ac230","year":2011},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:321c68f37eb73e35ecdd615599968760c61a66631d98242c3b88f170a7f1e164","observation_id":"7f42644d-6a7e-4e5b-aa86-4d63c53d590a","resolution":{"observed_at":"2026-07-10T06:06:50.715783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.707202Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"d19576e1-0d99-418f-9496-4e3db6c9bb04","year":2007},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:5884ba781c0fcde35eff86d6903bbbf8c13a830185d39504ff52a4bef9dfcd4a","observation_id":"12614de6-ea55-4f27-abc6-07ee08d23739","resolution":{"observed_at":"2026-07-10T06:06:50.708393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.664856Z","title":"36th Computational Complexity Conference (CCC 2021) , pages=","venue":null,"work_id":"7e3fac53-c06f-4ada-ad70-43192b5f5271","year":2021},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:740a83ca745a590e1a3550885d7591b42c179f625a10fa7d12410f216f1718d8","observation_id":"fb7208e6-f8e4-4439-b97d-f1f366c35849","resolution":{"observed_at":"2026-07-10T06:06:50.666145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7801.308781","doi":"10.1145/3087801.3087817","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Triangle Finding and Listing in CONGEST Networks , year =","venue":null,"work_id":"e5403405-380f-4e22-a75b-d282e046f05d","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:8645faf06ba4d691c27d4983c09a040fb7d1a76b7dad50516b839e3506b90248","observation_id":"fb46c739-c999-40ef-a1f2-cbad1b1b5109","resolution":{"observed_at":"2026-07-10T06:06:50.306431Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-33651-5_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2012 , isbn =","venue":"Lecture notes in computer science","work_id":"824fc81d-9329-49a5-ad61-5097722333e0","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:9a74055967569d3bf43f71e784576d03fec638445f98ab9c55fcfe0c0e35d1bb","observation_id":"b58204e5-8611-4488-b60d-45a635ec5ca9","resolution":{"observed_at":"2026-07-10T06:06:50.310717Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T01:51:02.365872+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T01:51:02.365872+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08914","last_updated":"2020-06-04T20:33:53Z","snapshot_observed_at":"2026-08-06T09:03:09.937981Z","submitted_at":"2019-04-18T17:49:22Z","title":"Quantum Lower Bounds for Approximate Counting via Laurent Polynomials","version":3},"cited_work":{"arxiv_id":"1904.08914","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.08914","snapshot_observed_at":"2026-07-10T06:06:50.451054Z","title":"Quantum Lower Bounds for Approximate Counting via Laurent Polynomials","venue":"quant-ph","work_id":"bc60160d-7855-410b-8c93-80b49010d826","year":2019},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1904.08914","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:8407a6aca78b68deddeb07e3eb76cf059a173979d776bff542d239b1e7a41260","observation_id":"993d867d-49e1-433d-8f49-776f30f2dbaf","resolution":{"observed_at":"2026-07-10T06:06:50.452217Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.698533Z","title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"bc319ede-3539-47ba-81eb-80fa5f48c673","year":2017},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:3470679190d52304264e97ce397112a0d935668c2730410cf537d3420e5cd035","observation_id":"2746c374-a29e-49b4-882d-4531fbeccc70","resolution":{"observed_at":"2026-07-10T06:06:50.699607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.666982Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"6a382e08-d824-4eb4-8919-0d253317f10a","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:3bc6e68b3eb0df030397bff376ccb3bf7d97a4d2bb782ea0a874808edb30d331","observation_id":"811e644b-ab06-49c3-9602-089715ab54df","resolution":{"observed_at":"2026-07-10T06:06:50.668323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.684667Z","title":"International Colloquium on Automata, Languages, and Programming , pages=","venue":null,"work_id":"17e00ef3-2e82-4312-afad-a1e717edf4bf","year":2003},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6969536ab9d78460de48effd0057417d07f72e7dfc35a40c6662d0ec8860092c","observation_id":"c68e2961-99bf-467b-b92d-e98ddf0d1db4","resolution":{"observed_at":"2026-07-10T06:06:50.685907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.710781Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"1f26c537-5f79-4b39-b320-9c032b2df36c","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:ae798751c72a3caa120050f03f6f7981d02fc68d99729395cbe0d14e80c2b394","observation_id":"117a8360-86ee-4411-ad50-5f5c76df020f","resolution":{"observed_at":"2026-07-10T06:06:50.711923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2025.33","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2025 , isbn =","venue":"ArXiv.org","work_id":"e1cf9e14-4941-4a77-bb23-fcc8883fb893","year":2025},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:289829fca0dcc409edc1dd821f2395ff20f9cb07a753a957e81a9ab0e64496ea","observation_id":"97f1cdf0-f396-4887-9061-046af6371cd3","resolution":{"observed_at":"2026-07-10T06:06:50.314100Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T01:51:02.795291+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T01:51:02.795291+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.736745Z","title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"91e8211f-b209-4c1c-8b3d-5ea8a5fd84f1","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:57f4d37d34dd2a9e88a50995e432c45c00a1d6160f8688ccfc9406ed9f60af27","observation_id":"eb8f74c5-a976-48c0-987b-5507c594bb28","resolution":{"observed_at":"2026-07-10T06:06:50.738029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.740387Z","title":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"e9af68e2-5186-481d-9d01-782b34b7de00","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:b4722d72cb36c1532895c62e4a398d54de56b64d0e271e1af43d1068d55fd9c7","observation_id":"567c6cc4-6241-47ba-b095-c3c9ae9a669e","resolution":{"observed_at":"2026-07-10T06:06:50.741536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.721193Z","title":"2025 Symposium on Simplicity in Algorithms (SOSA) , pages=","venue":null,"work_id":"1c5abe57-0231-457a-b226-d1afa0367f66","year":2025},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:0697e6e03223a56a2b2c6aebf3bbc64fc5aba0955ddae363c1cc07ba6ebd75a4","observation_id":"5dbb47b6-5d12-494b-b703-5455d0a8c481","resolution":{"observed_at":"2026-07-10T06:06:50.722321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.tqc.2019.1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Quantum Chosen-Ciphertext Attacks and Learning with Errors","venue":"ArXiv.org","work_id":"03143848-4c5c-4226-a822-83cc06d4684c","year":2019},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:52db005a5e24da8d1bf59b6523b53c3423463377be6d88bbd161729dacc95afb","observation_id":"d5bffebe-4a3c-4b87-92e0-d14a2c1f01ba","resolution":{"observed_at":"2026-07-10T06:06:50.301484Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T01:51:03.242201+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T01:51:03.242201+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:06:50.727821Z","title":"Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"26e1777d-0cfb-4cf6-a529-9e84529e375d","year":null},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:f9980f080e3bb5feb3bcc00460275936bc6cd1208ed216fe620d4195614530d4","observation_id":"1b18132f-35fc-4c7f-b11e-925e5a43dcec","resolution":{"observed_at":"2026-07-10T06:06:50.729062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.tqc.2020.1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exponential","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"c8c6f5f4-4b02-49ea-b0d8-95038d03316a","year":2020},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:d552c0d57642cd40ca0b0eb029acd54c88119c7372d1b0167111134313fd10fc","observation_id":"eadcb947-03a0-4ddc-b751-5777f7b064ab","resolution":{"observed_at":"2026-07-10T06:06:50.311052Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T01:51:03.68521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T01:51:03.68521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2016.54","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8b8d2252-a528-45bd-b485-fbc8d252b465","year":2016},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:0a9d9f8f7f245b5b95c424aae7eaf061ce2cf9dddfead5b7e901cf303a8e0dcc","observation_id":"478d75e7-3889-4d99-8e45-ee151b6705a7","resolution":{"observed_at":"2026-07-10T06:06:50.316487Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T01:51:04.116358+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T01:51:04.116358+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/9781108231596","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Comput.54, 2 (2025), 193–232","venue":null,"work_id":"324f3b32-472c-40d1-b839-4c22ba21e656","year":2018},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:6243e6ac84e7ce93a7a581e7c99c97928ae9dc00c7ffcc81c9d4c89cb8af8221","observation_id":"935ab869-00da-48b6-b16c-3d24f2a16bfe","resolution":{"observed_at":"2026-07-10T06:06:50.300659Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-18T16:21:17.228774+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T16:21:17.228774+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy"},"reference_resolution":{"displayed":98,"state_counts":{"malformed_identifier":0,"metadata_mismatch":25,"parse_uncertain":1,"unresolved":2,"verified_exact":18,"verified_fuzzy":52},"total_outbound_references":98},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 98 of 98 outbound references and 0 inbound Pith citation observations for arXiv:2607.08517."}