{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7DOYDFNBM32YUS3TFZLJBZ573X","short_pith_number":"pith:7DOYDFNB","canonical_record":{"source":{"id":"1007.3753","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-21T20:26:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"291bf5b3f0d930b87cf47284c2909b0d8ab90f608b914e89a41dcf79a6d0bca1","abstract_canon_sha256":"d74cbab4c1da3b4f1ab81cde3e6b84e1b452a6c822d3305b9c24dfc8c105a8e5"},"schema_version":"1.0"},"canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","source":{"kind":"arxiv","id":"1007.3753","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3753","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3753v4","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3753","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"7DOYDFNBM32Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DOYDFNBM32YUS3T","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DOYDFNB","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7DOYDFNBM32YUS3TFZLJBZ573X","target":"record","payload":{"canonical_record":{"source":{"id":"1007.3753","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-21T20:26:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"291bf5b3f0d930b87cf47284c2909b0d8ab90f608b914e89a41dcf79a6d0bca1","abstract_canon_sha256":"d74cbab4c1da3b4f1ab81cde3e6b84e1b452a6c822d3305b9c24dfc8c105a8e5"},"schema_version":"1.0"},"canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:09.023867Z","signature_b64":"eAlYTLwGS8zye0IlpN3rJ6xM/1E81C5fBx/NdjMvYVpol3VjfGF313feAgl17L9Xm7HlUJmQ1HCUmSKfjq0iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","last_reissued_at":"2026-05-18T03:47:09.023242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:09.023242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.3753","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-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elq3AKfUfUeirTb4PJsu/68r5j6V2vEn73ECuJZgEWUMZzGuK2flYPpreR/ydvQGmzqXjhH+CML7PYwQzT5DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:02.074116Z"},"content_sha256":"b1f22f812af6f093ea29319cc2fae7f882c9143902fc2e024a8c8a7175d28aa7","schema_version":"1.0","event_id":"sha256:b1f22f812af6f093ea29319cc2fae7f882c9143902fc2e024a8c8a7175d28aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7DOYDFNBM32YUS3TFZLJBZ573X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast L1-Minimization Algorithms For Robust Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CV","authors_text":"Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma, Zihan Zhou","submitted_at":"2010-07-21T20:26:26Z","abstract_excerpt":"L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax. Under certain conditions as described in compressive sensing theory, the minimum L1-norm solution is also the sparsest solution. In this paper, our study addresses the speed and scalability of its algorithms. In particular, we focus on the numerical implementation of a sparsity-based classification framework in robust face recognition, where sparse representation is sought to recover human identities from very high-dimensional facial images that may be corrupted by illumination, facial disg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3753","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-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLURsIPCaHebaHqkZiFU1Vk3L4Ku29anShcwEVUqwwwh4tNU+vgXviJcA4mdS3MqXX9NahEHKjmITI6+nWU4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:02.074869Z"},"content_sha256":"1062f599468226449f85be2efd0a2ab9c62f57a9415419a8b83a7af25b1f1c96","schema_version":"1.0","event_id":"sha256:1062f599468226449f85be2efd0a2ab9c62f57a9415419a8b83a7af25b1f1c96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/bundle.json","state_url":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DOYDFNBM32YUS3TFZLJBZ573X/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-01T02:03:02Z","links":{"resolver":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X","bundle":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/bundle.json","state":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DOYDFNBM32YUS3TFZLJBZ573X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7DOYDFNBM32YUS3TFZLJBZ573X","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":"d74cbab4c1da3b4f1ab81cde3e6b84e1b452a6c822d3305b9c24dfc8c105a8e5","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-21T20:26:26Z","title_canon_sha256":"291bf5b3f0d930b87cf47284c2909b0d8ab90f608b914e89a41dcf79a6d0bca1"},"schema_version":"1.0","source":{"id":"1007.3753","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3753","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3753v4","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3753","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"7DOYDFNBM32Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DOYDFNBM32YUS3T","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DOYDFNB","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:1062f599468226449f85be2efd0a2ab9c62f57a9415419a8b83a7af25b1f1c96","target":"graph","created_at":"2026-05-18T03:47:09Z","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":"L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax. Under certain conditions as described in compressive sensing theory, the minimum L1-norm solution is also the sparsest solution. In this paper, our study addresses the speed and scalability of its algorithms. In particular, we focus on the numerical implementation of a sparsity-based classification framework in robust face recognition, where sparse representation is sought to recover human identities from very high-dimensional facial images that may be corrupted by illumination, facial disg","authors_text":"Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma, Zihan Zhou","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-21T20:26:26Z","title":"Fast L1-Minimization Algorithms For Robust Face Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3753","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:b1f22f812af6f093ea29319cc2fae7f882c9143902fc2e024a8c8a7175d28aa7","target":"record","created_at":"2026-05-18T03:47:09Z","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":"d74cbab4c1da3b4f1ab81cde3e6b84e1b452a6c822d3305b9c24dfc8c105a8e5","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-21T20:26:26Z","title_canon_sha256":"291bf5b3f0d930b87cf47284c2909b0d8ab90f608b914e89a41dcf79a6d0bca1"},"schema_version":"1.0","source":{"id":"1007.3753","kind":"arxiv","version":4}},"canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","first_computed_at":"2026-05-18T03:47:09.023242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:09.023242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eAlYTLwGS8zye0IlpN3rJ6xM/1E81C5fBx/NdjMvYVpol3VjfGF313feAgl17L9Xm7HlUJmQ1HCUmSKfjq0iBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:09.023867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.3753","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1f22f812af6f093ea29319cc2fae7f882c9143902fc2e024a8c8a7175d28aa7","sha256:1062f599468226449f85be2efd0a2ab9c62f57a9415419a8b83a7af25b1f1c96"],"state_sha256":"01dad8c7d34b24f490aaa58536ffe01d639ec22281237b62d4f016516a566973"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWJ+EELw/ARfaGX3ng5cxfhWvFrjA38CiOid/ESLiwi6f7nzMmbX6OM/PUN6TZOwm4V3SM0oxX8r91+Efe0eAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:03:02.078261Z","bundle_sha256":"0e36c41b63ccdba7fef584ba62241ceef99eaed53b675ae71a508c8ca6199c41"}}