{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XLORMLPBT4YCNND373C577JFRH","short_pith_number":"pith:XLORMLPB","schema_version":"1.0","canonical_sha256":"badd162de19f3026b47bfec5dffd2589d5262256e87e63e8304ec257c45549e1","source":{"kind":"arxiv","id":"2505.08536","version":1},"attestation_state":"computed","paper":{"title":"Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Branka Vucetic, Chentao Yue, Hao Chang, Jiafu Hao, Yonghui Li","submitted_at":"2025-05-13T13:07:01Z","abstract_excerpt":"This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is divided into segments, where each is encoded with short block channel codes independently before transmission. At the receiver, each short block of codewords is decoded in parallel, followed by a semantic error correction (SEC) model to reconstruct corrupted segments semantically. We design and train the SEC model based on Bidirectional and Auto-Regressive Trans"},"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":"2505.08536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-05-13T13:07:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"133684ca3977ffa1161e0e280931085d0e34f984c4d76076e32daebe616c54e6","abstract_canon_sha256":"8e7ba12f6e8bb6ff25df939570648e4bea82dc4e9f56a891eddedb1e75a2ee0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:44.097137Z","signature_b64":"M1ghEqj0QTyfdjUCsWKD/5hk7W1hShwZNx6pV0eBux6dx01iQCgHG+fMU4WFm533r44On9XUks1Xteu9vNIGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"badd162de19f3026b47bfec5dffd2589d5262256e87e63e8304ec257c45549e1","last_reissued_at":"2026-07-05T11:02:44.096634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:44.096634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Branka Vucetic, Chentao Yue, Hao Chang, Jiafu Hao, Yonghui Li","submitted_at":"2025-05-13T13:07:01Z","abstract_excerpt":"This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is divided into segments, where each is encoded with short block channel codes independently before transmission. At the receiver, each short block of codewords is decoded in parallel, followed by a semantic error correction (SEC) model to reconstruct corrupted segments semantically. We design and train the SEC model based on Bidirectional and Auto-Regressive Trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08536","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/2505.08536/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":"2505.08536","created_at":"2026-07-05T11:02:44.096694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08536v1","created_at":"2026-07-05T11:02:44.096694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08536","created_at":"2026-07-05T11:02:44.096694+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLORMLPBT4YC","created_at":"2026-07-05T11:02:44.096694+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLORMLPBT4YCNND3","created_at":"2026-07-05T11:02:44.096694+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLORMLPB","created_at":"2026-07-05T11:02:44.096694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27641","citing_title":"Semantics-Aware Hierarchical Token Communication: Clustering, Bit Mapping, and Power Allocation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19035","citing_title":"LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08419","citing_title":"Real-Time Cross-Layer Semantic Error Correction Using Language Models and Software-Defined Radio","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02296","citing_title":"Semantic Ordered Statistics Decoding","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH","json":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH.json","graph_json":"https://pith.science/api/pith-number/XLORMLPBT4YCNND373C577JFRH/graph.json","events_json":"https://pith.science/api/pith-number/XLORMLPBT4YCNND373C577JFRH/events.json","paper":"https://pith.science/paper/XLORMLPB"},"agent_actions":{"view_html":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH","download_json":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH.json","view_paper":"https://pith.science/paper/XLORMLPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08536&json=true","fetch_graph":"https://pith.science/api/pith-number/XLORMLPBT4YCNND373C577JFRH/graph.json","fetch_events":"https://pith.science/api/pith-number/XLORMLPBT4YCNND373C577JFRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH/action/storage_attestation","attest_author":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH/action/author_attestation","sign_citation":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH/action/citation_signature","submit_replication":"https://pith.science/pith/XLORMLPBT4YCNND373C577JFRH/action/replication_record"}},"created_at":"2026-07-05T11:02:44.096694+00:00","updated_at":"2026-07-05T11:02:44.096694+00:00"}