{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B7SYOQL6UXRW6BSC73VFYJTNPF","short_pith_number":"pith:B7SYOQL6","schema_version":"1.0","canonical_sha256":"0fe587417ea5e36f0642feea5c266d7942934f8f06e2a0a4acaebe3f43f8f4fb","source":{"kind":"arxiv","id":"1602.00594","version":8},"attestation_state":"computed","paper":{"title":"Randomization and sparsity in huge-scale optimization on the Mirror Descent example","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Gornov, Anton Anikin","submitted_at":"2016-02-01T17:05:12Z","abstract_excerpt":"We investigate different randomizations for mirror descent method. We try to propose such a randomization that allows us to use sparsity of the problem as much as it possible. In the paper one can also find a generalization of randomizaed mirror descent for the convex optimization problems with functional restrictions."},"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":"1602.00594","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-01T17:05:12Z","cross_cats_sorted":[],"title_canon_sha256":"70fed9593197f2f27469f2c8892c47afe495ea9e5b6cf29e3f38f909e5bc76b5","abstract_canon_sha256":"52c156f2c5ebaab3b6ad570f44886403a4ba9444b74b296a8b7a424dd0df5d02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:28.586464Z","signature_b64":"rSKjdLTA5nBc55zxsH95WCG9IByYZ79SJrZV+Tww9aMq9MxVyfKbxXhhwGtf1BgCkTbNVQXzFm2PIK40D4nBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe587417ea5e36f0642feea5c266d7942934f8f06e2a0a4acaebe3f43f8f4fb","last_reissued_at":"2026-05-18T00:55:28.585697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:28.585697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomization and sparsity in huge-scale optimization on the Mirror Descent example","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Gornov, Anton Anikin","submitted_at":"2016-02-01T17:05:12Z","abstract_excerpt":"We investigate different randomizations for mirror descent method. We try to propose such a randomization that allows us to use sparsity of the problem as much as it possible. In the paper one can also find a generalization of randomizaed mirror descent for the convex optimization problems with functional restrictions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00594","kind":"arxiv","version":8},"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":"1602.00594","created_at":"2026-05-18T00:55:28.585813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00594v8","created_at":"2026-05-18T00:55:28.585813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00594","created_at":"2026-05-18T00:55:28.585813+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7SYOQL6UXRW","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7SYOQL6UXRW6BSC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7SYOQL6","created_at":"2026-05-18T12:30:07.202191+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/B7SYOQL6UXRW6BSC73VFYJTNPF","json":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF.json","graph_json":"https://pith.science/api/pith-number/B7SYOQL6UXRW6BSC73VFYJTNPF/graph.json","events_json":"https://pith.science/api/pith-number/B7SYOQL6UXRW6BSC73VFYJTNPF/events.json","paper":"https://pith.science/paper/B7SYOQL6"},"agent_actions":{"view_html":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF","download_json":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF.json","view_paper":"https://pith.science/paper/B7SYOQL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00594&json=true","fetch_graph":"https://pith.science/api/pith-number/B7SYOQL6UXRW6BSC73VFYJTNPF/graph.json","fetch_events":"https://pith.science/api/pith-number/B7SYOQL6UXRW6BSC73VFYJTNPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF/action/storage_attestation","attest_author":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF/action/author_attestation","sign_citation":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF/action/citation_signature","submit_replication":"https://pith.science/pith/B7SYOQL6UXRW6BSC73VFYJTNPF/action/replication_record"}},"created_at":"2026-05-18T00:55:28.585813+00:00","updated_at":"2026-05-18T00:55:28.585813+00:00"}