{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NB4PPOBMNRJX2FBQVPLWSRLOQT","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":"00b0c91b4e5fe09b6bdd8855e21a1f929fe49b542627fb920c6c50dde7637314","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T12:55:17Z","title_canon_sha256":"81ceb6774697de40b3b92a7ee8e0c0716bb7097a813d9aca0fd8c0cf5f7f5a13"},"schema_version":"1.0","source":{"id":"2206.00466","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00466","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00466v2","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00466","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"NB4PPOBMNRJX","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"NB4PPOBMNRJX2FBQ","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"NB4PPOBM","created_at":"2026-07-05T05:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:2293c13c1e45cd6a4d12a7fce65422e7bae42753acca3afb24198c207702495a","target":"graph","created_at":"2026-07-05T05:05:47Z","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/2206.00466/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose the first regret-based approach to the Graphical Bilinear Bandits problem, where $n$ agents in a graph play a stochastic bilinear bandit game with each of their neighbors. This setting reveals a combinatorial NP-hard problem that prevents the use of any existing regret-based algorithm in the (bi-)linear bandit literature. In this paper, we fill this gap and present the first regret-based algorithm for graphical bilinear bandits using the principle of optimism in the face of uncertainty. Theoretical analysis of this new method yields an upper bound of $\\tilde{O}(\\sqrt{T})$ on the $\\a","authors_text":"Albert Thomas, Geovani Rizk, Igor Colin, Rida Laraki, Yann Chevaleyre","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T12:55:17Z","title":"An $\\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00466","kind":"arxiv","version":2},"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:9be6e8baec42cdca3e9ab693cfc4e7a7c1ccefbaa3d6e32521741934a5733cba","target":"record","created_at":"2026-07-05T05:05:47Z","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":"00b0c91b4e5fe09b6bdd8855e21a1f929fe49b542627fb920c6c50dde7637314","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T12:55:17Z","title_canon_sha256":"81ceb6774697de40b3b92a7ee8e0c0716bb7097a813d9aca0fd8c0cf5f7f5a13"},"schema_version":"1.0","source":{"id":"2206.00466","kind":"arxiv","version":2}},"canonical_sha256":"6878f7b82c6c537d1430abd769456e84ffc3989330db897c17f36832bbd42332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6878f7b82c6c537d1430abd769456e84ffc3989330db897c17f36832bbd42332","first_computed_at":"2026-07-05T05:05:47.982928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:05:47.982928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VRrvD4KIwUKJId6VRo9Pb3C2GkLpqdy7fT+qkeo/Bacu1GuMQzPCbpMAH8UYrbwoiGSVR05U/IBKSXqWda5CAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:05:47.983444Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.00466","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9be6e8baec42cdca3e9ab693cfc4e7a7c1ccefbaa3d6e32521741934a5733cba","sha256:2293c13c1e45cd6a4d12a7fce65422e7bae42753acca3afb24198c207702495a"],"state_sha256":"dac1b15d2f1be1689f62a7ae5020a1362ee5f32156deb9f1d425ab38084831ec"}