{"as_of":"2026-08-10T18:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cee980eeb4ca573ba1b69ef69d5bec3570fbc1121be9f0cebac0c0cede01137","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-10T06:31:04.303077+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-06T22:03:26.709583Z","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-06T22:03:31.388053Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.05684","last_updated":"2021-10-25T15:45:41Z","snapshot_observed_at":"2026-08-10T16:20:42.667216Z","submitted_at":"2020-06-10T06:45:20Z","title":"Auction learning as a two-player game","version":4},"cited_work":{"arxiv_id":"2006.05684","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.05684","snapshot_observed_at":"2026-08-06T22:03:31.388053Z","title":"Auction learning as a two-player game","venue":"cs.GT","work_id":"acd95252-6a05-49fe-b26b-7ee8085b4d3e","year":2020},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.709583Z"},"links":{"cited_paper":"/paper/2006.05684","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:49f46dcc1d0e356eca8adee31f768d7abf63042053207f69709edb337804a29e","observation_id":"e6e161fe-97aa-4d86-93a2-98695f067020","resolution":{"observed_at":"2026-08-06T22:03:31.531506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.05684/citation-record","integrity":"/paper/2006.05684/integrity","json":"/paper/2006.05684/citation-record.json","paper":"/paper/2006.05684"},"outbound":[],"paper":{"arxiv_id":"2006.05684","last_updated":"2021-10-25T15:45:41Z","latest_version":4,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-10T16:20:42.667216Z","submitted_at":"2020-06-10T06:45:20Z","title":"Auction learning as a two-player game"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2006.05684."}