Pith. sign in

Paper Citation Record · LEDGER

Parameterized Complexity of Finding Dissimilar Shortest Paths

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.14376.

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

pith.paper-citation-record.v1
2402.14376 v1

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-08T06:32:00.761636+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-07T12:01:45.825818Z

measured 0 of 1 external citation measurements

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

source=pdf_text observed=2026-08-07T12:01:45.825818Z digest=sha256:1ff8fc679445d8e4703ddda4ef9b2db227910308114c77a63931ad18a76602d0

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-05-08T05:57:44.392224Z digest=sha256:908f60b5d41727a8b639ae56e491a67a0486a338f01cce82d0038af3d4affe31