{"as_of":"2026-08-19T18:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9313d570d2536e640356fba38358affd6f8431b65ab3e9a0df86fc30e7d178a8","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-19T06:32:44.657259+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-16T11:17:20.522094Z","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-07-02T19:37:18.509306Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.01848","last_updated":"2021-11-10T18:18:32Z","snapshot_observed_at":"2026-08-19T05:41:30.910161Z","submitted_at":"2021-11-02T19:10:19Z","title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.01848","snapshot_observed_at":"2026-08-16T11:17:20.522094Z","title":"[JLS23] ArunJambulapati,YangPLiu,andAaronSidford.Chaining,groupleverage score overestimates, and fast spectral hypergraph sparsification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16270","last_updated":"2025-04-22T21:06:41Z","snapshot_observed_at":"2026-08-19T09:08:13.168061Z","submitted_at":"2025-04-22T21:06:41Z","title":"A Geometric Approach to Problems in Optimization and Data Science","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:20.522094Z"},"links":{"cited_paper":"/paper/2111.01848","citing_paper":"/paper/2504.16270"},"observation_digest":"sha256:dadbcee121c036b3cf80e80800bd7b9e4c897e6b3f935014452ab0874afe6db0","observation_id":"4f83eca0-1b01-4a7c-afce-af30327d893d","resolution":{"observed_at":"2026-08-16T11:17:20.522094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.01848","last_updated":"2021-11-10T18:18:32Z","snapshot_observed_at":"2026-08-19T05:41:30.910161Z","submitted_at":"2021-11-02T19:10:19Z","title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression","version":2},"cited_work":{"arxiv_id":"2111.01848","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.01848","snapshot_observed_at":"2026-07-02T19:37:18.509306Z","title":"[JLS23] Arun Jambulapati, Yang P Liu, and Aaron Sidford","venue":null,"work_id":"2ab87192-000b-4936-86f0-3b457a52800c","year":null},"citing_paper":{"arxiv_id":"2607.00252","last_updated":"2026-06-30T23:01:08Z","snapshot_observed_at":"2026-08-13T15:44:45.880165Z","submitted_at":"2026-06-30T23:01:08Z","title":"Distributionally Robust Linear Regression With Block Lewis Weights","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T19:29:59.464383Z"},"links":{"cited_paper":"/paper/2111.01848","citing_paper":"/paper/2607.00252"},"observation_digest":"sha256:e95ee98eab21d6619cf8e9800fe754a79a9e26215680a88de59a016bf404d855","observation_id":"fcd3a388-20a0-46a8-8cc7-26fe069bf1f5","resolution":{"observed_at":"2026-07-02T19:37:18.510805Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.01848/citation-record","integrity":"/paper/2111.01848/integrity","json":"/paper/2111.01848/citation-record.json","paper":"/paper/2111.01848"},"outbound":[],"paper":{"arxiv_id":"2111.01848","last_updated":"2021-11-10T18:18:32Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T05:41:30.910161Z","submitted_at":"2021-11-02T19:10:19Z","title":"Improved Iteration Complexities for Overconstrained $p$-Norm Regression"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2111.01848."}