{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NHA2QGBEWTODVL72YTYWOYU6UE","short_pith_number":"pith:NHA2QGBE","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"},"canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","source":{"kind":"arxiv","id":"1102.2748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2748","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2748v1","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2748","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"NHA2QGBEWTOD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NHA2QGBEWTODVL72","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NHA2QGBE","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NHA2QGBEWTODVL72YTYWOYU6UE","target":"record","payload":{"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"},"canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","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"},"source_kind":"arxiv","source_id":"1102.2748","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-18T04:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ELaVqImnmcLZiAzwZ67aGrDYFEcnN9RxvDDA3aotEYiKoY5gicj5QG/zZnBNsdOjLw6qmvnMh197nh5YtkZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:10.149591Z"},"content_sha256":"82c2f2058cdb7637a88d8d780ccbb76ed8398cb5fce5f3ed6f0e7692ea3a9393","schema_version":"1.0","event_id":"sha256:82c2f2058cdb7637a88d8d780ccbb76ed8398cb5fce5f3ed6f0e7692ea3a9393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NHA2QGBEWTODVL72YTYWOYU6UE","target":"graph","payload":{"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"},"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-18T04:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOOFgOap+NsM1Zi6DJ1iJ5QRbEhALRozjHWt7vI7hA3zsclQyAFbnN2d7MT7XdNN5iO10kzsQZNtMJ7A7+DYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:10.150279Z"},"content_sha256":"a94296dfc9442d2d880db7c19f5b3c664df20eb1f78901b479f86e8cbafe437c","schema_version":"1.0","event_id":"sha256:a94296dfc9442d2d880db7c19f5b3c664df20eb1f78901b479f86e8cbafe437c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/bundle.json","state_url":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHA2QGBEWTODVL72YTYWOYU6UE/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-25T19:18:10Z","links":{"resolver":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE","bundle":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/bundle.json","state":"https://pith.science/pith/NHA2QGBEWTODVL72YTYWOYU6UE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHA2QGBEWTODVL72YTYWOYU6UE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NHA2QGBEWTODVL72YTYWOYU6UE","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":"a1ac9e7aa0721c9415137a116c64e59fb57ce157f6e4ac5926f092a7fc140a35","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-02-14T12:05:47Z","title_canon_sha256":"a61cd27445529bf0c9e67f4fdde819e81767858ef28ce5992b3b5ed233b8ae89"},"schema_version":"1.0","source":{"id":"1102.2748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2748","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2748v1","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2748","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"NHA2QGBEWTOD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NHA2QGBEWTODVL72","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NHA2QGBE","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:a94296dfc9442d2d880db7c19f5b3c664df20eb1f78901b479f86e8cbafe437c","target":"graph","created_at":"2026-05-18T04:28: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":"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","authors_text":"Beiji Zou, Lei Wang, Yao Xiang, Yixiong Liang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-02-14T12:05:47Z","title":"Feature Selection via Sparse Approximation for Face Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2748","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:82c2f2058cdb7637a88d8d780ccbb76ed8398cb5fce5f3ed6f0e7692ea3a9393","target":"record","created_at":"2026-05-18T04:28: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":"a1ac9e7aa0721c9415137a116c64e59fb57ce157f6e4ac5926f092a7fc140a35","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-02-14T12:05:47Z","title_canon_sha256":"a61cd27445529bf0c9e67f4fdde819e81767858ef28ce5992b3b5ed233b8ae89"},"schema_version":"1.0","source":{"id":"1102.2748","kind":"arxiv","version":1}},"canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c1a81824b4dc3aaffac4f167629ea12b431f488af92ef1ded540a3684f15ab","first_computed_at":"2026-05-18T04:28:46.566558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:46.566558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ist2zP2xyOu9mqSNSDJCHid384aEVK9/HhLEWx2cDHTS9U3c781oZHCT/ogcar/0sNSMDGJ4moEP3uSku/J4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:46.567025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82c2f2058cdb7637a88d8d780ccbb76ed8398cb5fce5f3ed6f0e7692ea3a9393","sha256:a94296dfc9442d2d880db7c19f5b3c664df20eb1f78901b479f86e8cbafe437c"],"state_sha256":"737556e64ac1beb804f5da902b92e6e5d11d98bae1aa23445810a3852d43d38a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVgmJMKj7ezX2ZkgmvWM5Z8AaNHS1Yzny0iDtCEaUUurmxFf+dTyUXa2nbahR1x9TPbCQnBJMOn3lpGr+swDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:18:10.154019Z","bundle_sha256":"ec0b439d89bbf83ab7f9027acf1dec7b368c4f1ad9f60526636e5fcec6ceb5f8"}}