{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C36SNN52T7JF7U35Q5NYA2YCVS","short_pith_number":"pith:C36SNN52","schema_version":"1.0","canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","source":{"kind":"arxiv","id":"1301.6847","version":2},"attestation_state":"computed","paper":{"title":"Robust Face Recognition via Block Sparse Bayesian Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Taiyong Li, Zhilin Zhang","submitted_at":"2013-01-29T07:23:00Z","abstract_excerpt":"Face recognition (FR) is an important task in pattern recognition and computer vision. Sparse representation (SR) has been demonstrated to be a powerful framework for FR. In general, an SR algorithm treats each face in a training dataset as a basis function, and tries to find a sparse representation of a test face under these basis functions. The sparse representation coefficients then provide a recognition hint. Early SR algorithms are based on a basic sparse model. Recently, it has been found that algorithms based on a block sparse model can achieve better recognition rates. Based on this mo"},"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":"1301.6847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-29T07:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"8698633ff01a6f44437da6cd0891f313da6680a7e52aca2a09de449740061028","abstract_canon_sha256":"72da1d07670ea582016ceb9792314e5244a4da26732ba402a9f49335d23e4f17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:00.068511Z","signature_b64":"RBua5NiXRbzaqKNapMTAGrcUzj79az7altB/4PlAF2crqQGdnDcYmqhlnteYNTaSv39SMUwUQFLDnZJS5dV6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","last_reissued_at":"2026-05-18T03:13:00.067737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:00.067737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Face Recognition via Block Sparse Bayesian Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Taiyong Li, Zhilin Zhang","submitted_at":"2013-01-29T07:23:00Z","abstract_excerpt":"Face recognition (FR) is an important task in pattern recognition and computer vision. Sparse representation (SR) has been demonstrated to be a powerful framework for FR. In general, an SR algorithm treats each face in a training dataset as a basis function, and tries to find a sparse representation of a test face under these basis functions. The sparse representation coefficients then provide a recognition hint. Early SR algorithms are based on a basic sparse model. Recently, it has been found that algorithms based on a block sparse model can achieve better recognition rates. Based on this mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6847","kind":"arxiv","version":2},"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":"1301.6847","created_at":"2026-05-18T03:13:00.067888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6847v2","created_at":"2026-05-18T03:13:00.067888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6847","created_at":"2026-05-18T03:13:00.067888+00:00"},{"alias_kind":"pith_short_12","alias_value":"C36SNN52T7JF","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C36SNN52T7JF7U35","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C36SNN52","created_at":"2026-05-18T12:27:40.988391+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/C36SNN52T7JF7U35Q5NYA2YCVS","json":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS.json","graph_json":"https://pith.science/api/pith-number/C36SNN52T7JF7U35Q5NYA2YCVS/graph.json","events_json":"https://pith.science/api/pith-number/C36SNN52T7JF7U35Q5NYA2YCVS/events.json","paper":"https://pith.science/paper/C36SNN52"},"agent_actions":{"view_html":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS","download_json":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS.json","view_paper":"https://pith.science/paper/C36SNN52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6847&json=true","fetch_graph":"https://pith.science/api/pith-number/C36SNN52T7JF7U35Q5NYA2YCVS/graph.json","fetch_events":"https://pith.science/api/pith-number/C36SNN52T7JF7U35Q5NYA2YCVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/action/storage_attestation","attest_author":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/action/author_attestation","sign_citation":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/action/citation_signature","submit_replication":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/action/replication_record"}},"created_at":"2026-05-18T03:13:00.067888+00:00","updated_at":"2026-05-18T03:13:00.067888+00:00"}