{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T7V4TZP4AW5WRIFL5DMQF2XH5F","short_pith_number":"pith:T7V4TZP4","canonical_record":{"source":{"id":"1112.5629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-23T18:25:17Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a1bb5581500045146c5b77a417979f27f633ae54958f77f5fdadd4e0e399cb5f","abstract_canon_sha256":"fb87a911610096f4936d83e13b7dc128411722fb5e543574c51f1cab0f9c431b"},"schema_version":"1.0"},"canonical_sha256":"9febc9e5fc05bb68a0abe8d902eae7e971596061fb90ca3d534c69f0ecb25607","source":{"kind":"arxiv","id":"1112.5629","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5629","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5629v2","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5629","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"T7V4TZP4AW5W","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T7V4TZP4AW5WRIFL","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T7V4TZP4","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T7V4TZP4AW5WRIFL5DMQF2XH5F","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-23T18:25:17Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a1bb5581500045146c5b77a417979f27f633ae54958f77f5fdadd4e0e399cb5f","abstract_canon_sha256":"fb87a911610096f4936d83e13b7dc128411722fb5e543574c51f1cab0f9c431b"},"schema_version":"1.0"},"canonical_sha256":"9febc9e5fc05bb68a0abe8d902eae7e971596061fb90ca3d534c69f0ecb25607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:37.855573Z","signature_b64":"z1Zk83pGVeUybi6Oh0XbY+K9YpY8XF9DEPXR20+RxO54VOH93qvkHuf9pdudsVgKyZRBZtMGQBtUXQb+gReqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9febc9e5fc05bb68a0abe8d902eae7e971596061fb90ca3d534c69f0ecb25607","last_reissued_at":"2026-05-18T04:05:37.855183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:37.855183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5629","source_version":2,"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:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eisv1/v30ANscDYooIlIn6BvPDHjLEW+ysBDhumBwcK5X1qHOLPnJFFlZXgN96OzXltn7waCJawVlMc25Cn5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:52:04.081110Z"},"content_sha256":"eba8da398b0cc967c0f0780b3441644f2c5ad2785bacd15660b3622d3ae67c0d","schema_version":"1.0","event_id":"sha256:eba8da398b0cc967c0f0780b3441644f2c5ad2785bacd15660b3622d3ae67c0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T7V4TZP4AW5WRIFL5DMQF2XH5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Rank Matrix Completion and Subspace Clustering with Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Brian Eriksson, Laura Balzano, Robert Nowak","submitted_at":"2011-12-23T18:25:17Z","abstract_excerpt":"This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion problem to situations in which the matrix rank can be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also be viewed as a missing-data version of the subspace clustering problem. Let X be an n x N matrix whose (complete) columns lie in a union of at most k subspaces, each of rank <= r < n, and assume N >> kn."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5629","kind":"arxiv","version":2},"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:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoThoD1+lkytcedIg52eysyDvqgnjATt/eHn5pGYbjSFeiVL2RXw6oAl8/EhMoGos0VI+Z3wiigC7DwgOKgbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:52:04.081705Z"},"content_sha256":"72df0b6a71a15afb89fd3bf1331c3947685f7c542fe95a04579731a888230ce4","schema_version":"1.0","event_id":"sha256:72df0b6a71a15afb89fd3bf1331c3947685f7c542fe95a04579731a888230ce4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/bundle.json","state_url":"https://pith.science/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/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-31T13:52:04Z","links":{"resolver":"https://pith.science/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F","bundle":"https://pith.science/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/bundle.json","state":"https://pith.science/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7V4TZP4AW5WRIFL5DMQF2XH5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T7V4TZP4AW5WRIFL5DMQF2XH5F","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":"fb87a911610096f4936d83e13b7dc128411722fb5e543574c51f1cab0f9c431b","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-23T18:25:17Z","title_canon_sha256":"a1bb5581500045146c5b77a417979f27f633ae54958f77f5fdadd4e0e399cb5f"},"schema_version":"1.0","source":{"id":"1112.5629","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5629","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5629v2","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5629","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"T7V4TZP4AW5W","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T7V4TZP4AW5WRIFL","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T7V4TZP4","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:72df0b6a71a15afb89fd3bf1331c3947685f7c542fe95a04579731a888230ce4","target":"graph","created_at":"2026-05-18T04:05:37Z","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":"This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion problem to situations in which the matrix rank can be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also be viewed as a missing-data version of the subspace clustering problem. Let X be an n x N matrix whose (complete) columns lie in a union of at most k subspaces, each of rank <= r < n, and assume N >> kn.","authors_text":"Brian Eriksson, Laura Balzano, Robert Nowak","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-23T18:25:17Z","title":"High-Rank Matrix Completion and Subspace Clustering with Missing Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5629","kind":"arxiv","version":2},"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:eba8da398b0cc967c0f0780b3441644f2c5ad2785bacd15660b3622d3ae67c0d","target":"record","created_at":"2026-05-18T04:05:37Z","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":"fb87a911610096f4936d83e13b7dc128411722fb5e543574c51f1cab0f9c431b","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-23T18:25:17Z","title_canon_sha256":"a1bb5581500045146c5b77a417979f27f633ae54958f77f5fdadd4e0e399cb5f"},"schema_version":"1.0","source":{"id":"1112.5629","kind":"arxiv","version":2}},"canonical_sha256":"9febc9e5fc05bb68a0abe8d902eae7e971596061fb90ca3d534c69f0ecb25607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9febc9e5fc05bb68a0abe8d902eae7e971596061fb90ca3d534c69f0ecb25607","first_computed_at":"2026-05-18T04:05:37.855183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:37.855183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1Zk83pGVeUybi6Oh0XbY+K9YpY8XF9DEPXR20+RxO54VOH93qvkHuf9pdudsVgKyZRBZtMGQBtUXQb+gReqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:37.855573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5629","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eba8da398b0cc967c0f0780b3441644f2c5ad2785bacd15660b3622d3ae67c0d","sha256:72df0b6a71a15afb89fd3bf1331c3947685f7c542fe95a04579731a888230ce4"],"state_sha256":"b8ce5d743122e8f737af6c74f814c9b496630e0aa47ef66145720fe0868863d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4aXH/T7DVeY4DP5hh/jNoOKa65vWX5FBd0nXWPBLhc054XgOkLfh2QGqAOtEIG3aCfUvCORfRAireX9oqJfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:52:04.084948Z","bundle_sha256":"2be9cf70f078b7591fdc95bd427dab405357d71b0232040fd21ee325538c7833"}}