{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F2GRW2WFLCZN5JYYKEZVJPYZKN","short_pith_number":"pith:F2GRW2WF","canonical_record":{"source":{"id":"1612.03393","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-11T09:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"7fb6e3123db5ed3d400f8f99101fad2a05446db41961f1b13cf348ccc4b646da","abstract_canon_sha256":"6332e7de5ee1df28b2eb20f5cc4f6b25fa4cd82a30f82698ebb7581459aa176d"},"schema_version":"1.0"},"canonical_sha256":"2e8d1b6ac558b2dea718513354bf195362cf497aa688eadc97081f9722f6b9bc","source":{"kind":"arxiv","id":"1612.03393","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03393","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03393v6","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03393","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"F2GRW2WFLCZN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2GRW2WFLCZN5JYY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2GRW2WF","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F2GRW2WFLCZN5JYYKEZVJPYZKN","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03393","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-11T09:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"7fb6e3123db5ed3d400f8f99101fad2a05446db41961f1b13cf348ccc4b646da","abstract_canon_sha256":"6332e7de5ee1df28b2eb20f5cc4f6b25fa4cd82a30f82698ebb7581459aa176d"},"schema_version":"1.0"},"canonical_sha256":"2e8d1b6ac558b2dea718513354bf195362cf497aa688eadc97081f9722f6b9bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:49.020086Z","signature_b64":"93b9xLoqxTjjcp8dhxUenddV60gemsp6n5ReH5YRpEpNgOaeBQCW0qypwhPVy7NJGTwpLfCvglaznidCXaQDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e8d1b6ac558b2dea718513354bf195362cf497aa688eadc97081f9722f6b9bc","last_reissued_at":"2026-05-18T00:12:49.019516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:49.019516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03393","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNK71wqE/pqz4DvrtMod6RBBZ2LuZqchALdqac971OSx6rdRpXyyE/Mf/mxT2XIcdGu0dSbiEG2G5RGO6sHsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:08:51.214507Z"},"content_sha256":"74a1bce02cf74386902239a425413db2a5c566ea92d40ddc4eb61dc2f982674a","schema_version":"1.0","event_id":"sha256:74a1bce02cf74386902239a425413db2a5c566ea92d40ddc4eb61dc2f982674a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F2GRW2WFLCZN5JYYKEZVJPYZKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact recovery low-rank matrix via transformed affine matrix rank minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng","submitted_at":"2016-12-11T09:28:27Z","abstract_excerpt":"The goal of affine matrix rank minimization problem is to reconstruct a low-rank or approximately low-rank matrix under linear constraints. In general, this problem is combinatorial and NP-hard. In this paper, a nonconvex fraction function is studied to approximate the rank of a matrix and translate this NP-hard problem into a transformed affine matrix rank minimization problem. The equivalence between these two problems is established, and we proved that the uniqueness of the global minimizer of transformed affine matrix rank minimization problem also solves affine matrix rank minimization pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03393","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWRFbh6E2MEtXJW4cSWtbc9Eu9qzsZRGhnaDPO8AeAxofVKzqJR12FForP9BTnqXuehmcN7s/WvsO/aNAfUkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:08:51.214883Z"},"content_sha256":"0a59ca6a1095f57e60d7d41d58a4fe4602f60777f1f6797cb839378142186ed2","schema_version":"1.0","event_id":"sha256:0a59ca6a1095f57e60d7d41d58a4fe4602f60777f1f6797cb839378142186ed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/bundle.json","state_url":"https://pith.science/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:08:51Z","links":{"resolver":"https://pith.science/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN","bundle":"https://pith.science/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/bundle.json","state":"https://pith.science/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2GRW2WFLCZN5JYYKEZVJPYZKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F2GRW2WFLCZN5JYYKEZVJPYZKN","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":"6332e7de5ee1df28b2eb20f5cc4f6b25fa4cd82a30f82698ebb7581459aa176d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-11T09:28:27Z","title_canon_sha256":"7fb6e3123db5ed3d400f8f99101fad2a05446db41961f1b13cf348ccc4b646da"},"schema_version":"1.0","source":{"id":"1612.03393","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03393","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03393v6","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03393","created_at":"2026-05-18T00:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"F2GRW2WFLCZN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2GRW2WFLCZN5JYY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2GRW2WF","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:0a59ca6a1095f57e60d7d41d58a4fe4602f60777f1f6797cb839378142186ed2","target":"graph","created_at":"2026-05-18T00:12:49Z","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 goal of affine matrix rank minimization problem is to reconstruct a low-rank or approximately low-rank matrix under linear constraints. In general, this problem is combinatorial and NP-hard. In this paper, a nonconvex fraction function is studied to approximate the rank of a matrix and translate this NP-hard problem into a transformed affine matrix rank minimization problem. The equivalence between these two problems is established, and we proved that the uniqueness of the global minimizer of transformed affine matrix rank minimization problem also solves affine matrix rank minimization pr","authors_text":"Angang Cui, Haiyang Li, Jigen Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-11T09:28:27Z","title":"Exact recovery low-rank matrix via transformed affine matrix rank minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03393","kind":"arxiv","version":6},"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:74a1bce02cf74386902239a425413db2a5c566ea92d40ddc4eb61dc2f982674a","target":"record","created_at":"2026-05-18T00:12:49Z","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":"6332e7de5ee1df28b2eb20f5cc4f6b25fa4cd82a30f82698ebb7581459aa176d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-11T09:28:27Z","title_canon_sha256":"7fb6e3123db5ed3d400f8f99101fad2a05446db41961f1b13cf348ccc4b646da"},"schema_version":"1.0","source":{"id":"1612.03393","kind":"arxiv","version":6}},"canonical_sha256":"2e8d1b6ac558b2dea718513354bf195362cf497aa688eadc97081f9722f6b9bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e8d1b6ac558b2dea718513354bf195362cf497aa688eadc97081f9722f6b9bc","first_computed_at":"2026-05-18T00:12:49.019516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:49.019516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"93b9xLoqxTjjcp8dhxUenddV60gemsp6n5ReH5YRpEpNgOaeBQCW0qypwhPVy7NJGTwpLfCvglaznidCXaQDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:49.020086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03393","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74a1bce02cf74386902239a425413db2a5c566ea92d40ddc4eb61dc2f982674a","sha256:0a59ca6a1095f57e60d7d41d58a4fe4602f60777f1f6797cb839378142186ed2"],"state_sha256":"6c1ed5b8527c037c54ad7e4ee9b96c66140f64179abf7045a3a3ab9aeb0eb5ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1iS2clIkCYr5YGRegZTURiJlo3sCLszt4DsNoAkCchsSHvAuO1ys7vG3dKXWzdU2Om5Yor9nGuFiCXyhOMPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:08:51.217016Z","bundle_sha256":"3c485f7aa4de7944d01a227b778a5ac3bda080c0c4770416df613fcd900f8aa7"}}