{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XOD6V2W4A6BRXWCSQEC63PHDVR","short_pith_number":"pith:XOD6V2W4","canonical_record":{"source":{"id":"1201.5283","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-24T04:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"39714dfc493ca1c0814ee867735258b0aed039dcd9d3fa607a707c97cb5d2e90","abstract_canon_sha256":"672b61d61afd030fb0c6fadb5f4acb58dcd17380fd1cfb7b8d1f07ff49293d39"},"schema_version":"1.0"},"canonical_sha256":"bb87eaeadc07831bd8528105edbce3ac64406829392a33f276f0067f49f5d21c","source":{"kind":"arxiv","id":"1201.5283","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5283","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5283v5","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5283","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"XOD6V2W4A6BR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XOD6V2W4A6BRXWCS","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XOD6V2W4","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XOD6V2W4A6BRXWCSQEC63PHDVR","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5283","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-24T04:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"39714dfc493ca1c0814ee867735258b0aed039dcd9d3fa607a707c97cb5d2e90","abstract_canon_sha256":"672b61d61afd030fb0c6fadb5f4acb58dcd17380fd1cfb7b8d1f07ff49293d39"},"schema_version":"1.0"},"canonical_sha256":"bb87eaeadc07831bd8528105edbce3ac64406829392a33f276f0067f49f5d21c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.387043Z","signature_b64":"NIe44vk5Z4j3+DtOwHOENebV91jWkbY/dsFA9oDildkcIJuGh+PtDYYJni6FnwmJSL1Ta2mUucyVfWjkE9r3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb87eaeadc07831bd8528105edbce3ac64406829392a33f276f0067f49f5d21c","last_reissued_at":"2026-05-18T03:17:34.386361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.386361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5283","source_version":5,"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:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C83YuZSJrN4RPNVQr25TdUjx9Gw9s9lGXhGkGgw/Um1vYjFip4kJ9C+N9bVSdqOuq4IBHdy2lsjIB9N48sAoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:36.927504Z"},"content_sha256":"a7620e995aae611974fd5ee6129be510db2f2450cee14b37119a6d688073f835","schema_version":"1.0","event_id":"sha256:a7620e995aae611974fd5ee6129be510db2f2450cee14b37119a6d688073f835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XOD6V2W4A6BRXWCSQEC63PHDVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Primal-Dual Prox Method for Non-Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Shenghuo Zhu, Tianbao Yang","submitted_at":"2012-01-24T04:09:54Z","abstract_excerpt":"We study the non-smooth optimization problems in machine learning, where both the loss function and the regularizer are non-smooth functions. Previous studies on efficient empirical loss minimization assume either a smooth loss function or a strongly convex regularizer, making them unsuitable for non-smooth optimization. We develop a simple yet efficient method for a family of non-smooth optimization problems where the dual form of the loss function is bilinear in primal and dual variables. We cast a non-smooth optimization problem into a minimax optimization problem, and develop a primal dual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5283","kind":"arxiv","version":5},"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:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dFtLZgmzGvenu82124WeismRy3GsIafpZIS4lN86fbQK4iIDR9K6UP010lCShMcpH4JmzOu7qEtHt6X9BMTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:36.927850Z"},"content_sha256":"354971f3f071915bdf5b591f9084dff2b736228cf10319cb16cb9ccc4cf3b64f","schema_version":"1.0","event_id":"sha256:354971f3f071915bdf5b591f9084dff2b736228cf10319cb16cb9ccc4cf3b64f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/bundle.json","state_url":"https://pith.science/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/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-06T16:34:36Z","links":{"resolver":"https://pith.science/pith/XOD6V2W4A6BRXWCSQEC63PHDVR","bundle":"https://pith.science/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/bundle.json","state":"https://pith.science/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOD6V2W4A6BRXWCSQEC63PHDVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XOD6V2W4A6BRXWCSQEC63PHDVR","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":"672b61d61afd030fb0c6fadb5f4acb58dcd17380fd1cfb7b8d1f07ff49293d39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-24T04:09:54Z","title_canon_sha256":"39714dfc493ca1c0814ee867735258b0aed039dcd9d3fa607a707c97cb5d2e90"},"schema_version":"1.0","source":{"id":"1201.5283","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5283","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5283v5","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5283","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"XOD6V2W4A6BR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XOD6V2W4A6BRXWCS","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XOD6V2W4","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:354971f3f071915bdf5b591f9084dff2b736228cf10319cb16cb9ccc4cf3b64f","target":"graph","created_at":"2026-05-18T03:17:34Z","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 study the non-smooth optimization problems in machine learning, where both the loss function and the regularizer are non-smooth functions. Previous studies on efficient empirical loss minimization assume either a smooth loss function or a strongly convex regularizer, making them unsuitable for non-smooth optimization. We develop a simple yet efficient method for a family of non-smooth optimization problems where the dual form of the loss function is bilinear in primal and dual variables. We cast a non-smooth optimization problem into a minimax optimization problem, and develop a primal dual","authors_text":"Mehrdad Mahdavi, Rong Jin, Shenghuo Zhu, Tianbao Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-24T04:09:54Z","title":"An Efficient Primal-Dual Prox Method for Non-Smooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5283","kind":"arxiv","version":5},"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:a7620e995aae611974fd5ee6129be510db2f2450cee14b37119a6d688073f835","target":"record","created_at":"2026-05-18T03:17:34Z","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":"672b61d61afd030fb0c6fadb5f4acb58dcd17380fd1cfb7b8d1f07ff49293d39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-24T04:09:54Z","title_canon_sha256":"39714dfc493ca1c0814ee867735258b0aed039dcd9d3fa607a707c97cb5d2e90"},"schema_version":"1.0","source":{"id":"1201.5283","kind":"arxiv","version":5}},"canonical_sha256":"bb87eaeadc07831bd8528105edbce3ac64406829392a33f276f0067f49f5d21c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb87eaeadc07831bd8528105edbce3ac64406829392a33f276f0067f49f5d21c","first_computed_at":"2026-05-18T03:17:34.386361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:34.386361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIe44vk5Z4j3+DtOwHOENebV91jWkbY/dsFA9oDildkcIJuGh+PtDYYJni6FnwmJSL1Ta2mUucyVfWjkE9r3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:34.387043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5283","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7620e995aae611974fd5ee6129be510db2f2450cee14b37119a6d688073f835","sha256:354971f3f071915bdf5b591f9084dff2b736228cf10319cb16cb9ccc4cf3b64f"],"state_sha256":"f67de4729884ab516d04388c4f8347a0f296ddf4f3c6b56a57aa933c8c408491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LCrFEQCqwQvkMP97vptH0YGpiJM2Rp1lUwj9AakVEAF30sxke038VHLsoS09cCNPZafOG4obqDhIpHkLgAPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:34:36.930299Z","bundle_sha256":"c66006fc2ef4f80eb32108dd3ed27b3f6d2dcd62f9be58e479bae9ac48a949de"}}