{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FRF3ULSO256LYUGYYKNNLVK45L","short_pith_number":"pith:FRF3ULSO","canonical_record":{"source":{"id":"1506.07615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-25T05:11:44Z","cross_cats_sorted":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"title_canon_sha256":"ea713c4ea5325e0a7786ee132f5fae71de2bb0538f8647a4a24b9a634ad794ab","abstract_canon_sha256":"82f849153c4692160a5508ba6f65719441e6cb180706559812b5aed93b7aa60a"},"schema_version":"1.0"},"canonical_sha256":"2c4bba2e4ed77cbc50d8c29ad5d55cead446991e1f093a280d76314ae038d471","source":{"kind":"arxiv","id":"1506.07615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07615","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07615v2","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07615","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"FRF3ULSO256L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FRF3ULSO256LYUGY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FRF3ULSO","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FRF3ULSO256LYUGYYKNNLVK45L","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-25T05:11:44Z","cross_cats_sorted":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"title_canon_sha256":"ea713c4ea5325e0a7786ee132f5fae71de2bb0538f8647a4a24b9a634ad794ab","abstract_canon_sha256":"82f849153c4692160a5508ba6f65719441e6cb180706559812b5aed93b7aa60a"},"schema_version":"1.0"},"canonical_sha256":"2c4bba2e4ed77cbc50d8c29ad5d55cead446991e1f093a280d76314ae038d471","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.581887Z","signature_b64":"B/lVFyx78OB5ivIpCiM8555rc8gkYXIsOyL9cjRj3+iNJrgTNF21QPo3CyoIxL3FbqbVxmD9vrm5NP6WdmHMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c4bba2e4ed77cbc50d8c29ad5d55cead446991e1f093a280d76314ae038d471","last_reissued_at":"2026-05-18T00:57:50.581326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.581326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07615","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3hC2zP3l/QXhIdxEx/yA8A138Zcae3wGJQOT9+ecnD19GDQPlPqhsBljVKlEtCRKmaDea+veuDXVz+blHlfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:06:52.959882Z"},"content_sha256":"1ca1ce79953555dbab7dadf5c2033fe53957331761cad247cdd73136ece1ba46","schema_version":"1.0","event_id":"sha256:1ca1ce79953555dbab7dadf5c2033fe53957331761cad247cdd73136ece1ba46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FRF3ULSO256LYUGYYKNNLVK45L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"primary_cat":"cs.IT","authors_text":"Chao Zhang, Hongyang Zhang, Zhouchen Lin","submitted_at":"2015-06-25T05:11:44Z","abstract_excerpt":"Subspace recovery from corrupted and missing data is crucial for various applications in signal processing and information theory. To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. standard basis, which, however, does not apply to more general basis, e.g., Fourier basis. In this paper, we prove that the range space of an $m\\times n$ matrix with rank $r$ can be exactly recovered from few coefficients w.r.t. general basis, though $r$ and the number of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07615","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/z9+J6rkiY2Qhu/82awKCrbvsaPseKZi3Kb8uLSYCX/dcGYwzFW9bkkIWqeF623UuueJQV91aPMpttFeUPiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:06:52.960633Z"},"content_sha256":"551e95ba6babd8588b5750944118f9dbe50d09327188b2179e6e50c1c627234e","schema_version":"1.0","event_id":"sha256:551e95ba6babd8588b5750944118f9dbe50d09327188b2179e6e50c1c627234e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRF3ULSO256LYUGYYKNNLVK45L/bundle.json","state_url":"https://pith.science/pith/FRF3ULSO256LYUGYYKNNLVK45L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRF3ULSO256LYUGYYKNNLVK45L/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-06T19:06:52Z","links":{"resolver":"https://pith.science/pith/FRF3ULSO256LYUGYYKNNLVK45L","bundle":"https://pith.science/pith/FRF3ULSO256LYUGYYKNNLVK45L/bundle.json","state":"https://pith.science/pith/FRF3ULSO256LYUGYYKNNLVK45L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRF3ULSO256LYUGYYKNNLVK45L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FRF3ULSO256LYUGYYKNNLVK45L","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":"82f849153c4692160a5508ba6f65719441e6cb180706559812b5aed93b7aa60a","cross_cats_sorted":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-25T05:11:44Z","title_canon_sha256":"ea713c4ea5325e0a7786ee132f5fae71de2bb0538f8647a4a24b9a634ad794ab"},"schema_version":"1.0","source":{"id":"1506.07615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07615","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07615v2","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07615","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"FRF3ULSO256L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FRF3ULSO256LYUGY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FRF3ULSO","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:551e95ba6babd8588b5750944118f9dbe50d09327188b2179e6e50c1c627234e","target":"graph","created_at":"2026-05-18T00:57:50Z","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":"Subspace recovery from corrupted and missing data is crucial for various applications in signal processing and information theory. To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. standard basis, which, however, does not apply to more general basis, e.g., Fourier basis. In this paper, we prove that the range space of an $m\\times n$ matrix with rank $r$ can be exactly recovered from few coefficients w.r.t. general basis, though $r$ and the number of c","authors_text":"Chao Zhang, Hongyang Zhang, Zhouchen Lin","cross_cats":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-25T05:11:44Z","title":"Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07615","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:1ca1ce79953555dbab7dadf5c2033fe53957331761cad247cdd73136ece1ba46","target":"record","created_at":"2026-05-18T00:57:50Z","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":"82f849153c4692160a5508ba6f65719441e6cb180706559812b5aed93b7aa60a","cross_cats_sorted":["cs.LG","cs.NA","math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-25T05:11:44Z","title_canon_sha256":"ea713c4ea5325e0a7786ee132f5fae71de2bb0538f8647a4a24b9a634ad794ab"},"schema_version":"1.0","source":{"id":"1506.07615","kind":"arxiv","version":2}},"canonical_sha256":"2c4bba2e4ed77cbc50d8c29ad5d55cead446991e1f093a280d76314ae038d471","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c4bba2e4ed77cbc50d8c29ad5d55cead446991e1f093a280d76314ae038d471","first_computed_at":"2026-05-18T00:57:50.581326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.581326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/lVFyx78OB5ivIpCiM8555rc8gkYXIsOyL9cjRj3+iNJrgTNF21QPo3CyoIxL3FbqbVxmD9vrm5NP6WdmHMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.581887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca1ce79953555dbab7dadf5c2033fe53957331761cad247cdd73136ece1ba46","sha256:551e95ba6babd8588b5750944118f9dbe50d09327188b2179e6e50c1c627234e"],"state_sha256":"8b1fdb0ddc7127e067776f319b5242b446681c4ad8dd9d81acc09d6a5f6fca11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWEyngyzw2j3buQqfURoc1kFXMpb5mtFU8cFpJ0Rt62r54F/bZYvugnYiHLYs1mEPZFgyqTxTISni54VXO5yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:06:52.964266Z","bundle_sha256":"dfcce9a76a6f2616f03eeefec1bfc60bbb80ccf7a495bf94c8066bec7191ffd6"}}