{"as_of":"2026-08-10T01:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d37fe3bac3b8cd76f91a28afad8e599321e8a3d17d27ad9b095043246b5aab0","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:22:29.419418Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":6,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2106.01577","doi":"10.48550/arxiv.2106.01577","metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","venue":"arXiv (Cornell University)","work_id":"3d532399-c6dd-4754-bcdd-b2dcccc0f81d","year":2021},"citing_paper":{"arxiv_id":"2408.16286","last_updated":"2026-04-24T03:11:36Z","snapshot_observed_at":"2026-08-03T07:01:54.251485Z","submitted_at":"2024-08-29T06:37:16Z","title":"Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form","version":5},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-23T21:58:56.180393Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2408.16286"},"observation_digest":"sha256:694d61e484565fa7e25632c26312648147c0ff640962d5a3af6e68ddf106c1bc","observation_id":"5378cdf3-dd43-45ed-9659-d97273c92922","resolution":{"observed_at":"2026-05-23T22:03:30.954711Z","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-07-14T12:50:01.570706+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T12:50:01.570706+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-08-05T23:22:29.419418Z","title":"A provably-efficient model-free algorithm for constrained markov decision processes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.05441","last_updated":"2025-08-07T14:31:22Z","snapshot_observed_at":"2026-08-09T07:07:06.006850Z","submitted_at":"2025-08-07T14:31:22Z","title":"Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T23:22:29.419418Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2508.05441"},"observation_digest":"sha256:74192d100ad05cff39967f0aa0b1a751f4e966e8edf4a8e007931d7834d0a48a","observation_id":"4280673c-88d8-46ae-98be-93ae3cda025d","resolution":{"observed_at":"2026-08-05T23:22:29.419418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2106.01577","doi":"10.48550/arxiv.2106.01577","metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","venue":"arXiv (Cornell University)","work_id":"3d532399-c6dd-4754-bcdd-b2dcccc0f81d","year":2021},"citing_paper":{"arxiv_id":"2604.14243","last_updated":"2026-04-17T15:08:39Z","snapshot_observed_at":"2026-08-08T12:22:26.253994Z","submitted_at":"2026-04-15T04:53:29Z","title":"Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T13:36:59.355147Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2604.14243"},"observation_digest":"sha256:fc0bd5624a540976bbdaab200cf6361aafdd3034ac2ad96b121b7bfc042ecc53","observation_id":"33be9c60-fbe8-4421-bd83-79d2bb3ae52f","resolution":{"observed_at":"2026-05-10T13:40:27.191281Z","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-07-14T12:50:01.570706+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T12:50:01.570706+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2106.01577","doi":"10.48550/arxiv.2106.01577","metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","venue":"arXiv (Cornell University)","work_id":"3d532399-c6dd-4754-bcdd-b2dcccc0f81d","year":2021},"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":17,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:56.057336Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2605.08290"},"observation_digest":"sha256:ca03223c2856a7770b4dc41949ae79b37017935e2bd3c6ab71f33c4f169605c9","observation_id":"979f09a2-784b-4e4a-93f2-b069fe2b8fd4","resolution":{"observed_at":"2026-05-12T02:26:15.748110Z","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-07-14T12:50:01.570706+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T12:50:01.570706+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2106.01577","doi":"10.48550/arxiv.2106.01577","metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","venue":"arXiv (Cornell University)","work_id":"3d532399-c6dd-4754-bcdd-b2dcccc0f81d","year":2021},"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":16,"source":"arxiv_source","source_observed_at":"2026-05-12T04:04:36.278591Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2605.10519"},"observation_digest":"sha256:3b7c1b1a37f20b19336a34ca7040fb07a2dc395b3abd57be66a648504968ea7c","observation_id":"672f31e9-7fe0-4b65-99f6-5eb6b5998ea8","resolution":{"observed_at":"2026-05-12T04:06:20.709997Z","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-07-14T12:50:01.570706+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T12:50:01.570706+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01577","snapshot_observed_at":"2026-07-14T06:16:13.601515Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes , publisher =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11210","last_updated":"2026-07-13T08:02:18Z","snapshot_observed_at":"2026-08-02T06:22:15.029368Z","submitted_at":"2026-07-13T08:02:18Z","title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-14T06:16:13.601515Z"},"links":{"cited_paper":"/paper/2106.01577","citing_paper":"/paper/2607.11210"},"observation_digest":"sha256:080d96b69b28312205d2470bbd04098743deb17098bf392fb129824f65bbfa5d","observation_id":"b497eca0-98be-4443-acbf-132214cdd6b3","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/2106.01577/citation-record","integrity":"/paper/2106.01577/integrity","json":"/paper/2106.01577/citation-record.json","paper":"/paper/2106.01577"},"outbound":[],"paper":{"arxiv_id":"2106.01577","last_updated":"2021-10-23T04:56:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:15:26.915483Z","submitted_at":"2021-06-03T03:53:27Z","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes"},"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 6 inbound Pith citation observations for arXiv:2106.01577."}