{"as_of":"2026-08-20T10:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62a5f76537309621242cc57fad67b56da4abaf6c475eba99732a52da1fb4e68e","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-20T06:33:59.587034+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-15T15:49:22.324530Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T15:49:22.450918Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.02959","last_updated":"2024-07-03T09:52:30Z","snapshot_observed_at":"2026-08-16T13:37:27.301563Z","submitted_at":"2024-07-03T09:52:30Z","title":"Competing for the most profitable tour: The orienteering interdiction game","version":1},"cited_work":{"arxiv_id":"2407.02959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.02959","snapshot_observed_at":"2026-08-15T15:49:22.450918Z","title":"Competing for the most profitable tour: The orienteering interdiction game","venue":"math.OC","work_id":"a6c275c5-8eea-4823-b600-d99122f42f87","year":2024},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.324530Z"},"links":{"cited_paper":"/paper/2407.02959","citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:b289417797a9e1e7e8518c17acc730afc495af52a5070a9063094a68468e194f","observation_id":"a93edeb8-854f-43f1-a770-fc79719d11b9","resolution":{"observed_at":"2026-08-15T15:49:22.456866Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.02959/citation-record","integrity":"/paper/2407.02959/integrity","json":"/paper/2407.02959/citation-record.json","paper":"/paper/2407.02959"},"outbound":[],"paper":{"arxiv_id":"2407.02959","last_updated":"2024-07-03T09:52:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T13:37:27.301563Z","submitted_at":"2024-07-03T09:52:30Z","title":"Competing for the most profitable tour: The orienteering interdiction game"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.02959."}