{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CFDY3QW5Q63OKDSJEP73U776IO","short_pith_number":"pith:CFDY3QW5","canonical_record":{"source":{"id":"1806.01259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-04T17:56:29Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ac4c4f92e43384834c84828799279764dfc9df800e2b28962d04bda41b723ae4","abstract_canon_sha256":"234070c09ebbac6f9a55b906c07bbecb9f82d86d5ad473af95eb9c9e217eb544"},"schema_version":"1.0"},"canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","source":{"kind":"arxiv","id":"1806.01259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01259","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01259v1","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01259","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"CFDY3QW5Q63O","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFDY3QW5Q63OKDSJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFDY3QW5","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CFDY3QW5Q63OKDSJEP73U776IO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-04T17:56:29Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ac4c4f92e43384834c84828799279764dfc9df800e2b28962d04bda41b723ae4","abstract_canon_sha256":"234070c09ebbac6f9a55b906c07bbecb9f82d86d5ad473af95eb9c9e217eb544"},"schema_version":"1.0"},"canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:16.972012Z","signature_b64":"n64INAKOaB4j1jaLoCFUswtJwFJYOlZDJcf7cSMnWl7ypSdy58rMtc0t6qOt5Rz9lP/lhLJHPgsW/hNCQtKWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","last_reissued_at":"2026-05-18T00:14:16.971361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:16.971361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01259","source_version":1,"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-18T00:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grQu7VonUIHYyEVimYt4Gc/R2iOuaZ/NssgASmMb8tRK+DvcbAgAs9hVrrISFjuytqDcG9Lvs35gcTKFLj8nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:25.564107Z"},"content_sha256":"5964811f559ed1b893e3002d7373137e3fa47081ae06ee37e558610beb7fa9e7","schema_version":"1.0","event_id":"sha256:5964811f559ed1b893e3002d7373137e3fa47081ae06ee37e558610beb7fa9e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CFDY3QW5Q63OKDSJEP73U776IO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jack Kosaian, K.V. Rashmi, Shivaram Venkataraman","submitted_at":"2018-06-04T17:56:29Z","abstract_excerpt":"Machine learning algorithms are typically run on large scale, distributed compute infrastructure that routinely face a number of unavailabilities such as failures and temporary slowdowns. Adding redundant computations using coding-theoretic tools called \"codes\" is an emerging technique to alleviate the adverse effects of such unavailabilities. A code consists of an encoding function that proactively introduces redundant computation and a decoding function that reconstructs unavailable outputs using the available ones. Past work focuses on using codes to provide resilience for linear computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01259","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"},"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-18T00:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRf2Pm5LALN8tzVQYyGpVkoux0MpXjad56n1D72Otxtl2uV+cS14lA+McxXhUbrMAD3koTbnCzDPBc7YmnYWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:25.564496Z"},"content_sha256":"277b4b6a712702c1c289be0e76523e9e3833f6a028e173f40b96ebb0e873b3dd","schema_version":"1.0","event_id":"sha256:277b4b6a712702c1c289be0e76523e9e3833f6a028e173f40b96ebb0e873b3dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/bundle.json","state_url":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFDY3QW5Q63OKDSJEP73U776IO/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-06-02T21:37:25Z","links":{"resolver":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO","bundle":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/bundle.json","state":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFDY3QW5Q63OKDSJEP73U776IO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CFDY3QW5Q63OKDSJEP73U776IO","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":"234070c09ebbac6f9a55b906c07bbecb9f82d86d5ad473af95eb9c9e217eb544","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-04T17:56:29Z","title_canon_sha256":"ac4c4f92e43384834c84828799279764dfc9df800e2b28962d04bda41b723ae4"},"schema_version":"1.0","source":{"id":"1806.01259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01259","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01259v1","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01259","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"CFDY3QW5Q63O","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFDY3QW5Q63OKDSJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFDY3QW5","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:277b4b6a712702c1c289be0e76523e9e3833f6a028e173f40b96ebb0e873b3dd","target":"graph","created_at":"2026-05-18T00:14:16Z","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":"Machine learning algorithms are typically run on large scale, distributed compute infrastructure that routinely face a number of unavailabilities such as failures and temporary slowdowns. Adding redundant computations using coding-theoretic tools called \"codes\" is an emerging technique to alleviate the adverse effects of such unavailabilities. A code consists of an encoding function that proactively introduces redundant computation and a decoding function that reconstructs unavailable outputs using the available ones. Past work focuses on using codes to provide resilience for linear computatio","authors_text":"Jack Kosaian, K.V. Rashmi, Shivaram Venkataraman","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-04T17:56:29Z","title":"Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01259","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:5964811f559ed1b893e3002d7373137e3fa47081ae06ee37e558610beb7fa9e7","target":"record","created_at":"2026-05-18T00:14:16Z","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":"234070c09ebbac6f9a55b906c07bbecb9f82d86d5ad473af95eb9c9e217eb544","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-04T17:56:29Z","title_canon_sha256":"ac4c4f92e43384834c84828799279764dfc9df800e2b28962d04bda41b723ae4"},"schema_version":"1.0","source":{"id":"1806.01259","kind":"arxiv","version":1}},"canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","first_computed_at":"2026-05-18T00:14:16.971361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:16.971361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n64INAKOaB4j1jaLoCFUswtJwFJYOlZDJcf7cSMnWl7ypSdy58rMtc0t6qOt5Rz9lP/lhLJHPgsW/hNCQtKWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:16.972012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5964811f559ed1b893e3002d7373137e3fa47081ae06ee37e558610beb7fa9e7","sha256:277b4b6a712702c1c289be0e76523e9e3833f6a028e173f40b96ebb0e873b3dd"],"state_sha256":"5147e899d4a92a8ff309e4f5c346580699e13f6f58511272696680d70e0f3cd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkretKEuVAa65Tj75/ibhwysc0ENKQP/dmzBe7Okn5EzEtCJ115rQiof4ZUR6BchM48cEwUsgRQloirQaIRKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:37:25.566537Z","bundle_sha256":"fe3b7dbef9a19641f8234944ad98342cf6287e47432ae383b2e21b89211f0609"}}