{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NHA2QGBEWTODVL72YTYWOYU6UE","short_pith_number":"pith:NHA2QGBE","schema_version":"1.0","canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","source":{"kind":"arxiv","id":"1102.2748","version":1},"attestation_state":"computed","paper":{"title":"Feature Selection via Sparse Approximation for Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Beiji Zou, Lei Wang, Yao Xiang, Yixiong Liang","submitted_at":"2011-02-14T12:05:47Z","abstract_excerpt":"Inspired by biological vision systems, the over-complete local features with huge cardinality are increasingly used for face recognition during the last decades. Accordingly, feature selection has become more and more important and plays a critical role for face data description and recognition. In this paper, we propose a trainable feature selection algorithm based on the regularized frame for face recognition. By enforcing a sparsity penalty term on the minimum squared error (MSE) criterion, we cast the feature selection problem into a combinatorial sparse approximation problem, which can be"},"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":"1102.2748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-02-14T12:05:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a61cd27445529bf0c9e67f4fdde819e81767858ef28ce5992b3b5ed233b8ae89","abstract_canon_sha256":"a1ac9e7aa0721c9415137a116c64e59fb57ce157f6e4ac5926f092a7fc140a35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:46.567025Z","signature_b64":"Ist2zP2xyOu9mqSNSDJCHid384aEVK9/HhLEWx2cDHTS9U3c781oZHCT/ogcar/0sNSMDGJ4moEP3uSku/J4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","last_reissued_at":"2026-05-18T04:28:46.566558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:46.566558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Selection via Sparse Approximation for Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Beiji Zou, Lei Wang, Yao Xiang, Yixiong Liang","submitted_at":"2011-02-14T12:05:47Z","abstract_excerpt":"Inspired by biological vision systems, the over-complete local features with huge cardinality are increasingly used for face recognition during the last decades. Accordingly, feature selection has become more and more important and plays a critical role for face data description and recognition. In this paper, we propose a trainable feature selection algorithm based on the regularized frame for face recognition. By enforcing a sparsity penalty term on the minimum squared error (MSE) criterion, we cast the feature selection problem into a combinatorial sparse approximation problem, which can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2748","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.2748","created_at":"2026-05-18T04:28:46.566634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2748v1","created_at":"2026-05-18T04:28:46.566634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2748","created_at":"2026-05-18T04:28:46.566634+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHA2QGBEWTOD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHA2QGBEWTODVL72","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHA2QGBE","created_at":"2026-05-18T12:26:37.096874+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/NHA2QGBEWTODVL72YTYWOYU6UE","json":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE.json","graph_json":"https://pith.science/api/pith-number/NHA2QGBEWTODVL72YTYWOYU6UE/graph.json","events_json":"https://pith.science/api/pith-number/NHA2QGBEWTODVL72YTYWOYU6UE/events.json","paper":"https://pith.science/paper/NHA2QGBE"},"agent_actions":{"view_html":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE","download_json":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE.json","view_paper":"https://pith.science/paper/NHA2QGBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2748&json=true","fetch_graph":"https://pith.science/api/pith-number/NHA2QGBEWTODVL72YTYWOYU6UE/graph.json","fetch_events":"https://pith.science/api/pith-number/NHA2QGBEWTODVL72YTYWOYU6UE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/action/storage_attestation","attest_author":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/action/author_attestation","sign_citation":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/action/citation_signature","submit_replication":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/action/replication_record"}},"created_at":"2026-05-18T04:28:46.566634+00:00","updated_at":"2026-05-18T04:28:46.566634+00:00"}