{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LEWJ4O4TTJOYZ7BYTH5N4B3PT6","short_pith_number":"pith:LEWJ4O4T","schema_version":"1.0","canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","source":{"kind":"arxiv","id":"1408.5518","version":2},"attestation_state":"computed","paper":{"title":"Faster construction of asymptotically good unit-cost error correcting codes in the RAM model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2014-08-23T18:28:32Z","abstract_excerpt":"Assuming we are in a Word-RAM model with word size $w$, we show that we can construct in $o(w)$ time an error correcting code with a constant relative positive distance that maps numbers of $w$ bits into $\\Theta(w)$-bit numbers, and such that the application of the error-correcting code on any given number $x\\in[0,2^w-1]$ takes constant time. Our result improves on a previously proposed error-correcting code with the same properties whose construction time was exponential in $w$."},"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":"1408.5518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-23T18:28:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2357afe2c3cf670ce7359c1d46d0553f1b024f0b176fca3e2dda6482cf1a9241","abstract_canon_sha256":"e0e059289e899d2d0f5469f319276657afd0cfcfaf4d9b385c2d0bd3fa136b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.610634Z","signature_b64":"UD/Xvlnw/SIbzag91vAWSzoFrSxUp459LN3GgCt+Cc1C9myidAYsqG6Q7puPIMCcdgzzQd9npth7D2FWHcNhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","last_reissued_at":"2026-05-18T02:42:53.610262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.610262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster construction of asymptotically good unit-cost error correcting codes in the RAM model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2014-08-23T18:28:32Z","abstract_excerpt":"Assuming we are in a Word-RAM model with word size $w$, we show that we can construct in $o(w)$ time an error correcting code with a constant relative positive distance that maps numbers of $w$ bits into $\\Theta(w)$-bit numbers, and such that the application of the error-correcting code on any given number $x\\in[0,2^w-1]$ takes constant time. Our result improves on a previously proposed error-correcting code with the same properties whose construction time was exponential in $w$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5518","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":"1408.5518","created_at":"2026-05-18T02:42:53.610312+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5518v2","created_at":"2026-05-18T02:42:53.610312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5518","created_at":"2026-05-18T02:42:53.610312+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEWJ4O4TTJOY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEWJ4O4TTJOYZ7BY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEWJ4O4T","created_at":"2026-05-18T12:28:38.356838+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/LEWJ4O4TTJOYZ7BYTH5N4B3PT6","json":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6.json","graph_json":"https://pith.science/api/pith-number/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/graph.json","events_json":"https://pith.science/api/pith-number/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/events.json","paper":"https://pith.science/paper/LEWJ4O4T"},"agent_actions":{"view_html":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6","download_json":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6.json","view_paper":"https://pith.science/paper/LEWJ4O4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5518&json=true","fetch_graph":"https://pith.science/api/pith-number/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/graph.json","fetch_events":"https://pith.science/api/pith-number/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/action/storage_attestation","attest_author":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/action/author_attestation","sign_citation":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/action/citation_signature","submit_replication":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/action/replication_record"}},"created_at":"2026-05-18T02:42:53.610312+00:00","updated_at":"2026-05-18T02:42:53.610312+00:00"}