Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Task-Oriented Convex Bilevel Optimization with Latent Feasibility
As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1907.03083.
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-05T06:32:48.257954+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T20:49:54.803608Z
A source-named dated measurement, never combined with another source.
Source: cited_works
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 690c9285-a6c7-44fc-b9e9-2630813be869 · inbound
Directional first order approach for a class of bilevel programs cites this paper.
Directional first order approach for a class of bilevel programs Task-Oriented Convex Bilevel Optimization with Latent Feasibility
Reference 61
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T20:49:54.803608Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.