{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GQFWZCCBWPCDDVUPX54WCYVMWP","short_pith_number":"pith:GQFWZCCB","schema_version":"1.0","canonical_sha256":"340b6c8841b3c431d68fbf796162acb3ef8665a82491fb27df31880484d8eb26","source":{"kind":"arxiv","id":"1403.0603","version":2},"attestation_state":"computed","paper":{"title":"Efficient Distributed Online Prediction and Stochastic Optimization with Approximate Distributed Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","submitted_at":"2014-03-03T21:32:53Z","abstract_excerpt":"We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate in order to aggregate information and synchronize their decision variables. Synchronization is accomplished through the use of a distributed averaging protocol. When an exact distributed averaging protocol is used, it is known that the optimal regret bound of $\\mathcal{O}(\\sqrt{m})$ can be achieved using the distributed mini-batch algorithm of Dekel et al. (2012), where $m$ is the total number of samples processed a"},"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":"1403.0603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-03T21:32:53Z","cross_cats_sorted":["cs.DC","cs.SY","math.IT","math.OC"],"title_canon_sha256":"487923b6c6a9d314d48fcc6b3879d87a757b6ae148f7704f2566cb5b5d8cd1ae","abstract_canon_sha256":"6480d8e7ac1fe7579d80b87fe4c0b46d297025e284599161300d02647ec36088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:06.097481Z","signature_b64":"kJt1+SLoa12YwdMxnkxD0AVDbyMDM7ySL5P5IjC9R+QJY83jbGqRBNPHa97c6W/TUUqv+LzBGfAg3u4h+51TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"340b6c8841b3c431d68fbf796162acb3ef8665a82491fb27df31880484d8eb26","last_reissued_at":"2026-05-18T02:57:06.096799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:06.096799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Distributed Online Prediction and Stochastic Optimization with Approximate Distributed Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","submitted_at":"2014-03-03T21:32:53Z","abstract_excerpt":"We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate in order to aggregate information and synchronize their decision variables. Synchronization is accomplished through the use of a distributed averaging protocol. When an exact distributed averaging protocol is used, it is known that the optimal regret bound of $\\mathcal{O}(\\sqrt{m})$ can be achieved using the distributed mini-batch algorithm of Dekel et al. (2012), where $m$ is the total number of samples processed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0603","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":""},"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":"1403.0603","created_at":"2026-05-18T02:57:06.096903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0603v2","created_at":"2026-05-18T02:57:06.096903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0603","created_at":"2026-05-18T02:57:06.096903+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQFWZCCBWPCD","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQFWZCCBWPCDDVUP","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQFWZCCB","created_at":"2026-05-18T12:28:30.664211+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/GQFWZCCBWPCDDVUPX54WCYVMWP","json":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP.json","graph_json":"https://pith.science/api/pith-number/GQFWZCCBWPCDDVUPX54WCYVMWP/graph.json","events_json":"https://pith.science/api/pith-number/GQFWZCCBWPCDDVUPX54WCYVMWP/events.json","paper":"https://pith.science/paper/GQFWZCCB"},"agent_actions":{"view_html":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP","download_json":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP.json","view_paper":"https://pith.science/paper/GQFWZCCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0603&json=true","fetch_graph":"https://pith.science/api/pith-number/GQFWZCCBWPCDDVUPX54WCYVMWP/graph.json","fetch_events":"https://pith.science/api/pith-number/GQFWZCCBWPCDDVUPX54WCYVMWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP/action/storage_attestation","attest_author":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP/action/author_attestation","sign_citation":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP/action/citation_signature","submit_replication":"https://pith.science/pith/GQFWZCCBWPCDDVUPX54WCYVMWP/action/replication_record"}},"created_at":"2026-05-18T02:57:06.096903+00:00","updated_at":"2026-05-18T02:57:06.096903+00:00"}