{"as_of":"2026-08-17T10:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e3f6bbb7841a65ee6f2de626ffeb04256e838e874574c250c1544da3579c1e3","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:54:55.053888Z","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-15T20:54:55.289143Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.00399","last_updated":"2023-07-16T02:26:55Z","snapshot_observed_at":"2026-08-16T16:35:24.527827Z","submitted_at":"2022-09-01T12:23:26Z","title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","version":2},"cited_work":{"arxiv_id":"2209.00399","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.00399","snapshot_observed_at":"2026-08-15T20:54:55.289143Z","title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","venue":"cs.LG","work_id":"c9da2096-4afe-4de0-a635-7ba4104656f4","year":2022},"citing_paper":{"arxiv_id":"2505.12037","last_updated":"2025-05-17T14:59:15Z","snapshot_observed_at":"2026-08-15T20:40:06.093458Z","submitted_at":"2025-05-17T14:59:15Z","title":"Adaptive Resolving Methods for Reinforcement Learning with Function Approximations","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T20:54:55.053888Z"},"links":{"cited_paper":"/paper/2209.00399","citing_paper":"/paper/2505.12037"},"observation_digest":"sha256:0490c964f692a819945d3fab163b7fe0b4b7a5b54fa2b41c9f743cffef7e9b6d","observation_id":"4eac4a59-958c-468c-b487-5458863316c1","resolution":{"observed_at":"2026-08-15T20:54:55.294124Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2209.00399/citation-record","integrity":"/paper/2209.00399/integrity","json":"/paper/2209.00399/citation-record.json","paper":"/paper/2209.00399"},"outbound":[],"paper":{"arxiv_id":"2209.00399","last_updated":"2023-07-16T02:26:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:35:24.527827Z","submitted_at":"2022-09-01T12:23:26Z","title":"Optimal Regularized Online Allocation by Adaptive Re-Solving"},"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 1 inbound Pith citation observation for arXiv:2209.00399."}