{"as_of":"2026-08-07T22:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:02355eadd69cf62a4be0dfee5863844bd015c4fa2867d4197f376628c0132b39","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-07T06:34:17.273281+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-07T04:20:26.909406Z","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":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-03T07:06:28.969300Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03860","snapshot_observed_at":"2026-08-07T04:20:26.909406Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10872","last_updated":"2025-08-01T22:10:35Z","snapshot_observed_at":"2026-08-07T04:13:14.097277Z","submitted_at":"2025-06-12T16:38:51Z","title":"The Gittins Index: A Design Principle for Decision-Making Under Uncertainty","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:26.909406Z"},"links":{"cited_paper":"/paper/2412.03860","citing_paper":"/paper/2506.10872"},"observation_digest":"sha256:664801977dd96902c6fbb3b97d1783658d4a99adc010cbb07558945887ebce67","observation_id":"a10e1aaa-6647-4e1e-8e34-ee92643ae322","resolution":{"observed_at":"2026-08-07T04:20:26.909406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-03T07:06:28.969300Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03860","snapshot_observed_at":"2026-08-04T14:56:59.845877Z","title":"Combinatorial selection with costly information","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-07T00:55:36.865093Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.845877Z"},"links":{"cited_paper":"/paper/2412.03860","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:cae26c2cb224ab3bc69edeb19f4358b6c32b4eba1d155d5abf1b07464f564f11","observation_id":"f2715cd3-318b-4df7-85da-8750894a6c30","resolution":{"observed_at":"2026-08-04T14:56:59.845877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.03860/citation-record","integrity":"/paper/2412.03860/integrity","json":"/paper/2412.03860/citation-record.json","paper":"/paper/2412.03860"},"outbound":[],"paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T07:06:28.969300Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information"},"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 2 inbound Pith citation observations for arXiv:2412.03860."}