{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N2I26H67Z6E33WEFKCTXJ4MNDX","short_pith_number":"pith:N2I26H67","schema_version":"1.0","canonical_sha256":"6e91af1fdfcf89bdd88550a774f18d1dde5ac433da95b8c0ad07fdd9affa40f9","source":{"kind":"arxiv","id":"1402.7258","version":1},"attestation_state":"computed","paper":{"title":"An Information Theoretic Charachterization of Channel Shortening Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fredrik Rusek, Ove Edfors","submitted_at":"2014-02-28T14:30:02Z","abstract_excerpt":"Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of w"},"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":"1402.7258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T14:30:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a727e8b15913e9a86b766834507cec7c7c9568b534a46ed132ab5f39967ed2a","abstract_canon_sha256":"49777e3d5635f2d897558ed029332ca45685d7d50792594d2f5172fe438c4ce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.524528Z","signature_b64":"fiz5vedrn/0nWHvMOgJr3Vu4f9/tSnxHqed3gC7lVATDcZflyXnXo3jNNs2ToqnFQzBn6YWF0GqbcOIHwwJ8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e91af1fdfcf89bdd88550a774f18d1dde5ac433da95b8c0ad07fdd9affa40f9","last_reissued_at":"2026-05-18T02:57:34.524037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.524037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Information Theoretic Charachterization of Channel Shortening Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fredrik Rusek, Ove Edfors","submitted_at":"2014-02-28T14:30:02Z","abstract_excerpt":"Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7258","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":""},"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":"1402.7258","created_at":"2026-05-18T02:57:34.524118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7258v1","created_at":"2026-05-18T02:57:34.524118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7258","created_at":"2026-05-18T02:57:34.524118+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2I26H67Z6E3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2I26H67Z6E33WEF","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2I26H67","created_at":"2026-05-18T12:28:41.024544+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/N2I26H67Z6E33WEFKCTXJ4MNDX","json":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX.json","graph_json":"https://pith.science/api/pith-number/N2I26H67Z6E33WEFKCTXJ4MNDX/graph.json","events_json":"https://pith.science/api/pith-number/N2I26H67Z6E33WEFKCTXJ4MNDX/events.json","paper":"https://pith.science/paper/N2I26H67"},"agent_actions":{"view_html":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX","download_json":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX.json","view_paper":"https://pith.science/paper/N2I26H67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7258&json=true","fetch_graph":"https://pith.science/api/pith-number/N2I26H67Z6E33WEFKCTXJ4MNDX/graph.json","fetch_events":"https://pith.science/api/pith-number/N2I26H67Z6E33WEFKCTXJ4MNDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX/action/storage_attestation","attest_author":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX/action/author_attestation","sign_citation":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX/action/citation_signature","submit_replication":"https://pith.science/pith/N2I26H67Z6E33WEFKCTXJ4MNDX/action/replication_record"}},"created_at":"2026-05-18T02:57:34.524118+00:00","updated_at":"2026-05-18T02:57:34.524118+00:00"}