{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OQDDH55FK6KBGC6ZI5LI7TGI2Z","short_pith_number":"pith:OQDDH55F","canonical_record":{"source":{"id":"1711.04454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-13T07:36:01Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"89b32c68dcf9514ef86de23b967ffabd505efbc9d30fed9cfa0d2f67d6354896","abstract_canon_sha256":"0f77b524786aad9830f211af6a11596a51c755724219e84160dc8d99a9764ed9"},"schema_version":"1.0"},"canonical_sha256":"740633f7a55794130bd947568fccc8d66bd4f7aad19fc66134bb3348b5842107","source":{"kind":"arxiv","id":"1711.04454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04454","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04454v2","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04454","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"OQDDH55FK6KB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQDDH55FK6KBGC6Z","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQDDH55F","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OQDDH55FK6KBGC6ZI5LI7TGI2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-13T07:36:01Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"89b32c68dcf9514ef86de23b967ffabd505efbc9d30fed9cfa0d2f67d6354896","abstract_canon_sha256":"0f77b524786aad9830f211af6a11596a51c755724219e84160dc8d99a9764ed9"},"schema_version":"1.0"},"canonical_sha256":"740633f7a55794130bd947568fccc8d66bd4f7aad19fc66134bb3348b5842107","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:03.706982Z","signature_b64":"2lk/TvEGEOBoNcDB5R5/Q9ajcwvfe/Xt5orMV9b+oshuGow5I932dbt/0QbgU7e5fcxowjmv7WDOjvXTPNdnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"740633f7a55794130bd947568fccc8d66bd4f7aad19fc66134bb3348b5842107","last_reissued_at":"2026-05-18T00:10:03.706249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:03.706249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04454","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-18T00:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9C2Q3Aiu8SdQYEt6m44uGPl0XiAZPUjlt9au3TajgI5s2UlbFFy561e65vZ+Y/b354Hh1b27jUWBZzjICMmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:26:46.932365Z"},"content_sha256":"0e0c133d3d944cca0d71fe7224a831e0af9f27c4f1a652ea572e025328d86337","schema_version":"1.0","event_id":"sha256:0e0c133d3d944cca0d71fe7224a831e0af9f27c4f1a652ea572e025328d86337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OQDDH55FK6KBGC6ZI5LI7TGI2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholding Bandit for Dose-ranging: The Impact of Monotonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aur\\'elien Garivier (IMT), Laurent Rossi (IMT), Pierre M\\'enard (IMT), Pierre Menard (IMT)","submitted_at":"2017-11-13T07:36:01Z","abstract_excerpt":"We analyze the sample complexity of the thresholding bandit problem, with and without the assumption that the mean values of the arms are increasing. In each case, we provide a lower bound valid for any risk $\\delta$ and any $\\delta$-correct algorithm; in addition, we propose an algorithm whose sample complexity is of the same order of magnitude for small risks. This work is motivated by phase 1 clinical trials, a practically important setting where the arm means are increasing by nature, and where no satisfactory solution is available so far."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04454","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-18T00:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziDpNIlrBMR1KvOCx+mpxWi6L+Dwjy2L1tMZqGTJW0X5wI+WqkD3hat8ktekeJy1a5sbtz+guqWVHbfoJ+5mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:26:46.933018Z"},"content_sha256":"98c5ccc771316951f171097c0f5fe2a4c71dd61c45880c65b7d3be79dc92d3ac","schema_version":"1.0","event_id":"sha256:98c5ccc771316951f171097c0f5fe2a4c71dd61c45880c65b7d3be79dc92d3ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/bundle.json","state_url":"https://pith.science/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/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-05-26T13:26:46Z","links":{"resolver":"https://pith.science/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z","bundle":"https://pith.science/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/bundle.json","state":"https://pith.science/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQDDH55FK6KBGC6ZI5LI7TGI2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OQDDH55FK6KBGC6ZI5LI7TGI2Z","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":"0f77b524786aad9830f211af6a11596a51c755724219e84160dc8d99a9764ed9","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-13T07:36:01Z","title_canon_sha256":"89b32c68dcf9514ef86de23b967ffabd505efbc9d30fed9cfa0d2f67d6354896"},"schema_version":"1.0","source":{"id":"1711.04454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04454","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04454v2","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04454","created_at":"2026-05-18T00:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"OQDDH55FK6KB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQDDH55FK6KBGC6Z","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQDDH55F","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:98c5ccc771316951f171097c0f5fe2a4c71dd61c45880c65b7d3be79dc92d3ac","target":"graph","created_at":"2026-05-18T00:10: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 analyze the sample complexity of the thresholding bandit problem, with and without the assumption that the mean values of the arms are increasing. In each case, we provide a lower bound valid for any risk $\\delta$ and any $\\delta$-correct algorithm; in addition, we propose an algorithm whose sample complexity is of the same order of magnitude for small risks. This work is motivated by phase 1 clinical trials, a practically important setting where the arm means are increasing by nature, and where no satisfactory solution is available so far.","authors_text":"Aur\\'elien Garivier (IMT), Laurent Rossi (IMT), Pierre M\\'enard (IMT), Pierre Menard (IMT)","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-13T07:36:01Z","title":"Thresholding Bandit for Dose-ranging: The Impact of Monotonicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04454","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:0e0c133d3d944cca0d71fe7224a831e0af9f27c4f1a652ea572e025328d86337","target":"record","created_at":"2026-05-18T00:10: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":"0f77b524786aad9830f211af6a11596a51c755724219e84160dc8d99a9764ed9","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-13T07:36:01Z","title_canon_sha256":"89b32c68dcf9514ef86de23b967ffabd505efbc9d30fed9cfa0d2f67d6354896"},"schema_version":"1.0","source":{"id":"1711.04454","kind":"arxiv","version":2}},"canonical_sha256":"740633f7a55794130bd947568fccc8d66bd4f7aad19fc66134bb3348b5842107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"740633f7a55794130bd947568fccc8d66bd4f7aad19fc66134bb3348b5842107","first_computed_at":"2026-05-18T00:10:03.706249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:03.706249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lk/TvEGEOBoNcDB5R5/Q9ajcwvfe/Xt5orMV9b+oshuGow5I932dbt/0QbgU7e5fcxowjmv7WDOjvXTPNdnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:03.706982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e0c133d3d944cca0d71fe7224a831e0af9f27c4f1a652ea572e025328d86337","sha256:98c5ccc771316951f171097c0f5fe2a4c71dd61c45880c65b7d3be79dc92d3ac"],"state_sha256":"67e7fd3108e4c6d1de5fee4f7dd0ae74936eda5a0bed2bed12fc7cd47373046c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQzT7TYR1Jt8+zHt8w1nqXaQi3XZphPAcQXHgU7CfmWYkBBsDnwmJCMTP2eBPvB7lDijhzpvDRYE9uodSXW7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:26:46.936150Z","bundle_sha256":"b66f8216a5c31eb97b10076cb62e23ba993e0ef29c0eaa75db828b7d60596319"}}