{"as_of":"2026-08-10T03:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fe323725c1b2624a6e9db5825303a3fc451f77af6d637c46b50a4d1e7a567da","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-09T06:31:02.800959+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-08T20:49:17.044261Z","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-08T18:51:12.964602Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1604.02218","last_updated":"2020-05-18T06:31:30Z","snapshot_observed_at":"2026-08-01T15:47:59.899394Z","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.02218","snapshot_observed_at":"2026-08-08T20:49:17.044261Z","title":"A low complexity algorithm with o ( T ) regret and o (1) constraint violations for online convex optimization with long term constraints","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.044261Z"},"links":{"cited_paper":"/paper/1604.02218","citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:5d197d06ae9005fac9acff291f2b1f72b4c4f4086dd032fce13124a0d8e8b5b0","observation_id":"3dedcc25-bf48-4116-b809-a5f6413bd678","resolution":{"observed_at":"2026-08-08T20:49:17.044261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.02218","last_updated":"2020-05-18T06:31:30Z","snapshot_observed_at":"2026-08-01T15:47:59.899394Z","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","version":3},"cited_work":{"arxiv_id":"1604.02218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.02218","snapshot_observed_at":"2026-08-08T18:51:12.964602Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","venue":"math.OC","work_id":"e0a5d4db-418f-4df6-9b55-a73673e48861","year":2016},"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":19,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.696817Z"},"links":{"cited_paper":"/paper/1604.02218","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:0ab574507205cb1a676c910715d7dfa07dbf9cacb08471fce9b52d41ecabe120","observation_id":"9ca3397a-b886-4b7b-913f-fd9e7052a6b2","resolution":{"observed_at":"2026-08-08T18:51:12.968483Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1604.02218/citation-record","integrity":"/paper/1604.02218/integrity","json":"/paper/1604.02218/citation-record.json","paper":"/paper/1604.02218"},"outbound":[],"paper":{"arxiv_id":"1604.02218","last_updated":"2020-05-18T06:31:30Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-01T15:47:59.899394Z","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:1604.02218."}