{"as_of":"2026-08-14T21:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb44eb403d91a11b5f3d3b2e04c33e5e56f294320e2dc093dee5a60384b2a51a","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-14T06:32:32.682623+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-12T11:14:33.087882Z","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-12T12:16:16.734455Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.08546","last_updated":"2026-07-02T07:35:04Z","snapshot_observed_at":"2026-08-13T11:17:22.663451Z","submitted_at":"2023-06-14T14:44:28Z","title":"Recoverable Robust Optimization with Commitment","version":2},"cited_work":{"arxiv_id":"2306.08546","doi":"10.48550/arxiv.2306.08546","metadata_source":"pith","pith_arxiv_id":"2306.08546","snapshot_observed_at":"2026-08-12T12:16:16.734455Z","title":"Recoverable Robust Optimization with Commitment","venue":"cs.DS","work_id":"90d64099-50ee-48bf-b374-3a70f7de9070","year":2023},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.087882Z"},"links":{"cited_paper":"/paper/2306.08546","citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:8a493a9cf67281225c2c1883873eb3f99ad0466515a81929bb20993cf7a7399d","observation_id":"d80895c5-2a2b-4708-a778-66a397d4da98","resolution":{"observed_at":"2026-08-12T11:14:33.552827Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.08546/citation-record","integrity":"/paper/2306.08546/integrity","json":"/paper/2306.08546/citation-record.json","paper":"/paper/2306.08546"},"outbound":[],"paper":{"arxiv_id":"2306.08546","last_updated":"2026-07-02T07:35:04Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T11:17:22.663451Z","submitted_at":"2023-06-14T14:44:28Z","title":"Recoverable Robust Optimization with Commitment"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.08546."}