{"as_of":"2026-08-19T14:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2244ee7c3e39acd4689b8aefee50d3ace4c36fafa834b3226c60c69df5b212c","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-08-15T16:25:44.377106Z","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-15T16:25:44.532569Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.12183","last_updated":"2018-11-26T14:33:56Z","snapshot_observed_at":"2026-08-14T17:53:19.074750Z","submitted_at":"2018-11-26T14:33:56Z","title":"Analyzing and provably improving fixed budget ranking and selection algorithms","version":1},"cited_work":{"arxiv_id":"1811.12183","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.12183","snapshot_observed_at":"2026-08-15T16:25:44.532569Z","title":"Analyzing and provably improving fixed budget ranking and selection algorithms","venue":"math.OC","work_id":"f832d2e7-a8e2-4532-bd30-dc015e53d45a","year":2018},"citing_paper":{"arxiv_id":"2509.06147","last_updated":"2025-09-07T17:36:29Z","snapshot_observed_at":"2026-08-19T12:40:40.811432Z","submitted_at":"2025-09-07T17:36:29Z","title":"Additive Distributionally Robust Ranking and Selection","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T16:25:44.377106Z"},"links":{"cited_paper":"/paper/1811.12183","citing_paper":"/paper/2509.06147"},"observation_digest":"sha256:9b3694772057891939d7d9ca59c4d244105870cb8c381f03018facb629dff5cf","observation_id":"719e62e2-2642-47c0-a205-50fba30488e8","resolution":{"observed_at":"2026-08-15T16:25:44.539306Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"1811.12183","last_updated":"2018-11-26T14:33:56Z","snapshot_observed_at":"2026-08-14T17:53:19.074750Z","submitted_at":"2018-11-26T14:33:56Z","title":"Analyzing and provably improving fixed budget ranking and selection algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.12183","snapshot_observed_at":"2026-07-14T04:14:04.841382Z","title":"ArXiv preprint arXiv:1811.12183","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11635","last_updated":"2026-07-13T14:50:32Z","snapshot_observed_at":"2026-08-14T03:25:30.011826Z","submitted_at":"2026-07-13T14:50:32Z","title":"Fundamental Limitations of Fixed-Budget Best-Arm Identification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-14T04:14:04.841382Z"},"links":{"cited_paper":"/paper/1811.12183","citing_paper":"/paper/2607.11635"},"observation_digest":"sha256:e754c6cf27b5f1ccf101dd371b22fc086cc77338577811d9e0af5ac85ee9c77f","observation_id":"2f1f8aa7-db01-49a6-b7d8-d0c5b6bceb7c","resolution":{"observed_at":"2026-07-14T04:14:04.841382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1811.12183/citation-record","integrity":"/paper/1811.12183/integrity","json":"/paper/1811.12183/citation-record.json","paper":"/paper/1811.12183"},"outbound":[],"paper":{"arxiv_id":"1811.12183","last_updated":"2018-11-26T14:33:56Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T17:53:19.074750Z","submitted_at":"2018-11-26T14:33:56Z","title":"Analyzing and provably improving fixed budget ranking and selection algorithms"},"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:1811.12183."}