{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:COYFO6YUHYZSPTKCTIJCW7S5SS","short_pith_number":"pith:COYFO6YU","canonical_record":{"source":{"id":"1103.5479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-03-28T20:36:03Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"title_canon_sha256":"a485d65f29755dfec67d93762f64e59b57b83e67aa3ceb631a6104b68bd4edea","abstract_canon_sha256":"0944f0071150ee5b99e6a58d50915de1bc0e499636832935eb10dfd28a7bb802"},"schema_version":"1.0"},"canonical_sha256":"13b0577b143e3327cd429a122b7e5d94a28983dfb474ccd133cc63501cb20bd9","source":{"kind":"arxiv","id":"1103.5479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5479","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5479v1","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5479","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"pith_short_12","alias_value":"COYFO6YUHYZS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"COYFO6YUHYZSPTKC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"COYFO6YU","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:COYFO6YUHYZSPTKCTIJCW7S5SS","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-03-28T20:36:03Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"title_canon_sha256":"a485d65f29755dfec67d93762f64e59b57b83e67aa3ceb631a6104b68bd4edea","abstract_canon_sha256":"0944f0071150ee5b99e6a58d50915de1bc0e499636832935eb10dfd28a7bb802"},"schema_version":"1.0"},"canonical_sha256":"13b0577b143e3327cd429a122b7e5d94a28983dfb474ccd133cc63501cb20bd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:43.917683Z","signature_b64":"HBGbiiOmljvxaxO/v/6ocqoB7DpITTyxmtvxuKj+5P0kw4PY29ztcYSTilQHs5+pPlP2LT6jMACzdORJ8K0YDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b0577b143e3327cd429a122b7e5d94a28983dfb474ccd133cc63501cb20bd9","last_reissued_at":"2026-05-18T02:02:43.917064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:43.917064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5479","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-18T02:02:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ltuvrcEqELpE9Xp5pAgvMheRZ7Is5FEk4qFEi+UcNMJmt1vj7ePaOUp9oBZ3q5el0BfS/g5qn2N7+XWgUOlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:32.459796Z"},"content_sha256":"cf5281ab3e60c6cc12e06735d67c93350b47c218531b50a1b2a056cfccc8c079","schema_version":"1.0","event_id":"sha256:cf5281ab3e60c6cc12e06735d67c93350b47c218531b50a1b2a056cfccc8c079"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:COYFO6YUHYZSPTKCTIJCW7S5SS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unicity conditions for low-rank matrix recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Yaniv Plan, Yonina C. Eldar","submitted_at":"2011-03-28T20:36:03Z","abstract_excerpt":"Low-rank matrix recovery addresses the problem of recovering an unknown low-rank matrix from few linear measurements. Nuclear-norm minimization is a tractible approach with a recent surge of strong theoretical backing. Analagous to the theory of compressed sensing, these results have required random measurements. For example, m >= Cnr Gaussian measurements are sufficient to recover any rank-r n x n matrix with high probability. In this paper we address the theoretical question of how many measurements are needed via any method whatsoever --- tractible or not. We show that for a family of rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5479","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-18T02:02:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yx3gzqUfV+3RzyWod96MB7gK7z0YOrYLsmBL0GH+iS9qata9RTsdHxWWgTf1C8mH7gqMXBxx3witvYbrwlaoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:32.460586Z"},"content_sha256":"66296840c635b79ef384579090e0d98ce9c51cbb6eb1093ef64bf2fd3eb39914","schema_version":"1.0","event_id":"sha256:66296840c635b79ef384579090e0d98ce9c51cbb6eb1093ef64bf2fd3eb39914"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/bundle.json","state_url":"https://pith.science/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/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-30T10:43:32Z","links":{"resolver":"https://pith.science/pith/COYFO6YUHYZSPTKCTIJCW7S5SS","bundle":"https://pith.science/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/bundle.json","state":"https://pith.science/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COYFO6YUHYZSPTKCTIJCW7S5SS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:COYFO6YUHYZSPTKCTIJCW7S5SS","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":"0944f0071150ee5b99e6a58d50915de1bc0e499636832935eb10dfd28a7bb802","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-03-28T20:36:03Z","title_canon_sha256":"a485d65f29755dfec67d93762f64e59b57b83e67aa3ceb631a6104b68bd4edea"},"schema_version":"1.0","source":{"id":"1103.5479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5479","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5479v1","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5479","created_at":"2026-05-18T02:02:43Z"},{"alias_kind":"pith_short_12","alias_value":"COYFO6YUHYZS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"COYFO6YUHYZSPTKC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"COYFO6YU","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:66296840c635b79ef384579090e0d98ce9c51cbb6eb1093ef64bf2fd3eb39914","target":"graph","created_at":"2026-05-18T02:02:43Z","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 addresses the problem of recovering an unknown low-rank matrix from few linear measurements. Nuclear-norm minimization is a tractible approach with a recent surge of strong theoretical backing. Analagous to the theory of compressed sensing, these results have required random measurements. For example, m >= Cnr Gaussian measurements are sufficient to recover any rank-r n x n matrix with high probability. In this paper we address the theoretical question of how many measurements are needed via any method whatsoever --- tractible or not. We show that for a family of rando","authors_text":"Deanna Needell, Yaniv Plan, Yonina C. Eldar","cross_cats":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-03-28T20:36:03Z","title":"Unicity conditions for low-rank matrix recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5479","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:cf5281ab3e60c6cc12e06735d67c93350b47c218531b50a1b2a056cfccc8c079","target":"record","created_at":"2026-05-18T02:02:43Z","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":"0944f0071150ee5b99e6a58d50915de1bc0e499636832935eb10dfd28a7bb802","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-03-28T20:36:03Z","title_canon_sha256":"a485d65f29755dfec67d93762f64e59b57b83e67aa3ceb631a6104b68bd4edea"},"schema_version":"1.0","source":{"id":"1103.5479","kind":"arxiv","version":1}},"canonical_sha256":"13b0577b143e3327cd429a122b7e5d94a28983dfb474ccd133cc63501cb20bd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b0577b143e3327cd429a122b7e5d94a28983dfb474ccd133cc63501cb20bd9","first_computed_at":"2026-05-18T02:02:43.917064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:43.917064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HBGbiiOmljvxaxO/v/6ocqoB7DpITTyxmtvxuKj+5P0kw4PY29ztcYSTilQHs5+pPlP2LT6jMACzdORJ8K0YDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:43.917683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf5281ab3e60c6cc12e06735d67c93350b47c218531b50a1b2a056cfccc8c079","sha256:66296840c635b79ef384579090e0d98ce9c51cbb6eb1093ef64bf2fd3eb39914"],"state_sha256":"b14f00058826038a6e458d95b499ec97bd62465163d4cd98dd7cd195f847428a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svzgselLzzBZ4GhUj5xDHM14lki/2iVYWI7O5sQnxesbI8Szgyz7mVxV/nBxPCS9tfUcbjVzgTKHC6rEaTNiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:43:32.464770Z","bundle_sha256":"c11d80740195f3589e0c88b7db9918137d9501e70b14df07586a2e643e8082a3"}}