{"as_of":"2026-08-10T06:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2979aeee35d467ea1a1e6d6274f7f35b98d7e40fa1a20b9e9113d5c56a9ebe7c","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-10T06:31:04.303077+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-08T18:49:52.600678Z","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:49:52.742899Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1211.2260","last_updated":"2012-11-09T22:13:10Z","snapshot_observed_at":"2026-07-06T02:59:34.393809Z","submitted_at":"2012-11-09T22:13:10Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization","version":1},"cited_work":{"arxiv_id":"1211.2260","doi":null,"metadata_source":"pith","pith_arxiv_id":"1211.2260","snapshot_observed_at":"2026-08-08T18:49:52.742899Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization","venue":"cs.LG","work_id":"cecf7219-aa56-4a85-9b74-a7beb0254c3d","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-09T19:08:23.815423Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.600678Z"},"links":{"cited_paper":"/paper/1211.2260","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:223239aa0877513b6c1dcc23e4766e7ebe0b080d6413d815b6c1ad49f9f7b3c6","observation_id":"bc115a12-d3ad-4bd6-abf6-5fe4216d24b9","resolution":{"observed_at":"2026-08-08T18:49:52.750138Z","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/1211.2260/citation-record","integrity":"/paper/1211.2260/integrity","json":"/paper/1211.2260/citation-record.json","paper":"/paper/1211.2260"},"outbound":[],"paper":{"arxiv_id":"1211.2260","last_updated":"2012-11-09T22:13:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T02:59:34.393809Z","submitted_at":"2012-11-09T22:13:10Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization"},"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 1 inbound Pith citation observation for arXiv:1211.2260."}