{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FKQHOEOGPGSBZBLRZ45KVWV2XN","short_pith_number":"pith:FKQHOEOG","canonical_record":{"source":{"id":"1509.00296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-01T13:49:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1d9e9acca932b875289e4d815d9510296d27cb86859a7a6a61322252b29f29f3","abstract_canon_sha256":"2b40c56f38735b37ed1569c4afd392a8c01961052167e37dc058b084e993651d"},"schema_version":"1.0"},"canonical_sha256":"2aa07711c679a41c8571cf3aaadababb52bdb27e7f220507fcb115a0a3017516","source":{"kind":"arxiv","id":"1509.00296","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00296","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00296v2","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00296","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"FKQHOEOGPGSB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FKQHOEOGPGSBZBLR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FKQHOEOG","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FKQHOEOGPGSBZBLRZ45KVWV2XN","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-01T13:49:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1d9e9acca932b875289e4d815d9510296d27cb86859a7a6a61322252b29f29f3","abstract_canon_sha256":"2b40c56f38735b37ed1569c4afd392a8c01961052167e37dc058b084e993651d"},"schema_version":"1.0"},"canonical_sha256":"2aa07711c679a41c8571cf3aaadababb52bdb27e7f220507fcb115a0a3017516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.255159Z","signature_b64":"69L9voAPC3y/npI6z1rEEcwebhPUJ2pZuYF5bj2j/2CjhqzvcPnBsupdmd8KV00G/hR5Ufu1r8zwxfsLrY3UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa07711c679a41c8571cf3aaadababb52bdb27e7f220507fcb115a0a3017516","last_reissued_at":"2026-05-17T23:53:58.254438Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.254438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00296","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-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyKMNdJ4I0O/w8v6ms/vzpQorhefFgP31+RT7weRl+PFZVjXENEXv8s2iDFNr9NcPiIo2zotV7pULSJzkfOKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:16:23.384235Z"},"content_sha256":"4991edfa9ad9107e6bfd4fe25af8571d8b915712fa5de52d1a9519e0daf68e0e","schema_version":"1.0","event_id":"sha256:4991edfa9ad9107e6bfd4fe25af8571d8b915712fa5de52d1a9519e0daf68e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FKQHOEOGPGSBZBLRZ45KVWV2XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Randomized Singular Value Thresholding for Low-rank Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"In So Kweon, Tae-Hyun Oh, Yasuyuki Matsushita, Yu-Wing Tai","submitted_at":"2015-09-01T13:49:11Z","abstract_excerpt":"Rank minimization can be converted into tractable surrogate problems, such as Nuclear Norm Minimization (NNM) and Weighted NNM (WNNM). The problems related to NNM, or WNNM, can be solved iteratively by applying a closed-form proximal operator, called Singular Value Thresholding (SVT), or Weighted SVT, but they suffer from high computational cost of Singular Value Decomposition (SVD) at each iteration. We propose a fast and accurate approximation method for SVT, that we call fast randomized SVT (FRSVT), with which we avoid direct computation of SVD. The key idea is to extract an approximate bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00296","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-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiRk4wgTgCGSjxKNmKshSNYISO9h6HINqaImcZNTVGrrk93xzCQUsJgtULTaR4RWo87pN0XE0OhKs/NAouS4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:16:23.384711Z"},"content_sha256":"8a4757aa58901d465f315270bf9731b793701fe2c015aee23e289946e7202c23","schema_version":"1.0","event_id":"sha256:8a4757aa58901d465f315270bf9731b793701fe2c015aee23e289946e7202c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/bundle.json","state_url":"https://pith.science/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/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-02T08:16:23Z","links":{"resolver":"https://pith.science/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN","bundle":"https://pith.science/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/bundle.json","state":"https://pith.science/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKQHOEOGPGSBZBLRZ45KVWV2XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FKQHOEOGPGSBZBLRZ45KVWV2XN","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":"2b40c56f38735b37ed1569c4afd392a8c01961052167e37dc058b084e993651d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-01T13:49:11Z","title_canon_sha256":"1d9e9acca932b875289e4d815d9510296d27cb86859a7a6a61322252b29f29f3"},"schema_version":"1.0","source":{"id":"1509.00296","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00296","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00296v2","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00296","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"FKQHOEOGPGSB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FKQHOEOGPGSBZBLR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FKQHOEOG","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:8a4757aa58901d465f315270bf9731b793701fe2c015aee23e289946e7202c23","target":"graph","created_at":"2026-05-17T23:53:58Z","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":"Rank minimization can be converted into tractable surrogate problems, such as Nuclear Norm Minimization (NNM) and Weighted NNM (WNNM). The problems related to NNM, or WNNM, can be solved iteratively by applying a closed-form proximal operator, called Singular Value Thresholding (SVT), or Weighted SVT, but they suffer from high computational cost of Singular Value Decomposition (SVD) at each iteration. We propose a fast and accurate approximation method for SVT, that we call fast randomized SVT (FRSVT), with which we avoid direct computation of SVD. The key idea is to extract an approximate bas","authors_text":"In So Kweon, Tae-Hyun Oh, Yasuyuki Matsushita, Yu-Wing Tai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-01T13:49:11Z","title":"Fast Randomized Singular Value Thresholding for Low-rank Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00296","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:4991edfa9ad9107e6bfd4fe25af8571d8b915712fa5de52d1a9519e0daf68e0e","target":"record","created_at":"2026-05-17T23:53:58Z","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":"2b40c56f38735b37ed1569c4afd392a8c01961052167e37dc058b084e993651d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-01T13:49:11Z","title_canon_sha256":"1d9e9acca932b875289e4d815d9510296d27cb86859a7a6a61322252b29f29f3"},"schema_version":"1.0","source":{"id":"1509.00296","kind":"arxiv","version":2}},"canonical_sha256":"2aa07711c679a41c8571cf3aaadababb52bdb27e7f220507fcb115a0a3017516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aa07711c679a41c8571cf3aaadababb52bdb27e7f220507fcb115a0a3017516","first_computed_at":"2026-05-17T23:53:58.254438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:58.254438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"69L9voAPC3y/npI6z1rEEcwebhPUJ2pZuYF5bj2j/2CjhqzvcPnBsupdmd8KV00G/hR5Ufu1r8zwxfsLrY3UAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:58.255159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00296","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4991edfa9ad9107e6bfd4fe25af8571d8b915712fa5de52d1a9519e0daf68e0e","sha256:8a4757aa58901d465f315270bf9731b793701fe2c015aee23e289946e7202c23"],"state_sha256":"6c5d306cb56dddd2456ac8346c95bf0a312424b918700f94d0cf7c0145bd895c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZz9bInmi+pBSdvrhG+9nNfCnca35vxItiVUiHSJMPqW6ljVyUKS8FIOekhqegb8uFrZS0UHGuIqRDLXOrqbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:16:23.386691Z","bundle_sha256":"8bfb0f1b5e4f3e693b9a5182af5e0751f3ccf6ef723aa12d03a53b16e105b998"}}