{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CFDY3QW5Q63OKDSJEP73U776IO","short_pith_number":"pith:CFDY3QW5","schema_version":"1.0","canonical_sha256":"11478dc2dd87b6e50e4923ffba7ffe43b26a4551c11609d38f70c4f8580dc404","source":{"kind":"arxiv","id":"1806.01259","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01259","created_at":"2026-05-18T00:14:16.971476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01259v1","created_at":"2026-05-18T00:14:16.971476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01259","created_at":"2026-05-18T00:14:16.971476+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFDY3QW5Q63O","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFDY3QW5Q63OKDSJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFDY3QW5","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO","json":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO.json","graph_json":"https://pith.science/api/pith-number/CFDY3QW5Q63OKDSJEP73U776IO/graph.json","events_json":"https://pith.science/api/pith-number/CFDY3QW5Q63OKDSJEP73U776IO/events.json","paper":"https://pith.science/paper/CFDY3QW5"},"agent_actions":{"view_html":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO","download_json":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO.json","view_paper":"https://pith.science/paper/CFDY3QW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01259&json=true","fetch_graph":"https://pith.science/api/pith-number/CFDY3QW5Q63OKDSJEP73U776IO/graph.json","fetch_events":"https://pith.science/api/pith-number/CFDY3QW5Q63OKDSJEP73U776IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/action/storage_attestation","attest_author":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/action/author_attestation","sign_citation":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/action/citation_signature","submit_replication":"https://pith.science/pith/CFDY3QW5Q63OKDSJEP73U776IO/action/replication_record"}},"created_at":"2026-05-18T00:14:16.971476+00:00","updated_at":"2026-05-18T00:14:16.971476+00:00"}