{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JBIYVAN5UUW66DNGZV7BEGVXRJ","short_pith_number":"pith:JBIYVAN5","schema_version":"1.0","canonical_sha256":"48518a81bda52def0da6cd7e121ab78a4a6a7890683c5ffbfbaf2f722f7d3515","source":{"kind":"arxiv","id":"2505.22361","version":1},"attestation_state":"computed","paper":{"title":"Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Xiangyu Chang, Xi Chen, Yining Wang, Zhiyi Zeng","submitted_at":"2025-05-28T13:41:00Z","abstract_excerpt":"This paper studies a bandit optimization problem where the goal is to maximize a function $f(x)$ over $T$ periods for some unknown strongly concave function $f$. We consider a new pairwise comparison oracle, where the decision-maker chooses a pair of actions $(x, x')$ for a consecutive number of periods and then obtains an estimate of $f(x)-f(x')$. We show that such a pairwise comparison oracle finds important applications to joint pricing and inventory replenishment problems and network revenue management. The challenge in this bandit optimization is twofold. First, the decision-maker not onl"},"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":"2505.22361","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-28T13:41:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aeebc7c6e28462a9dbbe38982aeb1f5e9fabe2e8b0b08931a852ab0fd8c53a93","abstract_canon_sha256":"43167d04bba0524d1bdb7b09ff155d1881617007cdcb6a309795d9904f19b6fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:13.915381Z","signature_b64":"xoMZ5bvD7L/udQZffzzc8nFnu7VFMCW83Moj2ytjt88i7EqyQ5/2ce4hELdqLHeqqwhjmQyVNX7CtFnmp0ePBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48518a81bda52def0da6cd7e121ab78a4a6a7890683c5ffbfbaf2f722f7d3515","last_reissued_at":"2026-07-05T11:11:13.914895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:13.914895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Xiangyu Chang, Xi Chen, Yining Wang, Zhiyi Zeng","submitted_at":"2025-05-28T13:41:00Z","abstract_excerpt":"This paper studies a bandit optimization problem where the goal is to maximize a function $f(x)$ over $T$ periods for some unknown strongly concave function $f$. We consider a new pairwise comparison oracle, where the decision-maker chooses a pair of actions $(x, x')$ for a consecutive number of periods and then obtains an estimate of $f(x)-f(x')$. We show that such a pairwise comparison oracle finds important applications to joint pricing and inventory replenishment problems and network revenue management. The challenge in this bandit optimization is twofold. First, the decision-maker not onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22361","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/2505.22361/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":"2505.22361","created_at":"2026-07-05T11:11:13.914957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22361v1","created_at":"2026-07-05T11:11:13.914957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22361","created_at":"2026-07-05T11:11:13.914957+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBIYVAN5UUW6","created_at":"2026-07-05T11:11:13.914957+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBIYVAN5UUW66DNG","created_at":"2026-07-05T11:11:13.914957+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBIYVAN5","created_at":"2026-07-05T11:11:13.914957+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/JBIYVAN5UUW66DNGZV7BEGVXRJ","json":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ.json","graph_json":"https://pith.science/api/pith-number/JBIYVAN5UUW66DNGZV7BEGVXRJ/graph.json","events_json":"https://pith.science/api/pith-number/JBIYVAN5UUW66DNGZV7BEGVXRJ/events.json","paper":"https://pith.science/paper/JBIYVAN5"},"agent_actions":{"view_html":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ","download_json":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ.json","view_paper":"https://pith.science/paper/JBIYVAN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22361&json=true","fetch_graph":"https://pith.science/api/pith-number/JBIYVAN5UUW66DNGZV7BEGVXRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JBIYVAN5UUW66DNGZV7BEGVXRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ/action/storage_attestation","attest_author":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ/action/author_attestation","sign_citation":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ/action/citation_signature","submit_replication":"https://pith.science/pith/JBIYVAN5UUW66DNGZV7BEGVXRJ/action/replication_record"}},"created_at":"2026-07-05T11:11:13.914957+00:00","updated_at":"2026-07-05T11:11:13.914957+00:00"}