{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FL64X4TSUH4Q33GFACODKMEO2U","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":"f60ccf7c2e624b373df802989c9f341ba377da7a22c156de5685d5a96e1bfe4f","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-25T20:31:01Z","title_canon_sha256":"ca73c68c662e50fceb5f678aaff1facedc4c0f0fd19f8b70caa7e4d5941d93b3"},"schema_version":"1.0","source":{"id":"1804.09791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09791","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09791v1","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09791","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"FL64X4TSUH4Q","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FL64X4TSUH4Q33GF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FL64X4TS","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:44404fd3d6c405958bdc3e9345db5203669bba224a96fe3badbd525dfdc47e3f","target":"graph","created_at":"2026-05-18T00:17:27Z","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":"In large scale distributed linear transform problems, coded computation plays an important role to effectively deal with \"stragglers\" (distributed computations that may get delayed due to few slow or faulty processors). We propose a coded computation strategy, referred to as diagonal code, that achieves the optimum recovery threshold and the optimum computation load. This is the first code that simultaneously achieves two-fold optimality in coded distributed linear transforms. Furthermore, by leveraging the idea from random proposal graph theory, we design two random codes that can guarantee o","authors_text":"Jiashang Liu, Ness Shroff, Pengyu Yang, Sinong Wang","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-25T20:31:01Z","title":"Fundamental Limits of Coded Linear Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09791","kind":"arxiv","version":1},"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:87611d090e387119a28242708fba704a86ca11db37e865eff6ec6baa444fd18d","target":"record","created_at":"2026-05-18T00:17:27Z","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":"f60ccf7c2e624b373df802989c9f341ba377da7a22c156de5685d5a96e1bfe4f","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-25T20:31:01Z","title_canon_sha256":"ca73c68c662e50fceb5f678aaff1facedc4c0f0fd19f8b70caa7e4d5941d93b3"},"schema_version":"1.0","source":{"id":"1804.09791","kind":"arxiv","version":1}},"canonical_sha256":"2afdcbf272a1f90decc5009c35308ed509829d47a3bdcdcc254c7e06e3cbe7a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afdcbf272a1f90decc5009c35308ed509829d47a3bdcdcc254c7e06e3cbe7a2","first_computed_at":"2026-05-18T00:17:27.909771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:27.909771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ItmRW7NkmvOixFqBvLvRHFxttu6Ev4UTnEWQEfT+MHSf0BeUIEfyyPOcMTPLL2DWocDx1SmM6aellh1Ppq6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:27.910377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87611d090e387119a28242708fba704a86ca11db37e865eff6ec6baa444fd18d","sha256:44404fd3d6c405958bdc3e9345db5203669bba224a96fe3badbd525dfdc47e3f"],"state_sha256":"1e796e8fdc67339774d9ef752657af4bf35b668f89bca86389bbc3f092396976"}