{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XR6HHJBMTA2DVS4XZVFCYXMYKD","short_pith_number":"pith:XR6HHJBM","schema_version":"1.0","canonical_sha256":"bc7c73a42c98343acb97cd4a2c5d9850d326c0d8ad564ee613698e177652cf27","source":{"kind":"arxiv","id":"1709.02999","version":4},"attestation_state":"computed","paper":{"title":"Balancing Communication and Computation in Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Albert S. Berahas, Ermin Wei, Nitish Shirish Keskar, Raghu Bollapragada","submitted_at":"2017-09-09T20:01:14Z","abstract_excerpt":"Methods for distributed optimization have received significant attention in recent years owing to their wide applicability in various domains. A distributed optimization method typically consists of two key components: communication and computation. More specifically, at every iteration (or every several iterations) of a distributed algorithm, each node in the network requires some form of information exchange with its neighboring nodes (communication) and the computation step related to a (sub)-gradient (computation). The standard way of judging an algorithm via only the number of iterations "},"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":"1709.02999","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-09T20:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"1ce8d58675a95cd7b96b494f959b46b2a325b86d5c339ac7273350f8fcf46d93","abstract_canon_sha256":"3341ff6c2c7906d2e6dde8638cfbb16105c9189e3db02056290b120ecb44b95b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:28.768784Z","signature_b64":"8a5G/7XIElZ+omUFtm2ThrGG8EQ7df5dPqWZ/nFB4MUEIGBHKakj98RZEopEBUwLreRZ7C6WIHuSmaYXRodyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7c73a42c98343acb97cd4a2c5d9850d326c0d8ad564ee613698e177652cf27","last_reissued_at":"2026-05-18T00:14:28.768039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:28.768039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing Communication and Computation in Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Albert S. Berahas, Ermin Wei, Nitish Shirish Keskar, Raghu Bollapragada","submitted_at":"2017-09-09T20:01:14Z","abstract_excerpt":"Methods for distributed optimization have received significant attention in recent years owing to their wide applicability in various domains. A distributed optimization method typically consists of two key components: communication and computation. More specifically, at every iteration (or every several iterations) of a distributed algorithm, each node in the network requires some form of information exchange with its neighboring nodes (communication) and the computation step related to a (sub)-gradient (computation). The standard way of judging an algorithm via only the number of iterations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02999","kind":"arxiv","version":4},"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":"1709.02999","created_at":"2026-05-18T00:14:28.768162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02999v4","created_at":"2026-05-18T00:14:28.768162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02999","created_at":"2026-05-18T00:14:28.768162+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR6HHJBMTA2D","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR6HHJBMTA2DVS4X","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR6HHJBM","created_at":"2026-05-18T12:31:56.362134+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/XR6HHJBMTA2DVS4XZVFCYXMYKD","json":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD.json","graph_json":"https://pith.science/api/pith-number/XR6HHJBMTA2DVS4XZVFCYXMYKD/graph.json","events_json":"https://pith.science/api/pith-number/XR6HHJBMTA2DVS4XZVFCYXMYKD/events.json","paper":"https://pith.science/paper/XR6HHJBM"},"agent_actions":{"view_html":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD","download_json":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD.json","view_paper":"https://pith.science/paper/XR6HHJBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02999&json=true","fetch_graph":"https://pith.science/api/pith-number/XR6HHJBMTA2DVS4XZVFCYXMYKD/graph.json","fetch_events":"https://pith.science/api/pith-number/XR6HHJBMTA2DVS4XZVFCYXMYKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD/action/storage_attestation","attest_author":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD/action/author_attestation","sign_citation":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD/action/citation_signature","submit_replication":"https://pith.science/pith/XR6HHJBMTA2DVS4XZVFCYXMYKD/action/replication_record"}},"created_at":"2026-05-18T00:14:28.768162+00:00","updated_at":"2026-05-18T00:14:28.768162+00:00"}