{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HS5KQUBU7D3ZT5RWFELX7C3HWX","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":"7440a2fe84233f78b85c9f90f680c7822ec6345e5ea0b1a8deeee96bf17d10d4","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T13:43:42Z","title_canon_sha256":"f5baea937292bcc95cb53b86236bfd648e4d8d7feeb83208fec1c7fd8a50fc04"},"schema_version":"1.0","source":{"id":"1909.01175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01175","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01175v1","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01175","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"HS5KQUBU7D3Z","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_16","alias_value":"HS5KQUBU7D3ZT5RW","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_8","alias_value":"HS5KQUBU","created_at":"2026-07-05T00:01:16Z"}],"graph_snapshots":[{"event_id":"sha256:0e7f9138e630af742906a76033f3f71152cd843530cef88d0082cd447b0a4ad4","target":"graph","created_at":"2026-07-05T00:01:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.01175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we attack one of the most fundamental signal processing/informaton theory problems, widely known as the MIMO ML-detection. We introduce a powerful Random Duality Theory (RDT) mechanism that we refer to as the Controlled Loosening-up (CLuP) as a way of achieving the exact ML-performance in MIMO systems in polynomial time. We first outline the general strategy and then discuss the rationale behind the entire concept. A solid collection of results obtained through numerical experiments is presented as well and found to be in an excellent agreement with what the theory predicts. As t","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T13:43:42Z","title":"Controlled Loosening-up (CLuP) -- achieving exact MIMO ML in polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01175","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:5df211b703626e3184b7562ff2afdc2aa16cbe4c42d680be0f4e30cfc1698675","target":"record","created_at":"2026-07-05T00:01:16Z","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":"7440a2fe84233f78b85c9f90f680c7822ec6345e5ea0b1a8deeee96bf17d10d4","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T13:43:42Z","title_canon_sha256":"f5baea937292bcc95cb53b86236bfd648e4d8d7feeb83208fec1c7fd8a50fc04"},"schema_version":"1.0","source":{"id":"1909.01175","kind":"arxiv","version":1}},"canonical_sha256":"3cbaa85034f8f799f63629177f8b67b5e761a0874caa18946f9b237139e82974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cbaa85034f8f799f63629177f8b67b5e761a0874caa18946f9b237139e82974","first_computed_at":"2026-07-05T00:01:16.623873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:16.623873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ed/NGcnrLfvjJpL6/qqudMJDYCm/aPDt3ZWEQUS+xvY9wlBrHMOaqgjf6CZ/aawD9ubwgRL1umYQo7pniffrAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:16.624281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df211b703626e3184b7562ff2afdc2aa16cbe4c42d680be0f4e30cfc1698675","sha256:0e7f9138e630af742906a76033f3f71152cd843530cef88d0082cd447b0a4ad4"],"state_sha256":"4f85095cda7dbb12c1bb4b7edffc80abf78bb14b03d775b7fd7f0849158959a1"}