{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K7IU5USF46KUW3MX5UMPVDYNP5","short_pith_number":"pith:K7IU5USF","schema_version":"1.0","canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","source":{"kind":"arxiv","id":"1702.02241","version":2},"attestation_state":"computed","paper":{"title":"Adapting Regularized Low Rank Models for Parallel Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, Derek Driggs, Stephen Becker","submitted_at":"2017-02-08T01:07:45Z","abstract_excerpt":"We introduce a reformulation of regularized low-rank recovery models to take advantage of GPU, multiple CPU, and hybridized architectures. Low-rank recovery often involves nuclear-norm minimization through iterative thresholding of singular values. These models are slow to fit and difficult to parallelize because of their dependence on computing a singular value decomposition at each iteration. Regularized low-rank recovery models also incorporate non-smooth terms to separate structured components (e.g. sparse outliers) from the low-rank component, making these problems more difficult.\n  Using"},"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":"1702.02241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-08T01:07:45Z","cross_cats_sorted":[],"title_canon_sha256":"1afdec39d97943c6bab5e9cd7cfb359930b789ee40e71ad7d6a03ea033a39b38","abstract_canon_sha256":"c726256781cd863a7bcb5260b6c136ab49e7e413eca27a677685bb19eae7c977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.858078Z","signature_b64":"RjfOQ7/0TkNwBypgg/ch/CR0Y2UocC4XT1ViGTP90cVUmgyTOEGq3Cne+12OSRDIlGUDL4DiISY7+Zxk2YuNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","last_reissued_at":"2026-05-18T00:33:43.857582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.857582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapting Regularized Low Rank Models for Parallel Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, Derek Driggs, Stephen Becker","submitted_at":"2017-02-08T01:07:45Z","abstract_excerpt":"We introduce a reformulation of regularized low-rank recovery models to take advantage of GPU, multiple CPU, and hybridized architectures. Low-rank recovery often involves nuclear-norm minimization through iterative thresholding of singular values. These models are slow to fit and difficult to parallelize because of their dependence on computing a singular value decomposition at each iteration. Regularized low-rank recovery models also incorporate non-smooth terms to separate structured components (e.g. sparse outliers) from the low-rank component, making these problems more difficult.\n  Using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02241","kind":"arxiv","version":2},"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":"1702.02241","created_at":"2026-05-18T00:33:43.857655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02241v2","created_at":"2026-05-18T00:33:43.857655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02241","created_at":"2026-05-18T00:33:43.857655+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7IU5USF46KU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7IU5USF46KUW3MX","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7IU5USF","created_at":"2026-05-18T12:31:24.725408+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/K7IU5USF46KUW3MX5UMPVDYNP5","json":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5.json","graph_json":"https://pith.science/api/pith-number/K7IU5USF46KUW3MX5UMPVDYNP5/graph.json","events_json":"https://pith.science/api/pith-number/K7IU5USF46KUW3MX5UMPVDYNP5/events.json","paper":"https://pith.science/paper/K7IU5USF"},"agent_actions":{"view_html":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5","download_json":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5.json","view_paper":"https://pith.science/paper/K7IU5USF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02241&json=true","fetch_graph":"https://pith.science/api/pith-number/K7IU5USF46KUW3MX5UMPVDYNP5/graph.json","fetch_events":"https://pith.science/api/pith-number/K7IU5USF46KUW3MX5UMPVDYNP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/action/storage_attestation","attest_author":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/action/author_attestation","sign_citation":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/action/citation_signature","submit_replication":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/action/replication_record"}},"created_at":"2026-05-18T00:33:43.857655+00:00","updated_at":"2026-05-18T00:33:43.857655+00:00"}