{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LEIFOSOGOPI7CIWKEJEKTCXYKJ","short_pith_number":"pith:LEIFOSOG","schema_version":"1.0","canonical_sha256":"59105749c673d1f122ca2248a98af8526fb3f1bc09d0d501d40240efb100eefb","source":{"kind":"arxiv","id":"2508.16487","version":1},"attestation_state":"computed","paper":{"title":"FraPPE: Fast and Efficient Preference-based Pure Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Apurv Shukla, Debabrota Basu, Udvas Das","submitted_at":"2025-08-22T16:02:06Z","abstract_excerpt":"Preference-based Pure Exploration (PrePEx) aims to identify with a given confidence level the set of Pareto optimal arms in a vector-valued (aka multi-objective) bandit, where the reward vectors are ordered via a (given) preference cone $\\mathcal{C}$. Though PrePEx and its variants are well-studied, there does not exist a computationally efficient algorithm that can optimally track the existing lower bound for arbitrary preference cones. We successfully fill this gap by efficiently solving the minimisation and maximisation problems in the lower bound. First, we derive three structural properti"},"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":"2508.16487","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-22T16:02:06Z","cross_cats_sorted":["cs.AI","math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"e8aaa463192e69c3e055ba08e3906c357c879421cfa91c179dd3574426d3ca4f","abstract_canon_sha256":"7fc37ee0bf6fa7a07b4eb41a6908fa52d8c8edb763a79ddff5ad2437dad9d391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:49.421412Z","signature_b64":"3+loeJQbGk9JHuiE+gvrXU/vqFTHVwrb9O1szUcZ/gWNenbZmFXlwquDMEg72E38qvVLKt8JwuDA861CD3cHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59105749c673d1f122ca2248a98af8526fb3f1bc09d0d501d40240efb100eefb","last_reissued_at":"2026-07-05T11:57:49.420978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:49.420978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FraPPE: Fast and Efficient Preference-based Pure Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Apurv Shukla, Debabrota Basu, Udvas Das","submitted_at":"2025-08-22T16:02:06Z","abstract_excerpt":"Preference-based Pure Exploration (PrePEx) aims to identify with a given confidence level the set of Pareto optimal arms in a vector-valued (aka multi-objective) bandit, where the reward vectors are ordered via a (given) preference cone $\\mathcal{C}$. Though PrePEx and its variants are well-studied, there does not exist a computationally efficient algorithm that can optimally track the existing lower bound for arbitrary preference cones. We successfully fill this gap by efficiently solving the minimisation and maximisation problems in the lower bound. First, we derive three structural properti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16487","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.16487/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.16487","created_at":"2026-07-05T11:57:49.421033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16487v1","created_at":"2026-07-05T11:57:49.421033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16487","created_at":"2026-07-05T11:57:49.421033+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEIFOSOGOPI7","created_at":"2026-07-05T11:57:49.421033+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEIFOSOGOPI7CIWK","created_at":"2026-07-05T11:57:49.421033+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEIFOSOG","created_at":"2026-07-05T11:57:49.421033+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/LEIFOSOGOPI7CIWKEJEKTCXYKJ","json":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ.json","graph_json":"https://pith.science/api/pith-number/LEIFOSOGOPI7CIWKEJEKTCXYKJ/graph.json","events_json":"https://pith.science/api/pith-number/LEIFOSOGOPI7CIWKEJEKTCXYKJ/events.json","paper":"https://pith.science/paper/LEIFOSOG"},"agent_actions":{"view_html":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ","download_json":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ.json","view_paper":"https://pith.science/paper/LEIFOSOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16487&json=true","fetch_graph":"https://pith.science/api/pith-number/LEIFOSOGOPI7CIWKEJEKTCXYKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LEIFOSOGOPI7CIWKEJEKTCXYKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ/action/storage_attestation","attest_author":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ/action/author_attestation","sign_citation":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ/action/citation_signature","submit_replication":"https://pith.science/pith/LEIFOSOGOPI7CIWKEJEKTCXYKJ/action/replication_record"}},"created_at":"2026-07-05T11:57:49.421033+00:00","updated_at":"2026-07-05T11:57:49.421033+00:00"}