{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GPOM67IMYI52C4SAOFRRWBYEIE","short_pith_number":"pith:GPOM67IM","schema_version":"1.0","canonical_sha256":"33dccf7d0cc23ba1724071631b0704412dd8569eb582fe84ed00be73f9dfdb72","source":{"kind":"arxiv","id":"1811.10751","version":1},"attestation_state":"computed","paper":{"title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Haewon Jeong, Pulkit Grover, Sanghamitra Dutta, Tze Meng Low, Ziqian Bai","submitted_at":"2018-11-27T00:06:47Z","abstract_excerpt":"This paper has two contributions. First, we propose a novel coded matrix multiplication technique called Generalized PolyDot codes that advances on existing methods for coded matrix multiplication under storage and communication constraints. This technique uses \"garbage alignment,\" i.e., aligning computations in coded computing that are not a part of the desired output. Generalized PolyDot codes bridge between Polynomial codes and MatDot codes, trading off between recovery threshold and communication costs. Second, we demonstrate that Generalized PolyDot can be used for training large Deep Neu"},"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":"1811.10751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T00:06:47Z","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"title_canon_sha256":"b2fad57955d875029c5826357e9003f38f15067805032644132512038c7d58b2","abstract_canon_sha256":"28def4c6b9a22f97fbdcc46cfd506dec877ed18bd56889e360d5300b09237ad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.642684Z","signature_b64":"ewcpuGw5LFTDafeu1L77l4fzEiQp27Xfmh47fI/sYkyefsYGRopGbXUXqAd7IAjzMuyOdT0V4G0oNeBdEgxuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33dccf7d0cc23ba1724071631b0704412dd8569eb582fe84ed00be73f9dfdb72","last_reissued_at":"2026-05-17T23:59:47.642177Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.642177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Haewon Jeong, Pulkit Grover, Sanghamitra Dutta, Tze Meng Low, Ziqian Bai","submitted_at":"2018-11-27T00:06:47Z","abstract_excerpt":"This paper has two contributions. First, we propose a novel coded matrix multiplication technique called Generalized PolyDot codes that advances on existing methods for coded matrix multiplication under storage and communication constraints. This technique uses \"garbage alignment,\" i.e., aligning computations in coded computing that are not a part of the desired output. Generalized PolyDot codes bridge between Polynomial codes and MatDot codes, trading off between recovery threshold and communication costs. Second, we demonstrate that Generalized PolyDot can be used for training large Deep Neu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10751","kind":"arxiv","version":1},"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":"1811.10751","created_at":"2026-05-17T23:59:47.642264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10751v1","created_at":"2026-05-17T23:59:47.642264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10751","created_at":"2026-05-17T23:59:47.642264+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPOM67IMYI52","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPOM67IMYI52C4SA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPOM67IM","created_at":"2026-05-18T12:32:25.280505+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":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE","json":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE.json","graph_json":"https://pith.science/api/pith-number/GPOM67IMYI52C4SAOFRRWBYEIE/graph.json","events_json":"https://pith.science/api/pith-number/GPOM67IMYI52C4SAOFRRWBYEIE/events.json","paper":"https://pith.science/paper/GPOM67IM"},"agent_actions":{"view_html":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE","download_json":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE.json","view_paper":"https://pith.science/paper/GPOM67IM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10751&json=true","fetch_graph":"https://pith.science/api/pith-number/GPOM67IMYI52C4SAOFRRWBYEIE/graph.json","fetch_events":"https://pith.science/api/pith-number/GPOM67IMYI52C4SAOFRRWBYEIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE/action/storage_attestation","attest_author":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE/action/author_attestation","sign_citation":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE/action/citation_signature","submit_replication":"https://pith.science/pith/GPOM67IMYI52C4SAOFRRWBYEIE/action/replication_record"}},"created_at":"2026-05-17T23:59:47.642264+00:00","updated_at":"2026-05-17T23:59:47.642264+00:00"}