{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5GVHHJUD3A35KBNTAVYVER4OSR","short_pith_number":"pith:5GVHHJUD","canonical_record":{"source":{"id":"1206.6384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"713e3e5e14f5a89c1dcd016c24aa517f36b3654d328fa8cd9dd6b20d382768c9","abstract_canon_sha256":"04e3e62348b163f5aedcdc0368849b5eae51c51addac04e8df967b4c1d4cc538"},"schema_version":"1.0"},"canonical_sha256":"e9aa73a683d837d505b3057152478e946d0c95cb9dbb2f6617557e81e81bf0c5","source":{"kind":"arxiv","id":"1206.6384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6384","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6384v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6384","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"5GVHHJUD3A35","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5GVHHJUD3A35KBNT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5GVHHJUD","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5GVHHJUD3A35KBNTAVYVER4OSR","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"713e3e5e14f5a89c1dcd016c24aa517f36b3654d328fa8cd9dd6b20d382768c9","abstract_canon_sha256":"04e3e62348b163f5aedcdc0368849b5eae51c51addac04e8df967b4c1d4cc538"},"schema_version":"1.0"},"canonical_sha256":"e9aa73a683d837d505b3057152478e946d0c95cb9dbb2f6617557e81e81bf0c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.557833Z","signature_b64":"AppUQg8ztGHBbSlBKHJ3dpAAh1xjzRR0sUDXu77tfowWtKExRWYYbd9Q9vUo/EjBLNS08ehkDGEQW2DErfhdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9aa73a683d837d505b3057152478e946d0c95cb9dbb2f6617557e81e81bf0c5","last_reissued_at":"2026-05-18T03:52:14.556970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.556970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6384","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/3XnVLiXpYIdHHHOsGl4XI/C+1zr9uUbYEpJX2/x+k0jlLM+emxI+q70RxAV5/hwIZe34emEumAhHxc+66FAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:04.092559Z"},"content_sha256":"c88c84554f30efb9049c84c3879f28e12a151e29a7a931d340389ccad30e25ea","schema_version":"1.0","event_id":"sha256:c88c84554f30efb9049c84c3879f28e12a151e29a7a931d340389ccad30e25ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5GVHHJUD3A35KBNTAVYVER4OSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haim Avron (IBM T.J. Watson Research Center), Satyen Kale (IBM T.J. Watson Research Center), Shiva Kasiviswanathan (IBM T.J. Watson Research Center), Vikas Sindhwani (IBM T.J. Watson Research Center)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic subgradients with efficient incremental SVD updates, made possible by highly optimized and parallelizable dense linear algebra operations on small matrices. Our practical algorithms always maintain a low-rank factorization of iterates that can be conveniently held in memory and efficiently multiplied to generate predictions in matrix completion settings. Empirical com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6384","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42RyHQs9shFmp5gpdc5T2ADtrIG7/4lFkrc+my/YCBHj8xomXfBuX8CRdMT1Nj36Ass5MKctNEYISwtXI6USAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:04.093283Z"},"content_sha256":"42b76625f286c5f2578e9827dc94f63daa4cd10e95791a850b85f115674b8451","schema_version":"1.0","event_id":"sha256:42b76625f286c5f2578e9827dc94f63daa4cd10e95791a850b85f115674b8451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GVHHJUD3A35KBNTAVYVER4OSR/bundle.json","state_url":"https://pith.science/pith/5GVHHJUD3A35KBNTAVYVER4OSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GVHHJUD3A35KBNTAVYVER4OSR/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-05-26T17:42:04Z","links":{"resolver":"https://pith.science/pith/5GVHHJUD3A35KBNTAVYVER4OSR","bundle":"https://pith.science/pith/5GVHHJUD3A35KBNTAVYVER4OSR/bundle.json","state":"https://pith.science/pith/5GVHHJUD3A35KBNTAVYVER4OSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GVHHJUD3A35KBNTAVYVER4OSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5GVHHJUD3A35KBNTAVYVER4OSR","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":"04e3e62348b163f5aedcdc0368849b5eae51c51addac04e8df967b4c1d4cc538","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"713e3e5e14f5a89c1dcd016c24aa517f36b3654d328fa8cd9dd6b20d382768c9"},"schema_version":"1.0","source":{"id":"1206.6384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6384","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6384v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6384","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"5GVHHJUD3A35","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5GVHHJUD3A35KBNT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5GVHHJUD","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:42b76625f286c5f2578e9827dc94f63daa4cd10e95791a850b85f115674b8451","target":"graph","created_at":"2026-05-18T03:52:14Z","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 describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic subgradients with efficient incremental SVD updates, made possible by highly optimized and parallelizable dense linear algebra operations on small matrices. Our practical algorithms always maintain a low-rank factorization of iterates that can be conveniently held in memory and efficiently multiplied to generate predictions in matrix completion settings. Empirical com","authors_text":"Haim Avron (IBM T.J. Watson Research Center), Satyen Kale (IBM T.J. Watson Research Center), Shiva Kasiviswanathan (IBM T.J. Watson Research Center), Vikas Sindhwani (IBM T.J. Watson Research Center)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6384","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:c88c84554f30efb9049c84c3879f28e12a151e29a7a931d340389ccad30e25ea","target":"record","created_at":"2026-05-18T03:52:14Z","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":"04e3e62348b163f5aedcdc0368849b5eae51c51addac04e8df967b4c1d4cc538","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"713e3e5e14f5a89c1dcd016c24aa517f36b3654d328fa8cd9dd6b20d382768c9"},"schema_version":"1.0","source":{"id":"1206.6384","kind":"arxiv","version":1}},"canonical_sha256":"e9aa73a683d837d505b3057152478e946d0c95cb9dbb2f6617557e81e81bf0c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9aa73a683d837d505b3057152478e946d0c95cb9dbb2f6617557e81e81bf0c5","first_computed_at":"2026-05-18T03:52:14.556970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.556970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AppUQg8ztGHBbSlBKHJ3dpAAh1xjzRR0sUDXu77tfowWtKExRWYYbd9Q9vUo/EjBLNS08ehkDGEQW2DErfhdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.557833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88c84554f30efb9049c84c3879f28e12a151e29a7a931d340389ccad30e25ea","sha256:42b76625f286c5f2578e9827dc94f63daa4cd10e95791a850b85f115674b8451"],"state_sha256":"27c88ed39b252c65db13f450119b95b3215ef9c580b13247caf9dde64f0a94d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGRwe3nY9okTRaPjPE6+guAYQOvG7w00BtBpzbAHke6IccYDDutCLoUiOu/RY87XD7vCi198nPBpMO+pDQu0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:42:04.097267Z","bundle_sha256":"c6a7480564877b5b66bc447cf9b1ce7f898794aa656e1bb1b045004b6ce79d6e"}}