Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Differentiable Bilevel Programming for Stackelberg Congestion Games
As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2209.07618.
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-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-11T19:46:15.666437Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-06T14:14:38.948721Z
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 84e1256b-62e8-48db-94ce-639a577f88a0 · inbound
A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing cites this paper.
A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing Differentiable Bilevel Programming for Stackelberg Congestion Games
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T19:46:15.666437Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation af9fb3ba-f3d0-47ef-be27-16aa59f8d3ba · inbound
Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory cites this paper.
Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory Differentiable Bilevel Programming for Stackelberg Congestion Games
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T22:03:25.676405Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e64058c4-0fd5-4a47-a931-3ae9a4f8407d · inbound
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles cites this paper.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles Differentiable Bilevel Programming for Stackelberg Congestion Games
Reference 2007
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T14:14:39.011600Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.