{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XZ3NSVRTGN3C5MHG43ARMNG7XR","short_pith_number":"pith:XZ3NSVRT","canonical_record":{"source":{"id":"1801.09111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-27T17:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"a345a4818e0a349e96d222fb31800d16f6704d09cb62c772970b35693b2bf30b","abstract_canon_sha256":"a637165bc57362ba09a43377c9116a282d6c3c49e51db1d70372e0825633af8b"},"schema_version":"1.0"},"canonical_sha256":"be76d9563333762eb0e6e6c11634dfbc4b2e8908ab9bd7c7af88456a487275d2","source":{"kind":"arxiv","id":"1801.09111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09111","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09111v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09111","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"XZ3NSVRTGN3C","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"XZ3NSVRTGN3C5MHG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"XZ3NSVRT","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XZ3NSVRTGN3C5MHG43ARMNG7XR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-27T17:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"a345a4818e0a349e96d222fb31800d16f6704d09cb62c772970b35693b2bf30b","abstract_canon_sha256":"a637165bc57362ba09a43377c9116a282d6c3c49e51db1d70372e0825633af8b"},"schema_version":"1.0"},"canonical_sha256":"be76d9563333762eb0e6e6c11634dfbc4b2e8908ab9bd7c7af88456a487275d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:58.570828Z","signature_b64":"9QJQRMxP+SoqxmF1vVWOz5Lkq5kadTa7Xkht2MWrjNXXBe5kzFsDy/OJr7ME1Szh2CSJbu73OFJLZ5Si2u+lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be76d9563333762eb0e6e6c11634dfbc4b2e8908ab9bd7c7af88456a487275d2","last_reissued_at":"2026-05-18T00:24:58.570119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:58.570119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09111","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-18T00:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBNoMWw1oGYG4x1nFvzG/0XTH2xYDDPWXYOvftktFofm/AqAA/xSORDQdnh5OweBkcNBGBXB22CDbN6BJMlRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:04:05.664288Z"},"content_sha256":"fd61fef7b8bf6515c8be8dfab2878b334085b6aef17b4a2225fa7d7fe1921156","schema_version":"1.0","event_id":"sha256:fd61fef7b8bf6515c8be8dfab2878b334085b6aef17b4a2225fa7d7fe1921156"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XZ3NSVRTGN3C5MHG43ARMNG7XR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Multi-subspace Analysis Using Novel Column L0-norm Constrained Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Binghui Wang, Chuang Lin","submitted_at":"2018-01-27T17:00:02Z","abstract_excerpt":"We study the underlying structure of data (approximately) generated from a union of independent subspaces. Traditional methods learn only one subspace, failing to discover the multi-subspace structure, while state-of-the-art methods analyze the multi-subspace structure using data themselves as the dictionary, which cannot offer the explicit basis to span each subspace and are sensitive to errors via an indirect representation. Additionally, they also suffer from a high computational complexity, being quadratic or cubic to the sample size. To tackle all these problems, we propose a method, call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09111","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-18T00:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfbYLhELCpqZohdqfi6WIFtpndwFa7WPp7EtFgbxb3kkXugjKYeNtBEpc0GOKVDlseU1J/UFBp9jX0m47jZeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:04:05.664647Z"},"content_sha256":"b26acacfc88b66c301833c23244eea536b8b5d06e158d77c400dc6b7fcfb4924","schema_version":"1.0","event_id":"sha256:b26acacfc88b66c301833c23244eea536b8b5d06e158d77c400dc6b7fcfb4924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/bundle.json","state_url":"https://pith.science/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/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-30T07:04:05Z","links":{"resolver":"https://pith.science/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR","bundle":"https://pith.science/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/bundle.json","state":"https://pith.science/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ3NSVRTGN3C5MHG43ARMNG7XR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XZ3NSVRTGN3C5MHG43ARMNG7XR","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":"a637165bc57362ba09a43377c9116a282d6c3c49e51db1d70372e0825633af8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-27T17:00:02Z","title_canon_sha256":"a345a4818e0a349e96d222fb31800d16f6704d09cb62c772970b35693b2bf30b"},"schema_version":"1.0","source":{"id":"1801.09111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09111","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09111v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09111","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"XZ3NSVRTGN3C","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"XZ3NSVRTGN3C5MHG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"XZ3NSVRT","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b26acacfc88b66c301833c23244eea536b8b5d06e158d77c400dc6b7fcfb4924","target":"graph","created_at":"2026-05-18T00:24:58Z","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":"We study the underlying structure of data (approximately) generated from a union of independent subspaces. Traditional methods learn only one subspace, failing to discover the multi-subspace structure, while state-of-the-art methods analyze the multi-subspace structure using data themselves as the dictionary, which cannot offer the explicit basis to span each subspace and are sensitive to errors via an indirect representation. Additionally, they also suffer from a high computational complexity, being quadratic or cubic to the sample size. To tackle all these problems, we propose a method, call","authors_text":"Binghui Wang, Chuang Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-27T17:00:02Z","title":"Robust Multi-subspace Analysis Using Novel Column L0-norm Constrained Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09111","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:fd61fef7b8bf6515c8be8dfab2878b334085b6aef17b4a2225fa7d7fe1921156","target":"record","created_at":"2026-05-18T00:24:58Z","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":"a637165bc57362ba09a43377c9116a282d6c3c49e51db1d70372e0825633af8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-27T17:00:02Z","title_canon_sha256":"a345a4818e0a349e96d222fb31800d16f6704d09cb62c772970b35693b2bf30b"},"schema_version":"1.0","source":{"id":"1801.09111","kind":"arxiv","version":1}},"canonical_sha256":"be76d9563333762eb0e6e6c11634dfbc4b2e8908ab9bd7c7af88456a487275d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be76d9563333762eb0e6e6c11634dfbc4b2e8908ab9bd7c7af88456a487275d2","first_computed_at":"2026-05-18T00:24:58.570119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:58.570119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9QJQRMxP+SoqxmF1vVWOz5Lkq5kadTa7Xkht2MWrjNXXBe5kzFsDy/OJr7ME1Szh2CSJbu73OFJLZ5Si2u+lCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:58.570828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd61fef7b8bf6515c8be8dfab2878b334085b6aef17b4a2225fa7d7fe1921156","sha256:b26acacfc88b66c301833c23244eea536b8b5d06e158d77c400dc6b7fcfb4924"],"state_sha256":"154873ea6957a5b462e91dc9c9f4a709fc0a39bb4e151fb3cee1f92cb0e9be7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSXa8x/C+qemGDRZXLVz1c4YYua0pw5T7vmfo5ZM24Z/UUw6HmUHynnFJUX62f7RiUEL/CssSr/mTTzPQlH7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:04:05.666532Z","bundle_sha256":"fdb8f5116327b2fd1e654bcf17d2e53746e6f61157faf15e9e6b42f3212ff2b9"}}