{"as_of":"2026-08-09T17:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db8dc6796bf73dcb939debb83b3a25f06d4533b20ebb4c3553fc31103851dbd4","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-09T06:31:02.800959+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-07T13:10:36.006906Z","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-07T13:10:42.442404Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1606.03168","last_updated":"2016-10-29T21:03:47Z","snapshot_observed_at":"2026-07-06T04:59:27.042001Z","submitted_at":"2016-06-10T03:18:01Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","version":3},"cited_work":{"arxiv_id":"1606.03168","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.03168","snapshot_observed_at":"2026-08-07T13:10:42.442404Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","venue":"math.OC","work_id":"90522023-75d0-4601-a061-d28b20f4ccf0","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.006906Z"},"links":{"cited_paper":"/paper/1606.03168","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:69fd1655ad0a7ff78944134d3b46388b1e1d33a715dc9cd2e1d4e855861a0ced","observation_id":"a86473ee-9d15-4014-9693-36d0867ab473","resolution":{"observed_at":"2026-08-07T13:10:42.567198Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1606.03168/citation-record","integrity":"/paper/1606.03168/integrity","json":"/paper/1606.03168/citation-record.json","paper":"/paper/1606.03168"},"outbound":[],"paper":{"arxiv_id":"1606.03168","last_updated":"2016-10-29T21:03:47Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T04:59:27.042001Z","submitted_at":"2016-06-10T03:18:01Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1606.03168."}