{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7DG3VFGUJE4FF7IJF2XOZYLQU4","short_pith_number":"pith:7DG3VFGU","canonical_record":{"source":{"id":"1701.03821","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-13T20:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"0f69850d8f2780a326173a1cc05e0608f9c7eb2f54a3170e75c37688f3d44493","abstract_canon_sha256":"a533e8db08387e8aa9cb30da589a1523b6255d7323f30dbd2cc47a9214310d4b"},"schema_version":"1.0"},"canonical_sha256":"f8cdba94d4493852fd092eaeece170a73614a77d3b86b48f1e5f68bcca4fedb4","source":{"kind":"arxiv","id":"1701.03821","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03821","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03821v4","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03821","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"7DG3VFGUJE4F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DG3VFGUJE4FF7IJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DG3VFGU","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7DG3VFGUJE4FF7IJF2XOZYLQU4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03821","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-13T20:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"0f69850d8f2780a326173a1cc05e0608f9c7eb2f54a3170e75c37688f3d44493","abstract_canon_sha256":"a533e8db08387e8aa9cb30da589a1523b6255d7323f30dbd2cc47a9214310d4b"},"schema_version":"1.0"},"canonical_sha256":"f8cdba94d4493852fd092eaeece170a73614a77d3b86b48f1e5f68bcca4fedb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:09.032547Z","signature_b64":"b5qa5itr6OIurEb/S57F1mOZayM+2+QTJq1LqMTwUBS53n2JEBGthfIM8c8OrqVP8LkWXyD2GPQbpnYsyCSnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8cdba94d4493852fd092eaeece170a73614a77d3b86b48f1e5f68bcca4fedb4","last_reissued_at":"2026-05-18T00:38:09.032040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:09.032040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03821","source_version":4,"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-18T00:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYiwUL00MCJ0aY6P2CofJxH+ejeG4HRDZYqWTIoQvbM8nw1bRAUSkmcDkbj2WXhm5mu2XOmOEtRZ150uvJ3jCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:07:24.152087Z"},"content_sha256":"4108080237946c7c25d42b912ded5851a2eabff0ed78c9d4a260a1e5487531c6","schema_version":"1.0","event_id":"sha256:4108080237946c7c25d42b912ded5851a2eabff0ed78c9d4a260a1e5487531c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7DG3VFGUJE4FF7IJF2XOZYLQU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasia Bayandina, Anastasia Lagunovskaya, Fariman Guliev","submitted_at":"2017-01-13T20:03:29Z","abstract_excerpt":"Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-smooth stochastic convex programming. We investigate how much can be the level of noise (the nature of this noise isn't necessary stochastic) for the rate of convergence to be maintained (up to a multiplicative factor)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03821","kind":"arxiv","version":4},"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-18T00:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhAZhJlRSY7L28oVT7HClx7b0zIBH+m8AaOC7kxtBA4AG/Wimn2MnPT5sBnok3ldnX3VPPLsH8cgqVqWVHEDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:07:24.152442Z"},"content_sha256":"7ce562e4ccae5c30a845eb4940d9bac54d17630b06e93c540aa7bde99b703177","schema_version":"1.0","event_id":"sha256:7ce562e4ccae5c30a845eb4940d9bac54d17630b06e93c540aa7bde99b703177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/bundle.json","state_url":"https://pith.science/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/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-19T23:07:24Z","links":{"resolver":"https://pith.science/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4","bundle":"https://pith.science/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/bundle.json","state":"https://pith.science/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DG3VFGUJE4FF7IJF2XOZYLQU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7DG3VFGUJE4FF7IJF2XOZYLQU4","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":"a533e8db08387e8aa9cb30da589a1523b6255d7323f30dbd2cc47a9214310d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-13T20:03:29Z","title_canon_sha256":"0f69850d8f2780a326173a1cc05e0608f9c7eb2f54a3170e75c37688f3d44493"},"schema_version":"1.0","source":{"id":"1701.03821","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03821","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03821v4","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03821","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"7DG3VFGUJE4F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DG3VFGUJE4FF7IJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DG3VFGU","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:7ce562e4ccae5c30a845eb4940d9bac54d17630b06e93c540aa7bde99b703177","target":"graph","created_at":"2026-05-18T00:38:09Z","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":"Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-smooth stochastic convex programming. We investigate how much can be the level of noise (the nature of this noise isn't necessary stochastic) for the rate of convergence to be maintained (up to a multiplicative factor).","authors_text":"Alexander Gasnikov, Anastasia Bayandina, Anastasia Lagunovskaya, Fariman Guliev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-13T20:03:29Z","title":"Gradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03821","kind":"arxiv","version":4},"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:4108080237946c7c25d42b912ded5851a2eabff0ed78c9d4a260a1e5487531c6","target":"record","created_at":"2026-05-18T00:38:09Z","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":"a533e8db08387e8aa9cb30da589a1523b6255d7323f30dbd2cc47a9214310d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-13T20:03:29Z","title_canon_sha256":"0f69850d8f2780a326173a1cc05e0608f9c7eb2f54a3170e75c37688f3d44493"},"schema_version":"1.0","source":{"id":"1701.03821","kind":"arxiv","version":4}},"canonical_sha256":"f8cdba94d4493852fd092eaeece170a73614a77d3b86b48f1e5f68bcca4fedb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8cdba94d4493852fd092eaeece170a73614a77d3b86b48f1e5f68bcca4fedb4","first_computed_at":"2026-05-18T00:38:09.032040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:09.032040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b5qa5itr6OIurEb/S57F1mOZayM+2+QTJq1LqMTwUBS53n2JEBGthfIM8c8OrqVP8LkWXyD2GPQbpnYsyCSnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:09.032547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03821","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4108080237946c7c25d42b912ded5851a2eabff0ed78c9d4a260a1e5487531c6","sha256:7ce562e4ccae5c30a845eb4940d9bac54d17630b06e93c540aa7bde99b703177"],"state_sha256":"f40a10c33e13957b60e104e97c0323762c8f5d31892e4d1cd6818db526d510a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6Ij8b1oPGSMJYiKLlzca5D//71MW7RRPMCaBb7BDc7Nz98xnSnCBRG4r+8vyDCojdq3bcqkF2uTjSXGE/Y0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:07:24.154346Z","bundle_sha256":"7f62ea856fc657b832268c142af8323339f2d9a476f0c033c4b454cdca0cad3b"}}