{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3CEKCEYHBFP7W5FABWQVFSHJDB","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":"9c42935ef1338cb37169a8283b1cf27e6590157325d716ff8cb712ce9f42b54a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T07:02:46Z","title_canon_sha256":"afc82400161b57b7d7d681574e2ca1fd2bf912706b19a6f7fa230c025a78322d"},"schema_version":"1.0","source":{"id":"1802.03704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03704","created_at":"2026-07-05T00:30:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03704v1","created_at":"2026-07-05T00:30:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03704","created_at":"2026-07-05T00:30:50Z"},{"alias_kind":"pith_short_12","alias_value":"3CEKCEYHBFP7","created_at":"2026-07-05T00:30:50Z"},{"alias_kind":"pith_short_16","alias_value":"3CEKCEYHBFP7W5FA","created_at":"2026-07-05T00:30:50Z"},{"alias_kind":"pith_short_8","alias_value":"3CEKCEYH","created_at":"2026-07-05T00:30:50Z"}],"graph_snapshots":[{"event_id":"sha256:9120af2c5c1b0c0f086719e9ba68887922823a6dd0479236d240ac83069239d3","target":"graph","created_at":"2026-07-05T00:30:50Z","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/1802.03704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The affine rank minimization (ARM) problem arises in many real-world applications. The goal is to recover a low-rank matrix from a small amount of noisy affine measurements. The original problem is NP-hard, and so directly solving the problem is computationally prohibitive. Approximate low-complexity solutions for ARM have recently attracted much research interest. In this paper, we design an iterative algorithm for ARM based on message passing principles. The proposed algorithm is termed turbo-type ARM (TARM), as inspired by the recently developed turbo compressed sensing algorithm for sparse","authors_text":"Junjie Ma, Xiaojun Yuan, Yi Ma, Zhipeng Xue","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T07:02:46Z","title":"TARM: A Turbo-type Algorithm for Affine Rank Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03704","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:bca9c326ee0769bdaafe215bfa4ed08783ff285b4f18ba723a5e74fd5ba94138","target":"record","created_at":"2026-07-05T00:30:50Z","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":"9c42935ef1338cb37169a8283b1cf27e6590157325d716ff8cb712ce9f42b54a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-11T07:02:46Z","title_canon_sha256":"afc82400161b57b7d7d681574e2ca1fd2bf912706b19a6f7fa230c025a78322d"},"schema_version":"1.0","source":{"id":"1802.03704","kind":"arxiv","version":1}},"canonical_sha256":"d888a11307095ffb74a00da152c8e918611ce3b51a0610bd8313418a6ab38682","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d888a11307095ffb74a00da152c8e918611ce3b51a0610bd8313418a6ab38682","first_computed_at":"2026-07-05T00:30:50.725352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:30:50.725352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b0mvclGHCgMzk+34MQrvrul+YxjbV8fOu9wB5ywKm3VwUy6lI6J055Tm064tMXNGCnsqz/OPNOpGM/upPbfSDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:30:50.725904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bca9c326ee0769bdaafe215bfa4ed08783ff285b4f18ba723a5e74fd5ba94138","sha256:9120af2c5c1b0c0f086719e9ba68887922823a6dd0479236d240ac83069239d3"],"state_sha256":"d36dccdbd62afb932a79581244b40dbb158e01cafb76d5b8c190cfc4f77b94c6"}