{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2Q4G2WHMP44C7KLSZTFF22I5MD","short_pith_number":"pith:2Q4G2WHM","canonical_record":{"source":{"id":"1903.08326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-20T03:24:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b41f28316727e2cf0a442a7679bf3aaf748b446be7728b1f417fd37272a334d","abstract_canon_sha256":"45932bcf6752b8fc95c7e971b06b2dae9a4de4654a6b21f895227e665200099e"},"schema_version":"1.0"},"canonical_sha256":"d4386d58ec7f382fa972ccca5d691d60e5a41ab02a9c655cfefb61f45c4d1b7a","source":{"kind":"arxiv","id":"1903.08326","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08326","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08326v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08326","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"2Q4G2WHMP44C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2Q4G2WHMP44C7KLS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2Q4G2WHM","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2Q4G2WHMP44C7KLSZTFF22I5MD","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-20T03:24:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b41f28316727e2cf0a442a7679bf3aaf748b446be7728b1f417fd37272a334d","abstract_canon_sha256":"45932bcf6752b8fc95c7e971b06b2dae9a4de4654a6b21f895227e665200099e"},"schema_version":"1.0"},"canonical_sha256":"d4386d58ec7f382fa972ccca5d691d60e5a41ab02a9c655cfefb61f45c4d1b7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:22.324600Z","signature_b64":"o3GuKiVbc2IneGtFC0W1O2T5ih+87E7+jTv9n1sigiQ+I9E72LkdDejlGSFf8jY2xM2B1YJOwQhAwpHMvqitCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4386d58ec7f382fa972ccca5d691d60e5a41ab02a9c655cfefb61f45c4d1b7a","last_reissued_at":"2026-05-17T23:45:22.324142Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:22.324142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08326","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LKr0dJFDw/8BpNucVlbtPBefw9aXcPD3VL/HUJATNf9AVu3gX2E/9yY6Xqbg2/p3SLWWygP7nZ0IoBPmrYqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:44:10.488543Z"},"content_sha256":"20668fd65df46a52a4e77322db8cfc64e34d804a4141b0aeeb7ac9812150c568","schema_version":"1.0","event_id":"sha256:20668fd65df46a52a4e77322db8cfc64e34d804a4141b0aeeb7ac9812150c568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2Q4G2WHMP44C7KLSZTFF22I5MD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numerically Stable Polynomially Coded Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Fahim, Viveck R. Cadambe","submitted_at":"2019-03-20T03:24:53Z","abstract_excerpt":"We study the numerical stability of polynomial based encoding methods, which has emerged to be a powerful class of techniques for providing straggler and fault tolerance in the area of coded computing. Our contributions are as follows: 1) We construct new codes for matrix multiplication that achieve the same fault/straggler tolerance as the previously constructed MatDot Codes and Polynomial Codes. Unlike previous codes that use polynomials expanded in a monomial basis, our codes uses a basis of orthogonal polynomials. 2) We show that the condition number of every $m \\times m$ sub-matrix of an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08326","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jf8ZyDI9O76tFU52/9T7I0SfszGyfI8mw0bPy3urNbIHsXQryk7l739FpRqKDKY6Y/PK/zFvI4C1egjXqsNVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:44:10.488881Z"},"content_sha256":"c1b6b7cc56c763b91977e6c3fecf3cbbe8e7ba9f5d35792a4008d41d7ff8d579","schema_version":"1.0","event_id":"sha256:c1b6b7cc56c763b91977e6c3fecf3cbbe8e7ba9f5d35792a4008d41d7ff8d579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/bundle.json","state_url":"https://pith.science/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:44:10Z","links":{"resolver":"https://pith.science/pith/2Q4G2WHMP44C7KLSZTFF22I5MD","bundle":"https://pith.science/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/bundle.json","state":"https://pith.science/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Q4G2WHMP44C7KLSZTFF22I5MD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2Q4G2WHMP44C7KLSZTFF22I5MD","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":"45932bcf6752b8fc95c7e971b06b2dae9a4de4654a6b21f895227e665200099e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-20T03:24:53Z","title_canon_sha256":"7b41f28316727e2cf0a442a7679bf3aaf748b446be7728b1f417fd37272a334d"},"schema_version":"1.0","source":{"id":"1903.08326","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08326","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08326v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08326","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"2Q4G2WHMP44C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2Q4G2WHMP44C7KLS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2Q4G2WHM","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:c1b6b7cc56c763b91977e6c3fecf3cbbe8e7ba9f5d35792a4008d41d7ff8d579","target":"graph","created_at":"2026-05-17T23:45:22Z","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":"We study the numerical stability of polynomial based encoding methods, which has emerged to be a powerful class of techniques for providing straggler and fault tolerance in the area of coded computing. Our contributions are as follows: 1) We construct new codes for matrix multiplication that achieve the same fault/straggler tolerance as the previously constructed MatDot Codes and Polynomial Codes. Unlike previous codes that use polynomials expanded in a monomial basis, our codes uses a basis of orthogonal polynomials. 2) We show that the condition number of every $m \\times m$ sub-matrix of an ","authors_text":"Mohammad Fahim, Viveck R. Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-20T03:24:53Z","title":"Numerically Stable Polynomially Coded Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08326","kind":"arxiv","version":2},"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:20668fd65df46a52a4e77322db8cfc64e34d804a4141b0aeeb7ac9812150c568","target":"record","created_at":"2026-05-17T23:45:22Z","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":"45932bcf6752b8fc95c7e971b06b2dae9a4de4654a6b21f895227e665200099e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-20T03:24:53Z","title_canon_sha256":"7b41f28316727e2cf0a442a7679bf3aaf748b446be7728b1f417fd37272a334d"},"schema_version":"1.0","source":{"id":"1903.08326","kind":"arxiv","version":2}},"canonical_sha256":"d4386d58ec7f382fa972ccca5d691d60e5a41ab02a9c655cfefb61f45c4d1b7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4386d58ec7f382fa972ccca5d691d60e5a41ab02a9c655cfefb61f45c4d1b7a","first_computed_at":"2026-05-17T23:45:22.324142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:22.324142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o3GuKiVbc2IneGtFC0W1O2T5ih+87E7+jTv9n1sigiQ+I9E72LkdDejlGSFf8jY2xM2B1YJOwQhAwpHMvqitCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:22.324600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08326","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20668fd65df46a52a4e77322db8cfc64e34d804a4141b0aeeb7ac9812150c568","sha256:c1b6b7cc56c763b91977e6c3fecf3cbbe8e7ba9f5d35792a4008d41d7ff8d579"],"state_sha256":"b273b3087307cc50f38306cb958fd95340267a492b0e638e88286f93672b0e16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7sXJWbhPO7e4BoxUFQYaEn3vU/XUJ+W2Yb9Ya+nB+U+l7P06he0r0DhKG39G0OtJw/H4/v/V8rb/anql9/bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:44:10.490780Z","bundle_sha256":"864610f029d57affded64f54fd473cb8db888fcf3815496ddb90ebba55f3e021"}}