{"as_of":"2026-08-08T09:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b98ff9399ba35dacf5ee9d6b886a858c15ab45adb41460ebcf7d4de6101d65fd","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-08T06:32:00.761636+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-07T13:35:50.768281Z","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-07T13:35:52.098114Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.18955","last_updated":"2024-10-27T16:37:56Z","snapshot_observed_at":"2026-08-07T09:23:39.294571Z","submitted_at":"2023-10-29T09:55:41Z","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","version":3},"cited_work":{"arxiv_id":"2310.18955","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.18955","snapshot_observed_at":"2026-08-07T13:35:52.098114Z","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","venue":"cs.LG","work_id":"1f3ef9bb-ec24-41c0-a7aa-d7dbe7e34fed","year":2023},"citing_paper":{"arxiv_id":"2505.21841","last_updated":"2025-05-28T00:16:34Z","snapshot_observed_at":"2026-08-07T13:19:25.695756Z","submitted_at":"2025-05-28T00:16:34Z","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:50.768281Z"},"links":{"cited_paper":"/paper/2310.18955","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:d06f103a2b40a4644c95f970c8b299bffcba249c9f64f80be73d1fc4e49e10d3","observation_id":"69f3302e-3541-4a29-b121-6ab7b2a4be2f","resolution":{"observed_at":"2026-08-07T13:35:52.145545Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.18955/citation-record","integrity":"/paper/2310.18955/integrity","json":"/paper/2310.18955/citation-record.json","paper":"/paper/2310.18955"},"outbound":[],"paper":{"arxiv_id":"2310.18955","last_updated":"2024-10-27T16:37:56Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T09:23:39.294571Z","submitted_at":"2023-10-29T09:55:41Z","title":"Optimal Algorithms for Online Convex Optimization with Adversarial 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2310.18955."}