{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WF4B5Y5HUC5NPBYF7RHPFTGG74","short_pith_number":"pith:WF4B5Y5H","schema_version":"1.0","canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","source":{"kind":"arxiv","id":"1805.08327","version":2},"attestation_state":"computed","paper":{"title":"Robust Gradient Descent via Moment Encoding with LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ankit Singh Rawat, Arya Mazumdar, Raj Kumar Maity","submitted_at":"2018-05-22T00:02:47Z","abstract_excerpt":"This paper considers the problem of implementing large-scale gradient descent algorithms in a distributed computing setting in the presence of {\\em straggling} processors. To mitigate the effect of the stragglers, it has been previously proposed to encode the data with an erasure-correcting code and decode at the master server at the end of the computation. We, instead, propose to encode the second-moment of the data with a low density parity-check (LDPC) code. The iterative decoding algorithms for LDPC codes have very low computational overhead and the number of decoding iterations can be mad"},"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":"1805.08327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-22T00:02:47Z","cross_cats_sorted":["cs.DC","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6df5e24c957f624a29120409412f2bc03ae0692dc184bb4c44089b5cc656c258","abstract_canon_sha256":"f380b399d7b6ccbc03cd98540bd5af1703de1c5a736fb54212da49af1409fbdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:02.918097Z","signature_b64":"97k3fJvvavP2oMjgu6QDSNKl8eUBt2htJ4RdCg7SvPJVUXa9H7ARz+Yo1OJGcgkCYT3+Z5NNMrnUXw64OHk+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","last_reissued_at":"2026-05-17T23:57:02.917555Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:02.917555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Gradient Descent via Moment Encoding with LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ankit Singh Rawat, Arya Mazumdar, Raj Kumar Maity","submitted_at":"2018-05-22T00:02:47Z","abstract_excerpt":"This paper considers the problem of implementing large-scale gradient descent algorithms in a distributed computing setting in the presence of {\\em straggling} processors. To mitigate the effect of the stragglers, it has been previously proposed to encode the data with an erasure-correcting code and decode at the master server at the end of the computation. We, instead, propose to encode the second-moment of the data with a low density parity-check (LDPC) code. The iterative decoding algorithms for LDPC codes have very low computational overhead and the number of decoding iterations can be mad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08327","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":"1805.08327","created_at":"2026-05-17T23:57:02.917650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08327v2","created_at":"2026-05-17T23:57:02.917650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08327","created_at":"2026-05-17T23:57:02.917650+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF4B5Y5HUC5N","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF4B5Y5HUC5NPBYF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF4B5Y5H","created_at":"2026-05-18T12:32:59.047623+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/WF4B5Y5HUC5NPBYF7RHPFTGG74","json":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74.json","graph_json":"https://pith.science/api/pith-number/WF4B5Y5HUC5NPBYF7RHPFTGG74/graph.json","events_json":"https://pith.science/api/pith-number/WF4B5Y5HUC5NPBYF7RHPFTGG74/events.json","paper":"https://pith.science/paper/WF4B5Y5H"},"agent_actions":{"view_html":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74","download_json":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74.json","view_paper":"https://pith.science/paper/WF4B5Y5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08327&json=true","fetch_graph":"https://pith.science/api/pith-number/WF4B5Y5HUC5NPBYF7RHPFTGG74/graph.json","fetch_events":"https://pith.science/api/pith-number/WF4B5Y5HUC5NPBYF7RHPFTGG74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/action/storage_attestation","attest_author":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/action/author_attestation","sign_citation":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/action/citation_signature","submit_replication":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/action/replication_record"}},"created_at":"2026-05-17T23:57:02.917650+00:00","updated_at":"2026-05-17T23:57:02.917650+00:00"}