{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2KKXFK2MREVFC4B3BR6XPWHSCE","short_pith_number":"pith:2KKXFK2M","canonical_record":{"source":{"id":"1611.07777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T13:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"d5db50a668fe47b239c7f3dece75d498535f13e9913c16189b2dd30480b5ca1d","abstract_canon_sha256":"0ed56a92ac9baaba81c280cee36a9aa9c31211bbd5a5ce3889506f34fef33e36"},"schema_version":"1.0"},"canonical_sha256":"d29572ab4c892a51703b0c7d77d8f2111f914b5858e208f065555e189af45d62","source":{"kind":"arxiv","id":"1611.07777","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2KKXFK2MREVFC4B3BR6XPWHSCE","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-23T13:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"d5db50a668fe47b239c7f3dece75d498535f13e9913c16189b2dd30480b5ca1d","abstract_canon_sha256":"0ed56a92ac9baaba81c280cee36a9aa9c31211bbd5a5ce3889506f34fef33e36"},"schema_version":"1.0"},"canonical_sha256":"d29572ab4c892a51703b0c7d77d8f2111f914b5858e208f065555e189af45d62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:22.197423Z","signature_b64":"PqCMnFGCvwyQRmV/n+DdyrXjyvJ7ZDfqJtCD469gQx81AymO5C9SeqPd1OAoTpF0PlyIZRn/L14wd9ICPrIECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d29572ab4c892a51703b0c7d77d8f2111f914b5858e208f065555e189af45d62","last_reissued_at":"2026-05-18T00:45:22.196832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:22.196832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07777","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeij0erpJV6kSvZehyb3VCPuk4spRcVFs3YTeg4kRZOc/22r0Edv31yhnPPb+pWx2jpX6IJAw5Xzz6NqA1BLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:25.086761Z"},"content_sha256":"ef945f69dfb7beda26e92fb7670a3ffbc19cc3b67b845df448a72d33461d12d6","schema_version":"1.0","event_id":"sha256:ef945f69dfb7beda26e92fb7670a3ffbc19cc3b67b845df448a72d33461d12d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2KKXFK2MREVFC4B3BR6XPWHSCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Affine matrix rank minimization problem via non-convex fraction function penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Chengyi Zhang, Haiyang Li, Jigen Peng, Yongchao Yu","submitted_at":"2016-11-23T13:08:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07777","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGONQruDCxSDMh3OwU/u8INKHyvWXAuqyeeAvsRSrciRiKD7o+cU08WkdFwpI8R/7FtfXu2L0KQjFa/yfLDcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:25.087104Z"},"content_sha256":"d06b60ae90884ef08e5a7f491a90267df4fba41dcc1766c96accf33d015f2a24","schema_version":"1.0","event_id":"sha256:d06b60ae90884ef08e5a7f491a90267df4fba41dcc1766c96accf33d015f2a24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/bundle.json","state_url":"https://pith.science/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/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-04T12:34:25Z","links":{"resolver":"https://pith.science/pith/2KKXFK2MREVFC4B3BR6XPWHSCE","bundle":"https://pith.science/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/bundle.json","state":"https://pith.science/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KKXFK2MREVFC4B3BR6XPWHSCE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzKHyEZYo6oI+w3ve63DKGdeLFGdkpfornbldgGZjDdYwO7Qo503WP2rHKyqzqvNInahErfcmT0zinmFZgyoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:34:25.089080Z","bundle_sha256":"0bda4f9bc089a78cc1ea0a12560d9a5232ab081f48736f9426163fdfffd252df"}}