{"as_of":"2026-08-05T01:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ea734658147231f7d8784962f839ad46f3269704a8b4c06f496284952a23e39","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T16:23:56.306626Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2502.08597","last_updated":"2026-05-01T09:39:08Z","snapshot_observed_at":"2026-07-06T20:35:30.739339Z","submitted_at":"2025-02-12T17:34:04Z","title":"Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T03:56:44.748069Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2502.08597"},"observation_digest":"sha256:1d2d1c345c421277bf546d703283ae23297c1f10c2d44272f5b41816f2c3b407","observation_id":"94794625-34d8-401e-b42f-e016ccd8e6a6","resolution":{"observed_at":"2026-05-23T03:57:29.473303Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2604.25045","last_updated":"2026-04-27T22:52:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-27T22:52:08Z","title":"Hierarchies of No-regret Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T17:16:43.372206Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2604.25045"},"observation_digest":"sha256:cfbe445f3878584ed1646a827bd23d1308632c3305e35298768d425c1c278a44","observation_id":"5fa1c0da-3b5b-47ba-9b24-6b63a217bf30","resolution":{"observed_at":"2026-05-11T23:21:22.918649Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2605.16064","last_updated":"2026-06-01T20:18:37Z","snapshot_observed_at":"2026-08-01T08:58:52.953119Z","submitted_at":"2026-05-15T15:29:23Z","title":"Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-19T18:05:53.291969Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2605.16064"},"observation_digest":"sha256:e275e1d5863cf64334e7245eff6bdd2fc2ecd48cca6b356f48b1c0e611313760","observation_id":"6d4f956c-eccb-4a5d-abad-26b7de50d061","resolution":{"observed_at":"2026-05-19T18:07:42.945017Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2606.01275","last_updated":"2026-05-31T14:57:46Z","snapshot_observed_at":"2026-08-01T16:41:36.971176Z","submitted_at":"2026-05-31T14:57:46Z","title":"Domination-Avoiding Learning Agents Cannot Collude","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T16:23:56.306626Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2606.01275"},"observation_digest":"sha256:1ae14e9f89126eff4e13e06ae5119349f27a13cddb54a9b798c31396d917fdec","observation_id":"90195b39-0985-4e60-81e1-53028773eac4","resolution":{"observed_at":"2026-07-01T21:46:15.391451Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2606.04931","last_updated":"2026-06-03T14:23:41Z","snapshot_observed_at":"2026-07-06T23:44:57.208389Z","submitted_at":"2026-06-03T14:23:41Z","title":"Mean-based algorithms: A lower bound and regret","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T07:17:24.957957Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2606.04931"},"observation_digest":"sha256:946fd78de51a211f124fdc631c85bd39a453156d116eb4c768ff2f54611ed8a5","observation_id":"6adb7307-0a92-4764-89a2-160f1c237ae1","resolution":{"observed_at":"2026-06-28T07:21:44.759879Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats","version":2},"cited_work":{"arxiv_id":"2409.03956","doi":"10.48550/arxiv.2409.03956","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.03956","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.03956 , year=","venue":null,"work_id":"dff9a443-2102-4039-b170-e20f845dc9f4","year":2024},"citing_paper":{"arxiv_id":"2606.05363","last_updated":"2026-06-08T00:27:34Z","snapshot_observed_at":"2026-08-02T11:41:57.056011Z","submitted_at":"2026-06-03T19:10:55Z","title":"Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T03:16:17.500642Z"},"links":{"cited_paper":"/paper/2409.03956","citing_paper":"/paper/2606.05363"},"observation_digest":"sha256:efba1809eeb5cf02f80d60e83d0a25fefcdc5f2da13cb72bce5a594626e39b0b","observation_id":"74ebf60e-6566-442a-aea5-e6f1ec58a671","resolution":{"observed_at":"2026-07-02T11:36:55.307695Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.03956/citation-record","integrity":"/paper/2409.03956/integrity","json":"/paper/2409.03956/citation-record.json","paper":"/paper/2409.03956"},"outbound":[],"paper":{"arxiv_id":"2409.03956","last_updated":"2024-12-13T23:48:14Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T19:11:18.410415Z","submitted_at":"2024-09-06T00:43:21Z","title":"Algorithmic Collusion Without Threats"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2409.03956."}