{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IPP23PGIXC72UG566EPYMAM4BO","short_pith_number":"pith:IPP23PGI","canonical_record":{"source":{"id":"1703.05487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","cross_cats_sorted":[],"title_canon_sha256":"3a1fd6b5b8b3c42f5531ae19131f216e6f441442b98716a545d224ad395dbd7a","abstract_canon_sha256":"bf8a353b12da5c1f9887793838c16d3a17c3411c6d3558eae0a50a95a8ce7cb2"},"schema_version":"1.0"},"canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","source":{"kind":"arxiv","id":"1703.05487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05487","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05487v2","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05487","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"IPP23PGIXC72","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPP23PGIXC72UG56","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPP23PGI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IPP23PGIXC72UG566EPYMAM4BO","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","cross_cats_sorted":[],"title_canon_sha256":"3a1fd6b5b8b3c42f5531ae19131f216e6f441442b98716a545d224ad395dbd7a","abstract_canon_sha256":"bf8a353b12da5c1f9887793838c16d3a17c3411c6d3558eae0a50a95a8ce7cb2"},"schema_version":"1.0"},"canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.781737Z","signature_b64":"0ln3pzlpPgzZvI7ZTqSn+VaqgI6v7bhefPZ4m0pY1jdDyHA7E4idYFFRUU53utf1H0uER1Kxx5j7oos5Ej2xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","last_reissued_at":"2026-05-18T00:07:18.781047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.781047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05487","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0YblvBOKpew0C65IR1tCn2z9f1BB+guFJUJ88+dhEWIaSH0b2tM9CGMg9+T4e4w2E6KRORwzbobydzi3PZvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:53:29.184607Z"},"content_sha256":"d9c8d56db6b991aab96934d7780818bf963f9eff4b30540a5e438a491650c7e3","schema_version":"1.0","event_id":"sha256:d9c8d56db6b991aab96934d7780818bf963f9eff4b30540a5e438a491650c7e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IPP23PGIXC72UG566EPYMAM4BO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated and Inexact Soft-Impute for Large-Scale Matrix and Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao","submitted_at":"2017-03-16T06:50:00Z","abstract_excerpt":"Matrix and tensor completion aim to recover a low-rank matrix / tensor from limited observations and have been commonly used in applications such as recommender systems and multi-relational data mining. A state-of-the-art matrix completion algorithm is Soft-Impute, which exploits the special \"sparse plus low-rank\" structure of the matrix iterates to allow efficient SVD in each iteration. Though Soft-Impute is a proximal algorithm, it is generally believed that acceleration destroys the special structure and is thus not useful. In this paper, we show that Soft-Impute can indeed be accelerated w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05487","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:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqSRMnQxk7ECNgigRR6NP7OTQ7qYGtS0LehkFIR6odxo0Vg5HbaTPDQpgqMcU8bnGUr2GwiPROIO1febAHzACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:53:29.185208Z"},"content_sha256":"f8b3d96ca6a7079fe347e2253f6bcfaa5ef9b00f36132c571bc9af24902a485a","schema_version":"1.0","event_id":"sha256:f8b3d96ca6a7079fe347e2253f6bcfaa5ef9b00f36132c571bc9af24902a485a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/bundle.json","state_url":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPP23PGIXC72UG566EPYMAM4BO/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-04T22:53:29Z","links":{"resolver":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO","bundle":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/bundle.json","state":"https://pith.science/pith/IPP23PGIXC72UG566EPYMAM4BO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPP23PGIXC72UG566EPYMAM4BO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IPP23PGIXC72UG566EPYMAM4BO","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":"bf8a353b12da5c1f9887793838c16d3a17c3411c6d3558eae0a50a95a8ce7cb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","title_canon_sha256":"3a1fd6b5b8b3c42f5531ae19131f216e6f441442b98716a545d224ad395dbd7a"},"schema_version":"1.0","source":{"id":"1703.05487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05487","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05487v2","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05487","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"IPP23PGIXC72","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPP23PGIXC72UG56","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPP23PGI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f8b3d96ca6a7079fe347e2253f6bcfaa5ef9b00f36132c571bc9af24902a485a","target":"graph","created_at":"2026-05-18T00:07:18Z","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":"Matrix and tensor completion aim to recover a low-rank matrix / tensor from limited observations and have been commonly used in applications such as recommender systems and multi-relational data mining. A state-of-the-art matrix completion algorithm is Soft-Impute, which exploits the special \"sparse plus low-rank\" structure of the matrix iterates to allow efficient SVD in each iteration. Though Soft-Impute is a proximal algorithm, it is generally believed that acceleration destroys the special structure and is thus not useful. In this paper, we show that Soft-Impute can indeed be accelerated w","authors_text":"James T. Kwok, Quanming Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","title":"Accelerated and Inexact Soft-Impute for Large-Scale Matrix and Tensor Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05487","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:d9c8d56db6b991aab96934d7780818bf963f9eff4b30540a5e438a491650c7e3","target":"record","created_at":"2026-05-18T00:07:18Z","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":"bf8a353b12da5c1f9887793838c16d3a17c3411c6d3558eae0a50a95a8ce7cb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-16T06:50:00Z","title_canon_sha256":"3a1fd6b5b8b3c42f5531ae19131f216e6f441442b98716a545d224ad395dbd7a"},"schema_version":"1.0","source":{"id":"1703.05487","kind":"arxiv","version":2}},"canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43dfadbcc8b8bfaa1bbef11f86019c0ba54afaad3a0a2d4cc769f1842aa8ddbb","first_computed_at":"2026-05-18T00:07:18.781047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:18.781047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ln3pzlpPgzZvI7ZTqSn+VaqgI6v7bhefPZ4m0pY1jdDyHA7E4idYFFRUU53utf1H0uER1Kxx5j7oos5Ej2xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:18.781737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9c8d56db6b991aab96934d7780818bf963f9eff4b30540a5e438a491650c7e3","sha256:f8b3d96ca6a7079fe347e2253f6bcfaa5ef9b00f36132c571bc9af24902a485a"],"state_sha256":"b6405dcae9216ca1c45df5dec082de2ed044498bf172510fa9b74c0d33a789dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLPtknIm5BK8hIMyBX/zCfRaPz7+hIsOP9JzI7mDPl92/ptjihdCBV1psQxOdtf5+7w2fn8uymcpgFiKAPxsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:53:29.188751Z","bundle_sha256":"2e3f00f415de902b3042fe0b2121f00fbaafa0e93371d8f11a3d1b80e03e7b59"}}