{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FQBTDQXT4N7QOHM2A2QIBV5JGB","short_pith_number":"pith:FQBTDQXT","canonical_record":{"source":{"id":"2508.03072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-05T04:43:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"22a3042733c70cad72c4020e28374536aa43bdb460aa8dac1c9e7611f71a8c55","abstract_canon_sha256":"18e8b64f88e94244fdf867c2963e0e22e0dbde69508e528f8702223d90aacc4e"},"schema_version":"1.0"},"canonical_sha256":"2c0331c2f3e37f071d9a06a080d7a9305966ab3d1f4f4102aa35496757f16495","source":{"kind":"arxiv","id":"2508.03072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03072","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03072v1","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03072","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"FQBTDQXT4N7Q","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"FQBTDQXT4N7QOHM2","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"FQBTDQXT","created_at":"2026-07-05T11:48:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FQBTDQXT4N7QOHM2A2QIBV5JGB","target":"record","payload":{"canonical_record":{"source":{"id":"2508.03072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-05T04:43:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"22a3042733c70cad72c4020e28374536aa43bdb460aa8dac1c9e7611f71a8c55","abstract_canon_sha256":"18e8b64f88e94244fdf867c2963e0e22e0dbde69508e528f8702223d90aacc4e"},"schema_version":"1.0"},"canonical_sha256":"2c0331c2f3e37f071d9a06a080d7a9305966ab3d1f4f4102aa35496757f16495","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:35.855402Z","signature_b64":"5j+hvthZRJOIPPBPsI5sGdvaYLrfZBizeXSkPumjdzB6Dmz7u4D0/pslpaKaZnMwBIHspVlPM3+iO5l99T4GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c0331c2f3e37f071d9a06a080d7a9305966ab3d1f4f4102aa35496757f16495","last_reissued_at":"2026-07-05T11:48:35.854948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:35.854948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.03072","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-05T11:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj+QSY+rS14CaUqp5dfir17REP15QTflgrztwk3kRjAgQ/NNy79mAFB9EdDM5KavPRWyxVj/ETlRe3wc9vveAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:17:39.377654Z"},"content_sha256":"94036c5ffe07c8431bea97d67662e4d8f34f569c0f431edb835252a7771bd647","schema_version":"1.0","event_id":"sha256:94036c5ffe07c8431bea97d67662e4d8f34f569c0f431edb835252a7771bd647"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FQBTDQXT4N7QOHM2A2QIBV5JGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Limited Adaptivity for Multinomial Logistic Bandits","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gaurav Sinha, Sukruta Prakash Midigeshi, Tanmay Goyal","submitted_at":"2025-08-05T04:43:01Z","abstract_excerpt":"Multinomial Logistic Bandits have recently attracted much attention due to their ability to model problems with multiple outcomes. In this setting, each decision is associated with many possible outcomes, modeled using a multinomial logit function. Several recent works on multinomial logistic bandits have simultaneously achieved optimal regret and computational efficiency. However, motivated by real-world challenges and practicality, there is a need to develop algorithms with limited adaptivity, wherein we are allowed only $M$ policy updates. To address these challenges, we present two algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03072","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.03072/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-05T11:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHrJRQ/QH2Zk2zjFw3yoTtwhO/rPmUY+vA0gFlwXG+VBJByw33ocx/VtyNTTaa33XDwiyqI8eDeiQZ1MookBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:17:39.378461Z"},"content_sha256":"f985c2d121a52c9b5dc695e45d4796df63dd9ef6869589a74a42a91bb30d97bb","schema_version":"1.0","event_id":"sha256:f985c2d121a52c9b5dc695e45d4796df63dd9ef6869589a74a42a91bb30d97bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/bundle.json","state_url":"https://pith.science/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/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-08-22T13:17:39Z","links":{"resolver":"https://pith.science/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB","bundle":"https://pith.science/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/bundle.json","state":"https://pith.science/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQBTDQXT4N7QOHM2A2QIBV5JGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FQBTDQXT4N7QOHM2A2QIBV5JGB","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":"18e8b64f88e94244fdf867c2963e0e22e0dbde69508e528f8702223d90aacc4e","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-05T04:43:01Z","title_canon_sha256":"22a3042733c70cad72c4020e28374536aa43bdb460aa8dac1c9e7611f71a8c55"},"schema_version":"1.0","source":{"id":"2508.03072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03072","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03072v1","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03072","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"FQBTDQXT4N7Q","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"FQBTDQXT4N7QOHM2","created_at":"2026-07-05T11:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"FQBTDQXT","created_at":"2026-07-05T11:48:35Z"}],"graph_snapshots":[{"event_id":"sha256:f985c2d121a52c9b5dc695e45d4796df63dd9ef6869589a74a42a91bb30d97bb","target":"graph","created_at":"2026-07-05T11:48: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/2508.03072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multinomial Logistic Bandits have recently attracted much attention due to their ability to model problems with multiple outcomes. In this setting, each decision is associated with many possible outcomes, modeled using a multinomial logit function. Several recent works on multinomial logistic bandits have simultaneously achieved optimal regret and computational efficiency. However, motivated by real-world challenges and practicality, there is a need to develop algorithms with limited adaptivity, wherein we are allowed only $M$ policy updates. To address these challenges, we present two algorit","authors_text":"Gaurav Sinha, Sukruta Prakash Midigeshi, Tanmay Goyal","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-05T04:43:01Z","title":"Achieving Limited Adaptivity for Multinomial Logistic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03072","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:94036c5ffe07c8431bea97d67662e4d8f34f569c0f431edb835252a7771bd647","target":"record","created_at":"2026-07-05T11:48: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":"18e8b64f88e94244fdf867c2963e0e22e0dbde69508e528f8702223d90aacc4e","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-05T04:43:01Z","title_canon_sha256":"22a3042733c70cad72c4020e28374536aa43bdb460aa8dac1c9e7611f71a8c55"},"schema_version":"1.0","source":{"id":"2508.03072","kind":"arxiv","version":1}},"canonical_sha256":"2c0331c2f3e37f071d9a06a080d7a9305966ab3d1f4f4102aa35496757f16495","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c0331c2f3e37f071d9a06a080d7a9305966ab3d1f4f4102aa35496757f16495","first_computed_at":"2026-07-05T11:48:35.854948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:35.854948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5j+hvthZRJOIPPBPsI5sGdvaYLrfZBizeXSkPumjdzB6Dmz7u4D0/pslpaKaZnMwBIHspVlPM3+iO5l99T4GCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:35.855402Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.03072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94036c5ffe07c8431bea97d67662e4d8f34f569c0f431edb835252a7771bd647","sha256:f985c2d121a52c9b5dc695e45d4796df63dd9ef6869589a74a42a91bb30d97bb"],"state_sha256":"8f2cd4359e8bfedfee456c4cee0975e0948b149862b7236c915096d38d1071c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0A2GgdQ4K1Hn0PGg/LE8iiQBFnf23GPeFH/FWFEQvv5bsa68AHHSg0vr9AyQ8YwFROSmDGptMFzRWAcUTfc3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:17:39.385780Z","bundle_sha256":"c89228f5db68c1d54e1ef5277852ebcf2c56181ff274cc4be4b6ca0a405c3f6e"}}