{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ROJ37I5DMJFAHOVWRPE6XRCEGQ","short_pith_number":"pith:ROJ37I5D","schema_version":"1.0","canonical_sha256":"8b93bfa3a3624a03bab68bc9ebc4443409425cbaf5228eddc9a1e2922ffe4b93","source":{"kind":"arxiv","id":"1704.05181","version":1},"attestation_state":"computed","paper":{"title":"\"Short-Dot\": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Sanghamitra Dutta, Viveck Cadambe","submitted_at":"2017-04-18T02:45:30Z","abstract_excerpt":"Faced with saturation of Moore's law and increasing dimension of data, system designers have increasingly resorted to parallel and distributed computing. However, distributed computing is often bottle necked by a small fraction of slow processors called \"stragglers\" that reduce the speed of computation because the fusion node has to wait for all processors to finish. To combat the effect of stragglers, recent literature introduces redundancy in computations across processors, e.g.,~using repetition-based strategies or erasure codes. The fusion node can exploit this redundancy by completing the"},"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":"1704.05181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T02:45:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a194329a6ea3eb54f514abd5f8469fca8c0c967407029700849dfe0278a4424","abstract_canon_sha256":"d140e9aa1cec0b967d34a0294ebba83612f75dc1e1773dabacb0644ff409db2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:11.628122Z","signature_b64":"umQFz9EhFRoJlsp05n2+WEvwj+2S/B08IaUyIor6rBd6DMuVDidhFb1MLO36/iK/lSYhR7Lwi/bxv3YIxaUxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b93bfa3a3624a03bab68bc9ebc4443409425cbaf5228eddc9a1e2922ffe4b93","last_reissued_at":"2026-05-18T00:46:11.627669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:11.627669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Short-Dot\": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Sanghamitra Dutta, Viveck Cadambe","submitted_at":"2017-04-18T02:45:30Z","abstract_excerpt":"Faced with saturation of Moore's law and increasing dimension of data, system designers have increasingly resorted to parallel and distributed computing. However, distributed computing is often bottle necked by a small fraction of slow processors called \"stragglers\" that reduce the speed of computation because the fusion node has to wait for all processors to finish. To combat the effect of stragglers, recent literature introduces redundancy in computations across processors, e.g.,~using repetition-based strategies or erasure codes. The fusion node can exploit this redundancy by completing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05181","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":"1704.05181","created_at":"2026-05-18T00:46:11.627741+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05181v1","created_at":"2026-05-18T00:46:11.627741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05181","created_at":"2026-05-18T00:46:11.627741+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROJ37I5DMJFA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROJ37I5DMJFAHOVW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROJ37I5D","created_at":"2026-05-18T12:31:39.905425+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ","json":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ.json","graph_json":"https://pith.science/api/pith-number/ROJ37I5DMJFAHOVWRPE6XRCEGQ/graph.json","events_json":"https://pith.science/api/pith-number/ROJ37I5DMJFAHOVWRPE6XRCEGQ/events.json","paper":"https://pith.science/paper/ROJ37I5D"},"agent_actions":{"view_html":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ","download_json":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ.json","view_paper":"https://pith.science/paper/ROJ37I5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05181&json=true","fetch_graph":"https://pith.science/api/pith-number/ROJ37I5DMJFAHOVWRPE6XRCEGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ROJ37I5DMJFAHOVWRPE6XRCEGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ/action/storage_attestation","attest_author":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ/action/author_attestation","sign_citation":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ/action/citation_signature","submit_replication":"https://pith.science/pith/ROJ37I5DMJFAHOVWRPE6XRCEGQ/action/replication_record"}},"created_at":"2026-05-18T00:46:11.627741+00:00","updated_at":"2026-05-18T00:46:11.627741+00:00"}