{"as_of":"2026-08-10T05:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:75179e14102d6716375412f185815b95c7192a42f08d75f380d399aa2aa6071f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T06:16:13.601515Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T07:41:27.805494Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.04375","last_updated":"2023-02-08T23:42:04Z","snapshot_observed_at":"2026-07-06T14:49:52.372908Z","submitted_at":"2023-02-08T23:42:04Z","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","version":1},"cited_work":{"arxiv_id":"2302.04375","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.04375","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2302.04375 , year=","venue":null,"work_id":"dae04f21-2a18-4892-aae6-75756b8518ab","year":null},"citing_paper":{"arxiv_id":"2605.08290","last_updated":"2026-05-08T08:22:43Z","snapshot_observed_at":"2026-07-06T23:20:33.816373Z","submitted_at":"2026-05-08T08:22:43Z","title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:56.057336Z"},"links":{"cited_paper":"/paper/2302.04375","citing_paper":"/paper/2605.08290"},"observation_digest":"sha256:6ac5e8fcbf1ec78a94e3bf6fa0d98e4a5b619fbcdfc831d78bbf081c8ee4ce4e","observation_id":"bca6eaa8-0753-4716-9b6f-a1d3ee917867","resolution":{"observed_at":"2026-05-12T07:41:27.808407Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04375","last_updated":"2023-02-08T23:42:04Z","snapshot_observed_at":"2026-07-06T14:49:52.372908Z","submitted_at":"2023-02-08T23:42:04Z","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","version":1},"cited_work":{"arxiv_id":"2302.04375","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.04375","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2302.04375 , year=","venue":null,"work_id":"dae04f21-2a18-4892-aae6-75756b8518ab","year":null},"citing_paper":{"arxiv_id":"2605.10519","last_updated":"2026-05-11T13:07:19Z","snapshot_observed_at":"2026-07-06T23:22:28.318343Z","submitted_at":"2026-05-11T13:07:19Z","title":"Online Resource Allocation With General Constraints","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-12T04:04:36.278591Z"},"links":{"cited_paper":"/paper/2302.04375","citing_paper":"/paper/2605.10519"},"observation_digest":"sha256:d4eceb89c1e8593f811f068faee42038a9420c0b5645645ed6b1fe9a75e21227","observation_id":"1523ae56-3171-49eb-a096-9493a2202f92","resolution":{"observed_at":"2026-05-12T06:41:32.052220Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04375","last_updated":"2023-02-08T23:42:04Z","snapshot_observed_at":"2026-07-06T14:49:52.372908Z","submitted_at":"2023-02-08T23:42:04Z","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04375","snapshot_observed_at":"2026-07-14T06:16:13.601515Z","title":"arXiv preprint arXiv:2302.04375 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11210","last_updated":"2026-07-13T08:02:18Z","snapshot_observed_at":"2026-08-10T03:03:53.935392Z","submitted_at":"2026-07-13T08:02:18Z","title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-14T06:16:13.601515Z"},"links":{"cited_paper":"/paper/2302.04375","citing_paper":"/paper/2607.11210"},"observation_digest":"sha256:472675aedaa75f545f046090f789f8033bec0c0cd0b9f35cdb674848b54b011c","observation_id":"fd8bdb5e-4bbc-4b20-9c4f-c8f6e5d1ef2b","resolution":{"observed_at":"2026-07-14T06:16:13.601515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.04375/citation-record","integrity":"/paper/2302.04375/integrity","json":"/paper/2302.04375/citation-record.json","paper":"/paper/2302.04375"},"outbound":[],"paper":{"arxiv_id":"2302.04375","last_updated":"2023-02-08T23:42:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T14:49:52.372908Z","submitted_at":"2023-02-08T23:42:04Z","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2302.04375."}