Pith. sign in

Paper Citation Record · LEDGER

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy

As of 7 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-07T06:34:17.273281+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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.