{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DODFFY34TI44UWUB4O32FPPZCF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b920911ab15576e4940f172263d3467012d0edf9071f440ac2fff6680b0e4420","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-02T15:04:44Z","title_canon_sha256":"1e977889fc327e3e14f90557f512a1259ae1eb3c41250d75c7fee5e18a5911a2"},"schema_version":"1.0","source":{"id":"1007.0379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0379","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0379v3","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0379","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"DODFFY34TI44","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DODFFY34TI44UWUB","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DODFFY34","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:a1b516e346a979b1e84db95ec718317b87e4b29279c7907e50178ed22b6b2999","target":"graph","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksandar Kavcic, Fabian Lim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-02T15:04:44Z","title":"Reliability Distributions of Truncated Max-log-map (MLM) Detectors Applied to ISI Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0379","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f2abfbc84913cc2da6ce9f6cc83275e8d7e74fb99b629c9e8b8fa575ef625fa7","target":"record","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b920911ab15576e4940f172263d3467012d0edf9071f440ac2fff6680b0e4420","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-02T15:04:44Z","title_canon_sha256":"1e977889fc327e3e14f90557f512a1259ae1eb3c41250d75c7fee5e18a5911a2"},"schema_version":"1.0","source":{"id":"1007.0379","kind":"arxiv","version":3}},"canonical_sha256":"1b8652e37c9a39ca5a81e3b7a2bdf911521d8c0e516494529de03f7a145a0824","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8652e37c9a39ca5a81e3b7a2bdf911521d8c0e516494529de03f7a145a0824","first_computed_at":"2026-05-18T03:28:19.895160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:19.895160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9slPYin4XwwIlcv4HGsEvQgnrzrMM16y9HoSyu+y+KsWmaRcpjbU7q1izXblKdDfrswcC3QQNhplkvMY34bpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:19.895856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2abfbc84913cc2da6ce9f6cc83275e8d7e74fb99b629c9e8b8fa575ef625fa7","sha256:a1b516e346a979b1e84db95ec718317b87e4b29279c7907e50178ed22b6b2999"],"state_sha256":"dffd99391ab172219e8bf17843ca1c424d70c7a65b390d8118d90f5bcdbf2423"}