{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HO3KNB5ZJYJMH2AESANGPEBRUJ","short_pith_number":"pith:HO3KNB5Z","schema_version":"1.0","canonical_sha256":"3bb6a687b94e12c3e804901a679031a278ec33245cce78ba49c534171d646f5d","source":{"kind":"arxiv","id":"2411.18153","version":1},"attestation_state":"computed","paper":{"title":"Learning Rate-Compatible Linear Block Codes: An Auto-Encoder Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bo Ai, Geoffrey Ye Li, Tianwei Hou, Wei Chen, Yukun Cheng","submitted_at":"2024-11-27T09:01:51Z","abstract_excerpt":"Artificial intelligence (AI) provides an alternative way to design channel coding with affordable complexity. However, most existing studies can only learn codes for a given size and rate, typically defined by a fixed network architecture and a set of parameters. The support of multiple code rates is essential for conserving bandwidth under varying channel conditions while it is costly to store multiple AI models or parameter sets. In this article, we propose an auto-encoder (AE) based rate-compatible linear block codes (RC-LBCs). The coding process associated with AI or non-AI decoders and mu"},"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":"2411.18153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2024-11-27T09:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"ede869556b38e12714ea34cebcfdb3a72bd78db821185df364d67bf550b6328a","abstract_canon_sha256":"deaa415f82fb6426d3929906136f6efc6c69db3bfee7f91f97b94fad063b00a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:12.612912Z","signature_b64":"5MHH2+plJxQZJ7kYchIal1pZuzX+7pBpv+FNY3LX0WYtkhHATvBrJzU/ARwentXh/4p081VxCval1qQNl5EvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bb6a687b94e12c3e804901a679031a278ec33245cce78ba49c534171d646f5d","last_reissued_at":"2026-07-05T09:41:12.612447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:12.612447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Rate-Compatible Linear Block Codes: An Auto-Encoder Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bo Ai, Geoffrey Ye Li, Tianwei Hou, Wei Chen, Yukun Cheng","submitted_at":"2024-11-27T09:01:51Z","abstract_excerpt":"Artificial intelligence (AI) provides an alternative way to design channel coding with affordable complexity. However, most existing studies can only learn codes for a given size and rate, typically defined by a fixed network architecture and a set of parameters. The support of multiple code rates is essential for conserving bandwidth under varying channel conditions while it is costly to store multiple AI models or parameter sets. In this article, we propose an auto-encoder (AE) based rate-compatible linear block codes (RC-LBCs). The coding process associated with AI or non-AI decoders and mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18153","kind":"arxiv","version":1},"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/2411.18153/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.18153","created_at":"2026-07-05T09:41:12.612507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18153v1","created_at":"2026-07-05T09:41:12.612507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18153","created_at":"2026-07-05T09:41:12.612507+00:00"},{"alias_kind":"pith_short_12","alias_value":"HO3KNB5ZJYJM","created_at":"2026-07-05T09:41:12.612507+00:00"},{"alias_kind":"pith_short_16","alias_value":"HO3KNB5ZJYJMH2AE","created_at":"2026-07-05T09:41:12.612507+00:00"},{"alias_kind":"pith_short_8","alias_value":"HO3KNB5Z","created_at":"2026-07-05T09:41:12.612507+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/HO3KNB5ZJYJMH2AESANGPEBRUJ","json":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ.json","graph_json":"https://pith.science/api/pith-number/HO3KNB5ZJYJMH2AESANGPEBRUJ/graph.json","events_json":"https://pith.science/api/pith-number/HO3KNB5ZJYJMH2AESANGPEBRUJ/events.json","paper":"https://pith.science/paper/HO3KNB5Z"},"agent_actions":{"view_html":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ","download_json":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ.json","view_paper":"https://pith.science/paper/HO3KNB5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18153&json=true","fetch_graph":"https://pith.science/api/pith-number/HO3KNB5ZJYJMH2AESANGPEBRUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HO3KNB5ZJYJMH2AESANGPEBRUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ/action/storage_attestation","attest_author":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ/action/author_attestation","sign_citation":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ/action/citation_signature","submit_replication":"https://pith.science/pith/HO3KNB5ZJYJMH2AESANGPEBRUJ/action/replication_record"}},"created_at":"2026-07-05T09:41:12.612507+00:00","updated_at":"2026-07-05T09:41:12.612507+00:00"}