{"as_of":"2026-08-07T16:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e46491beb48d14489615dfef4b07fcce89aff3e5f48e45829e8b79f9393b2a6f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T19:23:16.083566Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.15023","last_updated":"2025-07-29T10:36:14Z","snapshot_observed_at":"2026-08-07T00:20:54.278739Z","submitted_at":"2024-09-23T13:50:39Z","title":"Efficient Nearest Neighbor Search Using Dynamic Programming","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15023","snapshot_observed_at":"2026-08-04T19:23:16.083566Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09333","last_updated":"2025-09-11T10:36:26Z","snapshot_observed_at":"2026-08-05T02:05:11.064074Z","submitted_at":"2025-09-11T10:36:26Z","title":"Toward Precise Curve Offsetting Constrained to Parametric Surfaces","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T19:23:16.083566Z"},"links":{"cited_paper":"/paper/2409.15023","citing_paper":"/paper/2509.09333"},"observation_digest":"sha256:0df3c316d82e7948b1ff71cd9c4ff45b15ddf5ebd0b11e228cd3dbea198c3ac5","observation_id":"4f685627-62f5-4b02-8087-9d9d931d6362","resolution":{"observed_at":"2026-08-04T19:23:16.083566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.15023/citation-record","integrity":"/paper/2409.15023/integrity","json":"/paper/2409.15023/citation-record.json","paper":"/paper/2409.15023"},"outbound":[],"paper":{"arxiv_id":"2409.15023","last_updated":"2025-07-29T10:36:14Z","latest_version":5,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-07T00:20:54.278739Z","submitted_at":"2024-09-23T13:50:39Z","title":"Efficient Nearest Neighbor Search Using Dynamic Programming"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2409.15023."}