{"as_of":"2026-08-08T20:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e80805142b0e653bf7200b956623e5ea63ffbf5bda3c793ae5a23117ef833f07","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:01:45.825818Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:21:10.154514Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.14376","last_updated":"2024-02-22T08:40:03Z","snapshot_observed_at":"2026-07-06T17:33:50.525062Z","submitted_at":"2024-02-22T08:40:03Z","title":"Parameterized Complexity of Finding Dissimilar Shortest Paths","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14376","snapshot_observed_at":"2026-08-07T12:01:45.825818Z","title":"arXiv preprint arXiv:2402.14376 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01323","last_updated":"2025-06-10T15:23:08Z","snapshot_observed_at":"2026-08-07T11:42:07.853909Z","submitted_at":"2025-06-02T05:10:16Z","title":"Computing Diverse and Nice Triangulations","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:01:45.825818Z"},"links":{"cited_paper":"/paper/2402.14376","citing_paper":"/paper/2506.01323"},"observation_digest":"sha256:1ff8fc679445d8e4703ddda4ef9b2db227910308114c77a63931ad18a76602d0","observation_id":"63ee4aee-9944-4cc1-836e-bfbcf66955d7","resolution":{"observed_at":"2026-08-07T12:01:45.825818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14376","last_updated":"2024-02-22T08:40:03Z","snapshot_observed_at":"2026-07-06T17:33:50.525062Z","submitted_at":"2024-02-22T08:40:03Z","title":"Parameterized Complexity of Finding Dissimilar Shortest Paths","version":1},"cited_work":{"arxiv_id":"2402.14376","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.14376","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.14376 , year=","venue":null,"work_id":"950216b4-158e-459a-9a82-8fc9986ca71a","year":null},"citing_paper":{"arxiv_id":"2605.05991","last_updated":"2026-05-07T10:41:50Z","snapshot_observed_at":"2026-07-06T23:18:31.432422Z","submitted_at":"2026-05-07T10:41:50Z","title":"A Case-Driven Multi-Agent Framework for E-Commerce Search Relevance","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-08T05:57:44.392224Z"},"links":{"cited_paper":"/paper/2402.14376","citing_paper":"/paper/2605.05991"},"observation_digest":"sha256:908f60b5d41727a8b639ae56e491a67a0486a338f01cce82d0038af3d4affe31","observation_id":"7d4510cd-4975-42c8-bb85-6a77894bc066","resolution":{"observed_at":"2026-05-11T21:21:10.163437Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.14376/citation-record","integrity":"/paper/2402.14376/integrity","json":"/paper/2402.14376/citation-record.json","paper":"/paper/2402.14376"},"outbound":[],"paper":{"arxiv_id":"2402.14376","last_updated":"2024-02-22T08:40:03Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T17:33:50.525062Z","submitted_at":"2024-02-22T08:40:03Z","title":"Parameterized Complexity of Finding Dissimilar Shortest Paths"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}