{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GPLOGFPREDPALMNKUB4FF2BHCM","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":"c7abb211c52c3a6240f31cf9a89d6e4f62a321dd602dec8cc41d0ec5e8a56fb0","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:34:59Z","title_canon_sha256":"d2fe8282d9cb5631e310900c2f131fa58b2fb4428250dde8fcdb80127857209a"},"schema_version":"1.0","source":{"id":"1801.07487","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07487","created_at":"2026-07-05T00:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07487v5","created_at":"2026-07-05T00:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07487","created_at":"2026-07-05T00:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"GPLOGFPREDPA","created_at":"2026-07-05T00:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"GPLOGFPREDPALMNK","created_at":"2026-07-05T00:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"GPLOGFPR","created_at":"2026-07-05T00:54:00Z"}],"graph_snapshots":[{"event_id":"sha256:846f0eca170d80d86bd31a1a099001407b2c5f223cdba034a91524931df3a5e2","target":"graph","created_at":"2026-07-05T00:54:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1801.07487/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers' delay performance bottleneck, which is due to the unpredictable latency in waiting for slowest nodes (or stragglers) to finish their tasks. We propose a novel coding strategy, named \\emph{entangled polynomial code}, for designing the intermediate computations at the worker nodes in order to minimize the recovery threshold (i.e., the number of workers that we need to wait for in order to compu","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:34:59Z","title":"Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07487","kind":"arxiv","version":5},"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:ad51b66db2e112ccc578687ad0e7a8cb53b551756e4d5b2724b8d62d8fe31824","target":"record","created_at":"2026-07-05T00:54:00Z","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":"c7abb211c52c3a6240f31cf9a89d6e4f62a321dd602dec8cc41d0ec5e8a56fb0","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:34:59Z","title_canon_sha256":"d2fe8282d9cb5631e310900c2f131fa58b2fb4428250dde8fcdb80127857209a"},"schema_version":"1.0","source":{"id":"1801.07487","kind":"arxiv","version":5}},"canonical_sha256":"33d6e315f120de05b1aaa07852e82713129d377b62d97d8f8c9573f3e9542c9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d6e315f120de05b1aaa07852e82713129d377b62d97d8f8c9573f3e9542c9f","first_computed_at":"2026-07-05T00:54:00.206902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:00.206902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YszxasDflx9tJeEqmwsI6vuqMcG1aOp4kaz4V4CG3ZYazcz0vAYshueXk/wjuztFMMsy63elpEwAhWBTRKckDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:00.207273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07487","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad51b66db2e112ccc578687ad0e7a8cb53b551756e4d5b2724b8d62d8fe31824","sha256:846f0eca170d80d86bd31a1a099001407b2c5f223cdba034a91524931df3a5e2"],"state_sha256":"43d9e43b5abb0a02b5d0b5a4baa3eba00730a22c6cbaa3ddbc5d91716107bf02"}