{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KEBPIMCZ37WVPTS3MNO3CAON3K","short_pith_number":"pith:KEBPIMCZ","canonical_record":{"source":{"id":"1907.07359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-17T06:52:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"57945b00106263cb80bb2e7d21c5679334f264ddbd4f7d75535ff245a7f45ca1","abstract_canon_sha256":"98a222498162e61e90975ac1367c6f1d30b0dc46291d9d2d40e08e7cceb547cf"},"schema_version":"1.0"},"canonical_sha256":"5102f43059dfed57ce5b635db101cddaa4ddd69f7e457225df4ac5e463125cdd","source":{"kind":"arxiv","id":"1907.07359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07359","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07359v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07359","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"KEBPIMCZ37WV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEBPIMCZ37WVPTS3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEBPIMCZ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KEBPIMCZ37WVPTS3MNO3CAON3K","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-17T06:52:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"57945b00106263cb80bb2e7d21c5679334f264ddbd4f7d75535ff245a7f45ca1","abstract_canon_sha256":"98a222498162e61e90975ac1367c6f1d30b0dc46291d9d2d40e08e7cceb547cf"},"schema_version":"1.0"},"canonical_sha256":"5102f43059dfed57ce5b635db101cddaa4ddd69f7e457225df4ac5e463125cdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.538960Z","signature_b64":"kXhuzwxaF9m4Y/LooPd6o3S6UmDaWxKOzFDYaYVoPpIkWs/2ZOU+dIAG3pZnsw10zMBV4ZvEoan/X+qy18MaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5102f43059dfed57ce5b635db101cddaa4ddd69f7e457225df4ac5e463125cdd","last_reissued_at":"2026-05-17T23:40:22.538289Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.538289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07359","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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MGNBsVG3mjssJ7uSb7wSTysxuRORw45yk983bbidq8+/kxWSHFP0nJ3BtDKEAmnqea03qWiVfN6HiM4Xh5lDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:12.523097Z"},"content_sha256":"a8898f6bd616308220f610b2d3d765b73467442ae33f2aa0d5a0fe20eb1d2f04","schema_version":"1.0","event_id":"sha256:a8898f6bd616308220f610b2d3d765b73467442ae33f2aa0d5a0fe20eb1d2f04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KEBPIMCZ37WVPTS3MNO3CAON3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun-Hung Liu, Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang","submitted_at":"2019-07-17T06:52:45Z","abstract_excerpt":"Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted $\\ell_1$-minimization, which also generalizes a two-step $\\ell_1$-minimization algorithm introduced by E. J. Cand\\`es et al in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach place"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07359","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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYEv+be2HRjsU+lYLyfiF+rBQUATBKEi0NdD6N0r7PiRtmKt1d89DbS/C0b4NdlEqW0vDZsCW3dPRgdL92bWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:12.523498Z"},"content_sha256":"f42912f6db749342a460ab6ed3704e419c17658a1fa86569deac673acdf3d240","schema_version":"1.0","event_id":"sha256:f42912f6db749342a460ab6ed3704e419c17658a1fa86569deac673acdf3d240"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/bundle.json","state_url":"https://pith.science/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/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-27T19:19:12Z","links":{"resolver":"https://pith.science/pith/KEBPIMCZ37WVPTS3MNO3CAON3K","bundle":"https://pith.science/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/bundle.json","state":"https://pith.science/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEBPIMCZ37WVPTS3MNO3CAON3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KEBPIMCZ37WVPTS3MNO3CAON3K","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":"98a222498162e61e90975ac1367c6f1d30b0dc46291d9d2d40e08e7cceb547cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-17T06:52:45Z","title_canon_sha256":"57945b00106263cb80bb2e7d21c5679334f264ddbd4f7d75535ff245a7f45ca1"},"schema_version":"1.0","source":{"id":"1907.07359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07359","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07359v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07359","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"KEBPIMCZ37WV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEBPIMCZ37WVPTS3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEBPIMCZ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:f42912f6db749342a460ab6ed3704e419c17658a1fa86569deac673acdf3d240","target":"graph","created_at":"2026-05-17T23:40:22Z","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":"Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted $\\ell_1$-minimization, which also generalizes a two-step $\\ell_1$-minimization algorithm introduced by E. J. Cand\\`es et al in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach place","authors_text":"Chun-Hung Liu, Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-17T06:52:45Z","title":"Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07359","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:a8898f6bd616308220f610b2d3d765b73467442ae33f2aa0d5a0fe20eb1d2f04","target":"record","created_at":"2026-05-17T23:40:22Z","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":"98a222498162e61e90975ac1367c6f1d30b0dc46291d9d2d40e08e7cceb547cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-17T06:52:45Z","title_canon_sha256":"57945b00106263cb80bb2e7d21c5679334f264ddbd4f7d75535ff245a7f45ca1"},"schema_version":"1.0","source":{"id":"1907.07359","kind":"arxiv","version":1}},"canonical_sha256":"5102f43059dfed57ce5b635db101cddaa4ddd69f7e457225df4ac5e463125cdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5102f43059dfed57ce5b635db101cddaa4ddd69f7e457225df4ac5e463125cdd","first_computed_at":"2026-05-17T23:40:22.538289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.538289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXhuzwxaF9m4Y/LooPd6o3S6UmDaWxKOzFDYaYVoPpIkWs/2ZOU+dIAG3pZnsw10zMBV4ZvEoan/X+qy18MaBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.538960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8898f6bd616308220f610b2d3d765b73467442ae33f2aa0d5a0fe20eb1d2f04","sha256:f42912f6db749342a460ab6ed3704e419c17658a1fa86569deac673acdf3d240"],"state_sha256":"84117abcecae92ca119a4cbd9603964f19f4405c81c7ea87bd0c7b2f2b421add"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUKJJ23diTBjNJLSIXNXAGT2rbfHme1R63nABkWNC1wPw9xctsuQ617cMW2U+kG7D++yeeOj1VmgiyVeUSjwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:12.526221Z","bundle_sha256":"d88780a2b05fc5db76db384848469756feb224ab54eaab0fc2bf98365dd9c912"}}