{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2KKXFK2MREVFC4B3BR6XPWHSCE","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":"0ed56a92ac9baaba81c280cee36a9aa9c31211bbd5a5ce3889506f34fef33e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T13:08:19Z","title_canon_sha256":"d5db50a668fe47b239c7f3dece75d498535f13e9913c16189b2dd30480b5ca1d"},"schema_version":"1.0","source":{"id":"1611.07777","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07777","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07777v3","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07777","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"2KKXFK2MREVF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KKXFK2MREVFC4B3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KKXFK2M","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:d06b60ae90884ef08e5a7f491a90267df4fba41dcc1766c96accf33d015f2a24","target":"graph","created_at":"2026-05-18T00:45:22Z","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":"Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank non-convex fraction function is studied to replace the rank function in this NP-hard problem. Inspired by our former work in compressed sensing, an iterative singular value thresholding algorithm is proposed to solve the regularization transformed affine matrix rank minimization problem. For different $a>0$, we could get a much better result by adjusting th","authors_text":"Angang Cui, Chengyi Zhang, Haiyang Li, Jigen Peng, Yongchao Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T13:08:19Z","title":"Affine matrix rank minimization problem via non-convex fraction function penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07777","kind":"arxiv","version":3},"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:ef945f69dfb7beda26e92fb7670a3ffbc19cc3b67b845df448a72d33461d12d6","target":"record","created_at":"2026-05-18T00:45:22Z","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":"0ed56a92ac9baaba81c280cee36a9aa9c31211bbd5a5ce3889506f34fef33e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T13:08:19Z","title_canon_sha256":"d5db50a668fe47b239c7f3dece75d498535f13e9913c16189b2dd30480b5ca1d"},"schema_version":"1.0","source":{"id":"1611.07777","kind":"arxiv","version":3}},"canonical_sha256":"d29572ab4c892a51703b0c7d77d8f2111f914b5858e208f065555e189af45d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d29572ab4c892a51703b0c7d77d8f2111f914b5858e208f065555e189af45d62","first_computed_at":"2026-05-18T00:45:22.196832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:22.196832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PqCMnFGCvwyQRmV/n+DdyrXjyvJ7ZDfqJtCD469gQx81AymO5C9SeqPd1OAoTpF0PlyIZRn/L14wd9ICPrIECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:22.197423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07777","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef945f69dfb7beda26e92fb7670a3ffbc19cc3b67b845df448a72d33461d12d6","sha256:d06b60ae90884ef08e5a7f491a90267df4fba41dcc1766c96accf33d015f2a24"],"state_sha256":"d0519c040751bbb23c05bd10ac9059a2b2a82d769b8c69a1bcd43d2468c0e882"}