{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZKATXFWZHENH4S6QWKDOBBA7XD","short_pith_number":"pith:ZKATXFWZ","schema_version":"1.0","canonical_sha256":"ca813b96d9391a7e4bd0b286e0841fb8daabb427ceab6b78ec3031619f8d34d1","source":{"kind":"arxiv","id":"2411.16477","version":1},"attestation_state":"computed","paper":{"title":"Distributed Online Optimization with Stochastic Agent Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Qiu, Juliette Achddou, Nicol\\`o Cesa-Bianchi","submitted_at":"2024-11-25T15:20:01Z","abstract_excerpt":"Motivated by practical federated learning settings where clients may not be always available, we investigate a variant of distributed online optimization where agents are active with a known probability $p$ at each time step, and communication between neighboring agents can only take place if they are both active. We introduce a distributed variant of the FTRL algorithm and analyze its network regret, defined through the average of the instantaneous regret of the active agents. Our analysis shows that, for any connected communication graph $G$ over $N$ agents, the expected network regret of ou"},"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":"2411.16477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-25T15:20:01Z","cross_cats_sorted":[],"title_canon_sha256":"80846d888e021643b674571f8702b3111db787d7163b0a4f3150a4c55250f234","abstract_canon_sha256":"8cb040c90cded83f45081fc3f749bfa057ad495511ae013d957b661ed9fc5731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:10.019928Z","signature_b64":"16VY/RodVp4M0bd6DG/RTJa5AVrt6EsQzVucK5ga4q2hAF5VKop4v24YJ1NeYOduLb7a1fz0GvlxNoz0EsG1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca813b96d9391a7e4bd0b286e0841fb8daabb427ceab6b78ec3031619f8d34d1","last_reissued_at":"2026-07-05T09:40:10.019472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:10.019472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Online Optimization with Stochastic Agent Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Qiu, Juliette Achddou, Nicol\\`o Cesa-Bianchi","submitted_at":"2024-11-25T15:20:01Z","abstract_excerpt":"Motivated by practical federated learning settings where clients may not be always available, we investigate a variant of distributed online optimization where agents are active with a known probability $p$ at each time step, and communication between neighboring agents can only take place if they are both active. We introduce a distributed variant of the FTRL algorithm and analyze its network regret, defined through the average of the instantaneous regret of the active agents. Our analysis shows that, for any connected communication graph $G$ over $N$ agents, the expected network regret of ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16477","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/2411.16477/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":"2411.16477","created_at":"2026-07-05T09:40:10.019526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16477v1","created_at":"2026-07-05T09:40:10.019526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16477","created_at":"2026-07-05T09:40:10.019526+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKATXFWZHENH","created_at":"2026-07-05T09:40:10.019526+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKATXFWZHENH4S6Q","created_at":"2026-07-05T09:40:10.019526+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKATXFWZ","created_at":"2026-07-05T09:40:10.019526+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27831","citing_title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD","json":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD.json","graph_json":"https://pith.science/api/pith-number/ZKATXFWZHENH4S6QWKDOBBA7XD/graph.json","events_json":"https://pith.science/api/pith-number/ZKATXFWZHENH4S6QWKDOBBA7XD/events.json","paper":"https://pith.science/paper/ZKATXFWZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD","download_json":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD.json","view_paper":"https://pith.science/paper/ZKATXFWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16477&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKATXFWZHENH4S6QWKDOBBA7XD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKATXFWZHENH4S6QWKDOBBA7XD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD/action/storage_attestation","attest_author":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD/action/author_attestation","sign_citation":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD/action/citation_signature","submit_replication":"https://pith.science/pith/ZKATXFWZHENH4S6QWKDOBBA7XD/action/replication_record"}},"created_at":"2026-07-05T09:40:10.019526+00:00","updated_at":"2026-07-05T09:40:10.019526+00:00"}