{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PBBP6UQGH4PKE2TGJTQEIE4SHI","short_pith_number":"pith:PBBP6UQG","schema_version":"1.0","canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","source":{"kind":"arxiv","id":"1101.4279","version":1},"attestation_state":"computed","paper":{"title":"Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chockalingam, B. Sundar Rajan, N. Srinidhi, Pritam Som, Tanumay Datta","submitted_at":"2011-01-22T11:18:31Z","abstract_excerpt":"In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov Random Field (MRF) ba"},"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":"1101.4279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-22T11:18:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53d087dddceff8d8bd5ddc287d22941ed365008e50337e76bdb615fae1527c04","abstract_canon_sha256":"c6c61effc80444af71f9a55694f701924d58ed020065320f82295fc87f20b509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:25.369844Z","signature_b64":"VXgSChGo23JFM5MwP65vR+kfs56MEh3kZlJem0Bt9kApemTm33rIW/B1jkuk0EEm2oFB+noWaVEq/8y4WTPsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","last_reissued_at":"2026-05-18T02:03:25.369192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:25.369192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chockalingam, B. Sundar Rajan, N. Srinidhi, Pritam Som, Tanumay Datta","submitted_at":"2011-01-22T11:18:31Z","abstract_excerpt":"In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov Random Field (MRF) ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4279","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":"1101.4279","created_at":"2026-05-18T02:03:25.369285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4279v1","created_at":"2026-05-18T02:03:25.369285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4279","created_at":"2026-05-18T02:03:25.369285+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBBP6UQGH4PK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBBP6UQGH4PKE2TG","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBBP6UQG","created_at":"2026-05-18T12:26:39.201973+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/PBBP6UQGH4PKE2TGJTQEIE4SHI","json":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI.json","graph_json":"https://pith.science/api/pith-number/PBBP6UQGH4PKE2TGJTQEIE4SHI/graph.json","events_json":"https://pith.science/api/pith-number/PBBP6UQGH4PKE2TGJTQEIE4SHI/events.json","paper":"https://pith.science/paper/PBBP6UQG"},"agent_actions":{"view_html":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI","download_json":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI.json","view_paper":"https://pith.science/paper/PBBP6UQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4279&json=true","fetch_graph":"https://pith.science/api/pith-number/PBBP6UQGH4PKE2TGJTQEIE4SHI/graph.json","fetch_events":"https://pith.science/api/pith-number/PBBP6UQGH4PKE2TGJTQEIE4SHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/action/storage_attestation","attest_author":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/action/author_attestation","sign_citation":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/action/citation_signature","submit_replication":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/action/replication_record"}},"created_at":"2026-05-18T02:03:25.369285+00:00","updated_at":"2026-05-18T02:03:25.369285+00:00"}