{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:Q52VOWYJYZPUJRQK3DV53326FR","short_pith_number":"pith:Q52VOWYJ","schema_version":"1.0","canonical_sha256":"8775575b09c65f44c60ad8ebddef5e2c75552808709c91379ad2e034ac630eeb","source":{"kind":"arxiv","id":"cs/0508051","version":1},"attestation_state":"computed","paper":{"title":"Trellis-Based Equalization for Sparse ISI Channels Revisited","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ingmar Land, Jan Mietzner, Peter A. Hoeher, Sabah Badri-Hoeher","submitted_at":"2005-08-10T09:37:52Z","abstract_excerpt":"Sparse intersymbol-interference (ISI) channels are encountered in a variety of high-data-rate communication systems. Such channels have a large channel memory length, but only a small number of significant channel coefficients. In this paper, trellis-based equalization of sparse ISI channels is revisited. Due to the large channel memory length, the complexity of maximum-likelihood detection, e.g., by means of the Viterbi algorithm (VA), is normally prohibitive. In the first part of the paper, a unified framework based on factor graphs is presented for complexity reduction without loss of optim"},"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":"cs/0508051","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-10T09:37:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ce9cf15d9da07e3056706535fe82367ec46cbdaf712c790af3b34a507bfcd8b","abstract_canon_sha256":"3dc091be7317cc57872d01bd0cda3e6d988a899011093352b2a41538655b44ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.756476Z","signature_b64":"1rN2pQWlj7Goz9EQSDnBtNuHh6I4awby+orz/PzTkEJxB0bOCMM1SdOgfP4u2/jJ+4XDRwsy2uODAqcjKX9LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8775575b09c65f44c60ad8ebddef5e2c75552808709c91379ad2e034ac630eeb","last_reissued_at":"2026-05-18T00:58:26.755881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.755881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trellis-Based Equalization for Sparse ISI Channels Revisited","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ingmar Land, Jan Mietzner, Peter A. Hoeher, Sabah Badri-Hoeher","submitted_at":"2005-08-10T09:37:52Z","abstract_excerpt":"Sparse intersymbol-interference (ISI) channels are encountered in a variety of high-data-rate communication systems. Such channels have a large channel memory length, but only a small number of significant channel coefficients. In this paper, trellis-based equalization of sparse ISI channels is revisited. Due to the large channel memory length, the complexity of maximum-likelihood detection, e.g., by means of the Viterbi algorithm (VA), is normally prohibitive. In the first part of the paper, a unified framework based on factor graphs is presented for complexity reduction without loss of optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508051","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":"cs/0508051","created_at":"2026-05-18T00:58:26.755972+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508051v1","created_at":"2026-05-18T00:58:26.755972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508051","created_at":"2026-05-18T00:58:26.755972+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q52VOWYJYZPU","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q52VOWYJYZPUJRQK","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q52VOWYJ","created_at":"2026-05-18T12:25:53.335082+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/Q52VOWYJYZPUJRQK3DV53326FR","json":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR.json","graph_json":"https://pith.science/api/pith-number/Q52VOWYJYZPUJRQK3DV53326FR/graph.json","events_json":"https://pith.science/api/pith-number/Q52VOWYJYZPUJRQK3DV53326FR/events.json","paper":"https://pith.science/paper/Q52VOWYJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR","download_json":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR.json","view_paper":"https://pith.science/paper/Q52VOWYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508051&json=true","fetch_graph":"https://pith.science/api/pith-number/Q52VOWYJYZPUJRQK3DV53326FR/graph.json","fetch_events":"https://pith.science/api/pith-number/Q52VOWYJYZPUJRQK3DV53326FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR/action/storage_attestation","attest_author":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR/action/author_attestation","sign_citation":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR/action/citation_signature","submit_replication":"https://pith.science/pith/Q52VOWYJYZPUJRQK3DV53326FR/action/replication_record"}},"created_at":"2026-05-18T00:58:26.755972+00:00","updated_at":"2026-05-18T00:58:26.755972+00:00"}