{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GBCUQH3DZUBWOFITYQBV6MAUYS","short_pith_number":"pith:GBCUQH3D","schema_version":"1.0","canonical_sha256":"3045481f63cd03671513c4035f3014c49bded472711c4034b3a584da42e78b28","source":{"kind":"arxiv","id":"1807.01166","version":1},"attestation_state":"computed","paper":{"title":"$\\epsilon$-MSR Codes: Contacting Fewer Code Blocks for Exact Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sai Vikneshwar Mani Jayaraman, Satyanarayana V. Lokam, Venkatesan Guruswami","submitted_at":"2018-07-03T13:27:55Z","abstract_excerpt":"$\\epsilon$-Minimum Storage Regenerating ($\\epsilon$-MSR) codes form a special class of Maximum Distance Separable (MDS) codes, providing mechanisms for exact regeneration of a single code block in their codewords by downloading slighly sub-optimal amount of information from the remaining code blocks. The key advantage of these codes is a significantly lower sub-packetization that grows only logarithmically with the length of the code, while providing optimality in storage and error-correcting capacity. However, from an implementation point of view, these codes require each remaining code block"},"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":"1807.01166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T13:27:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"763534abe52d35b9c6754dba939bf1b43a02d93abd2db26225922f2d155c74e3","abstract_canon_sha256":"ee7b2b758af00fb3930832765db3991a53d4c2a8a135109cd8a7ed84ecb88e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:45.060788Z","signature_b64":"7j7J0NIhkHRD2g1wPoSA7T2jv4JCzVzZPmm6wkTy/FhXIGgk5g2cRD8MMc7jcBbfpjuLsgb2liYvRXrCM7o1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3045481f63cd03671513c4035f3014c49bded472711c4034b3a584da42e78b28","last_reissued_at":"2026-05-18T00:11:45.060087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:45.060087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\epsilon$-MSR Codes: Contacting Fewer Code Blocks for Exact Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sai Vikneshwar Mani Jayaraman, Satyanarayana V. Lokam, Venkatesan Guruswami","submitted_at":"2018-07-03T13:27:55Z","abstract_excerpt":"$\\epsilon$-Minimum Storage Regenerating ($\\epsilon$-MSR) codes form a special class of Maximum Distance Separable (MDS) codes, providing mechanisms for exact regeneration of a single code block in their codewords by downloading slighly sub-optimal amount of information from the remaining code blocks. The key advantage of these codes is a significantly lower sub-packetization that grows only logarithmically with the length of the code, while providing optimality in storage and error-correcting capacity. However, from an implementation point of view, these codes require each remaining code block"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01166","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":"1807.01166","created_at":"2026-05-18T00:11:45.060201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01166v1","created_at":"2026-05-18T00:11:45.060201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01166","created_at":"2026-05-18T00:11:45.060201+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBCUQH3DZUBW","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBCUQH3DZUBWOFIT","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBCUQH3D","created_at":"2026-05-18T12:32:25.280505+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/GBCUQH3DZUBWOFITYQBV6MAUYS","json":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS.json","graph_json":"https://pith.science/api/pith-number/GBCUQH3DZUBWOFITYQBV6MAUYS/graph.json","events_json":"https://pith.science/api/pith-number/GBCUQH3DZUBWOFITYQBV6MAUYS/events.json","paper":"https://pith.science/paper/GBCUQH3D"},"agent_actions":{"view_html":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS","download_json":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS.json","view_paper":"https://pith.science/paper/GBCUQH3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01166&json=true","fetch_graph":"https://pith.science/api/pith-number/GBCUQH3DZUBWOFITYQBV6MAUYS/graph.json","fetch_events":"https://pith.science/api/pith-number/GBCUQH3DZUBWOFITYQBV6MAUYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS/action/storage_attestation","attest_author":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS/action/author_attestation","sign_citation":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS/action/citation_signature","submit_replication":"https://pith.science/pith/GBCUQH3DZUBWOFITYQBV6MAUYS/action/replication_record"}},"created_at":"2026-05-18T00:11:45.060201+00:00","updated_at":"2026-05-18T00:11:45.060201+00:00"}