{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DODFFY34TI44UWUB4O32FPPZCF","short_pith_number":"pith:DODFFY34","schema_version":"1.0","canonical_sha256":"1b8652e37c9a39ca5a81e3b7a2bdf911521d8c0e516494529de03f7a145a0824","source":{"kind":"arxiv","id":"1007.0379","version":3},"attestation_state":"computed","paper":{"title":"Reliability Distributions of Truncated Max-log-map (MLM) Detectors Applied to ISI Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Kavcic, Fabian Lim","submitted_at":"2010-07-02T15:04:44Z","abstract_excerpt":"The max-log-map (MLM) receiver is an approximated version of the well-known, Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The MLM algorithm is attractive due to its implementation simplicity. In practice, sliding-window implementations are preferred; these practical implementations consider truncated signaling neighborhoods around each transmission time instant. In this paper, we consider sliding-window MLM receivers, where for any integer m, the MLM detector is truncated to a length- m signaling neighborhood. For any number n of chosen times instants, we derive exact expressions for both i) the"},"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":"1007.0379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-02T15:04:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e977889fc327e3e14f90557f512a1259ae1eb3c41250d75c7fee5e18a5911a2","abstract_canon_sha256":"b920911ab15576e4940f172263d3467012d0edf9071f440ac2fff6680b0e4420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:19.895856Z","signature_b64":"9slPYin4XwwIlcv4HGsEvQgnrzrMM16y9HoSyu+y+KsWmaRcpjbU7q1izXblKdDfrswcC3QQNhplkvMY34bpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8652e37c9a39ca5a81e3b7a2bdf911521d8c0e516494529de03f7a145a0824","last_reissued_at":"2026-05-18T03:28:19.895160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:19.895160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliability Distributions of Truncated Max-log-map (MLM) Detectors Applied to ISI Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Kavcic, Fabian Lim","submitted_at":"2010-07-02T15:04:44Z","abstract_excerpt":"The max-log-map (MLM) receiver is an approximated version of the well-known, Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The MLM algorithm is attractive due to its implementation simplicity. In practice, sliding-window implementations are preferred; these practical implementations consider truncated signaling neighborhoods around each transmission time instant. In this paper, we consider sliding-window MLM receivers, where for any integer m, the MLM detector is truncated to a length- m signaling neighborhood. For any number n of chosen times instants, we derive exact expressions for both i) the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0379","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":""},"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":"1007.0379","created_at":"2026-05-18T03:28:19.895265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.0379v3","created_at":"2026-05-18T03:28:19.895265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0379","created_at":"2026-05-18T03:28:19.895265+00:00"},{"alias_kind":"pith_short_12","alias_value":"DODFFY34TI44","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DODFFY34TI44UWUB","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DODFFY34","created_at":"2026-05-18T12:26:06.534383+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/DODFFY34TI44UWUB4O32FPPZCF","json":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF.json","graph_json":"https://pith.science/api/pith-number/DODFFY34TI44UWUB4O32FPPZCF/graph.json","events_json":"https://pith.science/api/pith-number/DODFFY34TI44UWUB4O32FPPZCF/events.json","paper":"https://pith.science/paper/DODFFY34"},"agent_actions":{"view_html":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF","download_json":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF.json","view_paper":"https://pith.science/paper/DODFFY34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.0379&json=true","fetch_graph":"https://pith.science/api/pith-number/DODFFY34TI44UWUB4O32FPPZCF/graph.json","fetch_events":"https://pith.science/api/pith-number/DODFFY34TI44UWUB4O32FPPZCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF/action/storage_attestation","attest_author":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF/action/author_attestation","sign_citation":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF/action/citation_signature","submit_replication":"https://pith.science/pith/DODFFY34TI44UWUB4O32FPPZCF/action/replication_record"}},"created_at":"2026-05-18T03:28:19.895265+00:00","updated_at":"2026-05-18T03:28:19.895265+00:00"}