{"as_of":"2026-08-07T21:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c37489b9f88f95425f48b77381da790e35ef8945c12c08bde35aae69ae5bd0d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:03:25.676405Z","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-06T14:14:38.948721Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.07618","last_updated":"2024-05-14T01:56:30Z","snapshot_observed_at":"2026-08-01T18:58:38.919527Z","submitted_at":"2022-09-15T21:32:23Z","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.07618","snapshot_observed_at":"2026-08-06T22:03:25.676405Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22966","last_updated":"2025-06-28T17:56:38Z","snapshot_observed_at":"2026-08-06T21:51:39.329058Z","submitted_at":"2025-06-28T17:56:38Z","title":"Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.676405Z"},"links":{"cited_paper":"/paper/2209.07618","citing_paper":"/paper/2506.22966"},"observation_digest":"sha256:f41294c6df51b29a44a4ac50bcfbd724f1e1672237a5030a89297af628e4e084","observation_id":"af9fb3ba-f3d0-47ef-be27-16aa59f8d3ba","resolution":{"observed_at":"2026-08-06T22:03:25.676405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07618","last_updated":"2024-05-14T01:56:30Z","snapshot_observed_at":"2026-08-01T18:58:38.919527Z","submitted_at":"2022-09-15T21:32:23Z","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","version":4},"cited_work":{"arxiv_id":"2209.07618","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.07618","snapshot_observed_at":"2026-08-06T14:14:38.948721Z","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","venue":"cs.GT","work_id":"fc48987c-a4e5-4ae9-9daa-4fc0df53ef45","year":2022},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.206632Z"},"links":{"cited_paper":"/paper/2209.07618","citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:bc7319fdfe588ebf9c722cbd4eb71539551f586063778bf847a578bc6f537a10","observation_id":"e64058c4-0fd5-4a47-a931-3ae9a4f8407d","resolution":{"observed_at":"2026-08-06T14:14:39.011600Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2209.07618/citation-record","integrity":"/paper/2209.07618/integrity","json":"/paper/2209.07618/citation-record.json","paper":"/paper/2209.07618"},"outbound":[],"paper":{"arxiv_id":"2209.07618","last_updated":"2024-05-14T01:56:30Z","latest_version":4,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-01T18:58:38.919527Z","submitted_at":"2022-09-15T21:32:23Z","title":"Differentiable Bilevel Programming for Stackelberg 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2209.07618."}