Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Parameterized Complexity of Finding Dissimilar Shortest Paths
As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.14376.
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-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T17:31:58.897642Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T21:21:10.154514Z
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 4d8b462e-6fb5-4041-812d-3cdf2f4ad38a · inbound
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems cites this paper.
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems Parameterized Complexity of Finding Dissimilar Shortest Paths
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T17:31:58.897642Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 63ee4aee-9944-4cc1-836e-bfbcf66955d7 · inbound
Computing Diverse and Nice Triangulations cites this paper.
Computing Diverse and Nice Triangulations Parameterized Complexity of Finding Dissimilar Shortest Paths
Reference 28
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T12:01:45.825818Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7d4510cd-4975-42c8-bb85-6a77894bc066 · inbound
A Case-Driven Multi-Agent Framework for E-Commerce Search Relevance cites this paper.
A Case-Driven Multi-Agent Framework for E-Commerce Search Relevance Parameterized Complexity of Finding Dissimilar Shortest Paths
Reference 36
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T21:21:10.163437Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.