{"as_of":"2026-08-07T22:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e4fda90cab07992cb692a7e840c4eb2ebba6bb3d8ac3a27a4f9895baa10ef59","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-07T06:34:17.273281+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-08-07T14:16:10.671575Z","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-06T23:13:25.360932Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.11420","last_updated":"2022-05-28T01:20:56Z","snapshot_observed_at":"2026-07-06T11:21:30.713389Z","submitted_at":"2021-06-21T21:42:08Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.11420","snapshot_observed_at":"2026-08-07T14:16:10.671575Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning.arXiv preprint arXiv:2106.11420, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19532","last_updated":"2026-06-24T05:39:26Z","snapshot_observed_at":"2026-08-07T14:09:43.286267Z","submitted_at":"2025-05-26T05:39:35Z","title":"Fox in the Henhouse: Supply-Chain Backdoor Attacks Against Reinforcement Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:16:10.671575Z"},"links":{"cited_paper":"/paper/2106.11420","citing_paper":"/paper/2505.19532"},"observation_digest":"sha256:b4d4b00ab268fb37f9da1e5747ea657b31aba06f04982bec0fc4c2b756beb8cd","observation_id":"1b805143-6fd5-4b8d-a1c3-54e9f60583d3","resolution":{"observed_at":"2026-08-07T14:16:10.671575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.11420","last_updated":"2022-05-28T01:20:56Z","snapshot_observed_at":"2026-07-06T11:21:30.713389Z","submitted_at":"2021-06-21T21:42:08Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.11420","snapshot_observed_at":"2026-08-07T00:43:59.795601Z","title":"Policy S moothing for P rovably R obust R einforcement L earning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13024","last_updated":"2025-08-11T02:15:49Z","snapshot_observed_at":"2026-08-07T01:31:42.307657Z","submitted_at":"2025-06-16T01:18:33Z","title":"Position: Certified Robustness Does Not (Yet) Imply Model Security","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:43:59.795601Z"},"links":{"cited_paper":"/paper/2106.11420","citing_paper":"/paper/2506.13024"},"observation_digest":"sha256:4e52059214bcaedb6f32cb19f6b5c2740936581e15dc863213c4ff303964bd80","observation_id":"9c70a4ec-6903-4cf1-aa33-692992aa8038","resolution":{"observed_at":"2026-08-07T00:43:59.795601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.11420","last_updated":"2022-05-28T01:20:56Z","snapshot_observed_at":"2026-07-06T11:21:30.713389Z","submitted_at":"2021-06-21T21:42:08Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2106.11420","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.11420","snapshot_observed_at":"2026-08-06T23:13:25.360932Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning","venue":"cs.LG","work_id":"d0f629b9-6128-43b5-b7e4-7c02f9a2a5fd","year":2021},"citing_paper":{"arxiv_id":"2506.19250","last_updated":"2025-08-09T15:01:55Z","snapshot_observed_at":"2026-08-06T23:04:51.858683Z","submitted_at":"2025-06-24T02:19:08Z","title":"Robust Behavior Cloning Via Global Lipschitz Regularization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T23:13:22.374469Z"},"links":{"cited_paper":"/paper/2106.11420","citing_paper":"/paper/2506.19250"},"observation_digest":"sha256:e4b743065e3ff107bfb485c2222335fab3a41e98b749fc03dfb69d6053ea8c07","observation_id":"176a576f-8a58-4fa5-ba8e-26304a64243f","resolution":{"observed_at":"2026-08-06T23:13:25.419264Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.11420/citation-record","integrity":"/paper/2106.11420/integrity","json":"/paper/2106.11420/citation-record.json","paper":"/paper/2106.11420"},"outbound":[],"paper":{"arxiv_id":"2106.11420","last_updated":"2022-05-28T01:20:56Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:21:30.713389Z","submitted_at":"2021-06-21T21:42:08Z","title":"Policy Smoothing for Provably Robust Reinforcement Learning"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2106.11420."}