Pith. sign in

Paper Citation Record · LEDGER

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy

As of 10 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-10T06:31:04.303077+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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.