{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EIBKJMCT2F4CNJJZN344BTOSCK","short_pith_number":"pith:EIBKJMCT","canonical_record":{"source":{"id":"1605.06892","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T04:21:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"155d6ee5907963c4cf078755017dfc1a3fa61ab8dad9ffee621eacf9ceec4633","abstract_canon_sha256":"623104e7d233a00209ed07528791e5504ce835515c649118b8f099a7d4c4b074"},"schema_version":"1.0"},"canonical_sha256":"2202a4b053d17826a5396ef9c0cdd212b027623689c98217270b8fa5213474bf","source":{"kind":"arxiv","id":"1605.06892","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06892","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06892v6","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06892","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"EIBKJMCT2F4C","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIBKJMCT2F4CNJJZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIBKJMCT","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EIBKJMCT2F4CNJJZN344BTOSCK","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06892","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T04:21:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"155d6ee5907963c4cf078755017dfc1a3fa61ab8dad9ffee621eacf9ceec4633","abstract_canon_sha256":"623104e7d233a00209ed07528791e5504ce835515c649118b8f099a7d4c4b074"},"schema_version":"1.0"},"canonical_sha256":"2202a4b053d17826a5396ef9c0cdd212b027623689c98217270b8fa5213474bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.991039Z","signature_b64":"PbdaPWjRobh+3waVdPtMLUU63Uw81kBxROg/fZOAHgfUmcW1J/8jbsWq8wcbQGJ4ioxx9wtORVqMNgipW7AEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2202a4b053d17826a5396ef9c0cdd212b027623689c98217270b8fa5213474bf","last_reissued_at":"2026-05-17T23:57:15.990614Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.990614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06892","source_version":6,"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-17T23:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AW9dUKTY+KKD6SenOQYdhtlFv4uhaTufwBJGYGfnbIUgJYfX7zKEYnIBRCjzILEoX3srl+Kvw/gTlka123n4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:48:08.024813Z"},"content_sha256":"5e410d995dc1a2a1819df8b989a4287a255a4bb077d6e2b79dbb35c6f315d6ca","schema_version":"1.0","event_id":"sha256:5e410d995dc1a2a1819df8b989a4287a255a4bb077d6e2b79dbb35c6f315d6ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EIBKJMCT2F4CNJJZN344BTOSCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Randomized Mirror Descent Algorithms For Composite Non-strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Canyi Lu, Cuong V. Nguyen, Huan Xu, Jiashi Feng, Le Thi Khanh Hien","submitted_at":"2016-05-23T04:21:07Z","abstract_excerpt":"We consider the problem of minimizing the sum of an average function of a large number of smooth convex components and a general, possibly non-differentiable, convex function. Although many methods have been proposed to solve this problem with the assumption that the sum is strongly convex, few methods support the non-strongly convex case. Adding a small quadratic regularization is a common devise used to tackle non-strongly convex problems; however, it may cause loss of sparsity of solutions or weaken the performance of the algorithms. Avoiding this devise, we propose an accelerated randomize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06892","kind":"arxiv","version":6},"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-17T23:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbTpnnezl9Hmfx8lujCkLMvpfdkY0gPT9DtchI0NVUOvwTaWZh7yZdUAq3yqTzW2fopVHuqhviLG36PwWNo4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:48:08.025186Z"},"content_sha256":"1ce23fed7ea6e72a0f9da21cfcbdc49cf4a60445f3599d71f1fc88acf3f2bbd6","schema_version":"1.0","event_id":"sha256:1ce23fed7ea6e72a0f9da21cfcbdc49cf4a60445f3599d71f1fc88acf3f2bbd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIBKJMCT2F4CNJJZN344BTOSCK/bundle.json","state_url":"https://pith.science/pith/EIBKJMCT2F4CNJJZN344BTOSCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIBKJMCT2F4CNJJZN344BTOSCK/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-30T08:48:08Z","links":{"resolver":"https://pith.science/pith/EIBKJMCT2F4CNJJZN344BTOSCK","bundle":"https://pith.science/pith/EIBKJMCT2F4CNJJZN344BTOSCK/bundle.json","state":"https://pith.science/pith/EIBKJMCT2F4CNJJZN344BTOSCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIBKJMCT2F4CNJJZN344BTOSCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EIBKJMCT2F4CNJJZN344BTOSCK","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":"623104e7d233a00209ed07528791e5504ce835515c649118b8f099a7d4c4b074","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T04:21:07Z","title_canon_sha256":"155d6ee5907963c4cf078755017dfc1a3fa61ab8dad9ffee621eacf9ceec4633"},"schema_version":"1.0","source":{"id":"1605.06892","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06892","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06892v6","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06892","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"EIBKJMCT2F4C","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIBKJMCT2F4CNJJZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIBKJMCT","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1ce23fed7ea6e72a0f9da21cfcbdc49cf4a60445f3599d71f1fc88acf3f2bbd6","target":"graph","created_at":"2026-05-17T23:57:15Z","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 consider the problem of minimizing the sum of an average function of a large number of smooth convex components and a general, possibly non-differentiable, convex function. Although many methods have been proposed to solve this problem with the assumption that the sum is strongly convex, few methods support the non-strongly convex case. Adding a small quadratic regularization is a common devise used to tackle non-strongly convex problems; however, it may cause loss of sparsity of solutions or weaken the performance of the algorithms. Avoiding this devise, we propose an accelerated randomize","authors_text":"Canyi Lu, Cuong V. Nguyen, Huan Xu, Jiashi Feng, Le Thi Khanh Hien","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T04:21:07Z","title":"Accelerated Randomized Mirror Descent Algorithms For Composite Non-strongly Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06892","kind":"arxiv","version":6},"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:5e410d995dc1a2a1819df8b989a4287a255a4bb077d6e2b79dbb35c6f315d6ca","target":"record","created_at":"2026-05-17T23:57:15Z","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":"623104e7d233a00209ed07528791e5504ce835515c649118b8f099a7d4c4b074","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T04:21:07Z","title_canon_sha256":"155d6ee5907963c4cf078755017dfc1a3fa61ab8dad9ffee621eacf9ceec4633"},"schema_version":"1.0","source":{"id":"1605.06892","kind":"arxiv","version":6}},"canonical_sha256":"2202a4b053d17826a5396ef9c0cdd212b027623689c98217270b8fa5213474bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2202a4b053d17826a5396ef9c0cdd212b027623689c98217270b8fa5213474bf","first_computed_at":"2026-05-17T23:57:15.990614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:15.990614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PbdaPWjRobh+3waVdPtMLUU63Uw81kBxROg/fZOAHgfUmcW1J/8jbsWq8wcbQGJ4ioxx9wtORVqMNgipW7AEBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:15.991039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06892","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e410d995dc1a2a1819df8b989a4287a255a4bb077d6e2b79dbb35c6f315d6ca","sha256:1ce23fed7ea6e72a0f9da21cfcbdc49cf4a60445f3599d71f1fc88acf3f2bbd6"],"state_sha256":"37bfbe8ec5df38644ea1259fcd784ae9b235c1006067dee45ec104f5a2685709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnw80viUsJn9kuoqoHKxmY8CORX5Whk6dP9mQ5d2uazURL5A2LCinqlRqmDKS11rOimcenq8lk8GH1+ya1iqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:48:08.027430Z","bundle_sha256":"76799352b36ba5c0e043aec0572907a39a168ccb06162240ec3baeaaae919c42"}}