{"as_of":"2026-08-15T12:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3dfa73210ce247a5d36926030b5dc12e0bf0ab21018cf309e0af406f453b0894","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-15T06:32:42.880941+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-11T18:26:41.387790Z","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-11T18:26:41.636850Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.08738","last_updated":"2019-03-20T21:01:22Z","snapshot_observed_at":"2026-08-14T16:59:10.237806Z","submitted_at":"2019-03-20T21:01:22Z","title":"Batch Policy Learning under Constraints","version":1},"cited_work":{"arxiv_id":"1903.08738","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08738","snapshot_observed_at":"2026-08-11T18:26:41.636850Z","title":"Batch Policy Learning under Constraints","venue":"cs.LG","work_id":"c45c2749-584a-44a2-b509-a30e4d19e1ea","year":2019},"citing_paper":{"arxiv_id":"2412.08052","last_updated":"2026-05-27T00:35:08Z","snapshot_observed_at":"2026-08-12T04:56:40.264525Z","submitted_at":"2024-12-11T02:59:46Z","title":"CANDOR: Counterfactual ANnotated DOubly Robust Off-Policy Evaluation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T18:26:41.387790Z"},"links":{"cited_paper":"/paper/1903.08738","citing_paper":"/paper/2412.08052"},"observation_digest":"sha256:81c708a0cf96f29c7098442bab06a2173df4ce369e450fd19f848e98e88db70c","observation_id":"88723be2-be6d-43fc-8cc8-3d2791d0cad1","resolution":{"observed_at":"2026-08-11T18:26:41.641946Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1903.08738/citation-record","integrity":"/paper/1903.08738/integrity","json":"/paper/1903.08738/citation-record.json","paper":"/paper/1903.08738"},"outbound":[],"paper":{"arxiv_id":"1903.08738","last_updated":"2019-03-20T21:01:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:59:10.237806Z","submitted_at":"2019-03-20T21:01:22Z","title":"Batch Policy Learning under 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1903.08738."}