{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4WQWWVFQ7JRIECRJ3YBI5OHPCE","short_pith_number":"pith:4WQWWVFQ","canonical_record":{"source":{"id":"1206.2372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-11T20:22:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f05727467c230d96bcab2d5e088a27759c2bef56695322c60e618300089ee194","abstract_canon_sha256":"a472d04e62bb227b337584a03fd6401da9dd4d043069b563b392659c8eae0aa2"},"schema_version":"1.0"},"canonical_sha256":"e5a16b54b0fa62820a29de028eb8ef11024fe4a9fdf6044e46f2af970f024667","source":{"kind":"arxiv","id":"1206.2372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2372","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2372v2","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2372","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"4WQWWVFQ7JRI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4WQWWVFQ7JRIECRJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4WQWWVFQ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4WQWWVFQ7JRIECRJ3YBI5OHPCE","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-11T20:22:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f05727467c230d96bcab2d5e088a27759c2bef56695322c60e618300089ee194","abstract_canon_sha256":"a472d04e62bb227b337584a03fd6401da9dd4d043069b563b392659c8eae0aa2"},"schema_version":"1.0"},"canonical_sha256":"e5a16b54b0fa62820a29de028eb8ef11024fe4a9fdf6044e46f2af970f024667","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:36.194511Z","signature_b64":"X5882xd1SgO3tQgr5xUp6mrE+eIAFSLe2Sme/GHLMZFts3zfYIG92ixIZE+dRgILfbmWOfMehPr0yEJkowA3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a16b54b0fa62820a29de028eb8ef11024fe4a9fdf6044e46f2af970f024667","last_reissued_at":"2026-05-18T03:40:36.193636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:36.193636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2372","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-18T03:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Wz2QapTQMLAWxNi8P84f9rWOEqhvbe7pPvz6fUgKcnGGMOo+Xbl+AQVwlWRv8MwHW3Q8NlDaDQMAtIqoxUIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:33:05.436035Z"},"content_sha256":"b3e35b779b7330f348a304ce1776203f8c997608b3ad6c75c46386b3b99ce561","schema_version":"1.0","event_id":"sha256:b3e35b779b7330f348a304ce1776203f8c997608b3ad6c75c46386b3b99ce561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4WQWWVFQ7JRIECRJ3YBI5OHPCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PRISMA: PRoximal Iterative SMoothing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andreas Argyriou, Francesco Orabona, Nathan Srebro","submitted_at":"2012-06-11T20:22:43Z","abstract_excerpt":"Motivated by learning problems including max-norm regularized matrix completion and clustering, robust PCA and sparse inverse covariance selection, we propose a novel optimization algorithm for minimizing a convex objective which decomposes into three parts: a smooth part, a simple non-smooth Lipschitz part, and a simple non-smooth non-Lipschitz part. We use a time variant smoothing strategy that allows us to obtain a guarantee that does not depend on knowing in advance the total number of iterations nor a bound on the domain."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2372","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-18T03:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKDquHws04wSmfpQIPKZ4DaOOBD6Ywv3L+at8+M7MKzD9R9OpFBj6QsAN30pcgobo3c1aFVCaDyyd3XISAp3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:33:05.436386Z"},"content_sha256":"b4b5f169102e3e61c3588282fde50fd9dbc6bb69914bb01a9f81fd8961aad1bc","schema_version":"1.0","event_id":"sha256:b4b5f169102e3e61c3588282fde50fd9dbc6bb69914bb01a9f81fd8961aad1bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/bundle.json","state_url":"https://pith.science/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/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-02T11:33:05Z","links":{"resolver":"https://pith.science/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE","bundle":"https://pith.science/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/bundle.json","state":"https://pith.science/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WQWWVFQ7JRIECRJ3YBI5OHPCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4WQWWVFQ7JRIECRJ3YBI5OHPCE","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":"a472d04e62bb227b337584a03fd6401da9dd4d043069b563b392659c8eae0aa2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-11T20:22:43Z","title_canon_sha256":"f05727467c230d96bcab2d5e088a27759c2bef56695322c60e618300089ee194"},"schema_version":"1.0","source":{"id":"1206.2372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2372","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2372v2","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2372","created_at":"2026-05-18T03:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"4WQWWVFQ7JRI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4WQWWVFQ7JRIECRJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4WQWWVFQ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b4b5f169102e3e61c3588282fde50fd9dbc6bb69914bb01a9f81fd8961aad1bc","target":"graph","created_at":"2026-05-18T03:40:36Z","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":"Motivated by learning problems including max-norm regularized matrix completion and clustering, robust PCA and sparse inverse covariance selection, we propose a novel optimization algorithm for minimizing a convex objective which decomposes into three parts: a smooth part, a simple non-smooth Lipschitz part, and a simple non-smooth non-Lipschitz part. We use a time variant smoothing strategy that allows us to obtain a guarantee that does not depend on knowing in advance the total number of iterations nor a bound on the domain.","authors_text":"Andreas Argyriou, Francesco Orabona, Nathan Srebro","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-11T20:22:43Z","title":"PRISMA: PRoximal Iterative SMoothing Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2372","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:b3e35b779b7330f348a304ce1776203f8c997608b3ad6c75c46386b3b99ce561","target":"record","created_at":"2026-05-18T03:40:36Z","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":"a472d04e62bb227b337584a03fd6401da9dd4d043069b563b392659c8eae0aa2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-11T20:22:43Z","title_canon_sha256":"f05727467c230d96bcab2d5e088a27759c2bef56695322c60e618300089ee194"},"schema_version":"1.0","source":{"id":"1206.2372","kind":"arxiv","version":2}},"canonical_sha256":"e5a16b54b0fa62820a29de028eb8ef11024fe4a9fdf6044e46f2af970f024667","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5a16b54b0fa62820a29de028eb8ef11024fe4a9fdf6044e46f2af970f024667","first_computed_at":"2026-05-18T03:40:36.193636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:36.193636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5882xd1SgO3tQgr5xUp6mrE+eIAFSLe2Sme/GHLMZFts3zfYIG92ixIZE+dRgILfbmWOfMehPr0yEJkowA3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:36.194511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e35b779b7330f348a304ce1776203f8c997608b3ad6c75c46386b3b99ce561","sha256:b4b5f169102e3e61c3588282fde50fd9dbc6bb69914bb01a9f81fd8961aad1bc"],"state_sha256":"cb277adbe56ec9f65cd70d1ac2284f020b646b1abf2a0726dbdda709d5d1b227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfi1WqF128kw+pdYr+ITm4J7NgHDHho+gpVU530xhF6dHH2PBmaq6pjZ8YhYsydHGboZFn/KQL4He67Bb03bCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:33:05.438402Z","bundle_sha256":"d7592eab7ec5b882202cdc9a6761630765cadc30f7a7cb59eddbc3e71832789d"}}