{"as_of":"2026-08-14T20:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:333861ebd46ad7945fb86124c1524014c37c5cc669abb3da8fdc0072fff10b81","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-12T13:07:04.289632Z","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-12T13:07:04.928700Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.16912","last_updated":"2025-02-24T07:18:24Z","snapshot_observed_at":"2026-08-07T17:54:05.770444Z","submitted_at":"2025-02-24T07:18:24Z","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","version":1},"cited_work":{"arxiv_id":"2502.16912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.16912","snapshot_observed_at":"2026-08-12T13:07:04.928700Z","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","venue":"cs.CC","work_id":"3f0cbdbf-2f49-4879-ae76-4ccf637ea95a","year":2025},"citing_paper":{"arxiv_id":"2411.16525","last_updated":"2025-06-05T23:04:39Z","snapshot_observed_at":"2026-08-13T12:09:17.275284Z","submitted_at":"2024-11-25T16:12:17Z","title":"Fundamental Limits of Prompt Tuning Transformers: Universality, Capacity and Efficiency","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T13:07:04.289632Z"},"links":{"cited_paper":"/paper/2502.16912","citing_paper":"/paper/2411.16525"},"observation_digest":"sha256:0904c86aa60ebe26f59ce0ce31ae802166e128920ddcce3636af6f682f30dfca","observation_id":"a2526298-a7ad-4a41-aa84-1cc8ab3e7d1b","resolution":{"observed_at":"2026-08-12T13:07:04.939799Z","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/2502.16912/citation-record","integrity":"/paper/2502.16912/integrity","json":"/paper/2502.16912/citation-record.json","paper":"/paper/2502.16912"},"outbound":[],"paper":{"arxiv_id":"2502.16912","last_updated":"2025-02-24T07:18:24Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T17:54:05.770444Z","submitted_at":"2025-02-24T07:18:24Z","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?"},"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:2502.16912."}