Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T15:37:57.900885Z
Paper Citation Record · LEDGER
Optimal Separation and Strong Direct Sum for Randomized Query Complexity
As of 16 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.01020.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
26 of 26 outbound references displayed
- verified exact0
- verified fuzzy25
- unresolved1
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 0bbb5970-7e73-43a9-ba0f-422fa80614be · outbound
This paper cites Separations in query complexity using cheat sheets.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Separations in query complexity using cheat sheets
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.194291Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4d439d0b-de6e-42bd-9412-1bd7156d8a16 · outbound
This paper cites Separations in query complexity based on pointer functions.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Separations in query complexity based on pointer functions
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.184035Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 09fed0a6-58db-4da8-900e-a8c5e5bb2078 · outbound
This paper cites Nearly optimal separations between communication (or query) complexity and partitions.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Nearly optimal separations between communication (or query) complexity and partitions
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.173645Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 494cca82-cde7-45be-9d4b-752be7b2a007 · outbound
This paper cites Separations in communication complexity using cheat sheets and information complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Separations in communication complexity using cheat sheets and information complexity
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.163074Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ef143b98-ae0d-40ba-a7cb-91e26e1c2a32 · outbound
This paper cites An information statistics approach to data stream and communication complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity An information statistics approach to data stream and communication complexity
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.152628Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 39cb7cee-97bb-4bef-8608-49df455ffae7 · outbound
This paper cites How to compress interactive commu- nication.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity How to compress interactive commu- nication
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.141865Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9d69cc0a-b684-44c5-9cc0-3194f2921f88 · outbound
This paper cites Decision trees with AND, OR queries.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Decision trees with AND, OR queries
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.132158Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 591b3cd7-6420-489c-98b7-529e9ab8e21b · outbound
This paper cites Randomized query complexity of sabotaged and com- posed functions.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Randomized query complexity of sabotaged and com- posed functions
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.121504Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation dfcab335-9e9a-4e48-9a63-def7c6c3da63 · outbound
This paper cites Information equals amortized communication.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Information equals amortized communication
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.111688Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1d74924d-1da4-49b2-b8f9-e6aa7f2ce080 · outbound
This paper cites Robust polynomials and quantum algorithms.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Robust polynomials and quantum algorithms
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.101888Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f46e0bdf-aec6-4d99-be76-902596577c5a · outbound
This paper cites Informational complexity and the direct sum problem for simultaneous message complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Informational complexity and the direct sum problem for simultaneous message complexity
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.090916Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b80aa1b0-0f78-4602-b2d1-907cd482e407 · outbound
This paper cites The bit extraction problem or t-resilient functions.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity The bit extraction problem or t-resilient functions
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.080978Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9d20cff3-758e-431d-8afa-8301131c6387 · outbound
This paper cites Improved direct product theorems for randomized query complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Improved direct product theorems for randomized query complexity
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.071215Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4523fd5b-7dca-42d6-aadf-e0ab057642b8 · outbound
This paper cites Amortized communication com- plexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Amortized communication com- plexity
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.061584Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d23c8a9e-35bc-49e5-ad78-3ae882e9c098 · outbound
This paper cites Exponential separation of information and communica- tion.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Exponential separation of information and communica- tion
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.052185Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c68cd633-22d0-40c5-aa6b-3184c0aaee2c · outbound
This paper cites Deterministic communication vs.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Deterministic communication vs
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.041886Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 910a2d1b-3e99-4144-a395-50171138c2f7 · outbound
This paper cites Query-to-communication lifting for BPP.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Query-to-communication lifting for BPP
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.031650Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation eaa7ddfd-57b7-4967-939c-569a00f62daa · outbound
This paper cites A direct product theorem.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity A direct product theorem
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.021584Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1fe872a6-b3f6-42b4-9b02-0b8457625dd1 · outbound
This paper cites Optimal direct sum results for deterministic and randomized decision tree complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Optimal direct sum results for deterministic and randomized decision tree complexity
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:58.011244Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ec9dc415-4300-4e76-885b-ad87af15171a · outbound
This paper cites Super-logarithmic depth lower bounds via the direct sum in communication complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Super-logarithmic depth lower bounds via the direct sum in communication complexity
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.999886Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6c0b7026-7dec-4bac-9d39-5c8871f8f738 · outbound
This paper cites Woodruff, and Grigory Yaroslavtsev.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Woodruff, and Grigory Yaroslavtsev
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.989243Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 61c2c1cf-6fd4-4eb0-904b-43bc467d789d · outbound
This paper cites Amplification of one-way infor- mation complexity via codes and noise sensitivity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Amplification of one-way infor- mation complexity via codes and noise sensitivity
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.977725Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 73ac845f-303d-4b84-bef4-3420b7b75aeb · outbound
This paper cites Towards better separation between determinis- tic and randomized query complexity.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Towards better separation between determinis- tic and randomized query complexity
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.967503Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0154d521-a544-42a2-a7f8-0ab219ae90f4 · outbound
This paper cites an unresolved cited work.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Unresolved cited work
Reference 24
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:37:57.956334Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 47add94e-1080-4aa3-b48c-3a9812deca81 · outbound
This paper cites Towards proving strong direct product theorems.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity Towards proving strong direct product theorems
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.945725Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation cebce3fc-4c6b-43ba-a20f-1fe6f6d2840c · outbound
This paper cites The power of asymmetry in constant-depth circuits.
Optimal Separation and Strong Direct Sum for Randomized Query Complexity The power of asymmetry in constant-depth circuits
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:37:57.934569Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.