{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NQZQ3GOU24P7KLEQMUYK5KJTF3","short_pith_number":"pith:NQZQ3GOU","schema_version":"1.0","canonical_sha256":"6c330d99d4d71ff52c906530aea9332ecdb955d297561d352a0ed34ec7d60628","source":{"kind":"arxiv","id":"1808.02240","version":3},"attestation_state":"computed","paper":{"title":"Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","eess.SP","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","submitted_at":"2018-08-07T07:49:25Z","abstract_excerpt":"Distributed gradient descent (DGD) is an efficient way of implementing gradient descent (GD), especially for large data sets, by dividing the computation tasks into smaller subtasks and assigning to different computing servers (CSs) to be executed in parallel. In standard parallel execution, per-iteration waiting time is limited by the execution time of the straggling servers. Coded DGD techniques have been introduced recently, which can tolerate straggling servers via assigning redundant computation tasks to the CSs. In most of the existing DGD schemes, either with coded computation or coded "},"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":"1808.02240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-07T07:49:25Z","cross_cats_sorted":["cs.DC","cs.LG","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"059e0dcc9ff5c4dcf678f97754156a21ba28a3c6e27e3d52f4775435217985bd","abstract_canon_sha256":"856ec4fbb66504c7427e1235d68cd87d1c3bd05ee5a0ab9974373213de002f96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:43.461529Z","signature_b64":"Mce0nKsmThd5CkjoRZ97XZCorM+EecjNibnMAYuktFrdLxHc7k0xjBxckpuRFF0p+hfpjiFTSRmH0uEhDBrXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c330d99d4d71ff52c906530aea9332ecdb955d297561d352a0ed34ec7d60628","last_reissued_at":"2026-05-17T23:59:43.460884Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:43.460884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","eess.SP","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Deniz Gunduz, Emre Ozfatura, Sennur Ulukus","submitted_at":"2018-08-07T07:49:25Z","abstract_excerpt":"Distributed gradient descent (DGD) is an efficient way of implementing gradient descent (GD), especially for large data sets, by dividing the computation tasks into smaller subtasks and assigning to different computing servers (CSs) to be executed in parallel. In standard parallel execution, per-iteration waiting time is limited by the execution time of the straggling servers. Coded DGD techniques have been introduced recently, which can tolerate straggling servers via assigning redundant computation tasks to the CSs. In most of the existing DGD schemes, either with coded computation or coded "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02240","kind":"arxiv","version":3},"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":"1808.02240","created_at":"2026-05-17T23:59:43.460983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02240v3","created_at":"2026-05-17T23:59:43.460983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02240","created_at":"2026-05-17T23:59:43.460983+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQZQ3GOU24P7","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQZQ3GOU24P7KLEQ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQZQ3GOU","created_at":"2026-05-18T12:32:40.477152+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/NQZQ3GOU24P7KLEQMUYK5KJTF3","json":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3.json","graph_json":"https://pith.science/api/pith-number/NQZQ3GOU24P7KLEQMUYK5KJTF3/graph.json","events_json":"https://pith.science/api/pith-number/NQZQ3GOU24P7KLEQMUYK5KJTF3/events.json","paper":"https://pith.science/paper/NQZQ3GOU"},"agent_actions":{"view_html":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3","download_json":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3.json","view_paper":"https://pith.science/paper/NQZQ3GOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02240&json=true","fetch_graph":"https://pith.science/api/pith-number/NQZQ3GOU24P7KLEQMUYK5KJTF3/graph.json","fetch_events":"https://pith.science/api/pith-number/NQZQ3GOU24P7KLEQMUYK5KJTF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3/action/storage_attestation","attest_author":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3/action/author_attestation","sign_citation":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3/action/citation_signature","submit_replication":"https://pith.science/pith/NQZQ3GOU24P7KLEQMUYK5KJTF3/action/replication_record"}},"created_at":"2026-05-17T23:59:43.460983+00:00","updated_at":"2026-05-17T23:59:43.460983+00:00"}