{"as_of":"2026-08-13T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7db250cf74687052d24ea346fa483b81db68674882b0c6aad3554d101d9bc8da","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-13T06:32:02.005865+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-10T16:17:16.932637Z","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-07-04T09:19:42.890054Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1603.06610","last_updated":"2016-04-09T02:48:49Z","snapshot_observed_at":"2026-08-03T12:11:44.182575Z","submitted_at":"2016-03-21T20:51:16Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.06610","snapshot_observed_at":"2026-08-10T16:17:16.932637Z","title":"W ang, V","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.13385","last_updated":"2025-01-23T05:03:50Z","snapshot_observed_at":"2026-08-10T15:58:09.933117Z","submitted_at":"2025-01-23T05:03:50Z","title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T16:17:16.932637Z"},"links":{"cited_paper":"/paper/1603.06610","citing_paper":"/paper/2501.13385"},"observation_digest":"sha256:5b3f32e7352acc58bb3e0c9d43fe1dd3561d2935c29311ff6f1c57172350cad3","observation_id":"87b737cb-0561-4445-8879-c71a78ce2863","resolution":{"observed_at":"2026-08-10T16:17:16.932637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.06610","last_updated":"2016-04-09T02:48:49Z","snapshot_observed_at":"2026-08-03T12:11:44.182575Z","submitted_at":"2016-03-21T20:51:16Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion","version":2},"cited_work":{"arxiv_id":"1603.06610","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.06610","snapshot_observed_at":"2026-07-04T09:19:42.890054Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion","venue":"math.NA","work_id":"0e75bd08-c899-4316-8862-ba35e5166f02","year":2016},"citing_paper":{"arxiv_id":"2606.22724","last_updated":"2026-06-21T23:49:22Z","snapshot_observed_at":"2026-07-06T23:57:32.788548Z","submitted_at":"2026-06-21T23:49:22Z","title":"Subspace-Constrained Federated Learning with Low-Rank Adaptation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-26T10:18:24.570122Z"},"links":{"cited_paper":"/paper/1603.06610","citing_paper":"/paper/2606.22724"},"observation_digest":"sha256:d0120543d7089e16cd094188fb6260c7efb612e42c9c4e055b57ddd239d97780","observation_id":"4bd66403-04db-4946-ab4c-8062951c9c7a","resolution":{"observed_at":"2026-07-04T09:19:42.891288Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1603.06610/citation-record","integrity":"/paper/1603.06610/integrity","json":"/paper/1603.06610/citation-record.json","paper":"/paper/1603.06610"},"outbound":[],"paper":{"arxiv_id":"1603.06610","last_updated":"2016-04-09T02:48:49Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-03T12:11:44.182575Z","submitted_at":"2016-03-21T20:51:16Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1603.06610."}