{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GIXBFWBOG5YBLT4WYEEN4TU2NK","short_pith_number":"pith:GIXBFWBO","canonical_record":{"source":{"id":"2007.04876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T15:26:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6cdacf106a28dd9dc5522dd7a5fa8d0fecc3b84eed2c4af719e0e73e7b946b6d","abstract_canon_sha256":"f24c43b37a10553423a8dbbc489fb335210428eb20b1844422e61099ca57eeed"},"schema_version":"1.0"},"canonical_sha256":"322e12d82e377015cf96c108de4e9a6a9be1fea89b9a0bd45ef8691301854fad","source":{"kind":"arxiv","id":"2007.04876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04876","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04876v1","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04876","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"GIXBFWBOG5YB","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_16","alias_value":"GIXBFWBOG5YBLT4W","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_8","alias_value":"GIXBFWBO","created_at":"2026-07-05T01:17:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GIXBFWBOG5YBLT4WYEEN4TU2NK","target":"record","payload":{"canonical_record":{"source":{"id":"2007.04876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T15:26:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6cdacf106a28dd9dc5522dd7a5fa8d0fecc3b84eed2c4af719e0e73e7b946b6d","abstract_canon_sha256":"f24c43b37a10553423a8dbbc489fb335210428eb20b1844422e61099ca57eeed"},"schema_version":"1.0"},"canonical_sha256":"322e12d82e377015cf96c108de4e9a6a9be1fea89b9a0bd45ef8691301854fad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:35.469959Z","signature_b64":"wQ7Lmiw/6smpIkus9totvHJWkv2+1PKPHxH7A72/WT9c39bfT3D7Ir1mDtlu+V2U3Io1GwyisOUaGg28cZfRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322e12d82e377015cf96c108de4e9a6a9be1fea89b9a0bd45ef8691301854fad","last_reissued_at":"2026-07-05T01:17:35.469522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:35.469522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.04876","source_version":1,"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-07-05T01:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJlHPXxL/fLzG+K7x5ezJlNsZ6gqDabQb2/qBv/sbKVLM4m/kQwxCk+0BvBnvo7cLXC9HzZUFVFHb6T+gRZLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:48:08.765136Z"},"content_sha256":"edbc0660e2f8c54fa30194b4f21e8c7a253e395412392fe8774fa38105645ac4","schema_version":"1.0","event_id":"sha256:edbc0660e2f8c54fa30194b4f21e8c7a253e395412392fe8774fa38105645ac4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GIXBFWBOG5YBLT4WYEEN4TU2NK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multinomial Logit Bandit with Low Switching Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kefan Dong, Qin Zhang, Yingkai Li, Yuan Zhou","submitted_at":"2020-07-09T15:26:54Z","abstract_excerpt":"We study multinomial logit bandit with limited adaptivity, where the algorithms change their exploration actions as infrequently as possible when achieving almost optimal minimax regret. We propose two measures of adaptivity: the assortment switching cost and the more fine-grained item switching cost. We present an anytime algorithm (AT-DUCB) with $O(N \\log T)$ assortment switches, almost matching the lower bound $\\Omega(\\frac{N \\log T}{ \\log \\log T})$. In the fixed-horizon setting, our algorithm FH-DUCB incurs $O(N \\log \\log T)$ assortment switches, matching the asymptotic lower bound. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04876","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/2007.04876/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"},"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-07-05T01:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRI6NWO6m6+Pa3poIJbBdYvnMtXJrJkbLh6/ULHbGieyoWbP7SCiNu1kDo/yG0I+PQKxQ9ena4jwxv/MfT8XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:48:08.765419Z"},"content_sha256":"a32b7b0cedfe186c63b47622c94a9d1d374c7cc117a6cdea5bad8774381bbf68","schema_version":"1.0","event_id":"sha256:a32b7b0cedfe186c63b47622c94a9d1d374c7cc117a6cdea5bad8774381bbf68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/bundle.json","state_url":"https://pith.science/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/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-07-31T15:48:08Z","links":{"resolver":"https://pith.science/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK","bundle":"https://pith.science/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/bundle.json","state":"https://pith.science/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIXBFWBOG5YBLT4WYEEN4TU2NK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GIXBFWBOG5YBLT4WYEEN4TU2NK","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":"f24c43b37a10553423a8dbbc489fb335210428eb20b1844422e61099ca57eeed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T15:26:54Z","title_canon_sha256":"6cdacf106a28dd9dc5522dd7a5fa8d0fecc3b84eed2c4af719e0e73e7b946b6d"},"schema_version":"1.0","source":{"id":"2007.04876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04876","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04876v1","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04876","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"GIXBFWBOG5YB","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_16","alias_value":"GIXBFWBOG5YBLT4W","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_8","alias_value":"GIXBFWBO","created_at":"2026-07-05T01:17:35Z"}],"graph_snapshots":[{"event_id":"sha256:a32b7b0cedfe186c63b47622c94a9d1d374c7cc117a6cdea5bad8774381bbf68","target":"graph","created_at":"2026-07-05T01:17:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.04876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study multinomial logit bandit with limited adaptivity, where the algorithms change their exploration actions as infrequently as possible when achieving almost optimal minimax regret. We propose two measures of adaptivity: the assortment switching cost and the more fine-grained item switching cost. We present an anytime algorithm (AT-DUCB) with $O(N \\log T)$ assortment switches, almost matching the lower bound $\\Omega(\\frac{N \\log T}{ \\log \\log T})$. In the fixed-horizon setting, our algorithm FH-DUCB incurs $O(N \\log \\log T)$ assortment switches, matching the asymptotic lower bound. We als","authors_text":"Kefan Dong, Qin Zhang, Yingkai Li, Yuan Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T15:26:54Z","title":"Multinomial Logit Bandit with Low Switching Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04876","kind":"arxiv","version":1},"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:edbc0660e2f8c54fa30194b4f21e8c7a253e395412392fe8774fa38105645ac4","target":"record","created_at":"2026-07-05T01:17:35Z","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":"f24c43b37a10553423a8dbbc489fb335210428eb20b1844422e61099ca57eeed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T15:26:54Z","title_canon_sha256":"6cdacf106a28dd9dc5522dd7a5fa8d0fecc3b84eed2c4af719e0e73e7b946b6d"},"schema_version":"1.0","source":{"id":"2007.04876","kind":"arxiv","version":1}},"canonical_sha256":"322e12d82e377015cf96c108de4e9a6a9be1fea89b9a0bd45ef8691301854fad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"322e12d82e377015cf96c108de4e9a6a9be1fea89b9a0bd45ef8691301854fad","first_computed_at":"2026-07-05T01:17:35.469522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:35.469522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQ7Lmiw/6smpIkus9totvHJWkv2+1PKPHxH7A72/WT9c39bfT3D7Ir1mDtlu+V2U3Io1GwyisOUaGg28cZfRDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:35.469959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.04876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbc0660e2f8c54fa30194b4f21e8c7a253e395412392fe8774fa38105645ac4","sha256:a32b7b0cedfe186c63b47622c94a9d1d374c7cc117a6cdea5bad8774381bbf68"],"state_sha256":"b5e3a903ff2cfd4490e4b595c6df914935ab3d584199f945358f3abdbe83bdbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9M8FRxa/687vggo3+TzZghaGJ2ubrSr7kNcJv7UpGLqCEZ8Zyi/o2Jzn1BoMJ3OEsaX0adZUcQfegZ7WUrgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T15:48:08.767681Z","bundle_sha256":"cf8aaea4652276389691d0fbcea9868f013edd1d677b4cbf0026e72f7bf32470"}}