{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZKGBYSYTJ7QRGVMZAR5DUBQ3JL","short_pith_number":"pith:ZKGBYSYT","canonical_record":{"source":{"id":"1504.06151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-23T12:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"b31fc658b4ce8df15c97e4949a029156753ff02f4552b4a0e8ced263cda928bc","abstract_canon_sha256":"0c162174c1e739264ba2754d2dec732be9cf413968ead881e411bb63dc453ee7"},"schema_version":"1.0"},"canonical_sha256":"ca8c1c4b134fe1135599047a3a061b4af40586ea126cb5e64efc3ac228276f41","source":{"kind":"arxiv","id":"1504.06151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06151","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06151v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06151","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZKGBYSYTJ7QR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKGBYSYTJ7QRGVMZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKGBYSYT","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZKGBYSYTJ7QRGVMZAR5DUBQ3JL","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-23T12:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"b31fc658b4ce8df15c97e4949a029156753ff02f4552b4a0e8ced263cda928bc","abstract_canon_sha256":"0c162174c1e739264ba2754d2dec732be9cf413968ead881e411bb63dc453ee7"},"schema_version":"1.0"},"canonical_sha256":"ca8c1c4b134fe1135599047a3a061b4af40586ea126cb5e64efc3ac228276f41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:02.406244Z","signature_b64":"irdo7d+Jy/rSn/NcbIroF66GTAaDqya4JjSIOJcUNtnE2Fh4EfWPfCC3I75wbg3w76WbEhK0OQ/oS8L93b0XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca8c1c4b134fe1135599047a3a061b4af40586ea126cb5e64efc3ac228276f41","last_reissued_at":"2026-05-18T02:18:02.405564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:02.405564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06151","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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFVqicxFrtA5ZQtBmWtZsGUuwhc2i9ywNtXz+U/Jk+v2YXAmGggqos0ij215XFc5CrY7fQ4vVn6TWZ9jfdG2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:56:34.605800Z"},"content_sha256":"ad83ff4e9e79c5eabffc26710e7252b03ab9c7132c2f5da0ac6c6442647163aa","schema_version":"1.0","event_id":"sha256:ad83ff4e9e79c5eabffc26710e7252b03ab9c7132c2f5da0ac6c6442647163aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZKGBYSYTJ7QRGVMZAR5DUBQ3JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Principal Component Analysis on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Michael Bronstein, Nauman Shahid, Pierre Vandergheynst, Vassilis Kalofolias, Xavier Bresson","submitted_at":"2015-04-23T12:39:40Z","abstract_excerpt":"Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA solves the first issue with a sparse penalty term. The second issue can be handled with the matrix factorization model, which is however non-convex. Besides, PCA based clustering can also be enhanced by using a graph of data similarity. In this article, we introduce a new model called \"Robust PCA on Graphs\" which incorporates spectral graph regularization into t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06151","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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMF9OixU6TutOgtT/rbGqBxAsMh1tuFqbq4RzUVaXo7FCbGDm9L80h1eotB/o8xswU/NOSXgZcNE06fqCbOgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:56:34.606141Z"},"content_sha256":"286943662e69537c89c43363eb05413206f3375f2f789b6f5ae2b3bb6d876248","schema_version":"1.0","event_id":"sha256:286943662e69537c89c43363eb05413206f3375f2f789b6f5ae2b3bb6d876248"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/bundle.json","state_url":"https://pith.science/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/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-28T22:56:34Z","links":{"resolver":"https://pith.science/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL","bundle":"https://pith.science/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/bundle.json","state":"https://pith.science/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKGBYSYTJ7QRGVMZAR5DUBQ3JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZKGBYSYTJ7QRGVMZAR5DUBQ3JL","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":"0c162174c1e739264ba2754d2dec732be9cf413968ead881e411bb63dc453ee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-23T12:39:40Z","title_canon_sha256":"b31fc658b4ce8df15c97e4949a029156753ff02f4552b4a0e8ced263cda928bc"},"schema_version":"1.0","source":{"id":"1504.06151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06151","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06151v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06151","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZKGBYSYTJ7QR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKGBYSYTJ7QRGVMZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKGBYSYT","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:286943662e69537c89c43363eb05413206f3375f2f789b6f5ae2b3bb6d876248","target":"graph","created_at":"2026-05-18T02:18:02Z","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":"Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA solves the first issue with a sparse penalty term. The second issue can be handled with the matrix factorization model, which is however non-convex. Besides, PCA based clustering can also be enhanced by using a graph of data similarity. In this article, we introduce a new model called \"Robust PCA on Graphs\" which incorporates spectral graph regularization into t","authors_text":"Michael Bronstein, Nauman Shahid, Pierre Vandergheynst, Vassilis Kalofolias, Xavier Bresson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-23T12:39:40Z","title":"Robust Principal Component Analysis on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06151","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:ad83ff4e9e79c5eabffc26710e7252b03ab9c7132c2f5da0ac6c6442647163aa","target":"record","created_at":"2026-05-18T02:18:02Z","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":"0c162174c1e739264ba2754d2dec732be9cf413968ead881e411bb63dc453ee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-04-23T12:39:40Z","title_canon_sha256":"b31fc658b4ce8df15c97e4949a029156753ff02f4552b4a0e8ced263cda928bc"},"schema_version":"1.0","source":{"id":"1504.06151","kind":"arxiv","version":1}},"canonical_sha256":"ca8c1c4b134fe1135599047a3a061b4af40586ea126cb5e64efc3ac228276f41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca8c1c4b134fe1135599047a3a061b4af40586ea126cb5e64efc3ac228276f41","first_computed_at":"2026-05-18T02:18:02.405564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:02.405564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irdo7d+Jy/rSn/NcbIroF66GTAaDqya4JjSIOJcUNtnE2Fh4EfWPfCC3I75wbg3w76WbEhK0OQ/oS8L93b0XCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:02.406244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad83ff4e9e79c5eabffc26710e7252b03ab9c7132c2f5da0ac6c6442647163aa","sha256:286943662e69537c89c43363eb05413206f3375f2f789b6f5ae2b3bb6d876248"],"state_sha256":"ae5a40d42a6816bd269ffc3156450f4902c98c7eadb68e917c54b515fa58afaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miTnQHblguBbuWQ+MxlkPX3CZ3chXBNjCv6T13527d655+UTWJWbgF1IBHKQ7ZMrgToF1YFqyTKdar1niqNkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T22:56:34.607989Z","bundle_sha256":"d5c104fdc0fe387afdb2dc4cc26d9d8e705db53cd1f029128370ad9b443429f3"}}