Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The one-way communication complexity of the Boolean Hidden Matching Problem
As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:quant-ph/0607173.
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-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-12T11:06:41.974339Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-12T11:06:42.277565Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation ac532d94-730c-40dc-a83e-6de76fd82cc7 · inbound
Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory cites this paper.
Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory The one-way communication complexity of the Boolean Hidden Matching Problem
Reference 20
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T11:06:42.282835Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.