{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U7GTAEOPJMMEXQF2NAJYHRONBE","short_pith_number":"pith:U7GTAEOP","canonical_record":{"source":{"id":"1709.08308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T03:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"55d8e2534c8ac11afadd3619aa21403f32a49c5dd77d8537fe2f0649869938e8","abstract_canon_sha256":"33f35503d2a4d92112bd764c88aa4ae563f3c88adceb3f06f705ef991d6dfb41"},"schema_version":"1.0"},"canonical_sha256":"a7cd3011cf4b184bc0ba681383c5cd091273cefd522329e56b4437d6b7825b0d","source":{"kind":"arxiv","id":"1709.08308","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08308","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08308v2","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08308","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"U7GTAEOPJMME","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7GTAEOPJMMEXQF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7GTAEOP","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U7GTAEOPJMMEXQF2NAJYHRONBE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T03:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"55d8e2534c8ac11afadd3619aa21403f32a49c5dd77d8537fe2f0649869938e8","abstract_canon_sha256":"33f35503d2a4d92112bd764c88aa4ae563f3c88adceb3f06f705ef991d6dfb41"},"schema_version":"1.0"},"canonical_sha256":"a7cd3011cf4b184bc0ba681383c5cd091273cefd522329e56b4437d6b7825b0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.228660Z","signature_b64":"4UFdNN059QosM2KLdxGEj31ROnIOdK+Dn5ZVTiXfiHqbGrwCYwJQse/6lIrC86yq2SVPiacZiPu4+p4lxySmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cd3011cf4b184bc0ba681383c5cd091273cefd522329e56b4437d6b7825b0d","last_reissued_at":"2026-05-17T23:54:03.228254Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.228254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08308","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-17T23:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQMMH2Y1j5kjwxIVeNW1CxSRcF8mb0Xhnl/WhJBMl0RhlDD9mSprSJczU3I83GRtR4kcvArugggs4bOsg2B4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:39.968869Z"},"content_sha256":"f6094886d4895140e25b51324d4b920d88d89438022ce9caf379d47ee18d0b26","schema_version":"1.0","event_id":"sha256:f6094886d4895140e25b51324d4b920d88d89438022ce9caf379d47ee18d0b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U7GTAEOPJMMEXQF2NAJYHRONBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-tuned mirror descent schemes for smooth and nonsmooth high-dimensional stochastic optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arash Pourhabib, Farzad Yousefian, Nahidsadat Majlesinasab","submitted_at":"2017-09-25T03:57:53Z","abstract_excerpt":"We consider randomized block coordinate stochastic mirror descent (RBSMD) methods for solving high-dimensional stochastic optimization problems with strongly convex objective functions. Our goal is to develop RBSMD schemes that achieve a rate of convergence with a minimum constant factor with respect to the choice of the stepsize sequence. To this end, we consider both subgradient and gradient RBSMD methods addressing nonsmooth and smooth problems, respectively. For each scheme, (i) we develop self-tuned stepsize rules characterized in terms of problem parameters and algorithm settings; (ii) w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08308","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-17T23:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsCFdag3bBrd7u/vNjbezvCw9hMXbbI7zvc0YudDpa8jV+wzzE/m6xuXPVNkzBIUijhEzFen9LnI3SnFwjCdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:23:39.969546Z"},"content_sha256":"d54510a0417ae9647f795325a0be6b6dc47498f49a01e50b396eb9befe5abb17","schema_version":"1.0","event_id":"sha256:d54510a0417ae9647f795325a0be6b6dc47498f49a01e50b396eb9befe5abb17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/bundle.json","state_url":"https://pith.science/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/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-12T05:23:39Z","links":{"resolver":"https://pith.science/pith/U7GTAEOPJMMEXQF2NAJYHRONBE","bundle":"https://pith.science/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/bundle.json","state":"https://pith.science/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7GTAEOPJMMEXQF2NAJYHRONBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U7GTAEOPJMMEXQF2NAJYHRONBE","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":"33f35503d2a4d92112bd764c88aa4ae563f3c88adceb3f06f705ef991d6dfb41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T03:57:53Z","title_canon_sha256":"55d8e2534c8ac11afadd3619aa21403f32a49c5dd77d8537fe2f0649869938e8"},"schema_version":"1.0","source":{"id":"1709.08308","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08308","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08308v2","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08308","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"U7GTAEOPJMME","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7GTAEOPJMMEXQF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7GTAEOP","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d54510a0417ae9647f795325a0be6b6dc47498f49a01e50b396eb9befe5abb17","target":"graph","created_at":"2026-05-17T23:54:03Z","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 randomized block coordinate stochastic mirror descent (RBSMD) methods for solving high-dimensional stochastic optimization problems with strongly convex objective functions. Our goal is to develop RBSMD schemes that achieve a rate of convergence with a minimum constant factor with respect to the choice of the stepsize sequence. To this end, we consider both subgradient and gradient RBSMD methods addressing nonsmooth and smooth problems, respectively. For each scheme, (i) we develop self-tuned stepsize rules characterized in terms of problem parameters and algorithm settings; (ii) w","authors_text":"Arash Pourhabib, Farzad Yousefian, Nahidsadat Majlesinasab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T03:57:53Z","title":"Self-tuned mirror descent schemes for smooth and nonsmooth high-dimensional stochastic optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08308","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:f6094886d4895140e25b51324d4b920d88d89438022ce9caf379d47ee18d0b26","target":"record","created_at":"2026-05-17T23:54:03Z","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":"33f35503d2a4d92112bd764c88aa4ae563f3c88adceb3f06f705ef991d6dfb41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-25T03:57:53Z","title_canon_sha256":"55d8e2534c8ac11afadd3619aa21403f32a49c5dd77d8537fe2f0649869938e8"},"schema_version":"1.0","source":{"id":"1709.08308","kind":"arxiv","version":2}},"canonical_sha256":"a7cd3011cf4b184bc0ba681383c5cd091273cefd522329e56b4437d6b7825b0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7cd3011cf4b184bc0ba681383c5cd091273cefd522329e56b4437d6b7825b0d","first_computed_at":"2026-05-17T23:54:03.228254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:03.228254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UFdNN059QosM2KLdxGEj31ROnIOdK+Dn5ZVTiXfiHqbGrwCYwJQse/6lIrC86yq2SVPiacZiPu4+p4lxySmCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:03.228660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08308","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6094886d4895140e25b51324d4b920d88d89438022ce9caf379d47ee18d0b26","sha256:d54510a0417ae9647f795325a0be6b6dc47498f49a01e50b396eb9befe5abb17"],"state_sha256":"d016382721c72f6dc552d8886778ea31ae3d24cbd241da18ffe761308f2977f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Plz/WYHNmYXwQok3fUCu8ro1zNyinZgR0PO8Tb0C2EMoGX0d/BOu4/xXGkEaOH/HYLwQ1Xk6s+hMsj0EUf6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:23:39.972823Z","bundle_sha256":"57e180a9d7c868e3f2c77504bbb4c0802ca562fb70410e268521de18db0101b5"}}