{"as_of":"2026-08-22T17:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d9a009f8210cc77feff3d8eb7d39e267d8919e04c3960a5b23499297ddef63e","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-22T06:32:14.747728+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-15T22:59:43.575763Z","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-15T22:59:43.729445Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.13628","last_updated":"2023-07-24T15:31:05Z","snapshot_observed_at":"2026-08-17T10:12:01.468772Z","submitted_at":"2021-08-31T05:38:36Z","title":"Learning Optimal Prescriptive Trees from Observational Data","version":2},"cited_work":{"arxiv_id":"2108.13628","doi":null,"metadata_source":"pith","pith_arxiv_id":"2108.13628","snapshot_observed_at":"2026-08-15T22:59:43.729445Z","title":"Learning Optimal Prescriptive Trees from Observational Data","venue":"cs.LG","work_id":"0121d72b-5dfd-42ed-8783-6c615b66127f","year":2021},"citing_paper":{"arxiv_id":"2505.05857","last_updated":"2025-08-30T16:26:24Z","snapshot_observed_at":"2026-08-17T10:10:55.098035Z","submitted_at":"2025-05-09T07:51:36Z","title":"Responsible Machine Learning via Mixed-Integer Optimization","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T22:59:43.575763Z"},"links":{"cited_paper":"/paper/2108.13628","citing_paper":"/paper/2505.05857"},"observation_digest":"sha256:d3e8f3d1e4bb9bcaeb0d43594c1d1b60b812a83471e7d0143a2a0b7a43bd68ce","observation_id":"807f95ef-c16e-421e-bf65-5d4752b60349","resolution":{"observed_at":"2026-08-15T22:59:43.734432Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.13628","last_updated":"2023-07-24T15:31:05Z","snapshot_observed_at":"2026-08-17T10:12:01.468772Z","submitted_at":"2021-08-31T05:38:36Z","title":"Learning Optimal Prescriptive Trees from Observational Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.13628","snapshot_observed_at":"2026-08-02T02:32:35.828722Z","title":"arXiv preprint arXiv:2108.13628 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14318","last_updated":"2026-07-15T19:27:49Z","snapshot_observed_at":"2026-08-20T20:08:07.639727Z","submitted_at":"2026-07-15T19:27:49Z","title":"Counterfactual Optimal Action Trees (COAT): Interpretable Prescriptive Policies from Observational Data","version":1},"reference_index":115,"source":"arxiv_source","source_observed_at":"2026-08-02T02:32:35.828722Z"},"links":{"cited_paper":"/paper/2108.13628","citing_paper":"/paper/2607.14318"},"observation_digest":"sha256:db954189821bfb4b3709ee19a5fbb5afea12226974b39af88d091bfc23f02e8f","observation_id":"a87cfb20-8109-4c78-b97a-80c34561fca6","resolution":{"observed_at":"2026-08-02T02:32:35.828722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.13628/citation-record","integrity":"/paper/2108.13628/integrity","json":"/paper/2108.13628/citation-record.json","paper":"/paper/2108.13628"},"outbound":[],"paper":{"arxiv_id":"2108.13628","last_updated":"2023-07-24T15:31:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T10:12:01.468772Z","submitted_at":"2021-08-31T05:38:36Z","title":"Learning Optimal Prescriptive Trees from Observational Data"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2108.13628."}