{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EBQQQPHM6W6OAAGL7RVXWXRVJC","short_pith_number":"pith:EBQQQPHM","schema_version":"1.0","canonical_sha256":"2061083cecf5bce000cbfc6b7b5e3548a680d2693181c705df6cef4a3f41b585","source":{"kind":"arxiv","id":"1403.3786","version":1},"attestation_state":"computed","paper":{"title":"Universal Decoding for Gaussian Intersymbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Wasim Huleihel","submitted_at":"2014-03-15T10:44:39Z","abstract_excerpt":"A universal decoding procedure is proposed for the intersymbol interference (ISI) Gaussian channels. The universality of the proposed decoder is in the sense of being independent of the various channel parameters, and at the same time, attaining the same random coding error exponent as the optimal maximum-likelihood (ML) decoder, which utilizes full knowledge of these unknown parameters. The proposed decoding rule can be regarded as a frequency domain version of the universal maximum mutual information (MMI) decoder. Contrary to previously suggested universal decoders for ISI channels, our pro"},"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":"1403.3786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T10:44:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e94c06c2e4356dac38653c345c96ff5ebe3c1e9517df5906bfc4da79abd79dee","abstract_canon_sha256":"246c30b6efb6c9452543427d56941f12249cb746274a5910a8bd8c8976d86e63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:13.445193Z","signature_b64":"TKwFdGGITSiNmz8GCYH8reADVxY6SF0/opbpVZNH8SHQNmZep0eSdB2i6eQ+t2QNmkV74YVi8ZJN6Oq8V36VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2061083cecf5bce000cbfc6b7b5e3548a680d2693181c705df6cef4a3f41b585","last_reissued_at":"2026-05-18T02:56:13.444747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:13.444747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Decoding for Gaussian Intersymbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Wasim Huleihel","submitted_at":"2014-03-15T10:44:39Z","abstract_excerpt":"A universal decoding procedure is proposed for the intersymbol interference (ISI) Gaussian channels. The universality of the proposed decoder is in the sense of being independent of the various channel parameters, and at the same time, attaining the same random coding error exponent as the optimal maximum-likelihood (ML) decoder, which utilizes full knowledge of these unknown parameters. The proposed decoding rule can be regarded as a frequency domain version of the universal maximum mutual information (MMI) decoder. Contrary to previously suggested universal decoders for ISI channels, our pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3786","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":"1403.3786","created_at":"2026-05-18T02:56:13.444819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3786v1","created_at":"2026-05-18T02:56:13.444819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3786","created_at":"2026-05-18T02:56:13.444819+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBQQQPHM6W6O","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBQQQPHM6W6OAAGL","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBQQQPHM","created_at":"2026-05-18T12:28:25.294606+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/EBQQQPHM6W6OAAGL7RVXWXRVJC","json":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC.json","graph_json":"https://pith.science/api/pith-number/EBQQQPHM6W6OAAGL7RVXWXRVJC/graph.json","events_json":"https://pith.science/api/pith-number/EBQQQPHM6W6OAAGL7RVXWXRVJC/events.json","paper":"https://pith.science/paper/EBQQQPHM"},"agent_actions":{"view_html":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC","download_json":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC.json","view_paper":"https://pith.science/paper/EBQQQPHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3786&json=true","fetch_graph":"https://pith.science/api/pith-number/EBQQQPHM6W6OAAGL7RVXWXRVJC/graph.json","fetch_events":"https://pith.science/api/pith-number/EBQQQPHM6W6OAAGL7RVXWXRVJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC/action/storage_attestation","attest_author":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC/action/author_attestation","sign_citation":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC/action/citation_signature","submit_replication":"https://pith.science/pith/EBQQQPHM6W6OAAGL7RVXWXRVJC/action/replication_record"}},"created_at":"2026-05-18T02:56:13.444819+00:00","updated_at":"2026-05-18T02:56:13.444819+00:00"}