{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4KSKLTGWK6YUJTZEYYHG6VF53C","short_pith_number":"pith:4KSKLTGW","canonical_record":{"source":{"id":"1704.05528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-04-14T20:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"b0867f529b22636ce5c2837bed32722bb80102050b63065cd39d7164ce78a533","abstract_canon_sha256":"902d9b8aac59a53f7f802f8f70393a2233bc741163b182fe309a1e0c86696435"},"schema_version":"1.0"},"canonical_sha256":"e2a4a5ccd657b144cf24c60e6f54bdd8be452456002bb49988d45419a1404edd","source":{"kind":"arxiv","id":"1704.05528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05528","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05528v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05528","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"4KSKLTGWK6YU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KSKLTGWK6YUJTZE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KSKLTGW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4KSKLTGWK6YUJTZEYYHG6VF53C","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-04-14T20:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"b0867f529b22636ce5c2837bed32722bb80102050b63065cd39d7164ce78a533","abstract_canon_sha256":"902d9b8aac59a53f7f802f8f70393a2233bc741163b182fe309a1e0c86696435"},"schema_version":"1.0"},"canonical_sha256":"e2a4a5ccd657b144cf24c60e6f54bdd8be452456002bb49988d45419a1404edd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.209753Z","signature_b64":"Mkbsatr6xUuzQCPfG5uiaqq1yxFWbC2jTWrmoDDfziicyE7jwTpReFki/VWhkvUV8EQ9CmjWsXV4G9NrdOJhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a4a5ccd657b144cf24c60e6f54bdd8be452456002bb49988d45419a1404edd","last_reissued_at":"2026-05-18T00:46:07.209308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.209308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05528","source_version":1,"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:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DW0xAF6a25rqB7ygo5E/WYmbPVluoY7p64KY+J8dkVaMuZNzfkrw6Ek1Z7Chvt8L/XeJjTZMRQTW1otqwP2KDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:10:03.265182Z"},"content_sha256":"c19ed16bb2094cea57d7ea62bea93571d2a7da0238514828b5a23a20a6da4071","schema_version":"1.0","event_id":"sha256:c19ed16bb2094cea57d7ea62bea93571d2a7da0238514828b5a23a20a6da4071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4KSKLTGWK6YUJTZEYYHG6VF53C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Implementation of Singular Value Thresholding Algorithm using Recycling Rank Revealing Randomized Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Wenjian Yu, Yaohang Li","submitted_at":"2017-04-14T20:22:39Z","abstract_excerpt":"In this paper, we present a fast implementation of the Singular Value Thresholding (SVT) algorithm for matrix completion. A rank-revealing randomized singular value decomposition (R3SVD) algorithm is used to adaptively carry out partial singular value decomposition (SVD) to fast approximate the SVT operator given a desired, fixed precision. We extend the R3SVD algorithm to a recycling rank revealing randomized singular value decomposition (R4SVD) algorithm by reusing the left singular vectors obtained from the previous iteration as the approximate basis in the current iteration, where the comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05528","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"},"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:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LD1rSRfzhOgF+GifghrGJATJrxsNMfBIEp4yyj2c6+r5Ad/kOLhekYtuRx4KUvdvQsXEk5F2X0Ph+cFrf8GNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:10:03.265557Z"},"content_sha256":"9bf8ae1256eab89d3c07c9e8c95ddcebb0df20adfe424d1c67ca64064e792780","schema_version":"1.0","event_id":"sha256:9bf8ae1256eab89d3c07c9e8c95ddcebb0df20adfe424d1c67ca64064e792780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/bundle.json","state_url":"https://pith.science/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/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-05T04:10:03Z","links":{"resolver":"https://pith.science/pith/4KSKLTGWK6YUJTZEYYHG6VF53C","bundle":"https://pith.science/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/bundle.json","state":"https://pith.science/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KSKLTGWK6YUJTZEYYHG6VF53C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4KSKLTGWK6YUJTZEYYHG6VF53C","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":"902d9b8aac59a53f7f802f8f70393a2233bc741163b182fe309a1e0c86696435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-04-14T20:22:39Z","title_canon_sha256":"b0867f529b22636ce5c2837bed32722bb80102050b63065cd39d7164ce78a533"},"schema_version":"1.0","source":{"id":"1704.05528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05528","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05528v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05528","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"4KSKLTGWK6YU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KSKLTGWK6YUJTZE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KSKLTGW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:9bf8ae1256eab89d3c07c9e8c95ddcebb0df20adfe424d1c67ca64064e792780","target":"graph","created_at":"2026-05-18T00:46:07Z","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":"In this paper, we present a fast implementation of the Singular Value Thresholding (SVT) algorithm for matrix completion. A rank-revealing randomized singular value decomposition (R3SVD) algorithm is used to adaptively carry out partial singular value decomposition (SVD) to fast approximate the SVT operator given a desired, fixed precision. We extend the R3SVD algorithm to a recycling rank revealing randomized singular value decomposition (R4SVD) algorithm by reusing the left singular vectors obtained from the previous iteration as the approximate basis in the current iteration, where the comp","authors_text":"Wenjian Yu, Yaohang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-04-14T20:22:39Z","title":"A Fast Implementation of Singular Value Thresholding Algorithm using Recycling Rank Revealing Randomized Singular Value Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05528","kind":"arxiv","version":1},"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:c19ed16bb2094cea57d7ea62bea93571d2a7da0238514828b5a23a20a6da4071","target":"record","created_at":"2026-05-18T00:46:07Z","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":"902d9b8aac59a53f7f802f8f70393a2233bc741163b182fe309a1e0c86696435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-04-14T20:22:39Z","title_canon_sha256":"b0867f529b22636ce5c2837bed32722bb80102050b63065cd39d7164ce78a533"},"schema_version":"1.0","source":{"id":"1704.05528","kind":"arxiv","version":1}},"canonical_sha256":"e2a4a5ccd657b144cf24c60e6f54bdd8be452456002bb49988d45419a1404edd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2a4a5ccd657b144cf24c60e6f54bdd8be452456002bb49988d45419a1404edd","first_computed_at":"2026-05-18T00:46:07.209308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:07.209308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mkbsatr6xUuzQCPfG5uiaqq1yxFWbC2jTWrmoDDfziicyE7jwTpReFki/VWhkvUV8EQ9CmjWsXV4G9NrdOJhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:07.209753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c19ed16bb2094cea57d7ea62bea93571d2a7da0238514828b5a23a20a6da4071","sha256:9bf8ae1256eab89d3c07c9e8c95ddcebb0df20adfe424d1c67ca64064e792780"],"state_sha256":"b3f2ccf614ea3e71cb2ddc82e603a16fde5e0764ab5b70e6b92dbb0ab746765b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1zxZCDq7L7ktUEFLvruk1cs0jIxt8PEU+BXGUWm+NyTw0pOj/IW/L0WghER7HTvT8QZN35doDKtKwxDgHxZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:10:03.267682Z","bundle_sha256":"3f282823b26798b2b45f910a9da71e9f36a042368bc82b46a21f27f6e8c2580e"}}