{"as_of":"2026-08-10T17:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:169e3bd67e4c7078fab71ccd03df8b8b60da87bdc2edd84da0e9daa75c35a87e","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:51:12.703340Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18955","snapshot_observed_at":"2026-08-08T18:51:12.703340Z","title":"Sinha, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.703340Z"},"links":{"cited_paper":"/paper/2310.18955","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:b58e39c0c84d90f640a1186a3f91fefc9db2bb4c9a073d8da9b4f1ded443e639","observation_id":"c9478aca-4de9-44ea-a123-6fa7c9863918","resolution":{"observed_at":"2026-08-08T18:51:12.703340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-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":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:f5b9e2f7453dd9298a818cc2d391b682096f3f37a10d71b0fb9e6577903cdcbe","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.18955."}