{"as_of":"2026-08-08T12:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4014a1e63fb357ee35128725501783fc584af1e9beb13e68df064b3504c513a3","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-07T10:39:41.088293Z","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-07T10:39:41.579697Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.4387","last_updated":"2013-06-01T09:35:15Z","snapshot_observed_at":"2026-07-06T03:06:41.808398Z","submitted_at":"2013-02-18T18:46:37Z","title":"Online Learning with Switching Costs and Other Adaptive Adversaries","version":2},"cited_work":{"arxiv_id":"1302.4387","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.4387","snapshot_observed_at":"2026-08-07T10:39:41.579697Z","title":"Online Learning with Switching Costs and Other Adaptive Adversaries","venue":"cs.LG","work_id":"ef5d3e4b-6e66-43cd-aa20-5c71bb8dc194","year":2013},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.088293Z"},"links":{"cited_paper":"/paper/1302.4387","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:df73cca4f9b23ec5f8d9fc2cf3e3b0764d752f3627ec48479d01cd4dd06f708b","observation_id":"22640ebc-bd14-4d02-8ea7-d8c5ca0e911b","resolution":{"observed_at":"2026-08-07T10:39:41.635304Z","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/1302.4387/citation-record","integrity":"/paper/1302.4387/integrity","json":"/paper/1302.4387/citation-record.json","paper":"/paper/1302.4387"},"outbound":[],"paper":{"arxiv_id":"1302.4387","last_updated":"2013-06-01T09:35:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T03:06:41.808398Z","submitted_at":"2013-02-18T18:46:37Z","title":"Online Learning with Switching Costs and Other Adaptive Adversaries"},"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:1302.4387."}