{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YAGENVK5VXBZXHLGOFVVN6PJ2K","short_pith_number":"pith:YAGENVK5","canonical_record":{"source":{"id":"1409.3660","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-12T07:18:17Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9be511d4dd8a4a6ae4f2fd9057fc29fdc665392f8be0d4720469ea374628a657","abstract_canon_sha256":"914e51a4244c879dc9ca895afb28b7788d29c3e94572e1945343cbbc1f9217c7"},"schema_version":"1.0"},"canonical_sha256":"c00c46d55dadc39b9d66716b56f9e9d28bbae90077ff79b41198b72fcd931b81","source":{"kind":"arxiv","id":"1409.3660","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3660","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3660v4","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3660","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"YAGENVK5VXBZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YAGENVK5VXBZXHLG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YAGENVK5","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YAGENVK5VXBZXHLGOFVVN6PJ2K","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3660","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-12T07:18:17Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9be511d4dd8a4a6ae4f2fd9057fc29fdc665392f8be0d4720469ea374628a657","abstract_canon_sha256":"914e51a4244c879dc9ca895afb28b7788d29c3e94572e1945343cbbc1f9217c7"},"schema_version":"1.0"},"canonical_sha256":"c00c46d55dadc39b9d66716b56f9e9d28bbae90077ff79b41198b72fcd931b81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.943753Z","signature_b64":"OGMml5kuhMh5+mujgdepBRbP36CEOJc2uHaa4P7sh0cKg8dJauRyooOlshZscq01PH/iSrqvIyQiA3/+C5NwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c00c46d55dadc39b9d66716b56f9e9d28bbae90077ff79b41198b72fcd931b81","last_reissued_at":"2026-05-18T02:35:46.943338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.943338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3660","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWk5IAP/GUHCGPg1M7k1Zl/i9WwLKi2m+3gbdHdZZ5J+6N0J13ecGfX11MZE6J5VwUOaaOrhmU4K/O7xoghvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:40:00.975891Z"},"content_sha256":"29f8cbafdae68722ccf97b1c7eae383eb76a98f77f62500d7698627d4abbdc85","schema_version":"1.0","event_id":"sha256:29f8cbafdae68722ccf97b1c7eae383eb76a98f77f62500d7698627d4abbdc85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YAGENVK5VXBZXHLGOFVVN6PJ2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"10,000+ Times Accelerated Robust Subset Selection (ARSS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Fan, Chunhong Pan, Feiyun Zhu, Shiming Xiang, Xinliang Zhu, Ying Wang","submitted_at":"2014-09-12T07:18:17Z","abstract_excerpt":"Subset selection from massive data with noised information is increasingly popular for various applications. This problem is still highly challenging as current methods are generally slow in speed and sensitive to outliers. To address the above two issues, we propose an accelerated robust subset selection (ARSS) method. Specifically in the subset selection area, this is the first attempt to employ the $\\ell_{p}(0<p\\leq1)$-norm based measure for the representation loss, preventing large errors from dominating our objective. As a result, the robustness against outlier elements is greatly enhance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3660","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKyE+T12M/bp9H+HLh6qkKwuo47FBn8jjLIt7N1lSH6FTR2lRcJVPmHpzhX1gjznKkPRepUi4F4kk0hPhoK5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:40:00.976584Z"},"content_sha256":"9666cc9f51da7d46a96661d47f129087b7bde8cf3ff33215d80178aa8a08ccc7","schema_version":"1.0","event_id":"sha256:9666cc9f51da7d46a96661d47f129087b7bde8cf3ff33215d80178aa8a08ccc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/bundle.json","state_url":"https://pith.science/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/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-10T23:40:00Z","links":{"resolver":"https://pith.science/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K","bundle":"https://pith.science/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/bundle.json","state":"https://pith.science/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAGENVK5VXBZXHLGOFVVN6PJ2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YAGENVK5VXBZXHLGOFVVN6PJ2K","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":"914e51a4244c879dc9ca895afb28b7788d29c3e94572e1945343cbbc1f9217c7","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-12T07:18:17Z","title_canon_sha256":"9be511d4dd8a4a6ae4f2fd9057fc29fdc665392f8be0d4720469ea374628a657"},"schema_version":"1.0","source":{"id":"1409.3660","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3660","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3660v4","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3660","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"YAGENVK5VXBZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YAGENVK5VXBZXHLG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YAGENVK5","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:9666cc9f51da7d46a96661d47f129087b7bde8cf3ff33215d80178aa8a08ccc7","target":"graph","created_at":"2026-05-18T02:35:46Z","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":"Subset selection from massive data with noised information is increasingly popular for various applications. This problem is still highly challenging as current methods are generally slow in speed and sensitive to outliers. To address the above two issues, we propose an accelerated robust subset selection (ARSS) method. Specifically in the subset selection area, this is the first attempt to employ the $\\ell_{p}(0<p\\leq1)$-norm based measure for the representation loss, preventing large errors from dominating our objective. As a result, the robustness against outlier elements is greatly enhance","authors_text":"Bin Fan, Chunhong Pan, Feiyun Zhu, Shiming Xiang, Xinliang Zhu, Ying Wang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-12T07:18:17Z","title":"10,000+ Times Accelerated Robust Subset Selection (ARSS)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3660","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:29f8cbafdae68722ccf97b1c7eae383eb76a98f77f62500d7698627d4abbdc85","target":"record","created_at":"2026-05-18T02:35:46Z","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":"914e51a4244c879dc9ca895afb28b7788d29c3e94572e1945343cbbc1f9217c7","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-12T07:18:17Z","title_canon_sha256":"9be511d4dd8a4a6ae4f2fd9057fc29fdc665392f8be0d4720469ea374628a657"},"schema_version":"1.0","source":{"id":"1409.3660","kind":"arxiv","version":4}},"canonical_sha256":"c00c46d55dadc39b9d66716b56f9e9d28bbae90077ff79b41198b72fcd931b81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c00c46d55dadc39b9d66716b56f9e9d28bbae90077ff79b41198b72fcd931b81","first_computed_at":"2026-05-18T02:35:46.943338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.943338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGMml5kuhMh5+mujgdepBRbP36CEOJc2uHaa4P7sh0cKg8dJauRyooOlshZscq01PH/iSrqvIyQiA3/+C5NwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.943753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3660","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29f8cbafdae68722ccf97b1c7eae383eb76a98f77f62500d7698627d4abbdc85","sha256:9666cc9f51da7d46a96661d47f129087b7bde8cf3ff33215d80178aa8a08ccc7"],"state_sha256":"7b5adb7cb61476f12eba113b2a86185253ce1fcbf31f4150eadb2d4a0efa6ea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOHsfhZXA0vkEqzwerxnR2/5W7yUoNshSS2E7oFFyoWm38JhjaTB9Tan31Xy8phDV1eENbgcKDm1FyvGFb89AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:40:00.980457Z","bundle_sha256":"a163118d78b77fa843baa4dda3904b9bcac09ff45e450ba96ca61fa4ae7d1428"}}