Pith. sign in

Paper Citation Record · LEDGER

Differentiable Bilevel Programming for Stackelberg Congestion Games

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2209.07618 v4

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T22:03:25.676405Z

measured 0 of 1 external citation measurements

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 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.

source=pdf_text observed=2026-08-06T22:03:25.676405Z digest=sha256:f41294c6df51b29a44a4ac50bcfbd724f1e1672237a5030a89297af628e4e084

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T14:14:38.206632Z digest=sha256:bc7319fdfe588ebf9c722cbd4eb71539551f586063778bf847a578bc6f537a10