{"as_of":"2026-08-19T03:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2c63a0d3c050599e291b4459042b0289b4189541e7e2c1e79e45b771a536fa5","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-18T06:34:40.430872+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-06T19:57:38.733012Z","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.660273Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1503.01752","last_updated":"2015-10-14T13:06:14Z","snapshot_observed_at":"2026-08-19T01:13:04.680434Z","submitted_at":"2015-03-05T20:12:13Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","version":3},"cited_work":{"arxiv_id":"1503.01752","doi":null,"metadata_source":"pith","pith_arxiv_id":"1503.01752","snapshot_observed_at":"2026-08-06T19:57:42.660273Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","venue":"cs.DS","work_id":"7ea342b0-8edc-466c-8aed-f0d499c0081c","year":2015},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.733012Z"},"links":{"cited_paper":"/paper/1503.01752","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:1efa14cbb536a5e780f165beed5221dc59d95ec8a642becad507e092da4e7aed","observation_id":"92bc1cc8-1ec0-4444-85e1-844f755c1879","resolution":{"observed_at":"2026-08-06T19:57:42.777190Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1503.01752/citation-record","integrity":"/paper/1503.01752/integrity","json":"/paper/1503.01752/citation-record.json","paper":"/paper/1503.01752"},"outbound":[],"paper":{"arxiv_id":"1503.01752","last_updated":"2015-10-14T13:06:14Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T01:13:04.680434Z","submitted_at":"2015-03-05T20:12:13Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1503.01752."}