{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DVXJ5MF5SCZRWWQEXVQ42JILSL","short_pith_number":"pith:DVXJ5MF5","canonical_record":{"source":{"id":"1106.1622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-08T19:07:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"edfa931ac1721af91cc51ef93bef4a031a05106e7ebf58fe8873c23de8cee16d","abstract_canon_sha256":"36b170e858ef498d7244367def8e3242f40d831af2ec9919cc818aa314fde02d"},"schema_version":"1.0"},"canonical_sha256":"1d6e9eb0bd90b31b5a04bd61cd250b92f7b2e0f83f5491291512f4123579c6f5","source":{"kind":"arxiv","id":"1106.1622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1622","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1622v1","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1622","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"DVXJ5MF5SCZR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DVXJ5MF5SCZRWWQE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DVXJ5MF5","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DVXJ5MF5SCZRWWQEXVQ42JILSL","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-08T19:07:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"edfa931ac1721af91cc51ef93bef4a031a05106e7ebf58fe8873c23de8cee16d","abstract_canon_sha256":"36b170e858ef498d7244367def8e3242f40d831af2ec9919cc818aa314fde02d"},"schema_version":"1.0"},"canonical_sha256":"1d6e9eb0bd90b31b5a04bd61cd250b92f7b2e0f83f5491291512f4123579c6f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:22.647585Z","signature_b64":"iyThcD7FLHjcF1/dLccbDZw/GhZ9o66urUmWvS71L6xGcx3Ow9U2Pm3425XfNtd2bCb+yeHqJLqofR+fxVjdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d6e9eb0bd90b31b5a04bd61cd250b92f7b2e0f83f5491291512f4123579c6f5","last_reissued_at":"2026-05-18T04:20:22.647056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:22.647056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1622","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-18T04:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgBKOwsMz5/7H+u3ob8IE/S2nZKR1z8LeaLOdQMXBOpLNX/scF0feuGy3gE0CydRp8ubNZmgZ+p87IU6vddtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:40:47.709136Z"},"content_sha256":"a851e6e38edea9b68a2821a402cf1daf397be8ed3850bd8c9a655e14bfc8df70","schema_version":"1.0","event_id":"sha256:a851e6e38edea9b68a2821a402cf1daf397be8ed3850bd8c9a655e14bfc8df70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DVXJ5MF5SCZRWWQEXVQ42JILSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Convex Minimization with a Low-Rank Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alon Gonen, Ohad Shamir, Shai Shalev-Shwartz","submitted_at":"2011-06-08T19:07:09Z","abstract_excerpt":"We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation guarantees. Each iteration of the algorithm involves (approximately) finding the left and right singular vectors corresponding to the largest singular value of a certain matrix, which can be calculated in linear time. This leads to an algorithm which can scale to large matrices arising in several applications such as matrix completion for collaborative filtering and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1622","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-18T04:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+kNdToOL+BpJh81wkFV8qU01PKZq8j6TxJGLtzrApLNIkNOcdZWNkZjDdvxt9E0G/JHUidCbdsJx9UeJ/VfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:40:47.709524Z"},"content_sha256":"f6aff24d9a375d8c1602bbb38cb2d0d20860bfe2e7636337db252d5aae055dcf","schema_version":"1.0","event_id":"sha256:f6aff24d9a375d8c1602bbb38cb2d0d20860bfe2e7636337db252d5aae055dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/bundle.json","state_url":"https://pith.science/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/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:40:47Z","links":{"resolver":"https://pith.science/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL","bundle":"https://pith.science/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/bundle.json","state":"https://pith.science/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVXJ5MF5SCZRWWQEXVQ42JILSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DVXJ5MF5SCZRWWQEXVQ42JILSL","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":"36b170e858ef498d7244367def8e3242f40d831af2ec9919cc818aa314fde02d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-08T19:07:09Z","title_canon_sha256":"edfa931ac1721af91cc51ef93bef4a031a05106e7ebf58fe8873c23de8cee16d"},"schema_version":"1.0","source":{"id":"1106.1622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1622","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1622v1","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1622","created_at":"2026-05-18T04:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"DVXJ5MF5SCZR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DVXJ5MF5SCZRWWQE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DVXJ5MF5","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:f6aff24d9a375d8c1602bbb38cb2d0d20860bfe2e7636337db252d5aae055dcf","target":"graph","created_at":"2026-05-18T04:20:22Z","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 address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation guarantees. Each iteration of the algorithm involves (approximately) finding the left and right singular vectors corresponding to the largest singular value of a certain matrix, which can be calculated in linear time. This leads to an algorithm which can scale to large matrices arising in several applications such as matrix completion for collaborative filtering and","authors_text":"Alon Gonen, Ohad Shamir, Shai Shalev-Shwartz","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-08T19:07:09Z","title":"Large-Scale Convex Minimization with a Low-Rank Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1622","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:a851e6e38edea9b68a2821a402cf1daf397be8ed3850bd8c9a655e14bfc8df70","target":"record","created_at":"2026-05-18T04:20:22Z","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":"36b170e858ef498d7244367def8e3242f40d831af2ec9919cc818aa314fde02d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-08T19:07:09Z","title_canon_sha256":"edfa931ac1721af91cc51ef93bef4a031a05106e7ebf58fe8873c23de8cee16d"},"schema_version":"1.0","source":{"id":"1106.1622","kind":"arxiv","version":1}},"canonical_sha256":"1d6e9eb0bd90b31b5a04bd61cd250b92f7b2e0f83f5491291512f4123579c6f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d6e9eb0bd90b31b5a04bd61cd250b92f7b2e0f83f5491291512f4123579c6f5","first_computed_at":"2026-05-18T04:20:22.647056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:22.647056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iyThcD7FLHjcF1/dLccbDZw/GhZ9o66urUmWvS71L6xGcx3Ow9U2Pm3425XfNtd2bCb+yeHqJLqofR+fxVjdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:22.647585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a851e6e38edea9b68a2821a402cf1daf397be8ed3850bd8c9a655e14bfc8df70","sha256:f6aff24d9a375d8c1602bbb38cb2d0d20860bfe2e7636337db252d5aae055dcf"],"state_sha256":"582c5ecb9a2cfaad69e6ead57f76a2690adc1bfc93057c1ac072593a7fd8ab5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56usTBGbFNJ6FrSu+Pjz/uGjV57iz6xVHXSehO7hUrLqhiEAIx5P5nfcFmXM5oNOkkEqr8NxQj+LaECLFP9DDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:40:47.711855Z","bundle_sha256":"4a58b46efdb14fef432520a50a27bd479e5d6f47908ed21601eebd7f8a9920a4"}}