{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E7T6T32UF7LC42Z2O24HVIKTJL","short_pith_number":"pith:E7T6T32U","schema_version":"1.0","canonical_sha256":"27e7e9ef542fd62e6b3a76b87aa1534acb7c25c08f7c109b81e6d3ef04fb12e0","source":{"kind":"arxiv","id":"2601.22969","version":2},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Nash Welfare in Linear Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dhruv Sarkar, Nishant Pandey, Sayak Ray Chowdhury","submitted_at":"2026-01-30T13:32:37Z","abstract_excerpt":"Nash regret has recently emerged as a principled fairness-aware performance metric for stochastic multi-armed bandits, motivated by the Nash Social Welfare objective. Although this notion has been extended to linear bandits, existing results suffer from suboptimality in ambient dimension $d$, stemming from proof techniques that rely on restrictive concentration inequalities. In this work, we resolve this open problem by introducing new analytical tools that yield an order-optimal Nash regret bound in linear bandits. Beyond Nash regret, we initiate the study of $p$-means regret in linear bandit"},"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":"2601.22969","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-30T13:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"b2ca2e8e7c210d42d04341be933d890ce3cb8f9f172803a26733ff3c99e7ea41","abstract_canon_sha256":"15e1544845595024fcaecbf8e884198abbc7f057b19b3cc25f2ba1cc6ffbb8c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:20.476105Z","signature_b64":"caGOSZKZJ7WFbS4t6BobFeIaulUKt0gDMO6hm06SlwRgTslFRyIfedxHbBFXusmf0moON8NHvvFIh236v2w2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e7e9ef542fd62e6b3a76b87aa1534acb7c25c08f7c109b81e6d3ef04fb12e0","last_reissued_at":"2026-06-23T02:13:20.475626Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:20.475626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Nash Welfare in Linear Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dhruv Sarkar, Nishant Pandey, Sayak Ray Chowdhury","submitted_at":"2026-01-30T13:32:37Z","abstract_excerpt":"Nash regret has recently emerged as a principled fairness-aware performance metric for stochastic multi-armed bandits, motivated by the Nash Social Welfare objective. Although this notion has been extended to linear bandits, existing results suffer from suboptimality in ambient dimension $d$, stemming from proof techniques that rely on restrictive concentration inequalities. In this work, we resolve this open problem by introducing new analytical tools that yield an order-optimal Nash regret bound in linear bandits. Beyond Nash regret, we initiate the study of $p$-means regret in linear bandit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.22969","kind":"arxiv","version":2},"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/2601.22969/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":"2601.22969","created_at":"2026-06-23T02:13:20.475684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.22969v2","created_at":"2026-06-23T02:13:20.475684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22969","created_at":"2026-06-23T02:13:20.475684+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7T6T32UF7LC","created_at":"2026-06-23T02:13:20.475684+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7T6T32UF7LC42Z2","created_at":"2026-06-23T02:13:20.475684+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7T6T32U","created_at":"2026-06-23T02:13:20.475684+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/E7T6T32UF7LC42Z2O24HVIKTJL","json":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL.json","graph_json":"https://pith.science/api/pith-number/E7T6T32UF7LC42Z2O24HVIKTJL/graph.json","events_json":"https://pith.science/api/pith-number/E7T6T32UF7LC42Z2O24HVIKTJL/events.json","paper":"https://pith.science/paper/E7T6T32U"},"agent_actions":{"view_html":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL","download_json":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL.json","view_paper":"https://pith.science/paper/E7T6T32U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.22969&json=true","fetch_graph":"https://pith.science/api/pith-number/E7T6T32UF7LC42Z2O24HVIKTJL/graph.json","fetch_events":"https://pith.science/api/pith-number/E7T6T32UF7LC42Z2O24HVIKTJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL/action/storage_attestation","attest_author":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL/action/author_attestation","sign_citation":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL/action/citation_signature","submit_replication":"https://pith.science/pith/E7T6T32UF7LC42Z2O24HVIKTJL/action/replication_record"}},"created_at":"2026-06-23T02:13:20.475684+00:00","updated_at":"2026-06-23T02:13:20.475684+00:00"}