{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TPXZPJWJSHUWUUMNFJXKQWFGZG","short_pith_number":"pith:TPXZPJWJ","canonical_record":{"source":{"id":"2207.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T06:16:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eed58d48360df3294ba329947cfb7dfd76428e192178ea43ee8c2261aa6381ba","abstract_canon_sha256":"3937ab8cdfa201e5f5d30b9efd0cfc7e99b74fbe6b44f60ab7ba1150db5094ab"},"schema_version":"1.0"},"canonical_sha256":"9bef97a6c991e96a518d2a6ea858a6c982a8a150bc19d066fdbe3c4a50e75473","source":{"kind":"arxiv","id":"2207.03106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03106","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03106v1","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03106","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"TPXZPJWJSHUW","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_16","alias_value":"TPXZPJWJSHUWUUMN","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_8","alias_value":"TPXZPJWJ","created_at":"2026-07-05T04:38:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TPXZPJWJSHUWUUMNFJXKQWFGZG","target":"record","payload":{"canonical_record":{"source":{"id":"2207.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T06:16:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eed58d48360df3294ba329947cfb7dfd76428e192178ea43ee8c2261aa6381ba","abstract_canon_sha256":"3937ab8cdfa201e5f5d30b9efd0cfc7e99b74fbe6b44f60ab7ba1150db5094ab"},"schema_version":"1.0"},"canonical_sha256":"9bef97a6c991e96a518d2a6ea858a6c982a8a150bc19d066fdbe3c4a50e75473","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:19.068981Z","signature_b64":"8RWTS8biJPZtDafnu0tScp83SAwonAUTIe03epQ/RHRtok+1eTyXqSOBQ8hfjU8z/4nI1VxebMcjzGURYiDxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bef97a6c991e96a518d2a6ea858a6c982a8a150bc19d066fdbe3c4a50e75473","last_reissued_at":"2026-07-05T04:38:19.068559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:19.068559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.03106","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-05T04:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEX3UR4+QcK0t76JNqQ8RPHEv06lyuthCV1CoHsfcxpkd/f7LxJMhUYu8uvlFIHS3SzYxOodCLihrE7Y/R4fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:44:11.001191Z"},"content_sha256":"34dd682ec5d57d89d7fd2801b7c821b3e93057394c5494df2ee1116d5910efbf","schema_version":"1.0","event_id":"sha256:34dd682ec5d57d89d7fd2801b7c821b3e93057394c5494df2ee1116d5910efbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TPXZPJWJSHUWUUMNFJXKQWFGZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiafan He, Quanquan Gu, Tianhao Wang, Yifei Min","submitted_at":"2022-07-07T06:16:19Z","abstract_excerpt":"We study federated contextual linear bandits, where $M$ agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We consider the asynchronous setting, where all agents work independently and the communication between one agent and the server will not trigger other agents' communication. We propose a simple algorithm named \\texttt{FedLinUCB} based on the principle of optimism. We prove that the regret of \\texttt{FedLinUCB} is bounded by $\\tilde{O}(d\\sqrt{\\sum_{m=1}^M T_m})$ and the communication complexity is $\\tilde{O}(dM^2)$, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03106","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/2207.03106/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-05T04:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20WdlQW1ZMKeitn3Cy0AYKe25SFYYm75lLffQ/nUL8y811x3dKFmcl+O+2NFIYm6m9NDIWs+tcs/RdFcu+ldBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:44:11.001581Z"},"content_sha256":"67acc86703a6ce001825340235180940004801c6b9232ae2cacc259935c0ab53","schema_version":"1.0","event_id":"sha256:67acc86703a6ce001825340235180940004801c6b9232ae2cacc259935c0ab53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/bundle.json","state_url":"https://pith.science/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/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-06T10:44:11Z","links":{"resolver":"https://pith.science/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG","bundle":"https://pith.science/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/bundle.json","state":"https://pith.science/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPXZPJWJSHUWUUMNFJXKQWFGZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TPXZPJWJSHUWUUMNFJXKQWFGZG","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":"3937ab8cdfa201e5f5d30b9efd0cfc7e99b74fbe6b44f60ab7ba1150db5094ab","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T06:16:19Z","title_canon_sha256":"eed58d48360df3294ba329947cfb7dfd76428e192178ea43ee8c2261aa6381ba"},"schema_version":"1.0","source":{"id":"2207.03106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03106","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03106v1","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03106","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"TPXZPJWJSHUW","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_16","alias_value":"TPXZPJWJSHUWUUMN","created_at":"2026-07-05T04:38:19Z"},{"alias_kind":"pith_short_8","alias_value":"TPXZPJWJ","created_at":"2026-07-05T04:38:19Z"}],"graph_snapshots":[{"event_id":"sha256:67acc86703a6ce001825340235180940004801c6b9232ae2cacc259935c0ab53","target":"graph","created_at":"2026-07-05T04:38:19Z","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/2207.03106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study federated contextual linear bandits, where $M$ agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We consider the asynchronous setting, where all agents work independently and the communication between one agent and the server will not trigger other agents' communication. We propose a simple algorithm named \\texttt{FedLinUCB} based on the principle of optimism. We prove that the regret of \\texttt{FedLinUCB} is bounded by $\\tilde{O}(d\\sqrt{\\sum_{m=1}^M T_m})$ and the communication complexity is $\\tilde{O}(dM^2)$, where","authors_text":"Jiafan He, Quanquan Gu, Tianhao Wang, Yifei Min","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T06:16:19Z","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03106","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:34dd682ec5d57d89d7fd2801b7c821b3e93057394c5494df2ee1116d5910efbf","target":"record","created_at":"2026-07-05T04:38:19Z","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":"3937ab8cdfa201e5f5d30b9efd0cfc7e99b74fbe6b44f60ab7ba1150db5094ab","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T06:16:19Z","title_canon_sha256":"eed58d48360df3294ba329947cfb7dfd76428e192178ea43ee8c2261aa6381ba"},"schema_version":"1.0","source":{"id":"2207.03106","kind":"arxiv","version":1}},"canonical_sha256":"9bef97a6c991e96a518d2a6ea858a6c982a8a150bc19d066fdbe3c4a50e75473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bef97a6c991e96a518d2a6ea858a6c982a8a150bc19d066fdbe3c4a50e75473","first_computed_at":"2026-07-05T04:38:19.068559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:19.068559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8RWTS8biJPZtDafnu0tScp83SAwonAUTIe03epQ/RHRtok+1eTyXqSOBQ8hfjU8z/4nI1VxebMcjzGURYiDxDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:19.068981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34dd682ec5d57d89d7fd2801b7c821b3e93057394c5494df2ee1116d5910efbf","sha256:67acc86703a6ce001825340235180940004801c6b9232ae2cacc259935c0ab53"],"state_sha256":"f27ef1b984db0def39382fb854f00b55a4ff73261183c3380250e75c06524375"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRCr0CE0wHe/OtPZ1C9enFgaMaWUuEtgriDwwsXrZhOxACYtzEztNpCVzKHln8XKfGov3Jtn6Sf0EHaTbKPUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:44:11.004346Z","bundle_sha256":"5300d097e656dfd6174a6da02808866d27f257e3454c71c81e80f004f27e50d1"}}