{"as_of":"2026-08-04T22:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5f4d6821f5240097ebcbcd3cb1743e064aee785f2c77fcc0cddb47ee70c4735","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-04T06:34:03.388597+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-05-16T08:56:27.405530Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T08:57:38.634225Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.12997","last_updated":"2020-03-29T02:08:41Z","snapshot_observed_at":"2026-08-04T01:23:22.374076Z","submitted_at":"2018-10-30T20:43:04Z","title":"An Online-Learning Approach to Inverse Optimization","version":2},"cited_work":{"arxiv_id":"1810.12997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.12997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fedb5211-7979-485f-bf82-7752a48a51c8","year":2018},"citing_paper":{"arxiv_id":"2602.01682","last_updated":"2026-05-11T23:34:22Z","snapshot_observed_at":"2026-08-03T18:24:58.191402Z","submitted_at":"2026-02-02T05:48:54Z","title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T08:56:27.405530Z"},"links":{"cited_paper":"/paper/1810.12997","citing_paper":"/paper/2602.01682"},"observation_digest":"sha256:8edf39215a06914b0d9bdce224ff1dd71ae56d8a06806cc156eab7435822426f","observation_id":"36d833de-2567-4dfe-8b0f-54c154564085","resolution":{"observed_at":"2026-05-16T08:57:38.635975Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1810.12997/citation-record","integrity":"/paper/1810.12997/integrity","json":"/paper/1810.12997/citation-record.json","paper":"/paper/1810.12997"},"outbound":[],"paper":{"arxiv_id":"1810.12997","last_updated":"2020-03-29T02:08:41Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T01:23:22.374076Z","submitted_at":"2018-10-30T20:43:04Z","title":"An Online-Learning Approach to Inverse 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1810.12997."}