{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I3POYHCKYFKHC4XHDI46HQUM64","short_pith_number":"pith:I3POYHCK","canonical_record":{"source":{"id":"1705.09977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-28T18:51:12Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ca35386433b9619eb37616185db322c5fed8fe413943cd94b93d91ef496406f0","abstract_canon_sha256":"7d6f4da46d9d62d64489b5857c571811254f8588630e9c6024f735259b15755c"},"schema_version":"1.0"},"canonical_sha256":"46deec1c4ac1547172e71a39e3c28cf72d9e61e64152d0970b441ea649c3e4d6","source":{"kind":"arxiv","id":"1705.09977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09977","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09977v1","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09977","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"pith_short_12","alias_value":"I3POYHCKYFKH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I3POYHCKYFKHC4XH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I3POYHCK","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I3POYHCKYFKHC4XHDI46HQUM64","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-28T18:51:12Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ca35386433b9619eb37616185db322c5fed8fe413943cd94b93d91ef496406f0","abstract_canon_sha256":"7d6f4da46d9d62d64489b5857c571811254f8588630e9c6024f735259b15755c"},"schema_version":"1.0"},"canonical_sha256":"46deec1c4ac1547172e71a39e3c28cf72d9e61e64152d0970b441ea649c3e4d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.044098Z","signature_b64":"XGixf53iUu/ZqrK8MXeLo6S/0QXK4QbHsYYXvZZJRvxCqm15yUHSBWlhUd25kJ4uVEKKa5IQsrxYcPfHHxH4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46deec1c4ac1547172e71a39e3c28cf72d9e61e64152d0970b441ea649c3e4d6","last_reissued_at":"2026-05-18T00:43:34.043609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.043609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09977","source_version":1,"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:43:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQQOsjhZ8gJGZ2eKW8lmzENrjt9pSxQnLYaGA9Kl+G00dawFTYr10zggAKN17pOUM5+HEoZOc+fkswKaI8pdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:24:19.433159Z"},"content_sha256":"e64711280f77e2c783223dc7237d551d8234e428d31ffbd2b7a3e4d34649dd95","schema_version":"1.0","event_id":"sha256:e64711280f77e2c783223dc7237d551d8234e428d31ffbd2b7a3e4d34649dd95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I3POYHCKYFKHC4XHDI46HQUM64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Armed Bandit Problem, Data Processing, and Parallel Version of the Mirror Descent Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander Kolnogorov, Alexander Nazin, Dmitry Shiyan","submitted_at":"2017-05-28T18:51:12Z","abstract_excerpt":"We consider the minimax setup for the two-armed bandit problem as applied to data processing if there are two alternative processing methods available with different a priori unknown efficiencies. One should determine the most effective method and provide its predominant application. To this end we use the mirror descent algorithm (MDA). It is well-known that corresponding minimax risk has the order $N^{1/2}$ with $N$ being the number of processed data. We improve significantly the theoretical estimate of the factor using Monte-Carlo simulations. Then we propose a parallel version of the MDA w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09977","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"},"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:43:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4aVsh5uHcFszcfo0TTU/OmP/ERA1DjhBgHBVDFzyD6m2YyGJDj/teI0pszso6JDbkRgwgCbUeIxgO7FIzR3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:24:19.433849Z"},"content_sha256":"6f8d24060896f2790ae24d09e97b2141210e25fe5f3d34bfe7d3985976f09d69","schema_version":"1.0","event_id":"sha256:6f8d24060896f2790ae24d09e97b2141210e25fe5f3d34bfe7d3985976f09d69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3POYHCKYFKHC4XHDI46HQUM64/bundle.json","state_url":"https://pith.science/pith/I3POYHCKYFKHC4XHDI46HQUM64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3POYHCKYFKHC4XHDI46HQUM64/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-07T10:24:19Z","links":{"resolver":"https://pith.science/pith/I3POYHCKYFKHC4XHDI46HQUM64","bundle":"https://pith.science/pith/I3POYHCKYFKHC4XHDI46HQUM64/bundle.json","state":"https://pith.science/pith/I3POYHCKYFKHC4XHDI46HQUM64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3POYHCKYFKHC4XHDI46HQUM64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I3POYHCKYFKHC4XHDI46HQUM64","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":"7d6f4da46d9d62d64489b5857c571811254f8588630e9c6024f735259b15755c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-28T18:51:12Z","title_canon_sha256":"ca35386433b9619eb37616185db322c5fed8fe413943cd94b93d91ef496406f0"},"schema_version":"1.0","source":{"id":"1705.09977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09977","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09977v1","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09977","created_at":"2026-05-18T00:43:34Z"},{"alias_kind":"pith_short_12","alias_value":"I3POYHCKYFKH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I3POYHCKYFKHC4XH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I3POYHCK","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:6f8d24060896f2790ae24d09e97b2141210e25fe5f3d34bfe7d3985976f09d69","target":"graph","created_at":"2026-05-18T00:43:34Z","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 the minimax setup for the two-armed bandit problem as applied to data processing if there are two alternative processing methods available with different a priori unknown efficiencies. One should determine the most effective method and provide its predominant application. To this end we use the mirror descent algorithm (MDA). It is well-known that corresponding minimax risk has the order $N^{1/2}$ with $N$ being the number of processed data. We improve significantly the theoretical estimate of the factor using Monte-Carlo simulations. Then we propose a parallel version of the MDA w","authors_text":"Alexander Kolnogorov, Alexander Nazin, Dmitry Shiyan","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-28T18:51:12Z","title":"Two-Armed Bandit Problem, Data Processing, and Parallel Version of the Mirror Descent Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09977","kind":"arxiv","version":1},"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:e64711280f77e2c783223dc7237d551d8234e428d31ffbd2b7a3e4d34649dd95","target":"record","created_at":"2026-05-18T00:43:34Z","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":"7d6f4da46d9d62d64489b5857c571811254f8588630e9c6024f735259b15755c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-28T18:51:12Z","title_canon_sha256":"ca35386433b9619eb37616185db322c5fed8fe413943cd94b93d91ef496406f0"},"schema_version":"1.0","source":{"id":"1705.09977","kind":"arxiv","version":1}},"canonical_sha256":"46deec1c4ac1547172e71a39e3c28cf72d9e61e64152d0970b441ea649c3e4d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46deec1c4ac1547172e71a39e3c28cf72d9e61e64152d0970b441ea649c3e4d6","first_computed_at":"2026-05-18T00:43:34.043609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:34.043609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XGixf53iUu/ZqrK8MXeLo6S/0QXK4QbHsYYXvZZJRvxCqm15yUHSBWlhUd25kJ4uVEKKa5IQsrxYcPfHHxH4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:34.044098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64711280f77e2c783223dc7237d551d8234e428d31ffbd2b7a3e4d34649dd95","sha256:6f8d24060896f2790ae24d09e97b2141210e25fe5f3d34bfe7d3985976f09d69"],"state_sha256":"b8e3e3d3db4f3a5df5cbf41dfc7702418bbc0f94bb3d4298ac9d15c96ec396b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eriKJPi3EQk+GBJ+wlodbZr7921E1Pm+05Kvy13Sv5esJXjRelWm0FRqtYHHmA0/guHyYbuRo2bFaUgxPPXeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:24:19.437524Z","bundle_sha256":"57b9b23f659c86e87c963823b3cd67365e4bae50790437b02130598abc55aa96"}}