{"as_of":"2026-08-19T11:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4737be5ceb39ea1a60fd6ae63bdac4a9ec7ea11ff928795e525e20fdceb44ea2","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-19T06:32:44.657259+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-05-18T21:35:45.836451Z","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-18T21:36:51.941129Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.01560","last_updated":"2025-04-02T10:01:34Z","snapshot_observed_at":"2026-08-18T04:19:44.891406Z","submitted_at":"2025-04-02T10:01:34Z","title":"Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery","version":1},"cited_work":{"arxiv_id":"2504.01560","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01560","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Osaba, E","venue":null,"work_id":"ba4b0503-e587-424e-8d4f-6d8c44c603fc","year":2025},"citing_paper":{"arxiv_id":"2508.17896","last_updated":"2026-07-06T08:14:54Z","snapshot_observed_at":"2026-08-15T17:02:05.454854Z","submitted_at":"2025-08-25T11:07:47Z","title":"Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T21:35:45.836451Z"},"links":{"cited_paper":"/paper/2504.01560","citing_paper":"/paper/2508.17896"},"observation_digest":"sha256:a67e2f4bc5a23d77fa9ca75e712391c27f2835a628105f80fc76e463bd1f03b6","observation_id":"50be32f6-4b90-4947-bc78-329f29429ee6","resolution":{"observed_at":"2026-05-18T21:36:51.944943Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01560","last_updated":"2025-04-02T10:01:34Z","snapshot_observed_at":"2026-08-18T04:19:44.891406Z","submitted_at":"2025-04-02T10:01:34Z","title":"Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery","version":1},"cited_work":{"arxiv_id":"2504.01560","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01560","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Osaba, E","venue":null,"work_id":"ba4b0503-e587-424e-8d4f-6d8c44c603fc","year":2025},"citing_paper":{"arxiv_id":"2604.20321","last_updated":"2026-04-22T08:20:17Z","snapshot_observed_at":"2026-08-18T02:10:37.005992Z","submitted_at":"2026-04-22T08:20:17Z","title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-10T00:37:09.410002Z"},"links":{"cited_paper":"/paper/2504.01560","citing_paper":"/paper/2604.20321"},"observation_digest":"sha256:c28cc94a26b0ad3c8e715c11cc685490bc537d80c043fd6fbb792a580ce0d37c","observation_id":"307c7436-7619-4ccb-b566-bbafb3626846","resolution":{"observed_at":"2026-05-11T13:46:04.637504Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.01560/citation-record","integrity":"/paper/2504.01560/integrity","json":"/paper/2504.01560/citation-record.json","paper":"/paper/2504.01560"},"outbound":[],"paper":{"arxiv_id":"2504.01560","last_updated":"2025-04-02T10:01:34Z","latest_version":1,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-18T04:19:44.891406Z","submitted_at":"2025-04-02T10:01:34Z","title":"Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2504.01560."}