Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T17:08:49.061359Z
Paper Citation Record · LEDGER
Strong XOR Lemma for Information Complexity
As of 21 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2411.13015.
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-20T06:33:59.587034+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
3 of 3 outbound references displayed
- verified exact0
- verified fuzzy2
- unresolved1
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation b32254a7-66e5-452d-ad86-6752b8a500fb · outbound
This paper cites Summing this over 0 ≤ k ≤ m − 1 = log2 n − 1 yields: m−1X k=0 X |S|=k H(pS) = O(nτ log n) as wished.
Strong XOR Lemma for Information Complexity Summing this over 0 ≤ k ≤ m − 1 = log2 n − 1 yields: m−1X k=0 X |S|=k H(pS) = O(nτ log n) as wished
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T17:08:49.134441Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 6918994f-0bc9-4b82-ad66-b24b7e779eef · outbound
This paper cites Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract).
Strong XOR Lemma for Information Complexity Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract)
Reference 1982
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T17:08:49.157447Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ae0adab2-ea12-43ab-8acf-e9dcf6cd292c · outbound
This paper cites An XOR Lemma for Deterministic Communication Complexity.
Strong XOR Lemma for Information Complexity An XOR Lemma for Deterministic Communication Complexity
Reference 2007
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T17:08:49.012741Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.