{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W6EHEEWS3CQI3ZBRVFNMFDRQBB","short_pith_number":"pith:W6EHEEWS","schema_version":"1.0","canonical_sha256":"b7887212d2d8a08de431a95ac28e3008542e740d979ae5c3315d9b57dd3e0ad3","source":{"kind":"arxiv","id":"1604.08194","version":11},"attestation_state":"computed","paper":{"title":"Primal-dual mirror descent for the stochastic programming problems with functional constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasia Bayandina, Evgenia Gasnikova, Sergey Matsievsky","submitted_at":"2016-04-27T19:35:19Z","abstract_excerpt":"We propose primal-dual stochastic mirror descent for the convex optimization problems with functional constraints. We obtain the rate of convergence in terms of probability of large deviations."},"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":"1604.08194","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-27T19:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"b6195a8eadc7c8df20b14bac93c44b6e17d2ac29c755aa64d1217dda02325e6f","abstract_canon_sha256":"5517e8b62bb19687bf61056e96cf8146d261d588d88bc03bb13ed8fbb363cff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:13.522671Z","signature_b64":"Wd8EGoSc+P/lU1jKLRVVZuJ9A/kgVzlJzzCLtg+OGjftsv6GnfErFaVwF6cVcehXa4ft7PcBWs1MNvfA4DE+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7887212d2d8a08de431a95ac28e3008542e740d979ae5c3315d9b57dd3e0ad3","last_reissued_at":"2026-05-18T00:39:13.522103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:13.522103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal-dual mirror descent for the stochastic programming problems with functional constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasia Bayandina, Evgenia Gasnikova, Sergey Matsievsky","submitted_at":"2016-04-27T19:35:19Z","abstract_excerpt":"We propose primal-dual stochastic mirror descent for the convex optimization problems with functional constraints. We obtain the rate of convergence in terms of probability of large deviations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08194","kind":"arxiv","version":11},"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":"1604.08194","created_at":"2026-05-18T00:39:13.522195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08194v11","created_at":"2026-05-18T00:39:13.522195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08194","created_at":"2026-05-18T00:39:13.522195+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6EHEEWS3CQI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6EHEEWS3CQI3ZBR","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6EHEEWS","created_at":"2026-05-18T12:30:48.956258+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/W6EHEEWS3CQI3ZBRVFNMFDRQBB","json":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB.json","graph_json":"https://pith.science/api/pith-number/W6EHEEWS3CQI3ZBRVFNMFDRQBB/graph.json","events_json":"https://pith.science/api/pith-number/W6EHEEWS3CQI3ZBRVFNMFDRQBB/events.json","paper":"https://pith.science/paper/W6EHEEWS"},"agent_actions":{"view_html":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB","download_json":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB.json","view_paper":"https://pith.science/paper/W6EHEEWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08194&json=true","fetch_graph":"https://pith.science/api/pith-number/W6EHEEWS3CQI3ZBRVFNMFDRQBB/graph.json","fetch_events":"https://pith.science/api/pith-number/W6EHEEWS3CQI3ZBRVFNMFDRQBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB/action/storage_attestation","attest_author":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB/action/author_attestation","sign_citation":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB/action/citation_signature","submit_replication":"https://pith.science/pith/W6EHEEWS3CQI3ZBRVFNMFDRQBB/action/replication_record"}},"created_at":"2026-05-18T00:39:13.522195+00:00","updated_at":"2026-05-18T00:39:13.522195+00:00"}