{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQJJ766V7GRXKYLFF5LI25VBTV","short_pith_number":"pith:EQJJ766V","canonical_record":{"source":{"id":"1811.04322","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T22:52:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04af9da857164c1b2c448706a9e117a666e0cc11e489f94ec03d2ae5cab59775","abstract_canon_sha256":"e97ebc408c6fb2aea1cae62c4814e89a2a9a0a3096cf394bdda4490d3505f5f5"},"schema_version":"1.0"},"canonical_sha256":"24129ffbd5f9a37561652f568d76a19d626de5f03cb5974c3792031e0e66a19e","source":{"kind":"arxiv","id":"1811.04322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04322","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04322v3","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04322","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"EQJJ766V7GRX","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_16","alias_value":"EQJJ766V7GRXKYLF","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_8","alias_value":"EQJJ766V","created_at":"2026-07-05T05:38:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQJJ766V7GRXKYLFF5LI25VBTV","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04322","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T22:52:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04af9da857164c1b2c448706a9e117a666e0cc11e489f94ec03d2ae5cab59775","abstract_canon_sha256":"e97ebc408c6fb2aea1cae62c4814e89a2a9a0a3096cf394bdda4490d3505f5f5"},"schema_version":"1.0"},"canonical_sha256":"24129ffbd5f9a37561652f568d76a19d626de5f03cb5974c3792031e0e66a19e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:38.214300Z","signature_b64":"awNxvL11hDnuQXTCYEvWi0okGY1RGTm3wl7NgHU/BCsj4d6m9HRIfxCy90Tv9wQk2al7wwzzB+0wdsVvDewYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24129ffbd5f9a37561652f568d76a19d626de5f03cb5974c3792031e0e66a19e","last_reissued_at":"2026-07-05T05:38:38.213905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:38.213905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04322","source_version":3,"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-07-05T05:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPEz66gu23qPvCTOGQnpojdD+dgn2yw/IZmGchtnLpgXuEDR7ij0WxMU6Zs30A810yqA0wSKZ7T9dEhk3H8rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:18:01.745119Z"},"content_sha256":"17eec6435fd813a02d0ee93aa318caf0210dbd56ee42ecc71b4c25568cac7bd4","schema_version":"1.0","event_id":"sha256:17eec6435fd813a02d0ee93aa318caf0210dbd56ee42ecc71b4c25568cac7bd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQJJ766V7GRXKYLFF5LI25VBTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Channel Coding at Low Capacity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamed Hassani, Hessam Mahdavifar, Mohammad Fereydounian, Mohammad Vahid Jamali","submitted_at":"2018-11-10T22:52:59Z","abstract_excerpt":"Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an extremely small capacity. Within these constraints, the state-of-the-art coding techniques may not be directly applicable. Moreover, the prior work on the finite-length analysis of optimal channel coding provides inaccurate predictions of the limits in the low-capacity regime. In this paper, we study channel coding at low capacity from two perspectives: fundament"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04322","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.04322/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idbCJoemP0/2JlFZX4oJntSGh4LuO6qk8WTGdEXVPdCcigUBIFyFjNA0G68TyT15iwpkjhmoe5+ssNRVJn51BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:18:01.745623Z"},"content_sha256":"25654db549cdc637a86db8eca1bb02b21076ba24c4591c390ea507ada52cd8c6","schema_version":"1.0","event_id":"sha256:25654db549cdc637a86db8eca1bb02b21076ba24c4591c390ea507ada52cd8c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQJJ766V7GRXKYLFF5LI25VBTV/bundle.json","state_url":"https://pith.science/pith/EQJJ766V7GRXKYLFF5LI25VBTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQJJ766V7GRXKYLFF5LI25VBTV/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-08-17T05:18:01Z","links":{"resolver":"https://pith.science/pith/EQJJ766V7GRXKYLFF5LI25VBTV","bundle":"https://pith.science/pith/EQJJ766V7GRXKYLFF5LI25VBTV/bundle.json","state":"https://pith.science/pith/EQJJ766V7GRXKYLFF5LI25VBTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQJJ766V7GRXKYLFF5LI25VBTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQJJ766V7GRXKYLFF5LI25VBTV","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":"e97ebc408c6fb2aea1cae62c4814e89a2a9a0a3096cf394bdda4490d3505f5f5","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T22:52:59Z","title_canon_sha256":"04af9da857164c1b2c448706a9e117a666e0cc11e489f94ec03d2ae5cab59775"},"schema_version":"1.0","source":{"id":"1811.04322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04322","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04322v3","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04322","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"EQJJ766V7GRX","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_16","alias_value":"EQJJ766V7GRXKYLF","created_at":"2026-07-05T05:38:38Z"},{"alias_kind":"pith_short_8","alias_value":"EQJJ766V","created_at":"2026-07-05T05:38:38Z"}],"graph_snapshots":[{"event_id":"sha256:25654db549cdc637a86db8eca1bb02b21076ba24c4591c390ea507ada52cd8c6","target":"graph","created_at":"2026-07-05T05:38:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.04322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an extremely small capacity. Within these constraints, the state-of-the-art coding techniques may not be directly applicable. Moreover, the prior work on the finite-length analysis of optimal channel coding provides inaccurate predictions of the limits in the low-capacity regime. In this paper, we study channel coding at low capacity from two perspectives: fundament","authors_text":"Hamed Hassani, Hessam Mahdavifar, Mohammad Fereydounian, Mohammad Vahid Jamali","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T22:52:59Z","title":"Channel Coding at Low Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04322","kind":"arxiv","version":3},"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:17eec6435fd813a02d0ee93aa318caf0210dbd56ee42ecc71b4c25568cac7bd4","target":"record","created_at":"2026-07-05T05:38:38Z","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":"e97ebc408c6fb2aea1cae62c4814e89a2a9a0a3096cf394bdda4490d3505f5f5","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T22:52:59Z","title_canon_sha256":"04af9da857164c1b2c448706a9e117a666e0cc11e489f94ec03d2ae5cab59775"},"schema_version":"1.0","source":{"id":"1811.04322","kind":"arxiv","version":3}},"canonical_sha256":"24129ffbd5f9a37561652f568d76a19d626de5f03cb5974c3792031e0e66a19e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24129ffbd5f9a37561652f568d76a19d626de5f03cb5974c3792031e0e66a19e","first_computed_at":"2026-07-05T05:38:38.213905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:38.213905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awNxvL11hDnuQXTCYEvWi0okGY1RGTm3wl7NgHU/BCsj4d6m9HRIfxCy90Tv9wQk2al7wwzzB+0wdsVvDewYDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:38.214300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17eec6435fd813a02d0ee93aa318caf0210dbd56ee42ecc71b4c25568cac7bd4","sha256:25654db549cdc637a86db8eca1bb02b21076ba24c4591c390ea507ada52cd8c6"],"state_sha256":"bcbd11702c83d43476401d7cdde58880553ecb54aa127b02273d824981a1f285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fWH7gWnQdngdYqK6kRj6QQG7HdvS/6F//9gDBjXgCVUXSllg2eJFQdspqPHT2gsuRw1OJdFYuqJoQUbKlPeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:18:01.749486Z","bundle_sha256":"d297bec29e0113e3038e836893aadc6262f382b8ca841d09f7da0f08a2f69e4d"}}