{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PBBP6UQGH4PKE2TGJTQEIE4SHI","short_pith_number":"pith:PBBP6UQG","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"},"canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","source":{"kind":"arxiv","id":"1101.4279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4279","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4279v1","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4279","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"PBBP6UQGH4PK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBBP6UQGH4PKE2TG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBBP6UQG","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PBBP6UQGH4PKE2TGJTQEIE4SHI","target":"record","payload":{"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"},"canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","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"},"source_kind":"arxiv","source_id":"1101.4279","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oTWJbMX+k2IWtIb9x2AUHHgcepPlYOyZRpBWvqFAlWETXkIWsAWKRRS/txryRj5Id/argH4VN23GD48Ig4yBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:34:09.161676Z"},"content_sha256":"c9f2cce10414b5e1860d88ba97fc36023b44ee3e3825609a43048b438aadcc5f","schema_version":"1.0","event_id":"sha256:c9f2cce10414b5e1860d88ba97fc36023b44ee3e3825609a43048b438aadcc5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PBBP6UQGH4PKE2TGJTQEIE4SHI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+MbctrC3m7xuEonkcZ2f6yKXJ5byP16wn4t4Uc1R30Tu8O4rJWS9h66/6CY7PQhAPGGTQ+PRZBYZjL0AbHdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:34:09.162035Z"},"content_sha256":"a873230e0c74abc1f26489a84375ac51c0aa1718093ef0d22642b7cad67f3816","schema_version":"1.0","event_id":"sha256:a873230e0c74abc1f26489a84375ac51c0aa1718093ef0d22642b7cad67f3816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/bundle.json","state_url":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T04:34:09Z","links":{"resolver":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI","bundle":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/bundle.json","state":"https://pith.science/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBBP6UQGH4PKE2TGJTQEIE4SHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PBBP6UQGH4PKE2TGJTQEIE4SHI","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":"c6c61effc80444af71f9a55694f701924d58ed020065320f82295fc87f20b509","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-22T11:18:31Z","title_canon_sha256":"53d087dddceff8d8bd5ddc287d22941ed365008e50337e76bdb615fae1527c04"},"schema_version":"1.0","source":{"id":"1101.4279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4279","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4279v1","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4279","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"PBBP6UQGH4PK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBBP6UQGH4PKE2TG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBBP6UQG","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a873230e0c74abc1f26489a84375ac51c0aa1718093ef0d22642b7cad67f3816","target":"graph","created_at":"2026-05-18T02:03:25Z","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":"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","authors_text":"A. Chockalingam, B. Sundar Rajan, N. Srinidhi, Pritam Som, Tanumay Datta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-22T11:18:31Z","title":"Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4279","kind":"arxiv","version":1},"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:c9f2cce10414b5e1860d88ba97fc36023b44ee3e3825609a43048b438aadcc5f","target":"record","created_at":"2026-05-18T02:03:25Z","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":"c6c61effc80444af71f9a55694f701924d58ed020065320f82295fc87f20b509","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-22T11:18:31Z","title_canon_sha256":"53d087dddceff8d8bd5ddc287d22941ed365008e50337e76bdb615fae1527c04"},"schema_version":"1.0","source":{"id":"1101.4279","kind":"arxiv","version":1}},"canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7842ff52063f1ea26a664ce04413923a0ce3cf4815b5f0b1d7ee7e3c821a77c1","first_computed_at":"2026-05-18T02:03:25.369192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:25.369192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXgSChGo23JFM5MwP65vR+kfs56MEh3kZlJem0Bt9kApemTm33rIW/B1jkuk0EEm2oFB+noWaVEq/8y4WTPsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:25.369844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9f2cce10414b5e1860d88ba97fc36023b44ee3e3825609a43048b438aadcc5f","sha256:a873230e0c74abc1f26489a84375ac51c0aa1718093ef0d22642b7cad67f3816"],"state_sha256":"2105b468e89fae52d843835006dd0dfebebb1965ff7e97dd6418a8fae2223734"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgkR1+bCXg6wrBSWOZSxSbIXkDZYiCvFLje4+ppt8tnY+6e7X9PNhquNhIRra72dWSRw1/LmpUx7NHSPd8gNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:34:09.164259Z","bundle_sha256":"874c9083fb28b5d8ea865e2a904f93f06a2595f28ab9174502568f2edc65788d"}}