Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Algorithmic Collusion Without Threats
As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2409.03956.
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-04T06:34:03.388597+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-28T16:23:56.306626Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-10T06:15:00.866473Z
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 94794625-34d8-401e-b42f-e016ccd8e6a6 · inbound
Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners cites this paper.
Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners Algorithmic Collusion Without Threats
Reference 4
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T03:57:29.473303Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 5fa1c0da-3b5b-47ba-9b24-6b63a217bf30 · inbound
Hierarchies of No-regret Algorithms cites this paper.
Hierarchies of No-regret Algorithms Algorithmic Collusion Without Threats
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T23:21:22.918649Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6d4f956c-eccb-4a5d-abad-26b7de50d061 · inbound
Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices cites this paper.
Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices Algorithmic Collusion Without Threats
Reference 4
- Resolution
- verified exact
- arxiv_id, observed 2026-05-19T18:07:42.945017Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 90195b39-0985-4e60-81e1-53028773eac4 · inbound
Domination-Avoiding Learning Agents Cannot Collude cites this paper.
Domination-Avoiding Learning Agents Cannot Collude Algorithmic Collusion Without Threats
Reference 19
- Resolution
- verified exact
- arxiv_id, observed 2026-07-01T21:46:15.391451Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6adb7307-0a92-4764-89a2-160f1c237ae1 · inbound
Mean-based algorithms: A lower bound and regret cites this paper.
Mean-based algorithms: A lower bound and regret Algorithmic Collusion Without Threats
Reference 18
- Resolution
- verified exact
- arxiv_id, observed 2026-06-28T07:21:44.759879Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 74ebf60e-6566-442a-aea5-e6f1ec58a671 · inbound
Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion cites this paper.
Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion Algorithmic Collusion Without Threats
Reference 24
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T11:36:55.307695Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.