{"as_of":"2026-08-15T19:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e60d7d03be3e9cf39eac654e0478b4c51a52cb08727331f092f98c94917d5a87","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:14:41.742043Z","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-06T19:57:42.549394Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1508.04874","last_updated":"2015-11-05T07:04:31Z","snapshot_observed_at":"2026-08-15T14:25:12.784398Z","submitted_at":"2015-08-20T04:44:51Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.04874","snapshot_observed_at":"2026-08-14T14:14:41.742043Z","title":"1049–1065, 2015, arXiv:1508.04874","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03903","last_updated":"2021-11-01T15:27:03Z","snapshot_observed_at":"2026-08-15T16:01:44.877472Z","submitted_at":"2019-08-11T13:13:47Z","title":"Quantum algorithm for estimating volumes of convex bodies","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:41.742043Z"},"links":{"cited_paper":"/paper/1508.04874","citing_paper":"/paper/1908.03903"},"observation_digest":"sha256:f1fb3d998e432f156eda08eaf3c2c9e9c6f56003f99325697cf619fa3de4021c","observation_id":"60e3b627-cd1e-43b6-842b-e6b37f79b2b2","resolution":{"observed_at":"2026-08-14T14:14:41.742043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.04874","last_updated":"2015-11-05T07:04:31Z","snapshot_observed_at":"2026-08-15T14:25:12.784398Z","submitted_at":"2015-08-20T04:44:51Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","version":2},"cited_work":{"arxiv_id":"1508.04874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1508.04874","snapshot_observed_at":"2026-08-06T19:57:42.549394Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","venue":"cs.DS","work_id":"1cfdf217-7926-4c26-806d-37304c7b46e9","year":2015},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-08T09:52:26.625560Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.784518Z"},"links":{"cited_paper":"/paper/1508.04874","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:c389454048308439d943a4bff62303d4f1dda6adaf279ec00f58794f9e135d2d","observation_id":"b7f9aa8c-54b5-4756-ad01-46e5b385f453","resolution":{"observed_at":"2026-08-06T19:57:42.600605Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1508.04874/citation-record","integrity":"/paper/1508.04874/integrity","json":"/paper/1508.04874/citation-record.json","paper":"/paper/1508.04874"},"outbound":[],"paper":{"arxiv_id":"1508.04874","last_updated":"2015-11-05T07:04:31Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T14:25:12.784398Z","submitted_at":"2015-08-20T04:44:51Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1508.04874."}