{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UVCYENLYI4GPAM2JHXUBV5MBK7","short_pith_number":"pith:UVCYENLY","schema_version":"1.0","canonical_sha256":"a545823578470cf033493de81af58157e081f221c4b0b70f68b289e55c9946b6","source":{"kind":"arxiv","id":"2102.04586","version":1},"attestation_state":"computed","paper":{"title":"Tightness and Equivalence of Semidefinite Relaxations for MIMO Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"math.OC","authors_text":"Bo Jiang, Chenglong Bao, Ruichen Jiang, Ya-Feng Liu","submitted_at":"2021-02-09T00:23:49Z","abstract_excerpt":"The multiple-input multiple-output (MIMO) detection problem, a fundamental problem in modern digital communications, is to detect a vector of transmitted symbols from the noisy outputs of a fading MIMO channel. The maximum likelihood detector can be formulated as a complex least-squares problem with discrete variables, which is NP-hard in general. Various semidefinite relaxation (SDR) methods have been proposed in the literature to solve the problem due to their polynomial-time worst-case complexity and good detection error rate performance. In this paper, we consider two popular classes of SD"},"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":"2102.04586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-09T00:23:49Z","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"title_canon_sha256":"d7c194a391a0baa32b66cc3b642f6ecffb33a73374405294094de3fd6c7355fc","abstract_canon_sha256":"0b6a1d6e44e13d78f466b511771bf88fdaa52299298aaf91973f2dcd4c469559"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:02.104922Z","signature_b64":"vnZyKXzGmdoOgKC4tzhlb95bkyQmVuJfuDN+dtO8zRqj/DJ+UiYr79/l/7qiU6EO+Qwim1uI3S1GvwPlT3a5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a545823578470cf033493de81af58157e081f221c4b0b70f68b289e55c9946b6","last_reissued_at":"2026-07-05T02:14:02.104449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:02.104449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tightness and Equivalence of Semidefinite Relaxations for MIMO Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"math.OC","authors_text":"Bo Jiang, Chenglong Bao, Ruichen Jiang, Ya-Feng Liu","submitted_at":"2021-02-09T00:23:49Z","abstract_excerpt":"The multiple-input multiple-output (MIMO) detection problem, a fundamental problem in modern digital communications, is to detect a vector of transmitted symbols from the noisy outputs of a fading MIMO channel. The maximum likelihood detector can be formulated as a complex least-squares problem with discrete variables, which is NP-hard in general. Various semidefinite relaxation (SDR) methods have been proposed in the literature to solve the problem due to their polynomial-time worst-case complexity and good detection error rate performance. In this paper, we consider two popular classes of SD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04586","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.04586/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.04586","created_at":"2026-07-05T02:14:02.104503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04586v1","created_at":"2026-07-05T02:14:02.104503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04586","created_at":"2026-07-05T02:14:02.104503+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVCYENLYI4GP","created_at":"2026-07-05T02:14:02.104503+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVCYENLYI4GPAM2J","created_at":"2026-07-05T02:14:02.104503+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVCYENLY","created_at":"2026-07-05T02:14:02.104503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02006","citing_title":"Exact algorithms for quadratic optimization over roots of unity","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7","json":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7.json","graph_json":"https://pith.science/api/pith-number/UVCYENLYI4GPAM2JHXUBV5MBK7/graph.json","events_json":"https://pith.science/api/pith-number/UVCYENLYI4GPAM2JHXUBV5MBK7/events.json","paper":"https://pith.science/paper/UVCYENLY"},"agent_actions":{"view_html":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7","download_json":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7.json","view_paper":"https://pith.science/paper/UVCYENLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04586&json=true","fetch_graph":"https://pith.science/api/pith-number/UVCYENLYI4GPAM2JHXUBV5MBK7/graph.json","fetch_events":"https://pith.science/api/pith-number/UVCYENLYI4GPAM2JHXUBV5MBK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7/action/storage_attestation","attest_author":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7/action/author_attestation","sign_citation":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7/action/citation_signature","submit_replication":"https://pith.science/pith/UVCYENLYI4GPAM2JHXUBV5MBK7/action/replication_record"}},"created_at":"2026-07-05T02:14:02.104503+00:00","updated_at":"2026-07-05T02:14:02.104503+00:00"}