{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EAYLWTPKC7Z76MAKA5FOMPFK4W","short_pith_number":"pith:EAYLWTPK","schema_version":"1.0","canonical_sha256":"2030bb4dea17f3ff300a074ae63caae5994d6a20c13f402901e4c85619e08737","source":{"kind":"arxiv","id":"1603.01765","version":1},"attestation_state":"computed","paper":{"title":"Accurate principal component analysis via a few iterations of alternating least squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO"],"primary_cat":"math.NA","authors_text":"Andrew Tulloch, Arthur Szlam, Mark Tygert","submitted_at":"2016-03-05T22:30:38Z","abstract_excerpt":"A few iterations of alternating least squares with a random starting point provably suffice to produce nearly optimal spectral- and Frobenius-norm accuracies of low-rank approximations to a matrix; iterating to convergence is unnecessary. Thus, software implementing alternating least squares can be retrofitted via appropriate setting of parameters to calculate nearly optimally accurate low-rank approximations highly efficiently, with no need for convergence."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.01765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-05T22:30:38Z","cross_cats_sorted":["cs.NA","stat.CO"],"title_canon_sha256":"c322dbf3c064552596d1f32e7c7e5c0d1af302d05b213980e03ba8758935a233","abstract_canon_sha256":"a391a48a21a8631d6b73eaacd566d174bbf4aee17ce6090436554d57b0f2a7c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.646768Z","signature_b64":"RGaytJyg3jaAe6fA0LabaG11RMq6ZO6RpA7DeBeMdSnis2i3Udjui6b9N3ykrmtEac+2ogy3QMPEcz4glwKXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2030bb4dea17f3ff300a074ae63caae5994d6a20c13f402901e4c85619e08737","last_reissued_at":"2026-05-18T00:43:18.646082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.646082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accurate principal component analysis via a few iterations of alternating least squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO"],"primary_cat":"math.NA","authors_text":"Andrew Tulloch, Arthur Szlam, Mark Tygert","submitted_at":"2016-03-05T22:30:38Z","abstract_excerpt":"A few iterations of alternating least squares with a random starting point provably suffice to produce nearly optimal spectral- and Frobenius-norm accuracies of low-rank approximations to a matrix; iterating to convergence is unnecessary. Thus, software implementing alternating least squares can be retrofitted via appropriate setting of parameters to calculate nearly optimally accurate low-rank approximations highly efficiently, with no need for convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01765","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.01765","created_at":"2026-05-18T00:43:18.646205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01765v1","created_at":"2026-05-18T00:43:18.646205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01765","created_at":"2026-05-18T00:43:18.646205+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAYLWTPKC7Z7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAYLWTPKC7Z76MAK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAYLWTPK","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W","json":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W.json","graph_json":"https://pith.science/api/pith-number/EAYLWTPKC7Z76MAKA5FOMPFK4W/graph.json","events_json":"https://pith.science/api/pith-number/EAYLWTPKC7Z76MAKA5FOMPFK4W/events.json","paper":"https://pith.science/paper/EAYLWTPK"},"agent_actions":{"view_html":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W","download_json":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W.json","view_paper":"https://pith.science/paper/EAYLWTPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01765&json=true","fetch_graph":"https://pith.science/api/pith-number/EAYLWTPKC7Z76MAKA5FOMPFK4W/graph.json","fetch_events":"https://pith.science/api/pith-number/EAYLWTPKC7Z76MAKA5FOMPFK4W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W/action/storage_attestation","attest_author":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W/action/author_attestation","sign_citation":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W/action/citation_signature","submit_replication":"https://pith.science/pith/EAYLWTPKC7Z76MAKA5FOMPFK4W/action/replication_record"}},"created_at":"2026-05-18T00:43:18.646205+00:00","updated_at":"2026-05-18T00:43:18.646205+00:00"}