{"as_of":"2026-08-17T05:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6b643607eec0f2f928b419b3a90c2b110e973fa8cba3e3bf0869ecb17a1f76d","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-16T06:30:59.297886+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-09T19:04:34.000402Z","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-06-28T23:02:45.989455Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.02704","last_updated":"2024-03-05T06:54:49Z","snapshot_observed_at":"2026-08-16T14:12:46.978419Z","submitted_at":"2024-03-05T06:54:49Z","title":"Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02704","snapshot_observed_at":"2026-08-09T19:04:34.000402Z","title":"Projected gradient descent algorithm for low-rank matrix estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-13T23:33:30.801142Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.000402Z"},"links":{"cited_paper":"/paper/2403.02704","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:40ae7f8937dcbc718e7fdaa0b617b467900dcd05c466be6636072702ffca963f","observation_id":"d5e61dc6-e813-4b77-8cd8-98b83b983731","resolution":{"observed_at":"2026-08-09T19:04:34.000402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02704","last_updated":"2024-03-05T06:54:49Z","snapshot_observed_at":"2026-08-16T14:12:46.978419Z","submitted_at":"2024-03-05T06:54:49Z","title":"Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation","version":1},"cited_work":{"arxiv_id":"2403.02704","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.02704","snapshot_observed_at":"2026-06-28T23:02:45.989455Z","title":"Zhang, T","venue":null,"work_id":"b73ca190-38b4-44da-9ee9-ed4c38d34115","year":2024},"citing_paper":{"arxiv_id":"2605.31484","last_updated":"2026-05-29T16:08:28Z","snapshot_observed_at":"2026-08-15T10:06:21.529221Z","submitted_at":"2026-05-29T16:08:28Z","title":"Balanced LoRA: Removing Parameter Invariance to Accelerate Convergence","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T23:02:13.044074Z"},"links":{"cited_paper":"/paper/2403.02704","citing_paper":"/paper/2605.31484"},"observation_digest":"sha256:846cf5393883c05b7e20da698d544978a5d4453e1078d4b468c418bda65d80f3","observation_id":"298b28a4-dae1-44e9-beae-477a03d80639","resolution":{"observed_at":"2026-06-28T23:02:45.991165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.02704/citation-record","integrity":"/paper/2403.02704/integrity","json":"/paper/2403.02704/citation-record.json","paper":"/paper/2403.02704"},"outbound":[],"paper":{"arxiv_id":"2403.02704","last_updated":"2024-03-05T06:54:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:12:46.978419Z","submitted_at":"2024-03-05T06:54:49Z","title":"Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.02704."}