{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FDIORDJIHO52KSKXOPQZIYN6UD","short_pith_number":"pith:FDIORDJI","schema_version":"1.0","canonical_sha256":"28d0e88d283bbba5495773e19461bea0c77e2e2c26cb5b6c185bc6c68beb9e8d","source":{"kind":"arxiv","id":"1711.04213","version":2},"attestation_state":"computed","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$-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.04213","created_at":"2026-05-18T00:26:19.106948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04213v2","created_at":"2026-05-18T00:26:19.106948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04213","created_at":"2026-05-18T00:26:19.106948+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDIORDJIHO52","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDIORDJIHO52KSKX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDIORDJI","created_at":"2026-05-18T12:31:15.632608+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/FDIORDJIHO52KSKXOPQZIYN6UD","json":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD.json","graph_json":"https://pith.science/api/pith-number/FDIORDJIHO52KSKXOPQZIYN6UD/graph.json","events_json":"https://pith.science/api/pith-number/FDIORDJIHO52KSKXOPQZIYN6UD/events.json","paper":"https://pith.science/paper/FDIORDJI"},"agent_actions":{"view_html":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD","download_json":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD.json","view_paper":"https://pith.science/paper/FDIORDJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04213&json=true","fetch_graph":"https://pith.science/api/pith-number/FDIORDJIHO52KSKXOPQZIYN6UD/graph.json","fetch_events":"https://pith.science/api/pith-number/FDIORDJIHO52KSKXOPQZIYN6UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/action/storage_attestation","attest_author":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/action/author_attestation","sign_citation":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/action/citation_signature","submit_replication":"https://pith.science/pith/FDIORDJIHO52KSKXOPQZIYN6UD/action/replication_record"}},"created_at":"2026-05-18T00:26:19.106948+00:00","updated_at":"2026-05-18T00:26:19.106948+00:00"}