{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TEEM7XSVYQQ2X2T2QWVMTNZ4XD","short_pith_number":"pith:TEEM7XSV","canonical_record":{"source":{"id":"1707.00573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","cross_cats_sorted":[],"title_canon_sha256":"48a12f69d912879db255137b0824f8b0d563cb6b6218109ce2e28382bfdf0a81","abstract_canon_sha256":"1ce3c160a299ff0860e08dd4cc5d82712731ff313a6e65334387a58b9e413069"},"schema_version":"1.0"},"canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","source":{"kind":"arxiv","id":"1707.00573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00573","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00573v3","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00573","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"TEEM7XSVYQQ2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TEEM7XSVYQQ2X2T2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TEEM7XSV","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TEEM7XSVYQQ2X2T2QWVMTNZ4XD","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","cross_cats_sorted":[],"title_canon_sha256":"48a12f69d912879db255137b0824f8b0d563cb6b6218109ce2e28382bfdf0a81","abstract_canon_sha256":"1ce3c160a299ff0860e08dd4cc5d82712731ff313a6e65334387a58b9e413069"},"schema_version":"1.0"},"canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:54.674335Z","signature_b64":"2TUHqDUlzw35hfbdNwlsbfQwOIp6H+LrtffdzezRGFG1wLxYEkk9h3NsuYDtQ+qS4GJ6tfRSsTlQNN0S8zXbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","last_reissued_at":"2026-05-18T00:17:54.673630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:54.673630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00573","source_version":3,"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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywYAJFJIEkiUWRU/8IG/C5Ag7ymRsydqy8gXI+sgIlkZvV3pyuEhys9gLuoMOV/wmrWzu0WtgSVSTCLgkloADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:47:58.619109Z"},"content_sha256":"f19838cf6fdeca4b268821906bcfcef47deb880685cf405a4be924415b2caffb","schema_version":"1.0","event_id":"sha256:f19838cf6fdeca4b268821906bcfcef47deb880685cf405a4be924415b2caffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TEEM7XSVYQQ2X2T2QWVMTNZ4XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized singular value thresholding operator to affine matrix rank minimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Junxiong Jia","submitted_at":"2017-07-03T14:38:23Z","abstract_excerpt":"It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to the combinational nature of the rank function. In this paper, a generalized singular value thresholding operator is generated to solve the affine matrix rank minimization problem. Numerical experiments show that our algorithm performs effectively in finding a low-rank matrix compared with some state-of-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00573","kind":"arxiv","version":3},"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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LGQXJfbOibokttv4zJ74XX6tJudF33vN+uU0cZVHf/iirIvyVwguWOJVZd1WGlShXFndGJtkQrKuN6sMd3XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:47:58.619476Z"},"content_sha256":"512e4c15a0811f195aab22c2f758a935b513f249dd97a8f261c83d4632be9208","schema_version":"1.0","event_id":"sha256:512e4c15a0811f195aab22c2f758a935b513f249dd97a8f261c83d4632be9208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/bundle.json","state_url":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/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-04T01:47:58Z","links":{"resolver":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD","bundle":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/bundle.json","state":"https://pith.science/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEEM7XSVYQQ2X2T2QWVMTNZ4XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TEEM7XSVYQQ2X2T2QWVMTNZ4XD","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":"1ce3c160a299ff0860e08dd4cc5d82712731ff313a6e65334387a58b9e413069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","title_canon_sha256":"48a12f69d912879db255137b0824f8b0d563cb6b6218109ce2e28382bfdf0a81"},"schema_version":"1.0","source":{"id":"1707.00573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00573","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00573v3","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00573","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"TEEM7XSVYQQ2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TEEM7XSVYQQ2X2T2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TEEM7XSV","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:512e4c15a0811f195aab22c2f758a935b513f249dd97a8f261c83d4632be9208","target":"graph","created_at":"2026-05-18T00:17:54Z","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":"It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to the combinational nature of the rank function. In this paper, a generalized singular value thresholding operator is generated to solve the affine matrix rank minimization problem. Numerical experiments show that our algorithm performs effectively in finding a low-rank matrix compared with some state-of-art methods.","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Junxiong Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","title":"Generalized singular value thresholding operator to affine matrix rank minimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00573","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:f19838cf6fdeca4b268821906bcfcef47deb880685cf405a4be924415b2caffb","target":"record","created_at":"2026-05-18T00:17:54Z","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":"1ce3c160a299ff0860e08dd4cc5d82712731ff313a6e65334387a58b9e413069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-03T14:38:23Z","title_canon_sha256":"48a12f69d912879db255137b0824f8b0d563cb6b6218109ce2e28382bfdf0a81"},"schema_version":"1.0","source":{"id":"1707.00573","kind":"arxiv","version":3}},"canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9908cfde55c421abea7a85aac9b73cb8f0e7b925971e709f8acd375b3385cef8","first_computed_at":"2026-05-18T00:17:54.673630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:54.673630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2TUHqDUlzw35hfbdNwlsbfQwOIp6H+LrtffdzezRGFG1wLxYEkk9h3NsuYDtQ+qS4GJ6tfRSsTlQNN0S8zXbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:54.674335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f19838cf6fdeca4b268821906bcfcef47deb880685cf405a4be924415b2caffb","sha256:512e4c15a0811f195aab22c2f758a935b513f249dd97a8f261c83d4632be9208"],"state_sha256":"231888b65c4b31549be6eaa3c200e748af7343b780e3987e365e33d6abcd1d40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mU2dlSPxvvr1RIND6O4hkZaS+Zvg+At4N4xoVdSFYx3PXFy8fzDGwECVlvuaL1Xm0o6+s8lTStmXcyj0UuSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:47:58.621481Z","bundle_sha256":"0540d198f8e4c3fe044d48e9ff7a80933d170a469012a8a931c44ec3d9f67214"}}