{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HTZZDR2KVL6COIYEO62UICN2SH","short_pith_number":"pith:HTZZDR2K","canonical_record":{"source":{"id":"1210.0805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"718d2d2bfcbebb40cebec5e305633c53f9f1f7bd28b97189ecca817edbc42d6b","abstract_canon_sha256":"80ceb6172577220b731d9d26b1754a01c64540b47b405c50cedfdb1d00e7c3d6"},"schema_version":"1.0"},"canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","source":{"kind":"arxiv","id":"1210.0805","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0805","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0805v2","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0805","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"HTZZDR2KVL6C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTZZDR2KVL6COIYE","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTZZDR2K","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HTZZDR2KVL6COIYEO62UICN2SH","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"718d2d2bfcbebb40cebec5e305633c53f9f1f7bd28b97189ecca817edbc42d6b","abstract_canon_sha256":"80ceb6172577220b731d9d26b1754a01c64540b47b405c50cedfdb1d00e7c3d6"},"schema_version":"1.0"},"canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.844219Z","signature_b64":"Sc8B3sh7cQoaqJ8LRxFPq6AUtxgqjSEoN1uUSQK5L6AWL4589VvCHvtr3Pk1nP/24HYFd7GxJ8BNrVvG0P0YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","last_reissued_at":"2026-05-18T03:36:15.843596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.843596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0805","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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ey9PPNG1gfvcBOtWgcFcROVnuk2fCTpyOeyBVTJ0W1Cg073p5stF/tWOUEFDFeNd27RBvLAidTgfzqwnBwF+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:49.004131Z"},"content_sha256":"d301d7f633ad5a308460d71be5b1479322fee1190215805eb227e89ca61a320d","schema_version":"1.0","event_id":"sha256:d301d7f633ad5a308460d71be5b1479322fee1190215805eb227e89ca61a320d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HTZZDR2KVL6COIYEO62UICN2SH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust PCA and subspace tracking from incomplete observations using L0-surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Clemens Hage, Martin Kleinsteuber","submitted_at":"2012-10-02T15:26:15Z","abstract_excerpt":"Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and L1-cost functions as convex relaxations of the rank constraint and the sparsity measure, respectively, or employ thresholding techniques. We propose a method that allows for reconstructing and tracking a subspace of upper-bounded dimension from incomplete and corrupted observations. It does not require any a priori information about the number of outliers. The core of our algorithm is an intrinsic Conjugate Gradien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0805","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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFJvWSpNGBfI/4L/NnkGr2qCVjw8Y+AG+0leid8w+x8SKiRL3v850/0Tnhopt9z2euupsH4FfXds1ZTotObeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:49.004527Z"},"content_sha256":"e7bee4b976af97945842009e56cde028bf0c71bc9727a6f0cec5d1a5720dd0bf","schema_version":"1.0","event_id":"sha256:e7bee4b976af97945842009e56cde028bf0c71bc9727a6f0cec5d1a5720dd0bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/bundle.json","state_url":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTZZDR2KVL6COIYEO62UICN2SH/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-28T23:39:49Z","links":{"resolver":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH","bundle":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/bundle.json","state":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTZZDR2KVL6COIYEO62UICN2SH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HTZZDR2KVL6COIYEO62UICN2SH","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":"80ceb6172577220b731d9d26b1754a01c64540b47b405c50cedfdb1d00e7c3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","title_canon_sha256":"718d2d2bfcbebb40cebec5e305633c53f9f1f7bd28b97189ecca817edbc42d6b"},"schema_version":"1.0","source":{"id":"1210.0805","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0805","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0805v2","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0805","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"HTZZDR2KVL6C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTZZDR2KVL6COIYE","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTZZDR2K","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:e7bee4b976af97945842009e56cde028bf0c71bc9727a6f0cec5d1a5720dd0bf","target":"graph","created_at":"2026-05-18T03:36:15Z","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":"Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and L1-cost functions as convex relaxations of the rank constraint and the sparsity measure, respectively, or employ thresholding techniques. We propose a method that allows for reconstructing and tracking a subspace of upper-bounded dimension from incomplete and corrupted observations. It does not require any a priori information about the number of outliers. The core of our algorithm is an intrinsic Conjugate Gradien","authors_text":"Clemens Hage, Martin Kleinsteuber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","title":"Robust PCA and subspace tracking from incomplete observations using L0-surrogates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0805","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:d301d7f633ad5a308460d71be5b1479322fee1190215805eb227e89ca61a320d","target":"record","created_at":"2026-05-18T03:36:15Z","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":"80ceb6172577220b731d9d26b1754a01c64540b47b405c50cedfdb1d00e7c3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","title_canon_sha256":"718d2d2bfcbebb40cebec5e305633c53f9f1f7bd28b97189ecca817edbc42d6b"},"schema_version":"1.0","source":{"id":"1210.0805","kind":"arxiv","version":2}},"canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","first_computed_at":"2026-05-18T03:36:15.843596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.843596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sc8B3sh7cQoaqJ8LRxFPq6AUtxgqjSEoN1uUSQK5L6AWL4589VvCHvtr3Pk1nP/24HYFd7GxJ8BNrVvG0P0YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.844219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0805","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d301d7f633ad5a308460d71be5b1479322fee1190215805eb227e89ca61a320d","sha256:e7bee4b976af97945842009e56cde028bf0c71bc9727a6f0cec5d1a5720dd0bf"],"state_sha256":"089e13a7fceeb10e5d42ff65ff2f13768a8630df3874dec20062fc4c0c817135"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Llz+nP6Wa19DC0kBEX6AsjtP4LMokF5qdpEXpisEDYrFUaXcR1w/bOtxJunVwqh6Ty6+Zo55b6FAAtdJ2B5qCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:39:49.007058Z","bundle_sha256":"bf29c58d4fdb9f57d3bdf4127bc11b800c460ba476d6ad9347073f6741897095"}}