Pith. sign in

Paper Citation Record · LEDGER

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy

As of 13 August 2026, this Paper Citation Record lists 98 of 98 outbound references and 0 inbound Pith citation observations for arXiv:2607.08517.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.08517 v1

Coverage vector

measured 98 of 98 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-10T06:05:38.945129Z

measured 98 of 98 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

98 of 98 outbound references displayed

  • verified exact18
  • verified fuzzy52
  • unresolved2
  • parse uncertain1
  • malformed identifier0
  • metadata mismatch25

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation eab6d98b-942f-4b10-a82e-082ece2af69c · outbound

This paper cites , title =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy , title =

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.710574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:5fe401d005f6a30dea4662dcba4106636f9c3411697c26d22909280854896ffd

Observation 91dffa36-aab9-4756-b5f2-12279a77c1ed · outbound

This paper cites Quantum Cryptanalysis of Hash and Claw-Free Functions , booktitle =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Cryptanalysis of Hash and Claw-Free Functions , booktitle =

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.698060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b9a5cbc2f1b8e1669db37ab20aeba34651186a20102a8f92f22bd6a392fc7f88

Observation 4d4c2df9-429f-4e8c-b1de-b48882c74050 · outbound

This paper cites Quantum Lower Bound for the Collision Problem.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Lower Bound for the Collision Problem

Reference 3

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.390445Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:96c36485ffd5975b3b0127647b11fa312c074c4f49eb24f61fe99fa74d908b08

Observation a1cb09e2-8e1d-4bca-b2b7-37946ca79fc3 · outbound

This paper cites Quantum lower bounds for the collision and the element distinctness problems.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum lower bounds for the collision and the element distinctness problems

Reference 4

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.390253Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:39242e2df8aa92a69d0e4dd05f90a2719af21a6b93df636416e0713adc09b8d9

Observation 68bfeda5-64af-4731-9731-6c6a8fba4579 · outbound

This paper cites Quantum walk algorithm for element distinctness.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum walk algorithm for element distinctness

Reference 5

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.384240Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a7572c106c9548ab68a0c13dc4fb8a97b487ea2c6f641fdb291c379203c807ba

Observation 7ea18d65-fda9-472f-a750-5beb64e43cef · outbound

This paper cites , title =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy , title =

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.677460Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:f4fac14eea76e54146c80df2a54dc8a15d1383c5e29de438090fabd134285cfa

Observation 25298229-b438-4d7c-8f20-c69ef6cde0e9 · outbound

This paper cites an unresolved cited work.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-07-10T06:06:50.725644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:47352e4d98584c4f806b945c2853735b77313b34faa7dea059dd98e16248c4fc

Observation 4fe92ca7-e89a-4b45-9c87-3fd5320ab5a2 · outbound

This paper cites Advances in Cryptology -- CRYPTO 2018, Part II , editor =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Advances in Cryptology -- CRYPTO 2018, Part II , editor =

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.664140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:ccce6bac8b9d8b1a89cbb219d90e5f9723b9a53ed6bbed63e5072c94656dbd27

Observation 0cea9cae-3654-4ab2-8745-0c84bd4f8942 · outbound

This paper cites 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages =

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.696450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:56971e9e959e7cd3273aefdaff870d53e6ea0c83c01b7ac3702486b6aead814d

Observation 33cc369b-bbbd-43b9-af9b-3c2bcc2286c7 · outbound

This paper cites and Chakrabarti, Amit , title =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy and Chakrabarti, Amit , title =

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.687530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:44e4542aa0f9d48467698363c91b2c369e9023b76e5c291ee3bf247a937c4a81

Observation 7e8d8caf-57ad-4fd1-a006-9a30429e232a · outbound

This paper cites How Hard is Counting Triangles in the Streaming Model.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy How Hard is Counting Triangles in the Streaming Model

Reference 11

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.372255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:d7c6273e92bfb21d76253410815f6dbab93b9942cca4247dd73bbee6261dd8a4

Observation f8a16844-91e8-4b29-85c2-3d6edfa2ff5b · outbound

This paper cites Theoretical Computer Science , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Theoretical Computer Science , volume =

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.734148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:197d8dc3a08231e26cca33cfd94e7228a58d592df38c4cfbadece9199495291d

Observation 819570a1-33fb-4693-bd36-c58414f3b449 · outbound

This paper cites , title =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy , title =

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.722671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e4cb7e4b3fde650df797734f2f7fbbe7927d212da91bba5872779aac47b32fd4

Observation 1f2d3573-1ba2-4bca-9a36-2a97cbf8fd0e · outbound

This paper cites Exponential separations for one-way quantum communication complexity, with applications to cryptography.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Exponential separations for one-way quantum communication complexity, with applications to cryptography

Reference 14

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.444462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:63c1c0d00a33097744dad9cdc72ef0d582cc25a5027615e08166e6ec799bbeb2

Observation 3604eafa-f4d0-406a-a7bf-042bf1b1d4e0 · outbound

This paper cites Communication Complexity of Collision.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Communication Complexity of Collision

Reference 15

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.447969Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:405780e64bf0b3277594c28b34c705114f1fc4ffcf109a4b0945d4e6182437aa

Observation b6c53a13-0040-4e68-a926-6906de59d5b4 · outbound

This paper cites 36th Computational Complexity Conference (CCC 2021) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 36th Computational Complexity Conference (CCC 2021) , pages =

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.719249Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b1b953e138fed9de0834b1ffe3dfa03f0c8fe2da01a2f923d72b0c41bf7ced30

Observation ee641f2c-fd53-4bad-a199-d6f8c19b70e3 · outbound

This paper cites An Optimal Algorithm for Triangle Counting in the Stream.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy An Optimal Algorithm for Triangle Counting in the Stream

Reference 17

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.415451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a9977ca84558bacd9c0be7adf767506870882768c74e59c32fe91cec376b446b

Observation 614a8367-57e7-452f-aa01-71b0d59a7950 · outbound

This paper cites A Quantum Advantage for a Natural Streaming Problem.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy A Quantum Advantage for a Natural Streaming Problem

Reference 18

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.351732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9d8410e48b21fa825b33be646b5076e372a2762d970f75b416d9d546d26f8824

Observation ec05132b-55bb-49e2-9f71-a7b6a7c00a5b · outbound

This paper cites The Sketching Complexity of Graph and Hypergraph Counting.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy The Sketching Complexity of Graph and Hypergraph Counting

Reference 19

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.423588Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:89deec17ff244a567472ce44dbfbdd50195b13dff793189295cfe3221e8cf6ae

Observation 0ecf9411-71f2-4c33-b3f3-e9c21bba81ca · outbound

This paper cites A Hybrid Sampling Scheme for Triangle Counting.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy A Hybrid Sampling Scheme for Triangle Counting

Reference 20

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.395551Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e18aa119e6b03f3e845025878d620b411464c24e9429c82a6915663808ce57ae

Observation 434b956b-d79c-4d1a-bf81-7616d1f5e5ee · outbound

This paper cites Noisy Boolean Hidden Matching with Applications.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Noisy Boolean Hidden Matching with Applications

Reference 21

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.404514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:695550daf12b1d1099dc09ebd621d07f517f4e37cf61b65dfd5a0054601c8b29

Observation 998ada90-c96b-4e87-aba8-4979d2c64030 · outbound

This paper cites 1991 , doi =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 1991 , doi =

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.704684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:95d5e9c8e3325edc2666ccdcde2520a0491d6df0a2a1948dcd0ffa29843ec96c

Observation 023e8192-30f0-477a-85d0-d31c66c68a6e · outbound

This paper cites an unresolved cited work.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-07-10T06:06:50.682438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:31861792f9ce77111abeb0e46f26aab1c32bda46ba820c76421446eaa42795d7

Observation 36946cb9-11bc-4986-a757-c3f207cb4d5f · outbound

This paper cites Non-Commutative Khintchine and Paley Inequalities , journal =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Non-Commutative Khintchine and Paley Inequalities , journal =

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.680517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:f8e27cc9b674512ac638c9ebcb2227cf8b571b36a31528a3503de4e3d83b5c78

Observation 3ce7f304-eb19-4a74-a015-10da314e4f12 · outbound

This paper cites An Introduction to Matrix Concentration Inequalities.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy An Introduction to Matrix Concentration Inequalities

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.371679Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:6f805576a149901084abe5c85ebbea01e8d20e7729c431df90550ecb633e6d75

Observation 531907a7-d0c2-4db6-a9a8-be4eabb2ff52 · outbound

This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024) , pages =

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.675704Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:66ede9201a467758f9d419e3a8e6959c82af800f5e93f6952a53a3b9f2c15e88

Observation 62f8865a-53a8-41f3-b5a1-2a33822a695c · outbound

This paper cites SIAM Journal on Computing , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy SIAM Journal on Computing , volume =

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.720658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:2b7b4f9e48b46db8654c9f46fc7e1a0be49d84e6109514265fecbef9759fbb8c

Observation 4e026a31-febe-433e-a785-5e21c2fee611 · outbound

This paper cites Algorithmica , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Algorithmica , volume =

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.719062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:1c9fe6e54937ea227cbdd4e67309c03804eeb194435376747199dc7a942432d7

Observation e6663c45-7e17-4573-8457-f07fab0fe4af · outbound

This paper cites Ryan , title =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Ryan , title =

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.729616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:83d09f5c01a4859eb7bfe84b8488ffdb985f070f3b007d1e8b114246ee4d6498

Observation 202dc4af-49a0-4ab3-9cd4-04d81770f404 · outbound

This paper cites Minimum Weight Cycles and Triangles: Equivalences and Algorithms.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Minimum Weight Cycles and Triangles: Equivalences and Algorithms

Reference 30

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.442494Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:cc2602c7c4eefbe60629749f299bf945b541fa39107a77aeb40a06b9e4b3cca3

Observation f3324946-8cc3-4f2b-a234-00b169abe5ed · outbound

This paper cites Quantum Algorithms for the Triangle Problem.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Algorithms for the Triangle Problem

Reference 31

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.417853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:130f60f2c444a115eb0baef03a83b872504c038f6a4d28ee0d14ecd5c0ec61dc

Observation 87a7bb32-f8c7-44df-bf9a-7eb0ea3ca4ea · outbound

This paper cites Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.377479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:5fc9c4448b35c195a9308338c943f6b26abb195ede4a6b6d2d39dbab1b94a960

Observation 8b7f5831-4126-4c4b-9885-62a6933bb8d7 · outbound

This paper cites Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments

Reference 33

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.445066Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:04578760c64ffd0f4f9f17eec283bbb814590338cf568d6d93bbb7180330e290

Observation e7bfd54f-88fa-401f-83b8-4797560da046 · outbound

This paper cites SIAM Journal on Discrete Mathematics , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy SIAM Journal on Discrete Mathematics , volume =

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.684100Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:4c1b7f756dac2a47e509303821d5efc6c20b53cbfa2bbb5fa2d9445b724fb9de

Observation 96e8ff36-a9c0-4fdd-b018-73de5675dce7 · outbound

This paper cites Worst-case Optimal Join Algorithms.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Worst-case Optimal Join Algorithms

Reference 35

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.408367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:4b5678a3e920286c1213b242aaf26ec8ea61624caf1a32bb29490ccfd598c484

Observation 574e5437-c5f0-4c3e-8300-d27ff8951a68 · outbound

This paper cites and Itzkovitz, Shalev and Kashtan, Nadav and Chklovskii, Dmitri B.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy and Itzkovitz, Shalev and Kashtan, Nadav and Chklovskii, Dmitri B

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.678791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a594d7ada0a174b284350f2d055f246a57e689d2cf4f01c99a36b6e98d8d5afd

Observation d73635f1-4cae-4ad7-b1ae-8869e89d32b4 · outbound

This paper cites Experimental and Efficient Algorithms (WEA 2005) , editor =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Experimental and Efficient Algorithms (WEA 2005) , editor =

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.712215Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:964b18ee19eb805032d9a3189dec18f64b0eb83ded1d6998919cb05e8e9208b5

Observation 641c4e01-67e7-43e6-a074-c748844c4e70 · outbound

This paper cites Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs

Reference 38

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.387787Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:c9d84030d3a9aa57153e1b8f365190b351c6328e4dffca67061a83173f544190

Observation 3803a07b-428f-49c9-8985-9100f25b40ad · outbound

This paper cites Proceedings of the 20th International Conference on World Wide Web (WWW 2011) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 20th International Conference on World Wide Web (WWW 2011) , pages =

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.734566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:df8dd9f57c82940a10cd9528a08d2072e1c95eec6d0b1e7eb7fa8f7c4211585f

Observation abbcd4e4-57cd-4740-8b14-ad1cec9e10b9 · outbound

This paper cites Triangle Finding and Listing in CONGEST Networks.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Triangle Finding and Listing in CONGEST Networks

Reference 40

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.452475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:c57cf470da4dfbea607ac1f0a33c699f42b1c5c2a8442eb7fe450c8aa564424a

Observation 6c4e6f02-3bab-41c7-aede-033b2afcbfdd · outbound

This paper cites Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) , pages =

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.720935Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:5351ef8ba7324fa592ae668393d30716c5e632008edf18e1849dbd48749b5f39

Observation 2da0d28d-ec67-4566-8a5f-5bd47656dfa4 · outbound

This paper cites Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model

Reference 42

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.420193Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a00bd5511a7884a18216116805cb7ffe938a97343813c9a9b3eadaade24ec623

Observation 34f1e8cf-ddc2-4933-a6e9-e5b78b35e6eb · outbound

This paper cites an unresolved cited work.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Unresolved cited work

Reference 43

Resolution
parse uncertain
raw_fallback, observed 2026-07-10T06:06:50.717588Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b31ac0cf67b7e1b3e7c87d6f57b7587b72985932a5117a184ad4284a81fbea0f

Observation 254df442-ceb5-4100-9648-ad5c88f9346b · outbound

This paper cites Quantum communication complexity of symmetric predicates.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum communication complexity of symmetric predicates

Reference 44

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.434058Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:573e02cecc5eec586613fcdfa869be55bc5347bf47208103b3d1bc207647692f

Observation bafa6a69-90f0-44b5-ba91-f612e546165d · outbound

This paper cites Random Structures & Algorithms , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Random Structures & Algorithms , volume =

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.694795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:ee2fa9ee58a4b8bf0cfe01515c34b5ebed91c22fd3700b34b414276e247d2c3c

Observation 2430549b-e80c-4720-97bc-0e3ff6426ce5 · outbound

This paper cites Foundations and Trends in Theoretical Computer Science , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Foundations and Trends in Theoretical Computer Science , volume =

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.695661Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:ea53dd14724ea5197de4d28ea4cbce897a4e8ed1a006704edaeb86d47e6ddf19

Observation 8ae19cac-5749-4c28-aa3d-259469a55bfe · outbound

This paper cites The Pattern Matrix Method (Journal Version).

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy The Pattern Matrix Method (Journal Version)

Reference 47

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.417634Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:84baddc3953b8a34d3d17c4bf7b45b43ea2d84712f4f14c130b1d0aa85857415

Observation f2525df3-8c69-4fa1-89d2-3ed3c26caa6f · outbound

This paper cites Transactions of the American Mathematical Society , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Transactions of the American Mathematical Society , volume =

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.739854Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a687557a87a81509a84dfae1bf8ad2f1fe036b615cc9de3cb0cfc0083388bdfe

Observation 2eb39939-f6b2-4417-8ccf-c48429a42007 · outbound

This paper cites Matrix Discrepancy from Quantum Communication.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Matrix Discrepancy from Quantum Communication

Reference 49

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.360606Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:c5c2f36077a3cc5147de589ea4c0ec19455e57525f55aa77c4c161b5dfe6b929

Observation 464749cf-ef90-46aa-8f1e-e4a2cd7006b2 · outbound

This paper cites A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent

Reference 50

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.396276Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:42c28f2005762430e76576301c85a526011454adb4d24d058e53abdd7a3e6072

Observation eee64853-8039-4ea2-a686-c1f052507eea · outbound

This paper cites Matrix Concentration Inequalities and Free Probability.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Matrix Concentration Inequalities and Free Probability

Reference 51

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.402896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:19dd3051239119537e711428b6ddf31d8847b26f7d0e201137533d3304813ebc

Observation 429599ac-f640-4dc0-8fb1-e36145abafbb · outbound

This paper cites Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank

Reference 52

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.450197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:5cd34646a75131e91d213c512eca5377503d38f067878c8df5383af3c2c706d7

Observation b117bab3-c710-47b9-b7d8-d6a5ed430d27 · outbound

This paper cites Strong Converse for Identification via Quantum Channels.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Strong Converse for Identification via Quantum Channels

Reference 53

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.454375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:4cc698c414e1e5cbce98785f4a2b65db1231a5c7fdcaf8f7331538061cb0c9b7

Observation ef425415-fc35-4a00-98c8-248e4bb4b906 · outbound

This paper cites User-friendly tail bounds for sums of random matrices.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy User-friendly tail bounds for sums of random matrices

Reference 54

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.410277Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:f465ccc678e4a8fe2b84ec4ee7c934e45ab7b074eadf06475f0f0c100248e6f8

Observation 45af46ce-9383-4aa1-a886-513ef9dee98d · outbound

This paper cites A lower bound for bounded round quantum communication complexity of set disjointness.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy A lower bound for bounded round quantum communication complexity of set disjointness

Reference 55

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.447464Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b54183b50c516e4538bab096cc754eb799cd506f747993aff8f41c60cb9c1793

Observation cd245f34-64c4-44bb-8961-96b6af853fac · outbound

This paper cites Quantum Information Complexity and Amortized Communication.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Information Complexity and Amortized Communication

Reference 56

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.400658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:0c2fe4efffcc1f0f160ca9c46304ecf6ea70195f2d1243e82dc4be28c80f28bc

Observation 2ba6320b-0cfc-43cc-958b-39adcfbde5d0 · outbound

This paper cites Lower bounds for quantum communication complexity.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Lower bounds for quantum communication complexity

Reference 57

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.428957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:ce8d33ea96204430537a4f3f90c93d7ddef1cd519e9f8d26150e0ff641e4f4f6

Observation cc1a1ded-455f-45cb-a5c6-1abaa38740b2 · outbound

This paper cites Quantum Information & Computation , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Information & Computation , volume =

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.703288Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:2864f97ecc1d62ec63c3f6c963bde5ca22f994f905fda3bf3a5cf60483d831e5

Observation 32acb3bf-657c-4229-8431-075680c86f35 · outbound

This paper cites Composition theorems in communication complexity.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Composition theorems in communication complexity

Reference 59

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.449978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:61e8659d3851907218ece017f74dc2056cf07cd71f2d500a3037d1cb9579787b

Observation 727259db-a4a1-4d94-a9c6-5024ff818746 · outbound

This paper cites 32nd Computational Complexity Conference (CCC 2017) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 32nd Computational Complexity Conference (CCC 2017) , pages =

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.723963Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:bc44b8c6a665413e13a24e2b9b76d26a511703574285098164c21aaa00ad11c3

Observation 84f0e5bf-e327-42e4-b850-fa03dedeede1 · outbound

This paper cites Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.732580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:230a57f2fbd5780db5f47acda12543eefcd7f0613c70082a7984b43617710f6f

Observation 9d9f1959-9226-439f-a663-54e36c5816bd · outbound

This paper cites Lifts of convex sets and cone factorizations.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Lifts of convex sets and cone factorizations

Reference 62

Resolution
verified exact
local_arxiv, observed 2026-07-10T06:06:50.439813Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:322e4bb2bc7745124746f0aeb4ff743e3e7c94a19d3235f0371364539a5ef79e

Observation 45f9839c-a890-48c2-89e0-fc2ae579a613 · outbound

This paper cites Positive semidefinite rank.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Positive semidefinite rank

Reference 63

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.399177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:49a0b0f82b312e505b9f6f22fc1cfa84ab00463f67c6f94e438365f7a389e0ed

Observation 0022ef86-7a75-4443-a578-874cd6ad830a · outbound

This paper cites Some upper and lower bounds on PSD-rank.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Some upper and lower bounds on PSD-rank

Reference 64

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.431652Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:07b1bb92d1872d966a99cddeca1fca4863e8a3f9c9d8338af9e7834bed1be97c

Observation f385177f-ebb8-4f8a-8176-9dbb833deaec · outbound

This paper cites Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012) , pages =

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.697444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:4b12eacb6c82498c89b1ef376a59fcc558dd0aca3be363b9798a780171b95b9b

Observation 3efd16ec-c385-43e8-8eed-78ab2d3a87bb · outbound

This paper cites Lifts of Convex Sets and Cone Factorizations , journal =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Lifts of Convex Sets and Cone Factorizations , journal =

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.692342Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:fdcfe4a6f89e43a178ad830058013847ca466ab5b4d8336e9e74a582cec715cf

Observation bc59d8e2-047e-4abd-ac0b-0f31e542f6df · outbound

This paper cites Positive Semidefinite Rank , journal =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Positive Semidefinite Rank , journal =

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.727255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:635c8dd4ac1dbed5a9ff50202b666674f1c49046c163bec408a4e70564fc2d68

Observation 31bf17aa-59f0-47db-9b04-406c3160b07d · outbound

This paper cites Mathematical Programming , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Mathematical Programming , volume =

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.679241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:0b9bff0c62e2021f7e6bf5f4bc2d5846a09632b329f9578fe508ddd2c90c3f78

Observation 87b00301-7480-4deb-a426-881e2d1b9f0f · outbound

This paper cites Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999) , pages =

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.730885Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:69b091bae362aa1d12c2608bbcb4b3ecb206b9ba7d59f53a467fa8f6690f8b0b

Observation 9c1570a4-afa0-4db0-a717-b87e32ba7b7d · outbound

This paper cites Journal of Computer and System Sciences , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Journal of Computer and System Sciences , volume =

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.727992Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e278ad09946b75b326b36f394faa0262f7573b469c646088d83c8d87cd37041b

Observation 76b035c7-54e3-454b-ad2f-709544441df5 · outbound

This paper cites Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) , series =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) , series =

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.724699Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:55acf48747eef15221bded86c3bc7b8b9c6fdc9dab7d57b7a5c76f8c15491b63

Observation 30c06fb4-b221-4f50-8436-91c4179531c3 · outbound

This paper cites SIAM Journal on Computing , volume =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy SIAM Journal on Computing , volume =

Reference 72

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.703005Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e6d3ff7892f8cd77e28b37e275d661c7aa66b0a432bc66d000ff149906607777

Observation caab8634-97a1-4029-84a7-116a2736dad3 · outbound

This paper cites Proceedings of the 32nd Computational Complexity Conference (CCC 2017) , series =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 32nd Computational Complexity Conference (CCC 2017) , series =

Reference 73

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.731152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:3c1a8795424e42c9f30d8aab1296672861f159d063bdf7b3f123fd21f783c23f

Observation 1cd6f368-4214-4ab9-8f6c-4afd300eee4d · outbound

This paper cites Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2022) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2022) , pages =

Reference 74

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.726416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9bb46735596291539e7266abf9b904064f744d1573bbbed4165e651ddc399fa9

Observation f93f6c76-993b-42b5-b6bf-5fe5cd8497eb · outbound

This paper cites A hypercontractive inequality for matrix-valued functions with applications to quantum computing and.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy A hypercontractive inequality for matrix-valued functions with applications to quantum computing and

Reference 75

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.736211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:4ebfb2f856eb91c04d7c084d2a0b2f22600149f88d74c82fbfb9cf710a4f0e61

Observation b6384d4e-3f72-4466-b467-ec753d89d1d0 · outbound

This paper cites Matrix hypercontractivity, streaming algorithms and.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Matrix hypercontractivity, streaming algorithms and

Reference 76

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.684830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:d5a34b6bffa3c89ef145f2508a3ae4b240b8db2eade6f1742125c60e0f70a37f

Observation 584a0bfc-0ea8-4504-befc-be4ec93a2947 · outbound

This paper cites The Quantum and Classical Streaming Complexity of Quantum and Classical.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy The Quantum and Classical Streaming Complexity of Quantum and Classical

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.713514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:2245f0d15ddd8b988aa0e7b0a597e549f98f20740d7fa88c0ab33ccc196e38d0

Observation 3b067662-7700-40ad-b4f7-6d41a280142a · outbound

This paper cites Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (STOC) , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (STOC) , pages=

Reference 78

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.735957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:433a6efaab09bf1974c236410c8b17bd2ff7d4947412dbfb30b4ec0493aee3cd

Observation bcaf22d1-b767-4d86-9aba-3c7821d0a875 · outbound

This paper cites Advances in Cryptology -- CRYPTO 2018 , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Advances in Cryptology -- CRYPTO 2018 , pages=

Reference 79

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.710260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b378ab9dc4bb9172ab1de007ec575db22535103caf154c77b84d185d607fa9a4

Observation 7f42644d-6a7e-4e5b-aa86-4d63c53d590a · outbound

This paper cites IEEE Transactions on Information Theory , volume=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy IEEE Transactions on Information Theory , volume=

Reference 80

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.715783Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9a225f3190abef4e2f2a9390c767903c781e3c0c013b9fce6560799d496b5161

Observation 12614de6-ea55-4f27-abc6-07ee08d23739 · outbound

This paper cites SIAM Journal on Computing , volume=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy SIAM Journal on Computing , volume=

Reference 81

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.708393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:71383221ec1ad7a257b1f10eb82b80bb6bde94791b6cc5b168cd54a871cfe15d

Observation fb7208e6-f8e4-4439-b97d-f1f366c35849 · outbound

This paper cites 36th Computational Complexity Conference (CCC 2021) , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 36th Computational Complexity Conference (CCC 2021) , pages=

Reference 82

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.666145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:7e029096797436bdaa439d3a4fff47bcf0c910fd3b90ac09745e81a3f44232c9

Observation fb46c739-c999-40ef-a1f2-cbad1b1b5109 · outbound

This paper cites Triangle Finding and Listing in CONGEST Networks , year =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Triangle Finding and Listing in CONGEST Networks , year =

Reference 83

Resolution
metadata mismatch
arxiv_id, observed 2026-07-10T06:06:50.306431Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e6d3ec00f0a836ae5675ee581fb7cea5d9c259814c463c02184a27dcc2ccbf7e

Observation b58204e5-8611-4488-b60d-45a635ec5ca9 · outbound

This paper cites 2012 , isbn =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 2012 , isbn =

Reference 84

Resolution
verified exact
doi, observed 2026-07-10T06:06:50.310717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9cdef267ff2220fee6957117356d8f21bcfe897606b412a676565d95b165f59c

Observation 993d867d-49e1-433d-8f49-776f30f2dbaf · outbound

This paper cites Quantum Lower Bounds for Approximate Counting via Laurent Polynomials.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Quantum Lower Bounds for Approximate Counting via Laurent Polynomials

Reference 85

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T06:06:50.452217Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9ddca96c9a1408fa4d5086ee4240c7fc8c8d15edcd67a53ba3b4b088b5e96bda

Observation 2746c374-a29e-49b4-882d-4531fbeccc70 · outbound

This paper cites 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 86

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.699607Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:491d27acffec35fd224dfde5a6fc75e04213aee80cf108d1b8fe3cbaa9f09977

Observation 811e644b-ab06-49c3-9602-089715ab54df · outbound

This paper cites Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=

Reference 87

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.668323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e4be0cb078586f139fc1488d7023b6b6cde09f3be92512d7a3011797f3ea2ba5

Observation c68e2961-99bf-467b-b92d-e98ddf0d1db4 · outbound

This paper cites International Colloquium on Automata, Languages, and Programming , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy International Colloquium on Automata, Languages, and Programming , pages=

Reference 88

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.685907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:2b44f31af15d2b6cbb245eb673c82de23399c2899435af29a101ca8fe64d96c8

Observation 117a8360-86ee-4411-ad50-5f5c76df020f · outbound

This paper cites SIAM Journal on Computing , volume=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy SIAM Journal on Computing , volume=

Reference 89

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.711923Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:01aac22b5d4ab14ac1a964a07fa40e8f9c3e7402dad3aa7385fb6fd4ff0e9bdf

Observation 97f1cdf0-f396-4887-9061-046af6371cd3 · outbound

This paper cites 2025 , isbn =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 2025 , isbn =

Reference 90

Resolution
verified exact
doi, observed 2026-07-10T06:06:50.314100Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:a4ea3e5dd59a6d83789203bfa7a0472acf291485db9944532a6d7ffefb594566

Observation eb8f74c5-a976-48c0-987b-5507c594bb28 · outbound

This paper cites Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

Reference 91

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.738029Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:098526fd0ba18dd08976eaa64cec8db877514389f4284cc58c56d57ecc4b4465

Observation 567c6cc4-6241-47ba-b095-c3c9ae9a669e · outbound

This paper cites Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , pages=

Reference 92

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.741536Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:e9e4440e4225fae8e5c497cbeff95079ab6175bad01260d36aac7802ce30cb50

Observation 5dbb47b6-5d12-494b-b703-5455d0a8c481 · outbound

This paper cites 2025 Symposium on Simplicity in Algorithms (SOSA) , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 2025 Symposium on Simplicity in Algorithms (SOSA) , pages=

Reference 93

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.722321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:07407ac4655e194ed30f11c1bda443140091d32bfe4ed11fd31c1fd60c92310c

Observation d5bffebe-4a3c-4b87-92e0-d14a2c1f01ba · outbound

This paper cites On Quantum Chosen-Ciphertext Attacks and Learning with Errors.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy On Quantum Chosen-Ciphertext Attacks and Learning with Errors

Reference 94

Resolution
verified exact
doi, observed 2026-07-10T06:06:50.301484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:9ab630c24cef8137e7ad45b8f269a8cd26fbdcc4435e66886543409aa99c1893

Observation 1b18132f-35fc-4c7f-b11e-925e5a43dcec · outbound

This paper cites Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=

Reference 95

Resolution
verified fuzzy
raw_fallback, observed 2026-07-10T06:06:50.729062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:0e3b26ce44a344bad83364648e9d16343143bc31333eb9518339fa6b8a57c7f6

Observation eadcb947-03a0-4ddc-b751-5777f7b064ab · outbound

This paper cites Exponential.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Exponential

Reference 96

Resolution
verified exact
doi, observed 2026-07-10T06:06:50.311052Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:3bbe953edb427b25aff32fb29b0b05bb9458850ba6158b1cca92a8ff8d9e7508

Observation 478d75e7-3889-4d99-8e45-ee151b6705a7 · outbound

This paper cites 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , pages =.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , pages =

Reference 97

Resolution
verified exact
doi, observed 2026-07-10T06:06:50.316487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:b6ca206090d6d87e2a9a5193332ce5812967496c894de713b0bd1f075d5e7117

Observation 935ab869-00da-48b6-b16c-3d24f2a16bfe · outbound

This paper cites Comput.54, 2 (2025), 193–232.

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy Comput.54, 2 (2025), 193–232

Reference 98

Resolution
metadata mismatch
doi, observed 2026-07-10T06:06:50.300659Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-07-10T06:05:38.945129Z digest=sha256:7f62b869ee2ca30c0d334fa956aa622a430d579e26adfbc0d3116705fe9e2400

Pith citing papers

No inbound Pith citation observations are available.