{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RVGZ2HTWPGPJ4TVVLOVX7L254F","short_pith_number":"pith:RVGZ2HTW","canonical_record":{"source":{"id":"1503.08356","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T21:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"48b42c5c165345ec08aa6b1e466c1ab661b57aa916e1dddd874514cb21fd8428","abstract_canon_sha256":"3f229bb71e20d5af53c643a2b1bf24018b5a4d05e89875945e9daafe6489c0dc"},"schema_version":"1.0"},"canonical_sha256":"8d4d9d1e76799e9e4eb55bab7faf5de1492a69a2494a1ead4eebabea126c1f42","source":{"kind":"arxiv","id":"1503.08356","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08356","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08356v4","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08356","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"RVGZ2HTWPGPJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RVGZ2HTWPGPJ4TVV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RVGZ2HTW","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RVGZ2HTWPGPJ4TVVLOVX7L254F","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08356","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T21:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"48b42c5c165345ec08aa6b1e466c1ab661b57aa916e1dddd874514cb21fd8428","abstract_canon_sha256":"3f229bb71e20d5af53c643a2b1bf24018b5a4d05e89875945e9daafe6489c0dc"},"schema_version":"1.0"},"canonical_sha256":"8d4d9d1e76799e9e4eb55bab7faf5de1492a69a2494a1ead4eebabea126c1f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.747847Z","signature_b64":"3NiAUTCZn8Wt6SvfUzHV2esI9OFWH3Olqgtb3DBoDYXVO09b2TZlT4ThldSHnFgi/E0ybDv5HX7ti8amnBZ3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d4d9d1e76799e9e4eb55bab7faf5de1492a69a2494a1ead4eebabea126c1f42","last_reissued_at":"2026-05-18T00:32:21.747171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.747171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08356","source_version":4,"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:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkjOIyGFgJBOI9L7KtBLyoUK8qiloMcrvGAlPRMyg0UaFRo7LeARrNZOpi7knkCqmg6x50ZzFcEacCjymfn5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:28:31.225635Z"},"content_sha256":"634226691ee6829417efeca9ef5d61e5cf4a556a3197bd0f6f6a52ce0751fbbb","schema_version":"1.0","event_id":"sha256:634226691ee6829417efeca9ef5d61e5cf4a556a3197bd0f6f6a52ce0751fbbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RVGZ2HTWPGPJ4TVVLOVX7L254F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Online Minimization for Low-Rank Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Huan Xu, Jie Shen, Ping Li","submitted_at":"2015-03-28T21:56:35Z","abstract_excerpt":"Low-rank representation~(LRR) has been a significant method for segmenting data that are generated from a union of subspaces. It is, however, known that solving the LRR program is challenging in terms of time complexity and memory footprint, in that the size of the nuclear norm regularized matrix is $n$-by-$n$ (where $n$ is the number of samples). In this paper, we thereby develop a fast online implementation of LRR that reduces the memory cost from $O(n^2)$ to $O(pd)$, with $p$ being the ambient dimension and $d$ being some estimated rank~($d < p \\ll n$). The crux for this end is a non-convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08356","kind":"arxiv","version":4},"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:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJhkYVEH91fG3D7n5eXu6bidUAQw0vrnik5MD3HCjcKBx2yeoDnVb7wphL37Asr2vXjlmdIQN+HtpbX/jEM+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:28:31.226036Z"},"content_sha256":"59e938755d3292dbe4051951ecfd8b700364ee10ceaebdc4fefba4ba96a2e63f","schema_version":"1.0","event_id":"sha256:59e938755d3292dbe4051951ecfd8b700364ee10ceaebdc4fefba4ba96a2e63f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/bundle.json","state_url":"https://pith.science/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/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-07T09:28:31Z","links":{"resolver":"https://pith.science/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F","bundle":"https://pith.science/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/bundle.json","state":"https://pith.science/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVGZ2HTWPGPJ4TVVLOVX7L254F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RVGZ2HTWPGPJ4TVVLOVX7L254F","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":"3f229bb71e20d5af53c643a2b1bf24018b5a4d05e89875945e9daafe6489c0dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T21:56:35Z","title_canon_sha256":"48b42c5c165345ec08aa6b1e466c1ab661b57aa916e1dddd874514cb21fd8428"},"schema_version":"1.0","source":{"id":"1503.08356","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08356","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08356v4","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08356","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"RVGZ2HTWPGPJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RVGZ2HTWPGPJ4TVV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RVGZ2HTW","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:59e938755d3292dbe4051951ecfd8b700364ee10ceaebdc4fefba4ba96a2e63f","target":"graph","created_at":"2026-05-18T00:32:21Z","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":"Low-rank representation~(LRR) has been a significant method for segmenting data that are generated from a union of subspaces. It is, however, known that solving the LRR program is challenging in terms of time complexity and memory footprint, in that the size of the nuclear norm regularized matrix is $n$-by-$n$ (where $n$ is the number of samples). In this paper, we thereby develop a fast online implementation of LRR that reduces the memory cost from $O(n^2)$ to $O(pd)$, with $p$ being the ambient dimension and $d$ being some estimated rank~($d < p \\ll n$). The crux for this end is a non-convex","authors_text":"Huan Xu, Jie Shen, Ping Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T21:56:35Z","title":"Efficient Online Minimization for Low-Rank Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08356","kind":"arxiv","version":4},"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:634226691ee6829417efeca9ef5d61e5cf4a556a3197bd0f6f6a52ce0751fbbb","target":"record","created_at":"2026-05-18T00:32:21Z","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":"3f229bb71e20d5af53c643a2b1bf24018b5a4d05e89875945e9daafe6489c0dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T21:56:35Z","title_canon_sha256":"48b42c5c165345ec08aa6b1e466c1ab661b57aa916e1dddd874514cb21fd8428"},"schema_version":"1.0","source":{"id":"1503.08356","kind":"arxiv","version":4}},"canonical_sha256":"8d4d9d1e76799e9e4eb55bab7faf5de1492a69a2494a1ead4eebabea126c1f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d4d9d1e76799e9e4eb55bab7faf5de1492a69a2494a1ead4eebabea126c1f42","first_computed_at":"2026-05-18T00:32:21.747171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:21.747171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3NiAUTCZn8Wt6SvfUzHV2esI9OFWH3Olqgtb3DBoDYXVO09b2TZlT4ThldSHnFgi/E0ybDv5HX7ti8amnBZ3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:21.747847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08356","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:634226691ee6829417efeca9ef5d61e5cf4a556a3197bd0f6f6a52ce0751fbbb","sha256:59e938755d3292dbe4051951ecfd8b700364ee10ceaebdc4fefba4ba96a2e63f"],"state_sha256":"d9202a1389a40438444729e3bbc4f9f3d54cd6389c698b7157e7b0087d52ec55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/i+gTBMbOkc3j2pCqIpmHnL2scfNiRTuzZ+bna7ObSmzMkzMpyweB/VWNoWhIWRIzQlSS7ses+h9IdClVD+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:28:31.229191Z","bundle_sha256":"c9cd12abc2cadff8c4c87e75f0c4b4463e2626f278c392982ec8845f344f920a"}}