Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T14:14:38.493294Z
Paper Citation Record · LEDGER
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles
As of 7 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2507.19675.
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-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T00:54:52.029029Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
12 of 12 outbound references displayed
- verified exact4
- verified fuzzy5
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch1
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 6d10f235-3989-4598-8893-83ff95da8cd4 · outbound
This paper cites URL http://dx.doi.org/10.1287/opre.1040.0197.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles URL http://dx.doi.org/10.1287/opre.1040.0197
Reference 4
- Resolution
- verified exact
- raw_fallback, observed 2026-08-06T14:14:39.186586Z
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.
Observation 866f568e-a90b-4410-a657-d8335103f829 · outbound
This paper cites we can assume that sum of this set is equal 0, in such approach we look for non-trivial solutions to such problem (not the one that takes all elements in the set).
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles we can assume that sum of this set is equal 0, in such approach we look for non-trivial solutions to such problem (not the one that takes all elements in the set)
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T14:14:39.509808Z
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.
Observation deaa0e5e-f9d2-4f76-ab98-5f3236843ee8 · outbound
This paper cites Proof of the Claim 2.13 In this section, we prove that reduction of a Wardropian Cycle length by the flow partition method isNP-hard.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles Proof of the Claim 2.13 In this section, we prove that reduction of a Wardropian Cycle length by the flow partition method isNP-hard
Reference 368
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T14:14:39.667137Z
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.
Observation 7fc261d2-ce03-41c7-b3e3-2cc0c695edce · outbound
This paper cites URL https://doi.org/10.2307/1969529.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles URL https://doi.org/10.2307/1969529
Reference 1951
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T14:14:37.839899Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ecae036f-3f04-41aa-8d63-ee77c8bb591f · outbound
This paper cites Stier-Moses.
Reference 2001
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T14:14:40.182714Z
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.
Observation c3428d44-057a-46ab-836d-1a33dc903d18 · outbound
This paper cites an unresolved cited work.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles Unresolved cited work
Reference 2005
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T14:14:40.332503Z
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.
Observation e64058c4-0fd5-4a47-a931-3ae9a4f8407d · outbound
This paper cites Differentiable Bilevel Programming for Stackelberg Congestion Games.
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.
Observation ba49cb92-1ec9-44d5-8733-b4a42c88d1dc · outbound
This paper cites Real-time urban tra ffic amount prediction models for dynamic route guidance systems.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles Real-time urban tra ffic amount prediction models for dynamic route guidance systems
Reference 2012
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T14:14:39.986318Z
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.
Observation c5a71a21-f1a4-4406-975b-49ebac55ad31 · outbound
This paper cites Bagloee, M.
Reference 2014
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T14:14:39.842291Z
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.
Observation 9357e70a-998a-46bb-ad45-e7cd6a049eb9 · outbound
This paper cites A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing
Reference 2018
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T14:14:39.330265Z
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.
Observation 5832f7e3-69b0-462b-9c6a-18c06e3b4adf · outbound
This paper cites doi: https: //doi.org/10.1016/j.cor.2020.105016.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles doi: https: //doi.org/10.1016/j.cor.2020.105016
Reference 2020
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-06T14:14:38.864078Z
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.
Observation ed5f356f-d4c2-4002-b322-9cb1737e887b · outbound
This paper cites doi: https: //doi.org/10.1016/j.trpro.2023.02.186.
Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles doi: https: //doi.org/10.1016/j.trpro.2023.02.186
Reference 2023
- Resolution
- verified exact
- doi, observed 2026-08-06T14:14:38.645238Z
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.
Pith citing papers
Observation 03b94f50-aac6-4b5f-aa62-cbd291996b18 · inbound
Randomized routing strategies of fleets of CAVs may prove market efficient cites this paper.
Randomized routing strategies of fleets of CAVs may prove market efficient Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T00:54:52.029029Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.