{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H4XIOIYKIUYCCAPIGR2OBZNC4L","short_pith_number":"pith:H4XIOIYK","canonical_record":{"source":{"id":"1812.08562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-20T13:47:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"965fc49e600fa32d5c494d047c8f150a218d310f818f6ee3f395c7ff842957aa","abstract_canon_sha256":"b0f09a9421c5d6615242c87514562586681493d9b04c126e2958ea8870f1afef"},"schema_version":"1.0"},"canonical_sha256":"3f2e87230a45302101e83474e0e5a2e2f82ed934b47c509afe5779c9c3658e7e","source":{"kind":"arxiv","id":"1812.08562","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08562","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08562v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08562","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"H4XIOIYKIUYC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4XIOIYKIUYCCAPI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4XIOIYK","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H4XIOIYKIUYCCAPIGR2OBZNC4L","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-20T13:47:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"965fc49e600fa32d5c494d047c8f150a218d310f818f6ee3f395c7ff842957aa","abstract_canon_sha256":"b0f09a9421c5d6615242c87514562586681493d9b04c126e2958ea8870f1afef"},"schema_version":"1.0"},"canonical_sha256":"3f2e87230a45302101e83474e0e5a2e2f82ed934b47c509afe5779c9c3658e7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.870209Z","signature_b64":"JXnLBnu18rJLPZqcR7y36nwgVkDj4FhFJGuHb2q0IXLEN4ys9rE1tzxJ2XF7uBBoleFIGArTht1OhwHa4mGKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f2e87230a45302101e83474e0e5a2e2f82ed934b47c509afe5779c9c3658e7e","last_reissued_at":"2026-05-17T23:51:41.869751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.869751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08562","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzxhB/Vc4IQasGL4bqb2FeidZZVsbh7qvhmpqIF5SmsCJvhrFxYOURNP8x1pWQ56/HyuR/Ocm+EHkMRLWfbECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:41:02.579378Z"},"content_sha256":"1c6388f99b490feb98ee4203407b2f1c459bf8296fd148237e5f1beb7019125b","schema_version":"1.0","event_id":"sha256:1c6388f99b490feb98ee4203407b2f1c459bf8296fd148237e5f1beb7019125b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H4XIOIYKIUYCCAPIGR2OBZNC4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Error-Correcting Codes in the Short Blocklength Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Stein, Fabian Steiner, Gianluigi Liva, Giuseppe Durisi, Mustafa Cemil Co\\c{s}kun, Thomas Jerkovits, William Ryan","submitted_at":"2018-12-20T13:47:36Z","abstract_excerpt":"The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we review some of the most promising code constructions targeting the short block regime, and we compare them with both finite-length performance bounds and classical error-correction coding schemes. The work addresses the use of both binary and high-order modulations over the additive white Gaussian noise channel. We will illustrate how to effectively approach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08562","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMtwaxRyq94GuCJgEUDErp+LPV+BlVT9BxR3HByheC86HZrBrLgy6+PDdksDVnw1z5H5tQldLkTNv+JvK/V/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:41:02.579731Z"},"content_sha256":"22fb2182940dc85345f2190f1ad24bdf084456d62167b4af697fc14b87e6226f","schema_version":"1.0","event_id":"sha256:22fb2182940dc85345f2190f1ad24bdf084456d62167b4af697fc14b87e6226f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/bundle.json","state_url":"https://pith.science/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/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-04T12:41:02Z","links":{"resolver":"https://pith.science/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L","bundle":"https://pith.science/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/bundle.json","state":"https://pith.science/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4XIOIYKIUYCCAPIGR2OBZNC4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H4XIOIYKIUYCCAPIGR2OBZNC4L","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":"b0f09a9421c5d6615242c87514562586681493d9b04c126e2958ea8870f1afef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-20T13:47:36Z","title_canon_sha256":"965fc49e600fa32d5c494d047c8f150a218d310f818f6ee3f395c7ff842957aa"},"schema_version":"1.0","source":{"id":"1812.08562","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08562","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08562v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08562","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"H4XIOIYKIUYC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H4XIOIYKIUYCCAPI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H4XIOIYK","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:22fb2182940dc85345f2190f1ad24bdf084456d62167b4af697fc14b87e6226f","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we review some of the most promising code constructions targeting the short block regime, and we compare them with both finite-length performance bounds and classical error-correction coding schemes. The work addresses the use of both binary and high-order modulations over the additive white Gaussian noise channel. We will illustrate how to effectively approach ","authors_text":"Brian Stein, Fabian Steiner, Gianluigi Liva, Giuseppe Durisi, Mustafa Cemil Co\\c{s}kun, Thomas Jerkovits, William Ryan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-20T13:47:36Z","title":"Efficient Error-Correcting Codes in the Short Blocklength Regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08562","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:1c6388f99b490feb98ee4203407b2f1c459bf8296fd148237e5f1beb7019125b","target":"record","created_at":"2026-05-17T23:51:41Z","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":"b0f09a9421c5d6615242c87514562586681493d9b04c126e2958ea8870f1afef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-20T13:47:36Z","title_canon_sha256":"965fc49e600fa32d5c494d047c8f150a218d310f818f6ee3f395c7ff842957aa"},"schema_version":"1.0","source":{"id":"1812.08562","kind":"arxiv","version":2}},"canonical_sha256":"3f2e87230a45302101e83474e0e5a2e2f82ed934b47c509afe5779c9c3658e7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f2e87230a45302101e83474e0e5a2e2f82ed934b47c509afe5779c9c3658e7e","first_computed_at":"2026-05-17T23:51:41.869751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.869751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JXnLBnu18rJLPZqcR7y36nwgVkDj4FhFJGuHb2q0IXLEN4ys9rE1tzxJ2XF7uBBoleFIGArTht1OhwHa4mGKDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.870209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08562","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c6388f99b490feb98ee4203407b2f1c459bf8296fd148237e5f1beb7019125b","sha256:22fb2182940dc85345f2190f1ad24bdf084456d62167b4af697fc14b87e6226f"],"state_sha256":"45c5f6326f4fa29fca28dd201bf85841f79920760f7361af6f8f1a9d52e37384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q76xu0Ri09+8N7+/tJM532Z1ISXpOMILwKqZAgsMiLd0FTG2yVE0JxOkRSU2wlbVuB2TvywNJ1r0X5/mxpCbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:41:02.581581Z","bundle_sha256":"91a1ab5484728389250b6f05560734433511915366c1f9fca64ff988cdbb4a3f"}}