{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VTUDV4H5NQ35GYT3YDC233KUPK","short_pith_number":"pith:VTUDV4H5","schema_version":"1.0","canonical_sha256":"ace83af0fd6c37d3627bc0c5aded547a8da385ed82acf5718379ae65d5e1bdff","source":{"kind":"arxiv","id":"1309.2249","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cong D. Dang, Guanghui Lan","submitted_at":"2013-09-09T18:33:15Z","abstract_excerpt":"In this paper, we present a new stochastic algorithm, namely the stochastic block mirror descent (SBMD) method for solving large-scale nonsmooth and stochastic optimization problems. The basic idea of this algorithm is to incorporate the block-coordinate decomposition and an incremental block averaging scheme into the classic (stochastic) mirror-descent method, in order to significantly reduce the cost per iteration of the latter algorithm. We establish the rate of convergence of the SBMD method along with its associated large-deviation results for solving general nonsmooth and stochastic opti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.2249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-09T18:33:15Z","cross_cats_sorted":[],"title_canon_sha256":"0cbab00c3acedb2454db2c0ce73267d91045e0f2945d042df74b2622b623ac5a","abstract_canon_sha256":"6c1d6d5a19b07531bef0c4782c466ac01b91a32310d770cc098bb578ca5f163d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:46.845892Z","signature_b64":"BOMDUPsrIOY2YBgcUCVq9SAsFFWjwZoDiBE+tQdwvbWeVGuuWJEpmAgopfY8gsx2kBgIB8T8dfuW2/MqkCCIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace83af0fd6c37d3627bc0c5aded547a8da385ed82acf5718379ae65d5e1bdff","last_reissued_at":"2026-05-18T03:13:46.845361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:46.845361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cong D. Dang, Guanghui Lan","submitted_at":"2013-09-09T18:33:15Z","abstract_excerpt":"In this paper, we present a new stochastic algorithm, namely the stochastic block mirror descent (SBMD) method for solving large-scale nonsmooth and stochastic optimization problems. The basic idea of this algorithm is to incorporate the block-coordinate decomposition and an incremental block averaging scheme into the classic (stochastic) mirror-descent method, in order to significantly reduce the cost per iteration of the latter algorithm. We establish the rate of convergence of the SBMD method along with its associated large-deviation results for solving general nonsmooth and stochastic opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2249","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.2249","created_at":"2026-05-18T03:13:46.845442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2249v1","created_at":"2026-05-18T03:13:46.845442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2249","created_at":"2026-05-18T03:13:46.845442+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTUDV4H5NQ35","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTUDV4H5NQ35GYT3","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTUDV4H5","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK","json":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK.json","graph_json":"https://pith.science/api/pith-number/VTUDV4H5NQ35GYT3YDC233KUPK/graph.json","events_json":"https://pith.science/api/pith-number/VTUDV4H5NQ35GYT3YDC233KUPK/events.json","paper":"https://pith.science/paper/VTUDV4H5"},"agent_actions":{"view_html":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK","download_json":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK.json","view_paper":"https://pith.science/paper/VTUDV4H5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2249&json=true","fetch_graph":"https://pith.science/api/pith-number/VTUDV4H5NQ35GYT3YDC233KUPK/graph.json","fetch_events":"https://pith.science/api/pith-number/VTUDV4H5NQ35GYT3YDC233KUPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK/action/storage_attestation","attest_author":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK/action/author_attestation","sign_citation":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK/action/citation_signature","submit_replication":"https://pith.science/pith/VTUDV4H5NQ35GYT3YDC233KUPK/action/replication_record"}},"created_at":"2026-05-18T03:13:46.845442+00:00","updated_at":"2026-05-18T03:13:46.845442+00:00"}