{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IRTE5VDVSLLF7ZHX73VRHSV53H","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":"0e8c97e4e0d8aec26f9ffb58ff53360ad6ab77dd92f1a04ba0aaa96b63f3322b","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-15T02:57:57Z","title_canon_sha256":"6e0a40401d10108f698a50163fd2cea6dcc14669968f0281d59a630bbdb83e25"},"schema_version":"1.0","source":{"id":"2006.08099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08099","created_at":"2026-07-05T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08099v1","created_at":"2026-07-05T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08099","created_at":"2026-07-05T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"IRTE5VDVSLLF","created_at":"2026-07-05T01:10:18Z"},{"alias_kind":"pith_short_16","alias_value":"IRTE5VDVSLLF7ZHX","created_at":"2026-07-05T01:10:18Z"},{"alias_kind":"pith_short_8","alias_value":"IRTE5VDV","created_at":"2026-07-05T01:10:18Z"}],"graph_snapshots":[{"event_id":"sha256:1c876570c17778adc9b3e5cd92c27ab633d220ee7454922249717a65cf4a5033","target":"graph","created_at":"2026-07-05T01:10:18Z","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/2006.08099/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimization theory assisted algorithms have received great attention for precoding design in multiuser multiple-input multiple-output (MU-MIMO) systems. Although the resultant optimization algorithms are able to provide excellent performance, they generally require considerable computational complexity, which gets in the way of their practical application in real-time systems. In this work, in order to address this issue, we first propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed in matrix form to be","authors_text":"Guanding Yu, Kaidi Xu, Qingjiang Shi, Qiyu Hu, Yunlong Cai, Zhi Ding","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-15T02:57:57Z","title":"Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08099","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:858ed623ae128ddd2d9b7124046ef17c549f582b8e2c1b02afe02659ae22dafc","target":"record","created_at":"2026-07-05T01:10:18Z","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":"0e8c97e4e0d8aec26f9ffb58ff53360ad6ab77dd92f1a04ba0aaa96b63f3322b","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-15T02:57:57Z","title_canon_sha256":"6e0a40401d10108f698a50163fd2cea6dcc14669968f0281d59a630bbdb83e25"},"schema_version":"1.0","source":{"id":"2006.08099","kind":"arxiv","version":1}},"canonical_sha256":"44664ed47592d65fe4f7feeb13cabdd9e5d3fd8bd94b651d25f382279d7f8b88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44664ed47592d65fe4f7feeb13cabdd9e5d3fd8bd94b651d25f382279d7f8b88","first_computed_at":"2026-07-05T01:10:18.293948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:18.293948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELBxP6oGqoSBtK7CYJ/GsyfM7xatnhRr6bQvqmsdsw52z0SnzuQfCDi+K7pmn7qodEZygNyXBgRNXEA7WvbpCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:18.294512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:858ed623ae128ddd2d9b7124046ef17c549f582b8e2c1b02afe02659ae22dafc","sha256:1c876570c17778adc9b3e5cd92c27ab633d220ee7454922249717a65cf4a5033"],"state_sha256":"c27e6a81f3dd19047489a1c523cc47227c83d29bf9504cdde32e5832f37bb4e0"}