{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Q2NZIATEQX3EJIAXNCI4DL7VHZ","short_pith_number":"pith:Q2NZIATE","canonical_record":{"source":{"id":"1103.1178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-07T00:34:25Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"d7a447e43e3d4b71eb8af49d08b285e44ddd37609f3df4a3091d146fb01668a8","abstract_canon_sha256":"4c881842160a8fd25c1c3236c0df3fa1ef2977381d37e4c3e0794cd90a346ac6"},"schema_version":"1.0"},"canonical_sha256":"869b94026485f644a0176891c1aff53e73a03a408dc9b3fd15d635b69884c755","source":{"kind":"arxiv","id":"1103.1178","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1178","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1178v3","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1178","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q2NZIATEQX3E","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q2NZIATEQX3EJIAX","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q2NZIATE","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Q2NZIATEQX3EJIAXNCI4DL7VHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-07T00:34:25Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"d7a447e43e3d4b71eb8af49d08b285e44ddd37609f3df4a3091d146fb01668a8","abstract_canon_sha256":"4c881842160a8fd25c1c3236c0df3fa1ef2977381d37e4c3e0794cd90a346ac6"},"schema_version":"1.0"},"canonical_sha256":"869b94026485f644a0176891c1aff53e73a03a408dc9b3fd15d635b69884c755","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:44.687034Z","signature_b64":"V8UQilSAZnLH1UX2Y8GwabXxYZWnnR7LtZEG0kWAYceCw1dLKgL+vzdRMIE1jHv+7AAIJbVKoZco18mk6D0OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869b94026485f644a0176891c1aff53e73a03a408dc9b3fd15d635b69884c755","last_reissued_at":"2026-05-18T04:08:44.686607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:44.686607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1178","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-18T04:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3YQPn9NgzdQeKOFGHt8YBHhU3ZKB27JXdkuxTAq3NWjhzYWkBxgsPrntholEjejJ+rHRGB/9ckNK82NFQnfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:38:51.593651Z"},"content_sha256":"7c9fcf3e94aad4e36772432783db832ce32d2dc9d3734c498f1ae6b40423b6bf","schema_version":"1.0","event_id":"sha256:7c9fcf3e94aad4e36772432783db832ce32d2dc9d3734c498f1ae6b40423b6bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Q2NZIATEQX3EJIAXNCI4DL7VHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simplified Approach to Recovery Conditions for Low Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Babak Hassibi, Karthik Mohan, Maryam Fazel, Samet Oymak","submitted_at":"2011-03-07T00:34:25Z","abstract_excerpt":"Recovering sparse vectors and low-rank matrices from noisy linear measurements has been the focus of much recent research. Various reconstruction algorithms have been studied, including $\\ell_1$ and nuclear norm minimization as well as $\\ell_p$ minimization with $p<1$. These algorithms are known to succeed if certain conditions on the measurement map are satisfied. Proofs of robust recovery for matrices have so far been much more involved than in the vector case.\n  In this paper, we show how several robust classes of recovery conditions can be extended from vectors to matrices in a simple and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1178","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-18T04:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osIKLWAXdPEkfYrwKzHq2dWlYnpxod0MoSunNyLZqzS42JCPs00hP6N6CFEBXyxM+talKPRLJTdQAZkWlEHoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:38:51.594132Z"},"content_sha256":"5f02e211c20e828a4633b5c425e515aa526fcc841dc0df8f95f96f60cdeef661","schema_version":"1.0","event_id":"sha256:5f02e211c20e828a4633b5c425e515aa526fcc841dc0df8f95f96f60cdeef661"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/bundle.json","state_url":"https://pith.science/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/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-05-23T01:38:51Z","links":{"resolver":"https://pith.science/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ","bundle":"https://pith.science/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/bundle.json","state":"https://pith.science/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2NZIATEQX3EJIAXNCI4DL7VHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q2NZIATEQX3EJIAXNCI4DL7VHZ","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":"4c881842160a8fd25c1c3236c0df3fa1ef2977381d37e4c3e0794cd90a346ac6","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-07T00:34:25Z","title_canon_sha256":"d7a447e43e3d4b71eb8af49d08b285e44ddd37609f3df4a3091d146fb01668a8"},"schema_version":"1.0","source":{"id":"1103.1178","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1178","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1178v3","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1178","created_at":"2026-05-18T04:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q2NZIATEQX3E","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q2NZIATEQX3EJIAX","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q2NZIATE","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:5f02e211c20e828a4633b5c425e515aa526fcc841dc0df8f95f96f60cdeef661","target":"graph","created_at":"2026-05-18T04:08:44Z","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":"Recovering sparse vectors and low-rank matrices from noisy linear measurements has been the focus of much recent research. Various reconstruction algorithms have been studied, including $\\ell_1$ and nuclear norm minimization as well as $\\ell_p$ minimization with $p<1$. These algorithms are known to succeed if certain conditions on the measurement map are satisfied. Proofs of robust recovery for matrices have so far been much more involved than in the vector case.\n  In this paper, we show how several robust classes of recovery conditions can be extended from vectors to matrices in a simple and ","authors_text":"Babak Hassibi, Karthik Mohan, Maryam Fazel, Samet Oymak","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-07T00:34:25Z","title":"A Simplified Approach to Recovery Conditions for Low Rank Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1178","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:7c9fcf3e94aad4e36772432783db832ce32d2dc9d3734c498f1ae6b40423b6bf","target":"record","created_at":"2026-05-18T04:08:44Z","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":"4c881842160a8fd25c1c3236c0df3fa1ef2977381d37e4c3e0794cd90a346ac6","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-07T00:34:25Z","title_canon_sha256":"d7a447e43e3d4b71eb8af49d08b285e44ddd37609f3df4a3091d146fb01668a8"},"schema_version":"1.0","source":{"id":"1103.1178","kind":"arxiv","version":3}},"canonical_sha256":"869b94026485f644a0176891c1aff53e73a03a408dc9b3fd15d635b69884c755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"869b94026485f644a0176891c1aff53e73a03a408dc9b3fd15d635b69884c755","first_computed_at":"2026-05-18T04:08:44.686607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:44.686607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8UQilSAZnLH1UX2Y8GwabXxYZWnnR7LtZEG0kWAYceCw1dLKgL+vzdRMIE1jHv+7AAIJbVKoZco18mk6D0OCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:44.687034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1178","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c9fcf3e94aad4e36772432783db832ce32d2dc9d3734c498f1ae6b40423b6bf","sha256:5f02e211c20e828a4633b5c425e515aa526fcc841dc0df8f95f96f60cdeef661"],"state_sha256":"8fadb8f9844e34f5f8fde6ae69f9b1d5ef18186e4da9fb74ab2fe10ea50a6d6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PRQxteffV/mhrdVv+FUwRSOzwYwfjb0TcL7sHU/M5hz6/qBbH2EPt96U1jCS5d6lGvgmqIZo0QbYAZNGkSzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T01:38:51.597152Z","bundle_sha256":"39f5bc9c288e9a18102714b2b142f08b3d9bde7f77e364ba4258632b49aa47fb"}}