{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LEDK4TDZEOEGCCOTKHA6VDC3YA","short_pith_number":"pith:LEDK4TDZ","canonical_record":{"source":{"id":"1806.00939","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T03:26:22Z","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"title_canon_sha256":"717ab1558ecde2d4e190ccde8d6ac9170c3f6185db51bd969fad91c93f05e1d8","abstract_canon_sha256":"4d8a54cb463651b876b1c1d3e37c6cefe11ee8e16924fa6606594c3d7d737565"},"schema_version":"1.0"},"canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","source":{"kind":"arxiv","id":"1806.00939","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00939","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00939v4","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00939","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"pith_short_12","alias_value":"LEDK4TDZEOEG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEDK4TDZEOEGCCOT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEDK4TDZ","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LEDK4TDZEOEGCCOTKHA6VDC3YA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00939","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T03:26:22Z","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"title_canon_sha256":"717ab1558ecde2d4e190ccde8d6ac9170c3f6185db51bd969fad91c93f05e1d8","abstract_canon_sha256":"4d8a54cb463651b876b1c1d3e37c6cefe11ee8e16924fa6606594c3d7d737565"},"schema_version":"1.0"},"canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:43.740979Z","signature_b64":"o0lF0es/Qn4a9EjybUPAGOYNsDL5Wmr6xoP/01C3OayKPHUbn0oTUboWnIdhuhnPyGzAUyZ1fgB0oMg0ddAwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","last_reissued_at":"2026-05-17T23:49:43.740418Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:43.740418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00939","source_version":4,"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:49:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPrhOEexhBA+pPUMCMjgZDN6EeFzMi4clO8tVYslA4vGMOn/zfO1d5INbHzC4IGvgsqmN/YWCXxE/bXCY2vwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:37:46.403592Z"},"content_sha256":"5949510a6888454fc3ece14a45085778d50926c0727cbb7c2b212e30219377ad","schema_version":"1.0","event_id":"sha256:5949510a6888454fc3ece14a45085778d50926c0727cbb7c2b212e30219377ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LEDK4TDZEOEGCCOTKHA6VDC3YA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Soltanolkotabi, Netanel Raviv, Qian Yu, Salman Avestimehr, Seyed Mohammadreza Mousavi Kalan, Songze Li","submitted_at":"2018-06-04T03:26:22Z","abstract_excerpt":"We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms. We propose Lagrange Coded Computing (LCC), a new framework to simultaneously provide (1) resiliency against stragglers that may prolong computations; (2) security against Byzantine (or malicious) workers that deliberately modify the computation for their benefit; and (3) (information-theoretic) privacy of the dataset amidst possible collusion of workers. LCC, which leverages the well-known Lagrange polynomial to create compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00939","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"},"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:49:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaflAyLf+aR8V94Yx0AQEVEfdI4ORSIM6a0llOd+NTMfboaUKWBKTO8tMYWprG/MqEss3WQQdqd+pVspMUzSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:37:46.404279Z"},"content_sha256":"aba8590763a3d56e53320d52b5f132f566b9b188750192ed6eeadd8919ec9dfa","schema_version":"1.0","event_id":"sha256:aba8590763a3d56e53320d52b5f132f566b9b188750192ed6eeadd8919ec9dfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/bundle.json","state_url":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/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-25T13:37:46Z","links":{"resolver":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA","bundle":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/bundle.json","state":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LEDK4TDZEOEGCCOTKHA6VDC3YA","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":"4d8a54cb463651b876b1c1d3e37c6cefe11ee8e16924fa6606594c3d7d737565","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T03:26:22Z","title_canon_sha256":"717ab1558ecde2d4e190ccde8d6ac9170c3f6185db51bd969fad91c93f05e1d8"},"schema_version":"1.0","source":{"id":"1806.00939","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00939","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00939v4","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00939","created_at":"2026-05-17T23:49:43Z"},{"alias_kind":"pith_short_12","alias_value":"LEDK4TDZEOEG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEDK4TDZEOEGCCOT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEDK4TDZ","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:aba8590763a3d56e53320d52b5f132f566b9b188750192ed6eeadd8919ec9dfa","target":"graph","created_at":"2026-05-17T23:49:43Z","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":"We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms. We propose Lagrange Coded Computing (LCC), a new framework to simultaneously provide (1) resiliency against stragglers that may prolong computations; (2) security against Byzantine (or malicious) workers that deliberately modify the computation for their benefit; and (3) (information-theoretic) privacy of the dataset amidst possible collusion of workers. LCC, which leverages the well-known Lagrange polynomial to create compu","authors_text":"Mahdi Soltanolkotabi, Netanel Raviv, Qian Yu, Salman Avestimehr, Seyed Mohammadreza Mousavi Kalan, Songze Li","cross_cats":["cs.DC","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T03:26:22Z","title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00939","kind":"arxiv","version":4},"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:5949510a6888454fc3ece14a45085778d50926c0727cbb7c2b212e30219377ad","target":"record","created_at":"2026-05-17T23:49:43Z","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":"4d8a54cb463651b876b1c1d3e37c6cefe11ee8e16924fa6606594c3d7d737565","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T03:26:22Z","title_canon_sha256":"717ab1558ecde2d4e190ccde8d6ac9170c3f6185db51bd969fad91c93f05e1d8"},"schema_version":"1.0","source":{"id":"1806.00939","kind":"arxiv","version":4}},"canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","first_computed_at":"2026-05-17T23:49:43.740418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:43.740418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o0lF0es/Qn4a9EjybUPAGOYNsDL5Wmr6xoP/01C3OayKPHUbn0oTUboWnIdhuhnPyGzAUyZ1fgB0oMg0ddAwCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:43.740979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00939","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5949510a6888454fc3ece14a45085778d50926c0727cbb7c2b212e30219377ad","sha256:aba8590763a3d56e53320d52b5f132f566b9b188750192ed6eeadd8919ec9dfa"],"state_sha256":"f8075d952da68c10beb5e0757fa3b4d0f770fe7020eed71241c3b3b5076e6da8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iz8ONNwl1mbMc0gst1/DpAO9gVmJU7uQVJJe86d3VudG6v9UOO/sAh5zD+Y98oSnituEff81XyB53zPbMxZJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:37:46.407622Z","bundle_sha256":"71e09ae5ca8f57e9a0cc7b588f7b9061f0a4fda0df04de426429945f96da5fbc"}}