{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AX3UL6KHBDEK3HHR5TGLP3Q6S2","short_pith_number":"pith:AX3UL6KH","canonical_record":{"source":{"id":"1507.08173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-29T14:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"f98a1dcd797102bbf45845b5f33d8ddf43b6ad09d1b3e9b7a8aa23b45a409b1c","abstract_canon_sha256":"167171a1ad630db24efcbf4ced6617afe951bae25ac370fa3d3c5f5c2f11ccd0"},"schema_version":"1.0"},"canonical_sha256":"05f745f94708c8ad9cf1ecccb7ee1e96b54ab4dccb020982403aa4a5e03e258d","source":{"kind":"arxiv","id":"1507.08173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08173","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08173v2","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08173","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"pith_short_12","alias_value":"AX3UL6KHBDEK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AX3UL6KHBDEK3HHR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AX3UL6KH","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AX3UL6KHBDEK3HHR5TGLP3Q6S2","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-29T14:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"f98a1dcd797102bbf45845b5f33d8ddf43b6ad09d1b3e9b7a8aa23b45a409b1c","abstract_canon_sha256":"167171a1ad630db24efcbf4ced6617afe951bae25ac370fa3d3c5f5c2f11ccd0"},"schema_version":"1.0"},"canonical_sha256":"05f745f94708c8ad9cf1ecccb7ee1e96b54ab4dccb020982403aa4a5e03e258d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:03.757153Z","signature_b64":"5FIgCAt1MDmzHSxPvA+yplB/Y6WpMoZnCNkNFx5BZ3OvkXOTpnnNN3KWZIu4YXFMmln5hkBsmFVhuHawfSa5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f745f94708c8ad9cf1ecccb7ee1e96b54ab4dccb020982403aa4a5e03e258d","last_reissued_at":"2026-05-18T01:14:03.756595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:03.756595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08173","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-18T01:14:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Un3wvbTD5TzeCUjrz4XmJlQn6HYStYFDXPfYtsPZgEveMmLN1OX0F+K7KNFtWZpynEyNDMfizapGufulPS8CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:33:16.899066Z"},"content_sha256":"671c2d893b942bfecab7ce014114c5c3558a0a49e56d26b3630b77de629971f7","schema_version":"1.0","event_id":"sha256:671c2d893b942bfecab7ce014114c5c3558a0a49e56d26b3630b77de629971f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AX3UL6KHBDEK3HHR5TGLP3Q6S2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Robust PCA on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gilles Puy, Nathanael Perraudin, Nauman Shahid, Pierre Vandergheynst, Vassilis Kalofolias","submitted_at":"2015-07-29T14:53:33Z","abstract_excerpt":"Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the curse of dimensionality. However, often such methods are accompanied with three different problems: high computational complexity (usually associated with the nuclear norm minimization), non-convexity (for matrix factorization methods) and susceptibility to gross corruptions in the data. In this paper we propose a principal component analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08173","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-18T01:14:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmT5joXxdNxD5UwWWVimWqi9FiQs15L22eNHU2zQrLcAnKKPzD1tEbm33UcdtEt9l+IBksjf2JB1V4OjjovUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:33:16.899417Z"},"content_sha256":"141e1f1fb8c23bf94e77203407866e375f32603c7c3fe1d49d40a7c4efbf15c4","schema_version":"1.0","event_id":"sha256:141e1f1fb8c23bf94e77203407866e375f32603c7c3fe1d49d40a7c4efbf15c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/bundle.json","state_url":"https://pith.science/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/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-01T15:33:16Z","links":{"resolver":"https://pith.science/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2","bundle":"https://pith.science/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/bundle.json","state":"https://pith.science/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AX3UL6KHBDEK3HHR5TGLP3Q6S2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AX3UL6KHBDEK3HHR5TGLP3Q6S2","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":"167171a1ad630db24efcbf4ced6617afe951bae25ac370fa3d3c5f5c2f11ccd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-29T14:53:33Z","title_canon_sha256":"f98a1dcd797102bbf45845b5f33d8ddf43b6ad09d1b3e9b7a8aa23b45a409b1c"},"schema_version":"1.0","source":{"id":"1507.08173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08173","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08173v2","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08173","created_at":"2026-05-18T01:14:03Z"},{"alias_kind":"pith_short_12","alias_value":"AX3UL6KHBDEK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AX3UL6KHBDEK3HHR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AX3UL6KH","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:141e1f1fb8c23bf94e77203407866e375f32603c7c3fe1d49d40a7c4efbf15c4","target":"graph","created_at":"2026-05-18T01:14:03Z","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":"Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the curse of dimensionality. However, often such methods are accompanied with three different problems: high computational complexity (usually associated with the nuclear norm minimization), non-convexity (for matrix factorization methods) and susceptibility to gross corruptions in the data. In this paper we propose a principal component analysis ","authors_text":"Gilles Puy, Nathanael Perraudin, Nauman Shahid, Pierre Vandergheynst, Vassilis Kalofolias","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-29T14:53:33Z","title":"Fast Robust PCA on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08173","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:671c2d893b942bfecab7ce014114c5c3558a0a49e56d26b3630b77de629971f7","target":"record","created_at":"2026-05-18T01:14:03Z","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":"167171a1ad630db24efcbf4ced6617afe951bae25ac370fa3d3c5f5c2f11ccd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-29T14:53:33Z","title_canon_sha256":"f98a1dcd797102bbf45845b5f33d8ddf43b6ad09d1b3e9b7a8aa23b45a409b1c"},"schema_version":"1.0","source":{"id":"1507.08173","kind":"arxiv","version":2}},"canonical_sha256":"05f745f94708c8ad9cf1ecccb7ee1e96b54ab4dccb020982403aa4a5e03e258d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05f745f94708c8ad9cf1ecccb7ee1e96b54ab4dccb020982403aa4a5e03e258d","first_computed_at":"2026-05-18T01:14:03.756595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:03.756595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FIgCAt1MDmzHSxPvA+yplB/Y6WpMoZnCNkNFx5BZ3OvkXOTpnnNN3KWZIu4YXFMmln5hkBsmFVhuHawfSa5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:03.757153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:671c2d893b942bfecab7ce014114c5c3558a0a49e56d26b3630b77de629971f7","sha256:141e1f1fb8c23bf94e77203407866e375f32603c7c3fe1d49d40a7c4efbf15c4"],"state_sha256":"80c801c0ea833dc18374a33b12d8eaf44e75fcdabe49e0cd7bec1aa295b0e10c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tiLL8kv0ZnHxWgfGVKCnkNuhU8kDfAgk5YPTzsEqBwS5T4H5AY/nXXHQ7DA7P+5G0szLdcfCTuZGbTxgVZ6jBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:33:16.901521Z","bundle_sha256":"c0c1847f98793bf91e780a898ebd8483862f2136bd1791ad08eacd09885ea941"}}