{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K7IU5USF46KUW3MX5UMPVDYNP5","short_pith_number":"pith:K7IU5USF","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"},"canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","source":{"kind":"arxiv","id":"1702.02241","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02241","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02241v2","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02241","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"K7IU5USF46KU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K7IU5USF46KUW3MX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K7IU5USF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K7IU5USF46KUW3MX5UMPVDYNP5","target":"record","payload":{"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"},"canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","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"},"source_kind":"arxiv","source_id":"1702.02241","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gB6l/Vj9xvz4fp+/Ovf3hwEHnDEioVI8y7D/rdIiJEdZG3p4cX8mHdTI7apS/kY7cG6/a5Xrix3RCnGrq04TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:16:19.149528Z"},"content_sha256":"d84d81be1b88650c69902ef898f13042c2c40e414b45c60fa46b79341f00d247","schema_version":"1.0","event_id":"sha256:d84d81be1b88650c69902ef898f13042c2c40e414b45c60fa46b79341f00d247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K7IU5USF46KUW3MX5UMPVDYNP5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usrRtozRV9skEHckdL9YHkTvJFTVM6brlekPI21StCNXG/0Nsos4BfRD5jYJXxpZUJ8Zye1xaBIq9rPE78jmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:16:19.149900Z"},"content_sha256":"09ecb782c7ab8b25e51cf0c2e871d7e59e885715e3932b0c7d4211141d5b2292","schema_version":"1.0","event_id":"sha256:09ecb782c7ab8b25e51cf0c2e871d7e59e885715e3932b0c7d4211141d5b2292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/bundle.json","state_url":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7IU5USF46KUW3MX5UMPVDYNP5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T22:16:19Z","links":{"resolver":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5","bundle":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/bundle.json","state":"https://pith.science/pith/K7IU5USF46KUW3MX5UMPVDYNP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7IU5USF46KUW3MX5UMPVDYNP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K7IU5USF46KUW3MX5UMPVDYNP5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c726256781cd863a7bcb5260b6c136ab49e7e413eca27a677685bb19eae7c977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-08T01:07:45Z","title_canon_sha256":"1afdec39d97943c6bab5e9cd7cfb359930b789ee40e71ad7d6a03ea033a39b38"},"schema_version":"1.0","source":{"id":"1702.02241","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02241","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02241v2","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02241","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"K7IU5USF46KU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K7IU5USF46KUW3MX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K7IU5USF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:09ecb782c7ab8b25e51cf0c2e871d7e59e885715e3932b0c7d4211141d5b2292","target":"graph","created_at":"2026-05-18T00:33:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksandr Aravkin, Derek Driggs, Stephen Becker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-08T01:07:45Z","title":"Adapting Regularized Low Rank Models for Parallel Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02241","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d84d81be1b88650c69902ef898f13042c2c40e414b45c60fa46b79341f00d247","target":"record","created_at":"2026-05-18T00:33:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c726256781cd863a7bcb5260b6c136ab49e7e413eca27a677685bb19eae7c977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-08T01:07:45Z","title_canon_sha256":"1afdec39d97943c6bab5e9cd7cfb359930b789ee40e71ad7d6a03ea033a39b38"},"schema_version":"1.0","source":{"id":"1702.02241","kind":"arxiv","version":2}},"canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d14ed245e7954b6d97ed18fa8f0d7f5b3ca72ecdd6e99dbd558342f738cbeb","first_computed_at":"2026-05-18T00:33:43.857582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:43.857582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RjfOQ7/0TkNwBypgg/ch/CR0Y2UocC4XT1ViGTP90cVUmgyTOEGq3Cne+12OSRDIlGUDL4DiISY7+Zxk2YuNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:43.858078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02241","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d84d81be1b88650c69902ef898f13042c2c40e414b45c60fa46b79341f00d247","sha256:09ecb782c7ab8b25e51cf0c2e871d7e59e885715e3932b0c7d4211141d5b2292"],"state_sha256":"3e743babd88d5d3bc677654193207e75a6e69d7fb52d5984e701e4fb8858465d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yc0jH2IN4HIy4oc6Sg/LZ4tcySuPQmNaWAgElczA9yKMZhlFhfSyOEyswFMcAL3RZIHWZQSIHq67pYTgRv5xAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:16:19.152621Z","bundle_sha256":"229dd5e633b14759edf5cddc14009328190bfcd038d1f9660f6c550ec894de86"}}