{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IUQKBOEQMX5CNCV5RD6VRRV5MM","short_pith_number":"pith:IUQKBOEQ","canonical_record":{"source":{"id":"1209.0841","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-09-05T01:36:11Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"1231595bbcfc3956d8b62ae411136b7bd373ce26cb7430febb7b6d3fc5dd968e","abstract_canon_sha256":"defabc6b65efaf88fd654d47e68c84798102a1a7f2a6c3aa5042994b62fce1e8"},"schema_version":"1.0"},"canonical_sha256":"4520a0b89065fa268abd88fd58c6bd631dae0574870ea0485d3be1b5dd7d0f5b","source":{"kind":"arxiv","id":"1209.0841","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0841","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0841v7","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0841","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"IUQKBOEQMX5C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUQKBOEQMX5CNCV5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUQKBOEQ","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IUQKBOEQMX5CNCV5RD6VRRV5MM","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0841","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-09-05T01:36:11Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"1231595bbcfc3956d8b62ae411136b7bd373ce26cb7430febb7b6d3fc5dd968e","abstract_canon_sha256":"defabc6b65efaf88fd654d47e68c84798102a1a7f2a6c3aa5042994b62fce1e8"},"schema_version":"1.0"},"canonical_sha256":"4520a0b89065fa268abd88fd58c6bd631dae0574870ea0485d3be1b5dd7d0f5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:30.270713Z","signature_b64":"/4Mi8aD4BP+j7ja78IYiHJOvsSaITnY0fK2hRafxehYBzbyN2pitn4aQoNjFxHSBgCR2Zo6S7Pyyp+m8DmL+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4520a0b89065fa268abd88fd58c6bd631dae0574870ea0485d3be1b5dd7d0f5b","last_reissued_at":"2026-05-18T00:44:30.270219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:30.270219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0841","source_version":7,"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:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lONpPdGRD7eoquaVvnClI1DiSF6M6X+Bz5XIqICzWDIBkJPStppzcGCLhHy06k6k+I0+pw0r6xZsTQ4i07nqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:52:38.504267Z"},"content_sha256":"0514fefd0a7083a2a24e7c86eac3eb5bc1270c189ff85f13243b89e5c7f23b42","schema_version":"1.0","event_id":"sha256:0514fefd0a7083a2a24e7c86eac3eb5bc1270c189ff85f13243b89e5c7f23b42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IUQKBOEQMX5CNCV5RD6VRRV5MM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Huajin Tang, Xi Peng, Zhang Yi, Zhiding Yu","submitted_at":"2012-09-05T01:36:11Z","abstract_excerpt":"Under the framework of graph-based learning, the key to robust subspace clustering and subspace learning is to obtain a good similarity graph that eliminates the effects of errors and retains only connections between the data points from the same subspace (i.e., intra-subspace data points). Recent works achieve good performance by modeling errors into their objective functions to remove the errors from the inputs. However, these approaches face the limitations that the structure of errors should be known prior and a complex convex problem must be solved. In this paper, we present a novel metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0841","kind":"arxiv","version":7},"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:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n92YOC32au8A+a5YvuqhVbBKVZ+mAn9DDqllmQrCtaqsqJpF8GbUKS/nkJepuQyf+f0sp8JY+3jEB5OG3IRCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:52:38.504656Z"},"content_sha256":"0ffe21a488f57279008f0ddd7463c3ed255cccdffd89e22a0db08d5bc46b7f0f","schema_version":"1.0","event_id":"sha256:0ffe21a488f57279008f0ddd7463c3ed255cccdffd89e22a0db08d5bc46b7f0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/bundle.json","state_url":"https://pith.science/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/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-03T04:52:38Z","links":{"resolver":"https://pith.science/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM","bundle":"https://pith.science/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/bundle.json","state":"https://pith.science/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUQKBOEQMX5CNCV5RD6VRRV5MM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IUQKBOEQMX5CNCV5RD6VRRV5MM","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":"defabc6b65efaf88fd654d47e68c84798102a1a7f2a6c3aa5042994b62fce1e8","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-09-05T01:36:11Z","title_canon_sha256":"1231595bbcfc3956d8b62ae411136b7bd373ce26cb7430febb7b6d3fc5dd968e"},"schema_version":"1.0","source":{"id":"1209.0841","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0841","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0841v7","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0841","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"IUQKBOEQMX5C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUQKBOEQMX5CNCV5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUQKBOEQ","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:0ffe21a488f57279008f0ddd7463c3ed255cccdffd89e22a0db08d5bc46b7f0f","target":"graph","created_at":"2026-05-18T00:44:30Z","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":"Under the framework of graph-based learning, the key to robust subspace clustering and subspace learning is to obtain a good similarity graph that eliminates the effects of errors and retains only connections between the data points from the same subspace (i.e., intra-subspace data points). Recent works achieve good performance by modeling errors into their objective functions to remove the errors from the inputs. However, these approaches face the limitations that the structure of errors should be known prior and a complex convex problem must be solved. In this paper, we present a novel metho","authors_text":"Huajin Tang, Xi Peng, Zhang Yi, Zhiding Yu","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-09-05T01:36:11Z","title":"Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0841","kind":"arxiv","version":7},"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:0514fefd0a7083a2a24e7c86eac3eb5bc1270c189ff85f13243b89e5c7f23b42","target":"record","created_at":"2026-05-18T00:44:30Z","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":"defabc6b65efaf88fd654d47e68c84798102a1a7f2a6c3aa5042994b62fce1e8","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-09-05T01:36:11Z","title_canon_sha256":"1231595bbcfc3956d8b62ae411136b7bd373ce26cb7430febb7b6d3fc5dd968e"},"schema_version":"1.0","source":{"id":"1209.0841","kind":"arxiv","version":7}},"canonical_sha256":"4520a0b89065fa268abd88fd58c6bd631dae0574870ea0485d3be1b5dd7d0f5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4520a0b89065fa268abd88fd58c6bd631dae0574870ea0485d3be1b5dd7d0f5b","first_computed_at":"2026-05-18T00:44:30.270219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:30.270219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/4Mi8aD4BP+j7ja78IYiHJOvsSaITnY0fK2hRafxehYBzbyN2pitn4aQoNjFxHSBgCR2Zo6S7Pyyp+m8DmL+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:30.270713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0841","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0514fefd0a7083a2a24e7c86eac3eb5bc1270c189ff85f13243b89e5c7f23b42","sha256:0ffe21a488f57279008f0ddd7463c3ed255cccdffd89e22a0db08d5bc46b7f0f"],"state_sha256":"8ad017b03614c35314d9da3cdc0d4f52e2e0232f4869720ddefec1aab93277b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDAIXR4Z1jor3NYngfNqDvSHTH3ahg+wqHAn9P9SYTjM8tzRwQRFHb/Va8eeO2sh6Hlwi2AjTlVFhRJrJkS0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:52:38.506714Z","bundle_sha256":"d5997e629d2ec19946586cbd2050d142164a08e42cb389b7971a2b0149364326"}}