Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Finding Densest Subgraphs with Edge-Color Constraints
As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.09124.
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-09T15:38:41.809426Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-09T15:38:41.906720Z
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 02be1a1d-533a-4e6d-9587-7b1199ada240 · inbound
Fair densest subgraph across multiple graphs cites this paper.
Fair densest subgraph across multiple graphs Finding Densest Subgraphs with Edge-Color Constraints
Reference 17
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-09T15:38:41.982638Z
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.