{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FDIORDJIHO52KSKXOPQZIYN6UD","short_pith_number":"pith:FDIORDJI","canonical_record":{"source":{"id":"1711.04213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T00:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"3a7ee05371ebd73904859925daab2831e403caff162225c200fae5492fb8b575","abstract_canon_sha256":"ba2c4551b1e258c32991d7611c2b00cd14bb348bd09927e2efc199c22134975d"},"schema_version":"1.0"},"canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","source":{"kind":"arxiv","id":"1711.04213","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04213","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04213v2","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04213","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"FDIORDJIHO52","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDIORDJIHO52KSKX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDIORDJI","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FDIORDJIHO52KSKXOPQZIYN6UD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T00:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"3a7ee05371ebd73904859925daab2831e403caff162225c200fae5492fb8b575","abstract_canon_sha256":"ba2c4551b1e258c32991d7611c2b00cd14bb348bd09927e2efc199c22134975d"},"schema_version":"1.0"},"canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:19.107401Z","signature_b64":"XlMr5iX6TgNRHxskX6nxPm3lLuFwinLVz/dDRkb+FZHBkKD+eZWs+g4o9lTbfJlsa9fii/k0Ddg/cTAPd+GxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","last_reissued_at":"2026-05-18T00:26:19.106872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:19.106872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04213","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:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvKXClpekvmUuQtkf6MbcEReeS7S7ugb2ZRcigidTd7uw1ASztkkWS3CU1H1CykoqEI6gMPvyXmX1I8FlArVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:27:25.566212Z"},"content_sha256":"2f75445bc638b84be9b2584d27d1f5c061f96c3970a62823eb46cddef11f7bf4","schema_version":"1.0","event_id":"sha256:2f75445bc638b84be9b2584d27d1f5c061f96c3970a62823eb46cddef11f7bf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FDIORDJIHO52KSKXOPQZIYN6UD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Skyline Identification in Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Albert Cheu, Jonathan Ullman, Ravi Sundaram","submitted_at":"2017-11-12T00:35:02Z","abstract_excerpt":"We introduce a variant of the classical PAC multi-armed bandit problem. There is an ordered set of $n$ arms $A[1],\\dots,A[n]$, each with some stochastic reward drawn from some unknown bounded distribution. The goal is to identify the $skyline$ of the set $A$, consisting of all arms $A[i]$ such that $A[i]$ has larger expected reward than all lower-numbered arms $A[1],\\dots,A[i-1]$. We define a natural notion of an $\\varepsilon$-approximate skyline and prove matching upper and lower bounds for identifying an $\\varepsilon$-skyline. Specifically, we show that in order to identify an $\\varepsilon$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04213","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:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwOsuQ+n/H4TI7zUw9ETAnV9yyVTnleyWzn9Fwkplz+QW4WLk7YJAa8Rh5cNB8VIiUKgav1bpkdxFxoU5SSLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:27:25.566564Z"},"content_sha256":"9ec029dcfadedf5714bd8f7fd6102f572125992f1e94261d15b989c92112dc62","schema_version":"1.0","event_id":"sha256:9ec029dcfadedf5714bd8f7fd6102f572125992f1e94261d15b989c92112dc62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/bundle.json","state_url":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDIORDJIHO52KSKXOPQZIYN6UD/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-08T23:27:25Z","links":{"resolver":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD","bundle":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/bundle.json","state":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDIORDJIHO52KSKXOPQZIYN6UD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FDIORDJIHO52KSKXOPQZIYN6UD","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":"ba2c4551b1e258c32991d7611c2b00cd14bb348bd09927e2efc199c22134975d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T00:35:02Z","title_canon_sha256":"3a7ee05371ebd73904859925daab2831e403caff162225c200fae5492fb8b575"},"schema_version":"1.0","source":{"id":"1711.04213","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04213","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04213v2","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04213","created_at":"2026-05-18T00:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"FDIORDJIHO52","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDIORDJIHO52KSKX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDIORDJI","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:9ec029dcfadedf5714bd8f7fd6102f572125992f1e94261d15b989c92112dc62","target":"graph","created_at":"2026-05-18T00:26:19Z","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 introduce a variant of the classical PAC multi-armed bandit problem. There is an ordered set of $n$ arms $A[1],\\dots,A[n]$, each with some stochastic reward drawn from some unknown bounded distribution. The goal is to identify the $skyline$ of the set $A$, consisting of all arms $A[i]$ such that $A[i]$ has larger expected reward than all lower-numbered arms $A[1],\\dots,A[i-1]$. We define a natural notion of an $\\varepsilon$-approximate skyline and prove matching upper and lower bounds for identifying an $\\varepsilon$-skyline. Specifically, we show that in order to identify an $\\varepsilon$-","authors_text":"Albert Cheu, Jonathan Ullman, Ravi Sundaram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T00:35:02Z","title":"Skyline Identification in Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04213","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:2f75445bc638b84be9b2584d27d1f5c061f96c3970a62823eb46cddef11f7bf4","target":"record","created_at":"2026-05-18T00:26:19Z","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":"ba2c4551b1e258c32991d7611c2b00cd14bb348bd09927e2efc199c22134975d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T00:35:02Z","title_canon_sha256":"3a7ee05371ebd73904859925daab2831e403caff162225c200fae5492fb8b575"},"schema_version":"1.0","source":{"id":"1711.04213","kind":"arxiv","version":2}},"canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","first_computed_at":"2026-05-18T00:26:19.106872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:19.106872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XlMr5iX6TgNRHxskX6nxPm3lLuFwinLVz/dDRkb+FZHBkKD+eZWs+g4o9lTbfJlsa9fii/k0Ddg/cTAPd+GxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:19.107401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04213","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f75445bc638b84be9b2584d27d1f5c061f96c3970a62823eb46cddef11f7bf4","sha256:9ec029dcfadedf5714bd8f7fd6102f572125992f1e94261d15b989c92112dc62"],"state_sha256":"dc2d6f825bae9c2b4e5f23d03ad8f6f72ab5782f052a945b918c0954aad2fe73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnCfJl2WHzWIZsGMswvT7xbrgQtT6Ls8VnryAn0/eC18RK885x7IR38KgfUueHXjlvsgcknAhiMGblzgN0qICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:27:25.568364Z","bundle_sha256":"0c79154f03321141c6c1a8b9f21cab9ff88b771b6535e33d146035dbcb53e7f6"}}