{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C36SNN52T7JF7U35Q5NYA2YCVS","short_pith_number":"pith:C36SNN52","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"},"canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","source":{"kind":"arxiv","id":"1301.6847","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6847","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6847v2","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6847","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"C36SNN52T7JF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C36SNN52T7JF7U35","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C36SNN52","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C36SNN52T7JF7U35Q5NYA2YCVS","target":"record","payload":{"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"},"canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","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"},"source_kind":"arxiv","source_id":"1301.6847","source_version":2,"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:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0TDnEmxgj0pHQBH02hlOb5t7TQB2bm0d4w+o4HuZuk4MfPLfpXPXxezMVxSyJFXftXgejtmTouT7+elF/R9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:50:10.100674Z"},"content_sha256":"279334d62853df0a153a15bf63dd5bd7cb244bba0fde2d7d11105c562e06203b","schema_version":"1.0","event_id":"sha256:279334d62853df0a153a15bf63dd5bd7cb244bba0fde2d7d11105c562e06203b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C36SNN52T7JF7U35Q5NYA2YCVS","target":"graph","payload":{"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"},"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:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2SMZzwrPSyjijHYOmtVYQfs1H6DIoiDRE9ZDtMkRJvdWGbLKB3BYOG/WFAJoxb+LMnR4TMagfK8yECAprR0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:50:10.101041Z"},"content_sha256":"6c3a3bfb9b190a4fe35960f922662ec5b27483a255effc07205c330c41746e74","schema_version":"1.0","event_id":"sha256:6c3a3bfb9b190a4fe35960f922662ec5b27483a255effc07205c330c41746e74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/bundle.json","state_url":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C36SNN52T7JF7U35Q5NYA2YCVS/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-05T10:50:10Z","links":{"resolver":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS","bundle":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/bundle.json","state":"https://pith.science/pith/C36SNN52T7JF7U35Q5NYA2YCVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C36SNN52T7JF7U35Q5NYA2YCVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C36SNN52T7JF7U35Q5NYA2YCVS","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":"72da1d07670ea582016ceb9792314e5244a4da26732ba402a9f49335d23e4f17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-29T07:23:00Z","title_canon_sha256":"8698633ff01a6f44437da6cd0891f313da6680a7e52aca2a09de449740061028"},"schema_version":"1.0","source":{"id":"1301.6847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6847","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6847v2","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6847","created_at":"2026-05-18T03:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"C36SNN52T7JF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C36SNN52T7JF7U35","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C36SNN52","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:6c3a3bfb9b190a4fe35960f922662ec5b27483a255effc07205c330c41746e74","target":"graph","created_at":"2026-05-18T03:13:00Z","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":"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","authors_text":"Taiyong Li, Zhilin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-29T07:23:00Z","title":"Robust Face Recognition via Block Sparse Bayesian Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6847","kind":"arxiv","version":2},"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:279334d62853df0a153a15bf63dd5bd7cb244bba0fde2d7d11105c562e06203b","target":"record","created_at":"2026-05-18T03:13:00Z","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":"72da1d07670ea582016ceb9792314e5244a4da26732ba402a9f49335d23e4f17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-29T07:23:00Z","title_canon_sha256":"8698633ff01a6f44437da6cd0891f313da6680a7e52aca2a09de449740061028"},"schema_version":"1.0","source":{"id":"1301.6847","kind":"arxiv","version":2}},"canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16fd26b7ba9fd25fd37d875b806b02acba9471e6766c134e82ee3e73d5a81d06","first_computed_at":"2026-05-18T03:13:00.067737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:00.067737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBua5NiXRbzaqKNapMTAGrcUzj79az7altB/4PlAF2crqQGdnDcYmqhlnteYNTaSv39SMUwUQFLDnZJS5dV6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:00.068511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:279334d62853df0a153a15bf63dd5bd7cb244bba0fde2d7d11105c562e06203b","sha256:6c3a3bfb9b190a4fe35960f922662ec5b27483a255effc07205c330c41746e74"],"state_sha256":"ee4722c7f4abeb7475799d3bfb2d4053c0a562c7f35df94bbc31c8dc8ac5677d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVR8WqTRyvrAYed2Yj3fqHlZTUgiy1oPNSIQ3j5IusY00XxQc16dG2/GaVTI8MF1boxokv6MKteqIi6IeOjXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:50:10.104163Z","bundle_sha256":"1b74f59db37fe41c9cf6bbcc2b7922a81e6942d2d1b23ea28c05771d1c00bd77"}}