{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LEDK4TDZEOEGCCOTKHA6VDC3YA","short_pith_number":"pith:LEDK4TDZ","schema_version":"1.0","canonical_sha256":"5906ae4c7923886109d351c1ea8c5bc015cf70d4982b7aa4dc9bda84536b341d","source":{"kind":"arxiv","id":"1806.00939","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.00939","created_at":"2026-05-17T23:49:43.740525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00939v4","created_at":"2026-05-17T23:49:43.740525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00939","created_at":"2026-05-17T23:49:43.740525+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEDK4TDZEOEG","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEDK4TDZEOEGCCOT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEDK4TDZ","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05965","citing_title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA","json":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA.json","graph_json":"https://pith.science/api/pith-number/LEDK4TDZEOEGCCOTKHA6VDC3YA/graph.json","events_json":"https://pith.science/api/pith-number/LEDK4TDZEOEGCCOTKHA6VDC3YA/events.json","paper":"https://pith.science/paper/LEDK4TDZ"},"agent_actions":{"view_html":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA","download_json":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA.json","view_paper":"https://pith.science/paper/LEDK4TDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00939&json=true","fetch_graph":"https://pith.science/api/pith-number/LEDK4TDZEOEGCCOTKHA6VDC3YA/graph.json","fetch_events":"https://pith.science/api/pith-number/LEDK4TDZEOEGCCOTKHA6VDC3YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/action/storage_attestation","attest_author":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/action/author_attestation","sign_citation":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/action/citation_signature","submit_replication":"https://pith.science/pith/LEDK4TDZEOEGCCOTKHA6VDC3YA/action/replication_record"}},"created_at":"2026-05-17T23:49:43.740525+00:00","updated_at":"2026-05-17T23:49:43.740525+00:00"}