{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3RDAUJ4VSYCSPWGXLNAV45KTLR","short_pith_number":"pith:3RDAUJ4V","canonical_record":{"source":{"id":"1106.3276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:01:34Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"61bde63c769b33b21c1efcbf7c0ee8cc83fdf2972336c2ccd79dec0604f4f2b8","abstract_canon_sha256":"b936c493e4c7fbabbf73117fa51c729cbe43a79abb9862aa6bcadaea4a0cdfe6"},"schema_version":"1.0"},"canonical_sha256":"dc460a2795960527d8d75b415e75535c4db2f2c83dd566a3fa50e8908ff998fc","source":{"kind":"arxiv","id":"1106.3276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3276","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3276v1","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3276","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"3RDAUJ4VSYCS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3RDAUJ4VSYCSPWGX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3RDAUJ4V","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3RDAUJ4VSYCSPWGXLNAV45KTLR","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:01:34Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"61bde63c769b33b21c1efcbf7c0ee8cc83fdf2972336c2ccd79dec0604f4f2b8","abstract_canon_sha256":"b936c493e4c7fbabbf73117fa51c729cbe43a79abb9862aa6bcadaea4a0cdfe6"},"schema_version":"1.0"},"canonical_sha256":"dc460a2795960527d8d75b415e75535c4db2f2c83dd566a3fa50e8908ff998fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:53.821945Z","signature_b64":"4EGML6HDD5dsUH7VeUmKCFmWxM/6Ke+uRKTTZ+8HJjo9gSMY66k34yQ05txNPUgaqKP/y753ya8jvODpBVQjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc460a2795960527d8d75b415e75535c4db2f2c83dd566a3fa50e8908ff998fc","last_reissued_at":"2026-05-18T04:19:53.821235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:53.821235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3276","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-18T04:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdL4/vuQ+yK6rTUhrj1WG5GiOUKE/OWPhaHJuVhX2VxYBSFJoCUxRXyYQllLEczgF+V1l5SuA2uL2eHHN0RwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:47.544135Z"},"content_sha256":"84f527e3916ab3f1c2fbe24294fec100c17a2d6d785fe63e361a95fbcfbd7de2","schema_version":"1.0","event_id":"sha256:84f527e3916ab3f1c2fbe24294fec100c17a2d6d785fe63e361a95fbcfbd7de2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3RDAUJ4VSYCSPWGXLNAV45KTLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Levent Tun\\c{c}el, Lingchen Kong, Naihua Xiu","submitted_at":"2011-06-16T17:01:34Z","abstract_excerpt":"The low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statistics, computer vision, system identification and control. This class of optimization problems is $\\N\\P$-hard and a popular approach replaces the rank function with the nuclear norm of the matrix variable. In this paper, we extend the concept of $s$-goodness for a sensing matrix in sparse signal recovery (proposed by Juditsky and Nemirovski [Math Program, 2011]) to linear transformations in LMR. Then, we give characteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3276","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-18T04:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWNA9JxhUaGBFdf/O73ZnnJiMjtRYmuFYTavUQ2nnwRzeY876y6ESKnXQ1ZXrgDHq57Y5ssWcSRNbU2D1y+3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:47.544505Z"},"content_sha256":"c391b7e337dd3883cf75f9c998ae5947451d2646da8ef30cf06a742211f0f51f","schema_version":"1.0","event_id":"sha256:c391b7e337dd3883cf75f9c998ae5947451d2646da8ef30cf06a742211f0f51f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/bundle.json","state_url":"https://pith.science/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/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-01T05:22:47Z","links":{"resolver":"https://pith.science/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR","bundle":"https://pith.science/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/bundle.json","state":"https://pith.science/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RDAUJ4VSYCSPWGXLNAV45KTLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3RDAUJ4VSYCSPWGXLNAV45KTLR","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":"b936c493e4c7fbabbf73117fa51c729cbe43a79abb9862aa6bcadaea4a0cdfe6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:01:34Z","title_canon_sha256":"61bde63c769b33b21c1efcbf7c0ee8cc83fdf2972336c2ccd79dec0604f4f2b8"},"schema_version":"1.0","source":{"id":"1106.3276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3276","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3276v1","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3276","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"3RDAUJ4VSYCS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3RDAUJ4VSYCSPWGX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3RDAUJ4V","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:c391b7e337dd3883cf75f9c998ae5947451d2646da8ef30cf06a742211f0f51f","target":"graph","created_at":"2026-05-18T04:19:53Z","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 low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statistics, computer vision, system identification and control. This class of optimization problems is $\\N\\P$-hard and a popular approach replaces the rank function with the nuclear norm of the matrix variable. In this paper, we extend the concept of $s$-goodness for a sensing matrix in sparse signal recovery (proposed by Juditsky and Nemirovski [Math Program, 2011]) to linear transformations in LMR. Then, we give characteri","authors_text":"Levent Tun\\c{c}el, Lingchen Kong, Naihua Xiu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:01:34Z","title":"Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3276","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:84f527e3916ab3f1c2fbe24294fec100c17a2d6d785fe63e361a95fbcfbd7de2","target":"record","created_at":"2026-05-18T04:19:53Z","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":"b936c493e4c7fbabbf73117fa51c729cbe43a79abb9862aa6bcadaea4a0cdfe6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:01:34Z","title_canon_sha256":"61bde63c769b33b21c1efcbf7c0ee8cc83fdf2972336c2ccd79dec0604f4f2b8"},"schema_version":"1.0","source":{"id":"1106.3276","kind":"arxiv","version":1}},"canonical_sha256":"dc460a2795960527d8d75b415e75535c4db2f2c83dd566a3fa50e8908ff998fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc460a2795960527d8d75b415e75535c4db2f2c83dd566a3fa50e8908ff998fc","first_computed_at":"2026-05-18T04:19:53.821235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:53.821235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4EGML6HDD5dsUH7VeUmKCFmWxM/6Ke+uRKTTZ+8HJjo9gSMY66k34yQ05txNPUgaqKP/y753ya8jvODpBVQjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:53.821945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84f527e3916ab3f1c2fbe24294fec100c17a2d6d785fe63e361a95fbcfbd7de2","sha256:c391b7e337dd3883cf75f9c998ae5947451d2646da8ef30cf06a742211f0f51f"],"state_sha256":"e539fdcb88477482e26e90f9cd186649aa5f0ad9ce1a1297052420ac2c09b604"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRvCTQdkBxIcYLi7IekE39i/bUYFAkScOnBlp9G5v7dbTog0qC0Z/iMsLcFTl2hEkVnobBsg9Qu6JIq5kk+nBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:22:47.546753Z","bundle_sha256":"37e82d53f43b988501bf82b3d26c291f44b796a76d44d20429c73bbdf1aed28f"}}