{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d7ee6418cfb77d890c104327e630ca896102749eaf75830e2f4896ca3f963f3","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:41:11.313698Z","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-06T18:41:11.478184Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.02176","last_updated":"2015-11-06T18:01:38Z","snapshot_observed_at":"2026-07-06T04:35:39.949579Z","submitted_at":"2015-11-06T18:01:38Z","title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice","version":1},"cited_work":{"arxiv_id":"1511.02176","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.02176","snapshot_observed_at":"2026-08-06T18:41:11.478184Z","title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice","venue":"stat.ML","work_id":"1d5f10bb-2498-4905-b904-42ea4624a647","year":2015},"citing_paper":{"arxiv_id":"2507.08067","last_updated":"2025-09-07T06:13:38Z","snapshot_observed_at":"2026-08-07T08:14:30.249709Z","submitted_at":"2025-07-10T17:48:09Z","title":"Enhanced entanglement from quantum ergodicity","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T18:41:11.313698Z"},"links":{"cited_paper":"/paper/1511.02176","citing_paper":"/paper/2507.08067"},"observation_digest":"sha256:0b6d265ea39fb7d4f32a7746f18f736e817faec76413050c2d714adaec0f444d","observation_id":"1d3416ed-8fb2-41a0-a55c-b22169a128d9","resolution":{"observed_at":"2026-08-06T18:41:11.546482Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1511.02176","last_updated":"2015-11-06T18:01:38Z","snapshot_observed_at":"2026-07-06T04:35:39.949579Z","submitted_at":"2015-11-06T18:01:38Z","title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.02176","snapshot_observed_at":"2026-08-04T20:12:38.234355Z","title":"Optimal non-asymptotic lower bound on the minimax regret of learning with expert advice","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.08911","last_updated":"2025-09-10T18:15:41Z","snapshot_observed_at":"2026-08-08T00:35:55.880889Z","submitted_at":"2025-09-10T18:15:41Z","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-04T20:12:38.234355Z"},"links":{"cited_paper":"/paper/1511.02176","citing_paper":"/paper/2509.08911"},"observation_digest":"sha256:fb24f10f99cf4365b947d8ffd174da2fce9ea6fd1d9db7ef9854df82b365a46f","observation_id":"faeb484d-100f-4e8e-bdf9-964e8a2661b7","resolution":{"observed_at":"2026-08-04T20:12:38.234355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.02176","last_updated":"2015-11-06T18:01:38Z","snapshot_observed_at":"2026-07-06T04:35:39.949579Z","submitted_at":"2015-11-06T18:01:38Z","title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.02176","snapshot_observed_at":"2026-07-13T05:37:39.878537Z","title":"Optimal non-asymptotic lower bound on the minimax regret of learning with expert advice, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08943","last_updated":"2026-07-09T21:14:10Z","snapshot_observed_at":"2026-07-15T23:17:57.820959Z","submitted_at":"2026-07-09T21:14:10Z","title":"Online Koml\\'os converges to mean curvature flow","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-07-13T05:37:39.878537Z"},"links":{"cited_paper":"/paper/1511.02176","citing_paper":"/paper/2607.08943"},"observation_digest":"sha256:95dc69f8fab2507058e6f4a21388018c86cda86fb6fce78fff780eab3f4a73a7","observation_id":"68357c5a-efae-4fa8-8386-cc9abf265a13","resolution":{"observed_at":"2026-07-13T05:37:39.878537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1511.02176/citation-record","integrity":"/paper/1511.02176/integrity","json":"/paper/1511.02176/citation-record.json","paper":"/paper/1511.02176"},"outbound":[],"paper":{"arxiv_id":"1511.02176","last_updated":"2015-11-06T18:01:38Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T04:35:39.949579Z","submitted_at":"2015-11-06T18:01:38Z","title":"Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice"},"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 3 inbound Pith citation observations for arXiv:1511.02176."}