{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FUSMWFATCJNZHC5YE6U32OJF5C","short_pith_number":"pith:FUSMWFAT","canonical_record":{"source":{"id":"1805.02515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-07T13:24:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d207d5bee01a8576d54aa067067af2e3f7ef9d045becd194c1d73c251e82676","abstract_canon_sha256":"f2b286c3062f020dfc1aaacf3929f7f366a277cb5dab377f74b3e8f55233f9cc"},"schema_version":"1.0"},"canonical_sha256":"2d24cb1413125b938bb827a9bd3925e89b73992284b575a5a2b4208261099dd8","source":{"kind":"arxiv","id":"1805.02515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02515","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02515v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02515","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"FUSMWFATCJNZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FUSMWFATCJNZHC5Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FUSMWFAT","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FUSMWFATCJNZHC5YE6U32OJF5C","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-07T13:24:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d207d5bee01a8576d54aa067067af2e3f7ef9d045becd194c1d73c251e82676","abstract_canon_sha256":"f2b286c3062f020dfc1aaacf3929f7f366a277cb5dab377f74b3e8f55233f9cc"},"schema_version":"1.0"},"canonical_sha256":"2d24cb1413125b938bb827a9bd3925e89b73992284b575a5a2b4208261099dd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:19.830161Z","signature_b64":"smx6fCFFU4BAEDPmFXyNyRA2F5Xg7a9pPH9fotkaFynE2n1ElWdyMN8qpS/mCGeLeIQ02JhjtftMG0JnzsCGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d24cb1413125b938bb827a9bd3925e89b73992284b575a5a2b4208261099dd8","last_reissued_at":"2026-05-17T23:51:19.829540Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:19.829540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02515","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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMghus+0yB5FdWZ/d+IUNpOZQXh9Ld0XoNvu+Yu89p9PjrkXv/nHgaDLgbmllnlRdP8rprEu0oE55sRivUurCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:25:53.892295Z"},"content_sha256":"6a51546276ff70ef09d343dfa2d5551dc0dcda2f02ef3a0c4ae32b0cb64a45e9","schema_version":"1.0","event_id":"sha256:6a51546276ff70ef09d343dfa2d5551dc0dcda2f02ef3a0c4ae32b0cb64a45e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FUSMWFATCJNZHC5YE6U32OJF5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Random Gilbert-Varshamov Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guill\\'en i F\\`abregas, Anelia Somekh-Baruch, Jonathan Scarlett","submitted_at":"2018-05-07T13:24:58Z","abstract_excerpt":"We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing codewords recursively from a fixed type class, in such a way that a newly generated codeword must be at a certain minimum distance from all previously chosen codewords, according to some generic distance function. We derive an achievable error exponent for this construction, and prove its tightness with respect to the ensemble average. We show that the exponen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02515","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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w03CsL6tqVqgtZ7Uvfx4wepS0EQWV42JfBegYZETbAu/KaazHyX6+Juhyf/JidCo50Pl5wuqAp/zdj7BIqAvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:25:53.892941Z"},"content_sha256":"cb047a86bfb1a2479d6ad0576c77f863cd1218e2e44f2a3ae4b0b75efc84ecf5","schema_version":"1.0","event_id":"sha256:cb047a86bfb1a2479d6ad0576c77f863cd1218e2e44f2a3ae4b0b75efc84ecf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUSMWFATCJNZHC5YE6U32OJF5C/bundle.json","state_url":"https://pith.science/pith/FUSMWFATCJNZHC5YE6U32OJF5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUSMWFATCJNZHC5YE6U32OJF5C/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-05-31T04:25:53Z","links":{"resolver":"https://pith.science/pith/FUSMWFATCJNZHC5YE6U32OJF5C","bundle":"https://pith.science/pith/FUSMWFATCJNZHC5YE6U32OJF5C/bundle.json","state":"https://pith.science/pith/FUSMWFATCJNZHC5YE6U32OJF5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUSMWFATCJNZHC5YE6U32OJF5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FUSMWFATCJNZHC5YE6U32OJF5C","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":"f2b286c3062f020dfc1aaacf3929f7f366a277cb5dab377f74b3e8f55233f9cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-07T13:24:58Z","title_canon_sha256":"5d207d5bee01a8576d54aa067067af2e3f7ef9d045becd194c1d73c251e82676"},"schema_version":"1.0","source":{"id":"1805.02515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02515","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02515v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02515","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"FUSMWFATCJNZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FUSMWFATCJNZHC5Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FUSMWFAT","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:cb047a86bfb1a2479d6ad0576c77f863cd1218e2e44f2a3ae4b0b75efc84ecf5","target":"graph","created_at":"2026-05-17T23:51:19Z","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":"We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing codewords recursively from a fixed type class, in such a way that a newly generated codeword must be at a certain minimum distance from all previously chosen codewords, according to some generic distance function. We derive an achievable error exponent for this construction, and prove its tightness with respect to the ensemble average. We show that the exponen","authors_text":"Albert Guill\\'en i F\\`abregas, Anelia Somekh-Baruch, Jonathan Scarlett","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-07T13:24:58Z","title":"Generalized Random Gilbert-Varshamov Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02515","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:6a51546276ff70ef09d343dfa2d5551dc0dcda2f02ef3a0c4ae32b0cb64a45e9","target":"record","created_at":"2026-05-17T23:51:19Z","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":"f2b286c3062f020dfc1aaacf3929f7f366a277cb5dab377f74b3e8f55233f9cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-07T13:24:58Z","title_canon_sha256":"5d207d5bee01a8576d54aa067067af2e3f7ef9d045becd194c1d73c251e82676"},"schema_version":"1.0","source":{"id":"1805.02515","kind":"arxiv","version":2}},"canonical_sha256":"2d24cb1413125b938bb827a9bd3925e89b73992284b575a5a2b4208261099dd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d24cb1413125b938bb827a9bd3925e89b73992284b575a5a2b4208261099dd8","first_computed_at":"2026-05-17T23:51:19.829540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:19.829540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"smx6fCFFU4BAEDPmFXyNyRA2F5Xg7a9pPH9fotkaFynE2n1ElWdyMN8qpS/mCGeLeIQ02JhjtftMG0JnzsCGCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:19.830161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a51546276ff70ef09d343dfa2d5551dc0dcda2f02ef3a0c4ae32b0cb64a45e9","sha256:cb047a86bfb1a2479d6ad0576c77f863cd1218e2e44f2a3ae4b0b75efc84ecf5"],"state_sha256":"6b055bc35a7d287496c665f129541ffdf2e17b3873e44315a4600025962bbfc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"geGhPk9R1TrenRkWfndJX5RmA8j2BZD4NLepdnlx80kTKK90OqlOHhWz+7SSfpzbJe1QRPnyauYunvNCPZq3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:25:53.896560Z","bundle_sha256":"2c463b1cbf18b0e44998dad73c5f8c42b673e37a730af4451543cdab4794b7d9"}}