{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVEG24DGUML5CGAB2Z2UDG5P4L","short_pith_number":"pith:FVEG24DG","canonical_record":{"source":{"id":"1802.05234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T17:44:22Z","cross_cats_sorted":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"431785c4174f7d44fbff452c4b07a11a7c5e045f3c0aa77925507c6c7a926dea","abstract_canon_sha256":"1b1cfe1fb30622c4b8a07504a55f351a991869ff64044f9fd5bc36d92ba75b09"},"schema_version":"1.0"},"canonical_sha256":"2d486d7066a317d11801d675419bafe2f7fe41ab3d425aab4c7cbf378be6d0f5","source":{"kind":"arxiv","id":"1802.05234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05234","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05234v1","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05234","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"FVEG24DGUML5","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVEG24DGUML5CGAB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVEG24DG","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVEG24DGUML5CGAB2Z2UDG5P4L","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T17:44:22Z","cross_cats_sorted":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"431785c4174f7d44fbff452c4b07a11a7c5e045f3c0aa77925507c6c7a926dea","abstract_canon_sha256":"1b1cfe1fb30622c4b8a07504a55f351a991869ff64044f9fd5bc36d92ba75b09"},"schema_version":"1.0"},"canonical_sha256":"2d486d7066a317d11801d675419bafe2f7fe41ab3d425aab4c7cbf378be6d0f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:19.937141Z","signature_b64":"0byr/WE+4xi9h+ySOCnMNz01GlwEvAa/JrgH0QVY63cxjknpDzuv40rwUrf7qz0fs3/BFobiLxclB4GAKrfEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d486d7066a317d11801d675419bafe2f7fe41ab3d425aab4c7cbf378be6d0f5","last_reissued_at":"2026-05-18T00:23:19.936394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:19.936394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05234","source_version":1,"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:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prYvlSwuCz20fY9zmVaQ10XvCwrdws6vC9cpA5sZf980ZLcKxKPm42JXIPXpzqaz6eqVBsTYxH2PBSfhOA4ABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:28:51.848470Z"},"content_sha256":"77ef2ed9ff05808ca712b09704e04cec7865f85ceffcb8a2a636ec4121adfbf5","schema_version":"1.0","event_id":"sha256:77ef2ed9ff05808ca712b09704e04cec7865f85ceffcb8a2a636ec4121adfbf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVEG24DGUML5CGAB2Z2UDG5P4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Necessary and Sufficient Null Space Condition for Nuclear Norm Minimization in Low-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Jirong Yi, Weiyu Xu","submitted_at":"2018-02-14T17:44:22Z","abstract_excerpt":"Low-rank matrix recovery has found many applications in science and engineering such as machine learning, signal processing, collaborative filtering, system identification, and Euclidean embedding. But the low-rank matrix recovery problem is an NP hard problem and thus challenging. A commonly used heuristic approach is the nuclear norm minimization. In [12,14,15], the authors established the necessary and sufficient null space conditions for nuclear norm minimization to recover every possible low-rank matrix with rank at most r (the strong null space condition). In addition, in [12], Oymak et "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05234","kind":"arxiv","version":1},"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:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wr4FJvuAaxyePPm9igx/3g3vtyC+Dyipfe7zj79yBvIuc/hJ1+PKRfbeitkkMrFll4tG0G3Y8OL7yfEh/VivAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:28:51.848824Z"},"content_sha256":"6fdafab65f32cb7feb2135f5324cee22feaed4f324f01c0f31a7c2feaa9790f5","schema_version":"1.0","event_id":"sha256:6fdafab65f32cb7feb2135f5324cee22feaed4f324f01c0f31a7c2feaa9790f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/bundle.json","state_url":"https://pith.science/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/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-04T03:28:51Z","links":{"resolver":"https://pith.science/pith/FVEG24DGUML5CGAB2Z2UDG5P4L","bundle":"https://pith.science/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/bundle.json","state":"https://pith.science/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVEG24DGUML5CGAB2Z2UDG5P4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVEG24DGUML5CGAB2Z2UDG5P4L","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":"1b1cfe1fb30622c4b8a07504a55f351a991869ff64044f9fd5bc36d92ba75b09","cross_cats_sorted":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T17:44:22Z","title_canon_sha256":"431785c4174f7d44fbff452c4b07a11a7c5e045f3c0aa77925507c6c7a926dea"},"schema_version":"1.0","source":{"id":"1802.05234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05234","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05234v1","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05234","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"FVEG24DGUML5","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVEG24DGUML5CGAB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVEG24DG","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6fdafab65f32cb7feb2135f5324cee22feaed4f324f01c0f31a7c2feaa9790f5","target":"graph","created_at":"2026-05-18T00:23:19Z","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":"Low-rank matrix recovery has found many applications in science and engineering such as machine learning, signal processing, collaborative filtering, system identification, and Euclidean embedding. But the low-rank matrix recovery problem is an NP hard problem and thus challenging. A commonly used heuristic approach is the nuclear norm minimization. In [12,14,15], the authors established the necessary and sufficient null space conditions for nuclear norm minimization to recover every possible low-rank matrix with rank at most r (the strong null space condition). In addition, in [12], Oymak et ","authors_text":"Jirong Yi, Weiyu Xu","cross_cats":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T17:44:22Z","title":"Necessary and Sufficient Null Space Condition for Nuclear Norm Minimization in Low-Rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05234","kind":"arxiv","version":1},"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:77ef2ed9ff05808ca712b09704e04cec7865f85ceffcb8a2a636ec4121adfbf5","target":"record","created_at":"2026-05-18T00:23:19Z","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":"1b1cfe1fb30622c4b8a07504a55f351a991869ff64044f9fd5bc36d92ba75b09","cross_cats_sorted":["cs.IT","cs.LG","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T17:44:22Z","title_canon_sha256":"431785c4174f7d44fbff452c4b07a11a7c5e045f3c0aa77925507c6c7a926dea"},"schema_version":"1.0","source":{"id":"1802.05234","kind":"arxiv","version":1}},"canonical_sha256":"2d486d7066a317d11801d675419bafe2f7fe41ab3d425aab4c7cbf378be6d0f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d486d7066a317d11801d675419bafe2f7fe41ab3d425aab4c7cbf378be6d0f5","first_computed_at":"2026-05-18T00:23:19.936394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:19.936394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0byr/WE+4xi9h+ySOCnMNz01GlwEvAa/JrgH0QVY63cxjknpDzuv40rwUrf7qz0fs3/BFobiLxclB4GAKrfEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:19.937141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77ef2ed9ff05808ca712b09704e04cec7865f85ceffcb8a2a636ec4121adfbf5","sha256:6fdafab65f32cb7feb2135f5324cee22feaed4f324f01c0f31a7c2feaa9790f5"],"state_sha256":"65055157afd376d8d83900a6884e2e03da74cb36628e00832f1d0cea08f861a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cEt9zYaWyh5tP96g6ock/lJ5ILN7Vp6sVepxGXB532u1sqv95gz0Z7wsUaB5vOyF4Np9UEb5zJC2sJnUk9DAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:28:51.850780Z","bundle_sha256":"6d0c44c112afce3da9152a710cd0ee07daf26b796a7c53f069256c745063ed98"}}