{"as_of":"2026-08-17T22:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4eff6fb9f90096e924a7b14d988569c43e3f66c3e32c8285496117834ffcd667","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-17T06:30:58.91139+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-07T14:16:52.208911Z","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.789065Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-08-07T14:16:52.208911Z","title":"Learning adversarial mdps with stochastic hard constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20010","last_updated":"2025-06-21T12:44:40Z","snapshot_observed_at":"2026-08-12T03:56:45.891653Z","submitted_at":"2025-05-26T14:00:36Z","title":"Data-Dependent Regret Bounds for Constrained MABs","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:16:52.208911Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2505.20010"},"observation_digest":"sha256:37845b3deb95814ecaaa65884991569c099f01dfcc4a575cc8074da12cef2306","observation_id":"0500cb62-2128-4fe6-a506-10c64ffda4f7","resolution":{"observed_at":"2026-08-07T14:16:52.208911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-08-07T13:35:51.044652Z","title":"E., Castiglioni, M., Marchesi, A., and Gatti, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21841","last_updated":"2025-05-28T00:16:34Z","snapshot_observed_at":"2026-08-10T12:03:35.177178Z","submitted_at":"2025-05-28T00:16:34Z","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:51.044652Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:2ed0ea4bcf4a9d4bd1135ae226c6233c4364601336035705a78db452e5b8bc8e","observation_id":"a182d344-fcc4-42ee-bf95-7cbc40d03d95","resolution":{"observed_at":"2026-08-07T13:35:51.044652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-08-07T00:44:27.212457Z","title":"Learning adversarial mdps with stochastic hard constraints.arXiv preprint arXiv:2403.03672, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13244","last_updated":"2025-06-18T14:04:08Z","snapshot_observed_at":"2026-08-07T00:34:12.940107Z","submitted_at":"2025-06-16T08:42:31Z","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.212457Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:4033b761a9ebbcafe9812979aa403c7ac6382ef07a221eb59038409a54a891d9","observation_id":"a48b5e45-c020-4f85-983c-bea6457fb9b8","resolution":{"observed_at":"2026-08-07T00:44:27.212457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":"2403.03672","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2403.03672 , year=","venue":null,"work_id":"29c2620f-9175-45b3-9a4b-3a96eb398c57","year":null},"citing_paper":{"arxiv_id":"2605.08290","last_updated":"2026-05-08T08:22:43Z","snapshot_observed_at":"2026-08-14T05:53:10.760005Z","submitted_at":"2026-05-08T08:22:43Z","title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:56.057336Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2605.08290"},"observation_digest":"sha256:483a0db5f3ccb9a9c3733b4a22a896cf9117c9e3e74d7a0256b77a220e76bacf","observation_id":"e25465a4-fbc9-4f66-99a5-5fa98b70a251","resolution":{"observed_at":"2026-05-12T07:41:27.794159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":"2403.03672","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2403.03672 , year=","venue":null,"work_id":"29c2620f-9175-45b3-9a4b-3a96eb398c57","year":null},"citing_paper":{"arxiv_id":"2605.10519","last_updated":"2026-05-11T13:07:19Z","snapshot_observed_at":"2026-08-15T02:29:33.688184Z","submitted_at":"2026-05-11T13:07:19Z","title":"Online Resource Allocation With General Constraints","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-12T04:04:36.278591Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2605.10519"},"observation_digest":"sha256:aa8acfcc2997029ac0f6cf5f7b1e971889e224cf77d92aebfe65d373de039b6e","observation_id":"bb51d065-4e69-4969-b200-8c17d5295f61","resolution":{"observed_at":"2026-05-12T06:41:31.772007Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-07-14T06:16:13.601515Z","title":"arXiv preprint arXiv:2403.03672 , 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-15T09:07:59.773465Z","submitted_at":"2026-07-13T08:02:18Z","title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-14T06:16:13.601515Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2607.11210"},"observation_digest":"sha256:629b538d982ffc571973d53c44237e4e9bde67c14d9df1d35f97d1978249cd50","observation_id":"f6298c77-7829-4a96-a705-ac0563ec262c","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/2403.03672/citation-record","integrity":"/paper/2403.03672/integrity","json":"/paper/2403.03672/citation-record.json","paper":"/paper/2403.03672"},"outbound":[],"paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:12:20.323667Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2403.03672."}