{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BNWFL2PY7ONIR5EGGWFI4RX4EH","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":"a8c2f707e659aacd3cc348fece8b7738a6d789fe20b546bd4360b2a629e0bc83","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:59:06Z","title_canon_sha256":"3534f8469b6bcaaa01785198e9a9237d7d278a0421b89b88ee205d28dfff2f9e"},"schema_version":"1.0","source":{"id":"1909.01190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01190","created_at":"2026-07-05T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01190v2","created_at":"2026-07-05T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01190","created_at":"2026-07-05T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"BNWFL2PY7ONI","created_at":"2026-07-05T00:02:15Z"},{"alias_kind":"pith_short_16","alias_value":"BNWFL2PY7ONIR5EG","created_at":"2026-07-05T00:02:15Z"},{"alias_kind":"pith_short_8","alias_value":"BNWFL2PY","created_at":"2026-07-05T00:02:15Z"}],"graph_snapshots":[{"event_id":"sha256:42b629d22f90d51f476a3ae25420b672fc436fd27d2b4dc1139210a05fa1c555","target":"graph","created_at":"2026-07-05T00:02:15Z","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.01190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In our companion paper \\cite{Stojnicclupint19} we introduced a powerful mechanism that we referred to as the Controlled Loosening-up (CLuP) for handling MIMO ML-detection problems. It turned out that the algorithm has many remarkable features and one of them, the \\emph{computational complexity}, we discuss in more details in this paper. As was explained in \\cite{Stojnicclupint19}, the CLuP is an iterative procedure where each iteration amounts to solving a simple quadratic program. This clearly implies that the key contributing factor to its overall computational complexity is the number of it","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:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01190","kind":"arxiv","version":2},"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:be4994341c8b6ea3d78916c2c554b0e28300c68882760adb94d48e3c4af3bdf1","target":"record","created_at":"2026-07-05T00:02:15Z","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":"a8c2f707e659aacd3cc348fece8b7738a6d789fe20b546bd4360b2a629e0bc83","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:59:06Z","title_canon_sha256":"3534f8469b6bcaaa01785198e9a9237d7d278a0421b89b88ee205d28dfff2f9e"},"schema_version":"1.0","source":{"id":"1909.01190","kind":"arxiv","version":2}},"canonical_sha256":"0b6c55e9f8fb9a88f486358a8e46fc21d24d32dd3629c292d8d0fc1195dad72b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b6c55e9f8fb9a88f486358a8e46fc21d24d32dd3629c292d8d0fc1195dad72b","first_computed_at":"2026-07-05T00:02:15.327642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:15.327642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ny0J/mqaoMJjRu7ieoAkm2FPJtfAOKprvhnHJhXhISfTerT+knjW94oN/mc23tUnQMyyzBjumyPENv1K3rKnDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:15.328067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4994341c8b6ea3d78916c2c554b0e28300c68882760adb94d48e3c4af3bdf1","sha256:42b629d22f90d51f476a3ae25420b672fc436fd27d2b4dc1139210a05fa1c555"],"state_sha256":"1164830f6c58bfcb767ddd82d063ab07f78ed313ff9e35ffc07db9d3917d36b0"}