{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WF4B5Y5HUC5NPBYF7RHPFTGG74","short_pith_number":"pith:WF4B5Y5H","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"},"canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","source":{"kind":"arxiv","id":"1805.08327","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08327","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08327v2","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08327","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"WF4B5Y5HUC5N","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WF4B5Y5HUC5NPBYF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WF4B5Y5H","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WF4B5Y5HUC5NPBYF7RHPFTGG74","target":"record","payload":{"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"},"canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","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"},"source_kind":"arxiv","source_id":"1805.08327","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acqoqCs1bl6tnrwUKyamkAcclclCTdvhGFmRRQbKSulDxWKu0Vh31gwxAWwXeg0Aji3C2glW20XmQZm183M/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:29.425153Z"},"content_sha256":"7cef90882f6e775d8abfbdbe4b1cb488fd58eab8283b88e47d8e48cb76d31d67","schema_version":"1.0","event_id":"sha256:7cef90882f6e775d8abfbdbe4b1cb488fd58eab8283b88e47d8e48cb76d31d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WF4B5Y5HUC5NPBYF7RHPFTGG74","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kf4xb5hOq+H2ue31RMh/WGqM5Pl44IqHaWUo42cHpHysXkOseJxvc5AEK0p/6OUqwIuT4js7adObfOKFupqFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:29.425523Z"},"content_sha256":"8eb5b391a96184864660410ada7ee51ce47a8838fe1dbfb2261a44465cf772b3","schema_version":"1.0","event_id":"sha256:8eb5b391a96184864660410ada7ee51ce47a8838fe1dbfb2261a44465cf772b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/bundle.json","state_url":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:43:29Z","links":{"resolver":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74","bundle":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/bundle.json","state":"https://pith.science/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WF4B5Y5HUC5NPBYF7RHPFTGG74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WF4B5Y5HUC5NPBYF7RHPFTGG74","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f380b399d7b6ccbc03cd98540bd5af1703de1c5a736fb54212da49af1409fbdf","cross_cats_sorted":["cs.DC","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-22T00:02:47Z","title_canon_sha256":"6df5e24c957f624a29120409412f2bc03ae0692dc184bb4c44089b5cc656c258"},"schema_version":"1.0","source":{"id":"1805.08327","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08327","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08327v2","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08327","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"WF4B5Y5HUC5N","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WF4B5Y5HUC5NPBYF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WF4B5Y5H","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:8eb5b391a96184864660410ada7ee51ce47a8838fe1dbfb2261a44465cf772b3","target":"graph","created_at":"2026-05-17T23:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ankit Singh Rawat, Arya Mazumdar, Raj Kumar Maity","cross_cats":["cs.DC","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-22T00:02:47Z","title":"Robust Gradient Descent via Moment Encoding with LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08327","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7cef90882f6e775d8abfbdbe4b1cb488fd58eab8283b88e47d8e48cb76d31d67","target":"record","created_at":"2026-05-17T23:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f380b399d7b6ccbc03cd98540bd5af1703de1c5a736fb54212da49af1409fbdf","cross_cats_sorted":["cs.DC","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-22T00:02:47Z","title_canon_sha256":"6df5e24c957f624a29120409412f2bc03ae0692dc184bb4c44089b5cc656c258"},"schema_version":"1.0","source":{"id":"1805.08327","kind":"arxiv","version":2}},"canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1781ee3a7a0bad78705fc4ef2ccc6ff095a31d2d50e3e954ae56dad10784c04","first_computed_at":"2026-05-17T23:57:02.917555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:02.917555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"97k3fJvvavP2oMjgu6QDSNKl8eUBt2htJ4RdCg7SvPJVUXa9H7ARz+Yo1OJGcgkCYT3+Z5NNMrnUXw64OHk+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:02.918097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08327","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cef90882f6e775d8abfbdbe4b1cb488fd58eab8283b88e47d8e48cb76d31d67","sha256:8eb5b391a96184864660410ada7ee51ce47a8838fe1dbfb2261a44465cf772b3"],"state_sha256":"1d67b8be1fda9f264e9b7dc295c10d9d3ed807ba53b62e1d750c4c89e85a8046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGhvP+qM2OOJciuCcaI9iMoiuwV2H6Em7ZY+UgAKMfhqDDzw8VtduJTt5DcyHjraXfZdVxMweuwgXG5kdl9VAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:43:29.428340Z","bundle_sha256":"ac46feb486676829cfe9d29279149e1d0af25803367bac0645206d12a9bb3b3f"}}