{"as_of":"2026-08-23T14:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5280597efb4d97db925aebaff72363850b0b262522202046e292545af37a971","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-23T06:30:58.430688+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-06-25T19:00:38.704198Z","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-07-04T21:10:09.628746Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.14868","last_updated":"2024-02-21T11:58:26Z","snapshot_observed_at":"2026-08-16T14:16:38.250255Z","submitted_at":"2024-02-21T11:58:26Z","title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints","version":1},"cited_work":{"arxiv_id":"2402.14868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.14868","snapshot_observed_at":"2026-07-04T21:10:09.628746Z","title":"arXiv preprint arXiv:2402.14868 , year=","venue":null,"work_id":"118f0e8f-688a-4e1a-b0c7-d180834dc8b5","year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"cited_paper":"/paper/2402.14868","citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:d4ef71c022adc03e864ce4d6eff74fd030e318476e25615564b2f2cbe6935eff","observation_id":"0bda89b8-9059-45b3-98b9-dbd4010c2ed3","resolution":{"observed_at":"2026-07-04T21:10:09.630730Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.14868/citation-record","integrity":"/paper/2402.14868/integrity","json":"/paper/2402.14868/citation-record.json","paper":"/paper/2402.14868"},"outbound":[],"paper":{"arxiv_id":"2402.14868","last_updated":"2024-02-21T11:58:26Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:16:38.250255Z","submitted_at":"2024-02-21T11:58:26Z","title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.14868."}