{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FTR64UTDR6IL5H6MQ7YADGFLI4","short_pith_number":"pith:FTR64UTD","canonical_record":{"source":{"id":"1304.5583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-20T03:54:48Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"feebb68fe62311b336aeae474893cc723e0abcbbe6e199e4a240f284e6ad7096","abstract_canon_sha256":"112bea6d197b6c3ee76d106f44c08f5a38a6a9443f8d5e7af4042f68813da8bf"},"schema_version":"1.0"},"canonical_sha256":"2ce3ee52638f90be9fcc87f00198ab47396f69c3a69bfdecfb43213b73eda5d6","source":{"kind":"arxiv","id":"1304.5583","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5583","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5583v2","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5583","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"FTR64UTDR6IL","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FTR64UTDR6IL5H6M","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FTR64UTD","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FTR64UTDR6IL5H6MQ7YADGFLI4","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-20T03:54:48Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"feebb68fe62311b336aeae474893cc723e0abcbbe6e199e4a240f284e6ad7096","abstract_canon_sha256":"112bea6d197b6c3ee76d106f44c08f5a38a6a9443f8d5e7af4042f68813da8bf"},"schema_version":"1.0"},"canonical_sha256":"2ce3ee52638f90be9fcc87f00198ab47396f69c3a69bfdecfb43213b73eda5d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.100008Z","signature_b64":"EYHvidYJ3NJDcBr3MNuTVr/smkdhim04hrBF0lFum/OO8mQ0waM4HRq14Z5W+zIY7suMmxD+NO2uNoiuNn4dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce3ee52638f90be9fcc87f00198ab47396f69c3a69bfdecfb43213b73eda5d6","last_reissued_at":"2026-05-18T03:10:24.099259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.099259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5583","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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAFT8KznHKT6ishEd6qXQ/Pbh5/AmWGz1h54OMYigvQIf2BcoMRuK1PXco20lHamnZUqdeH3Tud/touWuZ2nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:02:00.526972Z"},"content_sha256":"d1d025fd2812d1718407a650b4a76ec09187cd5e8cdf3bd5386760f2ab97e4ba","schema_version":"1.0","event_id":"sha256:d1d025fd2812d1718407a650b4a76ec09187cd5e8cdf3bd5386760f2ab97e4ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FTR64UTDR6IL5H6MQ7YADGFLI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Low-rank Subspace Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Ameet Talwalkar, Lester Mackey, Michael I. Jordan, Shih-Fu Chang, Yadong Mu","submitted_at":"2013-04-20T03:54:48Z","abstract_excerpt":"Vision problems ranging from image clustering to motion segmentation to semi-supervised learning can naturally be framed as subspace segmentation problems, in which one aims to recover multiple low-dimensional subspaces from noisy and corrupted input data. Low-Rank Representation (LRR), a convex formulation of the subspace segmentation problem, is provably and empirically accurate on small problems but does not scale to the massive sizes of modern vision datasets. Moreover, past work aimed at scaling up low-rank matrix factorization is not applicable to LRR given its non-decomposable constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5583","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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7r17KR+GB0i6r87eswX+7lt3KtKPhyHrByvYp9KYSPuOwWmN3LGFdc3l3AHFPaA7ZNExdz/yBGAp8e2C1PXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:02:00.527352Z"},"content_sha256":"8f76546389e3f88f25baa24342ea3dacd1ed2f82fcf77982c4e723a58cf57e5e","schema_version":"1.0","event_id":"sha256:8f76546389e3f88f25baa24342ea3dacd1ed2f82fcf77982c4e723a58cf57e5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/bundle.json","state_url":"https://pith.science/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/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-05-28T04:02:00Z","links":{"resolver":"https://pith.science/pith/FTR64UTDR6IL5H6MQ7YADGFLI4","bundle":"https://pith.science/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/bundle.json","state":"https://pith.science/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTR64UTDR6IL5H6MQ7YADGFLI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FTR64UTDR6IL5H6MQ7YADGFLI4","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":"112bea6d197b6c3ee76d106f44c08f5a38a6a9443f8d5e7af4042f68813da8bf","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-20T03:54:48Z","title_canon_sha256":"feebb68fe62311b336aeae474893cc723e0abcbbe6e199e4a240f284e6ad7096"},"schema_version":"1.0","source":{"id":"1304.5583","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5583","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5583v2","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5583","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"FTR64UTDR6IL","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FTR64UTDR6IL5H6M","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FTR64UTD","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:8f76546389e3f88f25baa24342ea3dacd1ed2f82fcf77982c4e723a58cf57e5e","target":"graph","created_at":"2026-05-18T03:10:24Z","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":"Vision problems ranging from image clustering to motion segmentation to semi-supervised learning can naturally be framed as subspace segmentation problems, in which one aims to recover multiple low-dimensional subspaces from noisy and corrupted input data. Low-Rank Representation (LRR), a convex formulation of the subspace segmentation problem, is provably and empirically accurate on small problems but does not scale to the massive sizes of modern vision datasets. Moreover, past work aimed at scaling up low-rank matrix factorization is not applicable to LRR given its non-decomposable constrain","authors_text":"Ameet Talwalkar, Lester Mackey, Michael I. Jordan, Shih-Fu Chang, Yadong Mu","cross_cats":["cs.DC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-20T03:54:48Z","title":"Distributed Low-rank Subspace Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5583","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:d1d025fd2812d1718407a650b4a76ec09187cd5e8cdf3bd5386760f2ab97e4ba","target":"record","created_at":"2026-05-18T03:10:24Z","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":"112bea6d197b6c3ee76d106f44c08f5a38a6a9443f8d5e7af4042f68813da8bf","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-20T03:54:48Z","title_canon_sha256":"feebb68fe62311b336aeae474893cc723e0abcbbe6e199e4a240f284e6ad7096"},"schema_version":"1.0","source":{"id":"1304.5583","kind":"arxiv","version":2}},"canonical_sha256":"2ce3ee52638f90be9fcc87f00198ab47396f69c3a69bfdecfb43213b73eda5d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ce3ee52638f90be9fcc87f00198ab47396f69c3a69bfdecfb43213b73eda5d6","first_computed_at":"2026-05-18T03:10:24.099259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:24.099259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EYHvidYJ3NJDcBr3MNuTVr/smkdhim04hrBF0lFum/OO8mQ0waM4HRq14Z5W+zIY7suMmxD+NO2uNoiuNn4dDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:24.100008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5583","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1d025fd2812d1718407a650b4a76ec09187cd5e8cdf3bd5386760f2ab97e4ba","sha256:8f76546389e3f88f25baa24342ea3dacd1ed2f82fcf77982c4e723a58cf57e5e"],"state_sha256":"ea2b72e6513b46d75594fcb9b565202b7edd6ef7adcdfd155856fe9bc9385e69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tR75XhUm1Pvg+ptQC/kHDub5TyPp+P1SaSgq9jTpjFfmt7IGKrcJCJ924DnIR2KRUZfsmgYN+JGB2Pd/6YcLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:02:00.529404Z","bundle_sha256":"9a6ed8d4b998fa528bdf25b25774bd5b67e7b48ad96d362a7b49e0f1b1f15320"}}