{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LEWJ4O4TTJOYZ7BYTH5N4B3PT6","short_pith_number":"pith:LEWJ4O4T","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"},"canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","source":{"kind":"arxiv","id":"1408.5518","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5518","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5518v2","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5518","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LEWJ4O4TTJOY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LEWJ4O4TTJOYZ7BY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LEWJ4O4T","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LEWJ4O4TTJOYZ7BYTH5N4B3PT6","target":"record","payload":{"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"},"canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","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"},"source_kind":"arxiv","source_id":"1408.5518","source_version":2,"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCMicQdvih5++cWASlDbcYuD4vftEm6IlgjM97Zjm7e5BYI1CGoil5eMfZMuyubLQprD8nfZtIXs28Ep100lDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:52.993135Z"},"content_sha256":"693b4bc58b939f5af674b2ef566f3710872518653dc2ce423ce74734b4bce0f2","schema_version":"1.0","event_id":"sha256:693b4bc58b939f5af674b2ef566f3710872518653dc2ce423ce74734b4bce0f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LEWJ4O4TTJOYZ7BYTH5N4B3PT6","target":"graph","payload":{"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"},"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njBM1sn4TIB5IDAp5fjeEKilQal9woLCrswI2nagGh6k6faa4hEVAWy+2eR/1HfCrJpUVNm5Y/ysmoB3SyhvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:52.993485Z"},"content_sha256":"4e41deeead182df2f89e0462a964d7627085987588aa9cada57c76f1b6d0b4d9","schema_version":"1.0","event_id":"sha256:4e41deeead182df2f89e0462a964d7627085987588aa9cada57c76f1b6d0b4d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/bundle.json","state_url":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/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-02T18:38:52Z","links":{"resolver":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6","bundle":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/bundle.json","state":"https://pith.science/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEWJ4O4TTJOYZ7BYTH5N4B3PT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LEWJ4O4TTJOYZ7BYTH5N4B3PT6","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":"e0e059289e899d2d0f5469f319276657afd0cfcfaf4d9b385c2d0bd3fa136b3e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-23T18:28:32Z","title_canon_sha256":"2357afe2c3cf670ce7359c1d46d0553f1b024f0b176fca3e2dda6482cf1a9241"},"schema_version":"1.0","source":{"id":"1408.5518","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5518","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5518v2","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5518","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LEWJ4O4TTJOY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LEWJ4O4TTJOYZ7BY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LEWJ4O4T","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4e41deeead182df2f89e0462a964d7627085987588aa9cada57c76f1b6d0b4d9","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"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$.","authors_text":"Djamal Belazzougui","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-23T18:28:32Z","title":"Faster construction of asymptotically good unit-cost error correcting codes in the RAM model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5518","kind":"arxiv","version":2},"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:693b4bc58b939f5af674b2ef566f3710872518653dc2ce423ce74734b4bce0f2","target":"record","created_at":"2026-05-18T02:42:53Z","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":"e0e059289e899d2d0f5469f319276657afd0cfcfaf4d9b385c2d0bd3fa136b3e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-23T18:28:32Z","title_canon_sha256":"2357afe2c3cf670ce7359c1d46d0553f1b024f0b176fca3e2dda6482cf1a9241"},"schema_version":"1.0","source":{"id":"1408.5518","kind":"arxiv","version":2}},"canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"592c9e3b939a5d8cfc3899fade076f9f9115a0e8ba60b5da92070c3e0fbf95f3","first_computed_at":"2026-05-18T02:42:53.610262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.610262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UD/Xvlnw/SIbzag91vAWSzoFrSxUp459LN3GgCt+Cc1C9myidAYsqG6Q7puPIMCcdgzzQd9npth7D2FWHcNhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.610634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5518","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:693b4bc58b939f5af674b2ef566f3710872518653dc2ce423ce74734b4bce0f2","sha256:4e41deeead182df2f89e0462a964d7627085987588aa9cada57c76f1b6d0b4d9"],"state_sha256":"8455936d893ae71af8be7cbfd3aa9eb497bb24d321be7fad900a347747fd374b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibrpVyPTWLr2DUpO4tSylSmtMxLH4T8C+ro0oce6H5v+OMmML6jYUVef2ipi6BXWsg+hZPQTflVSiLMLdaK5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:38:52.995382Z","bundle_sha256":"1f092afde5d92327560b59b49534816d0bbfb222aac9726337f82216cd9b1e06"}}