{"as_of":"2026-08-22T16:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1993461919d187c058aacb18a445392890bb6ee2191f38698ac9e88be72cb6cf","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:53:52.079436Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T20:53:52.130802Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.07437","last_updated":"2025-01-15T14:02:51Z","snapshot_observed_at":"2026-08-16T14:19:26.672341Z","submitted_at":"2024-02-12T06:32:53Z","title":"Learning Optimal Tax Design in Nonatomic Congestion Games","version":2},"cited_work":{"arxiv_id":"2402.07437","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.07437","snapshot_observed_at":"2026-08-15T20:53:52.130802Z","title":"Learning Optimal Tax Design in Nonatomic Congestion Games","venue":"cs.GT","work_id":"520a71bd-9928-46e5-97f2-3c2c948ecfbb","year":2024},"citing_paper":{"arxiv_id":"2505.11791","last_updated":"2026-06-01T02:56:56Z","snapshot_observed_at":"2026-08-19T03:00:54.922709Z","submitted_at":"2025-05-17T02:30:52Z","title":"Robustness of Incentive Mechanisms Against System Misspecification in Congestion Games","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:53:52.079436Z"},"links":{"cited_paper":"/paper/2402.07437","citing_paper":"/paper/2505.11791"},"observation_digest":"sha256:923f9d92b48307d8807127611c454dcbb4c92986b56d71ef84d2309f10889583","observation_id":"5da0f53b-bc49-4b6e-a38d-077416da937e","resolution":{"observed_at":"2026-08-15T20:53:52.137713Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.07437/citation-record","integrity":"/paper/2402.07437/integrity","json":"/paper/2402.07437/citation-record.json","paper":"/paper/2402.07437"},"outbound":[],"paper":{"arxiv_id":"2402.07437","last_updated":"2025-01-15T14:02:51Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T14:19:26.672341Z","submitted_at":"2024-02-12T06:32:53Z","title":"Learning Optimal Tax Design in Nonatomic Congestion Games"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.07437."}