{"as_of":"2026-08-12T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb090e6450f1a75a6398a99fb5a3949647fe5ae813d4e76b12a7a1288d4c7d8d","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T02:23:33.995819Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.28276/citation-record","integrity":"/paper/2605.28276/integrity","json":"/paper/2605.28276/citation-record.json","paper":"/paper/2605.28276"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.374754Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.374754Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:83e218af0b5a1376d7065dd3667e48a776b4f8fa95a8911cb4ddea04ad1293f7","observation_id":"1b6449c2-00f3-4d5b-9d85-9e2b67b48986","resolution":{"observed_at":"2026-08-03T02:23:33.374754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.518067Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.518067Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:b1d7edf2978fc5d3a15b9a0d6e039144217d2f02a04fb82d6f8b030a7d72b32f","observation_id":"17731fe9-7d1b-4b04-8f45-463e3f4b6331","resolution":{"observed_at":"2026-08-03T02:23:33.518067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.654343Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.654343Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:302c82f3be1539de87597d796feeb4f3ac4b78860b0da994a548910d73c199e3","observation_id":"2b0b6541-5cb7-4277-8f93-b24cd26585b7","resolution":{"observed_at":"2026-08-03T02:23:33.654343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.790518Z","title":"Moreover, both h(θ) .=E µH(θ, ξ)andh ∞(θ) .=E µH∞(θ, ξ) are well-defined and finite","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.790518Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:78df1659dd2bf8e6e93d1e93710d29819f70af21cea756a4d3ce201326ccde4f","observation_id":"c21ecac0-fed6-4d87-aeaa-8f986a7a5579","resolution":{"observed_at":"2026-08-03T02:23:33.790518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.995819Z","title":"learnable","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.995819Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:089ca2ce38d57b8b1ebfaca9447f61f3079805314ec0f0d3bf59aafbe531da14","observation_id":"e6eee462-e58a-446a-801c-5f888ab24037","resolution":{"observed_at":"2026-08-03T02:23:33.995819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.066870Z","title":"S.A First Look at Rigorous Probability Theory","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.066870Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:69bdb5b4c9eaf3139b423bab54243d09ea58cd6524336ae41aa62d7560083244","observation_id":"ccd06bea-6bb5-4f62-ab89-d6c0464e2fe6","resolution":{"observed_at":"2026-08-03T02:23:33.066870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:23:33.237434Z","title":"J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V ., Lanctot, M., et al","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:33.237434Z"},"links":{"citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:df3a393225463b1e5a5a7b8a8815dce0df86c7da965c73a73ff89bc2255ff6e7","observation_id":"fb8fde43-a9ef-4af8-92b2-7128eebf6218","resolution":{"observed_at":"2026-08-03T02:23:33.237434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06366","last_updated":"2020-02-19T06:05:39Z","snapshot_observed_at":"2026-08-11T17:45:22.645434Z","submitted_at":"2019-12-13T09:10:18Z","title":"Provably Efficient Reinforcement Learning with Aggregated States","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06366","snapshot_observed_at":"2026-08-03T02:23:32.975755Z","title":"Reinforcement learning with long short-term memory","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T02:23:32.975755Z"},"links":{"cited_paper":"/paper/1912.06366","citing_paper":"/paper/2605.28276"},"observation_digest":"sha256:5534bbe23d1c4d4c5fc11c378d02df00554828cfe2a36748a69054fe50712d63","observation_id":"0f2a81c2-87bc-4dbd-b6a4-e75fd4216a41","resolution":{"observed_at":"2026-08-03T02:23:32.975755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.28276","last_updated":"2026-07-31T15:51:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T11:55:18.734309Z","submitted_at":"2026-05-27T10:20:40Z","title":"Commit to the Bit: Reactive Reinforcement Learning Done Right"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":8},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2605.28276."}