{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DXUX3BAH4GKLD7WYA72XMQLBI3","short_pith_number":"pith:DXUX3BAH","schema_version":"1.0","canonical_sha256":"1de97d8407e194b1fed807f576416146da7d062f54facbec1247753168ef293c","source":{"kind":"arxiv","id":"1801.03951","version":2},"attestation_state":"computed","paper":{"title":"LDPC Codes with Local and Global Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eshed Ram, Yuval Cassuto","submitted_at":"2018-01-11T19:00:56Z","abstract_excerpt":"This paper presents a theoretical study of a new type of LDPC codes motivated by practical storage applications. LDPCL codes (suffix L represents locality) are LDPC codes that can be decoded either as usual over the full code block, or locally when a smaller sub-block is accessed (to reduce latency). LDPCL codes are designed to maximize the error-correction performance vs. rate in the usual (global) mode, while at the same time providing a certain performance in the local mode. We develop a theoretical framework for the design of LDPCL codes. Our results include a design tool to construct an L"},"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":"1801.03951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T19:00:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"923b57a90677be8f9cafd2d65ac36e5e27ad02a57251d133d6ee371826192741","abstract_canon_sha256":"0cc24ed305969e5a068ea27e05db4df12f0ca4fb87679ed65916e0dcb18e83c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.391985Z","signature_b64":"HRivc75AvTOzHkT3gBsOqoMsu9SwKLR3kD1toAhNhkMg4JgU1R1Zmbrt4pNNZdY1hbRLmdbleWoVx4AXePuZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de97d8407e194b1fed807f576416146da7d062f54facbec1247753168ef293c","last_reissued_at":"2026-05-17T23:46:36.391468Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.391468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LDPC Codes with Local and Global Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eshed Ram, Yuval Cassuto","submitted_at":"2018-01-11T19:00:56Z","abstract_excerpt":"This paper presents a theoretical study of a new type of LDPC codes motivated by practical storage applications. LDPCL codes (suffix L represents locality) are LDPC codes that can be decoded either as usual over the full code block, or locally when a smaller sub-block is accessed (to reduce latency). LDPCL codes are designed to maximize the error-correction performance vs. rate in the usual (global) mode, while at the same time providing a certain performance in the local mode. We develop a theoretical framework for the design of LDPCL codes. Our results include a design tool to construct an L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03951","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.03951","created_at":"2026-05-17T23:46:36.391547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03951v2","created_at":"2026-05-17T23:46:36.391547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03951","created_at":"2026-05-17T23:46:36.391547+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXUX3BAH4GKL","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXUX3BAH4GKLD7WY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXUX3BAH","created_at":"2026-05-18T12:32:19.392346+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/DXUX3BAH4GKLD7WYA72XMQLBI3","json":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3.json","graph_json":"https://pith.science/api/pith-number/DXUX3BAH4GKLD7WYA72XMQLBI3/graph.json","events_json":"https://pith.science/api/pith-number/DXUX3BAH4GKLD7WYA72XMQLBI3/events.json","paper":"https://pith.science/paper/DXUX3BAH"},"agent_actions":{"view_html":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3","download_json":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3.json","view_paper":"https://pith.science/paper/DXUX3BAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03951&json=true","fetch_graph":"https://pith.science/api/pith-number/DXUX3BAH4GKLD7WYA72XMQLBI3/graph.json","fetch_events":"https://pith.science/api/pith-number/DXUX3BAH4GKLD7WYA72XMQLBI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3/action/storage_attestation","attest_author":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3/action/author_attestation","sign_citation":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3/action/citation_signature","submit_replication":"https://pith.science/pith/DXUX3BAH4GKLD7WYA72XMQLBI3/action/replication_record"}},"created_at":"2026-05-17T23:46:36.391547+00:00","updated_at":"2026-05-17T23:46:36.391547+00:00"}