{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7DOYDFNBM32YUS3TFZLJBZ573X","short_pith_number":"pith:7DOYDFNB","schema_version":"1.0","canonical_sha256":"f8dd8195a166f58a4b732e5690e7bfddc1f4b8a4c5a3a9a52feabb07bf012ec1","source":{"kind":"arxiv","id":"1007.3753","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.3753","created_at":"2026-05-18T03:47:09.023335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3753v4","created_at":"2026-05-18T03:47:09.023335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3753","created_at":"2026-05-18T03:47:09.023335+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DOYDFNBM32Y","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DOYDFNBM32YUS3T","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DOYDFNB","created_at":"2026-05-18T12:26:04.259169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X","json":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X.json","graph_json":"https://pith.science/api/pith-number/7DOYDFNBM32YUS3TFZLJBZ573X/graph.json","events_json":"https://pith.science/api/pith-number/7DOYDFNBM32YUS3TFZLJBZ573X/events.json","paper":"https://pith.science/paper/7DOYDFNB"},"agent_actions":{"view_html":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X","download_json":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X.json","view_paper":"https://pith.science/paper/7DOYDFNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3753&json=true","fetch_graph":"https://pith.science/api/pith-number/7DOYDFNBM32YUS3TFZLJBZ573X/graph.json","fetch_events":"https://pith.science/api/pith-number/7DOYDFNBM32YUS3TFZLJBZ573X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/action/storage_attestation","attest_author":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/action/author_attestation","sign_citation":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/action/citation_signature","submit_replication":"https://pith.science/pith/7DOYDFNBM32YUS3TFZLJBZ573X/action/replication_record"}},"created_at":"2026-05-18T03:47:09.023335+00:00","updated_at":"2026-05-18T03:47:09.023335+00:00"}