{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FPP5JATOZF3UIJF36IUF4TIMFD","short_pith_number":"pith:FPP5JATO","schema_version":"1.0","canonical_sha256":"2bdfd4826ec9774424bbf2285e4d0c28eb844039e555ecf0419dc9c30e7bf709","source":{"kind":"arxiv","id":"2503.08004","version":1},"attestation_state":"computed","paper":{"title":"Multiplayer Information Asymmetric Bandits in Metric Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditi Karthik, William Chang","submitted_at":"2025-03-11T03:08:09Z","abstract_excerpt":"In recent years the information asymmetric Lipschitz bandits In this paper we studied the Lipschitz bandit problem applied to the multiplayer information asymmetric problem studied in \\cite{chang2022online, chang2023optimal}. More specifically we consider information asymmetry in rewards, actions, or both. We adopt the CAB algorithm given in \\cite{kleinberg2004nearly} which uses a fixed discretization to give regret bounds of the same order (in the dimension of the action) space in all 3 problem settings. We also adopt their zooming algorithm \\cite{ kleinberg2008multi}which uses an adaptive di"},"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":"2503.08004","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T03:08:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e564f2bd3b64c80b99cddb02d560eab6c5f01cccfa7715045acd982e1078c5c9","abstract_canon_sha256":"2ab7546e9d21efd41da7812f156af30934e3ad698150240d758441f415f92262"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:33.150825Z","signature_b64":"rs60wP7LnsSzF0/K2OGlp0WYyu82iUwLAasNLZKi1v/Z5zo3SUKTHH9Uh/IMx/ow96IkHvBxDtmAVt5Lc8znBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bdfd4826ec9774424bbf2285e4d0c28eb844039e555ecf0419dc9c30e7bf709","last_reissued_at":"2026-07-05T10:30:33.150339Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:33.150339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiplayer Information Asymmetric Bandits in Metric Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditi Karthik, William Chang","submitted_at":"2025-03-11T03:08:09Z","abstract_excerpt":"In recent years the information asymmetric Lipschitz bandits In this paper we studied the Lipschitz bandit problem applied to the multiplayer information asymmetric problem studied in \\cite{chang2022online, chang2023optimal}. More specifically we consider information asymmetry in rewards, actions, or both. We adopt the CAB algorithm given in \\cite{kleinberg2004nearly} which uses a fixed discretization to give regret bounds of the same order (in the dimension of the action) space in all 3 problem settings. We also adopt their zooming algorithm \\cite{ kleinberg2008multi}which uses an adaptive di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08004","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/2503.08004/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":"2503.08004","created_at":"2026-07-05T10:30:33.150398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.08004v1","created_at":"2026-07-05T10:30:33.150398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08004","created_at":"2026-07-05T10:30:33.150398+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPP5JATOZF3U","created_at":"2026-07-05T10:30:33.150398+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPP5JATOZF3UIJF3","created_at":"2026-07-05T10:30:33.150398+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPP5JATO","created_at":"2026-07-05T10:30:33.150398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10526","citing_title":"Coordinating the Unknown Lipschitz Constant in Multiplayer Bandits","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD","json":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD.json","graph_json":"https://pith.science/api/pith-number/FPP5JATOZF3UIJF36IUF4TIMFD/graph.json","events_json":"https://pith.science/api/pith-number/FPP5JATOZF3UIJF36IUF4TIMFD/events.json","paper":"https://pith.science/paper/FPP5JATO"},"agent_actions":{"view_html":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD","download_json":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD.json","view_paper":"https://pith.science/paper/FPP5JATO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.08004&json=true","fetch_graph":"https://pith.science/api/pith-number/FPP5JATOZF3UIJF36IUF4TIMFD/graph.json","fetch_events":"https://pith.science/api/pith-number/FPP5JATOZF3UIJF36IUF4TIMFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD/action/storage_attestation","attest_author":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD/action/author_attestation","sign_citation":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD/action/citation_signature","submit_replication":"https://pith.science/pith/FPP5JATOZF3UIJF36IUF4TIMFD/action/replication_record"}},"created_at":"2026-07-05T10:30:33.150398+00:00","updated_at":"2026-07-05T10:30:33.150398+00:00"}