{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5ZHXQ6NTANCJIUVQ3SA7IE7BPP","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":"50fc51765048998a7a814a29178497cc9a3a1f44d46361d8513d80ef67fbf82c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-18T08:33:00Z","title_canon_sha256":"3437816b86dbad16bd8d088183e25e35ca672967b792568b883bce1fa9271ee0"},"schema_version":"1.0","source":{"id":"1311.4291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4291","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4291v2","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4291","created_at":"2026-05-18T02:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"5ZHXQ6NTANCJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ZHXQ6NTANCJIUVQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ZHXQ6NT","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a02d547a79d258852c9acdbaab28a6faaaaf413f20ffcaad5e458096180522ef","target":"graph","created_at":"2026-05-18T02:54:39Z","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"},"paper":{"abstract_excerpt":"The problem of recovering a low $n$-rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics such as image inpainting and video inpainting. In this paper, we consider a new tensor recovery model, named as minimum $n$-rank approximation (MnRA), and propose an appropriate iterative hard thresholding algorithm with giving the upper bound of the $n$-rank in advance. The convergence analysis of the proposed algorithm is also presented. Particularly, we s","authors_text":"Lei Yang, Min Zhang, Zheng-Hai Huang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-18T08:33:00Z","title":"Minimum $n$-Rank Approximation via Iterative Hard Thresholding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4291","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:7ba6d924abad31f5f5ae42ba079a1bdb8f37b5b4cdc9b48c8ffc220cec37e33f","target":"record","created_at":"2026-05-18T02:54:39Z","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":"50fc51765048998a7a814a29178497cc9a3a1f44d46361d8513d80ef67fbf82c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-18T08:33:00Z","title_canon_sha256":"3437816b86dbad16bd8d088183e25e35ca672967b792568b883bce1fa9271ee0"},"schema_version":"1.0","source":{"id":"1311.4291","kind":"arxiv","version":2}},"canonical_sha256":"ee4f7879b303449452b0dc81f413e17be2c4fa447ccc064cbe131ae67c4b62aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4f7879b303449452b0dc81f413e17be2c4fa447ccc064cbe131ae67c4b62aa","first_computed_at":"2026-05-18T02:54:39.371963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:39.371963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0Gc+CKFL8J/5VEn9Yf6MNANLGRb+RN1JBKknX4R0/e6jtdsE0eKJwVtoS1VMv6HW4SFo7WEK+lXrvnOi+TrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:39.372590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ba6d924abad31f5f5ae42ba079a1bdb8f37b5b4cdc9b48c8ffc220cec37e33f","sha256:a02d547a79d258852c9acdbaab28a6faaaaf413f20ffcaad5e458096180522ef"],"state_sha256":"c6707046dbc8d1ae42ff672845a2699be1b42e4e139312c94e9f42e1893d2ee6"}