{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5BZJBXQNIENZRN4SW47YTQZYM3","short_pith_number":"pith:5BZJBXQN","canonical_record":{"source":{"id":"1605.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-08T02:45:33Z","cross_cats_sorted":[],"title_canon_sha256":"6bb60d18aea30aa4aa9dd95b3cfffd3590c5c30666cff270e4e5fc4dc829320d","abstract_canon_sha256":"60d7d52ec3bda9973125e4ad338689f88b371f8bd347a533d16d0cc7c62c49fd"},"schema_version":"1.0"},"canonical_sha256":"e87290de0d411b98b792b73f89c33866e17efcc71501762b8fe6b0d59044778e","source":{"kind":"arxiv","id":"1605.02266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02266","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02266v2","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02266","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"5BZJBXQNIENZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BZJBXQNIENZRN4S","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BZJBXQN","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5BZJBXQNIENZRN4SW47YTQZYM3","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-08T02:45:33Z","cross_cats_sorted":[],"title_canon_sha256":"6bb60d18aea30aa4aa9dd95b3cfffd3590c5c30666cff270e4e5fc4dc829320d","abstract_canon_sha256":"60d7d52ec3bda9973125e4ad338689f88b371f8bd347a533d16d0cc7c62c49fd"},"schema_version":"1.0"},"canonical_sha256":"e87290de0d411b98b792b73f89c33866e17efcc71501762b8fe6b0d59044778e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:49.056642Z","signature_b64":"V+CROcCGn+Agw801VfAASWCKGV78YZr8/+A7+v4UYtcostIxVV/lWto0Ub+vxe/QlArUhR5w+cxy9hrUJN8iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e87290de0d411b98b792b73f89c33866e17efcc71501762b8fe6b0d59044778e","last_reissued_at":"2026-05-18T00:30:49.056042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:49.056042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02266","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-18T00:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPOGeIdgo+qs6XyRZ1aLE++H5assrIPJspx5USN9Oo8H3zg0R0hij5E6k7SzJ47DmadFCTS9DyQwjSfeFgkyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:00:05.636710Z"},"content_sha256":"162b1003bd8da98748d2b00da80f04f226cfcf551f5abe038f2fe3e17b464120","schema_version":"1.0","event_id":"sha256:162b1003bd8da98748d2b00da80f04f226cfcf551f5abe038f2fe3e17b464120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5BZJBXQNIENZRN4SW47YTQZYM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and Low-Rank Representation for Fast Face Identification with Occlusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Aggelos K. Katsaggelos, Haohong Wang, Michael Iliadis, Rafael Molina","submitted_at":"2016-05-08T02:45:33Z","abstract_excerpt":"In this paper we propose an iterative method to address the face identification problem with block occlusions. Our approach utilizes a robust representation based on two characteristics in order to model contiguous errors (e.g., block occlusion) effectively. The first fits to the errors a distribution described by a tailored loss function. The second describes the error image as having a specific structure (resulting in low-rank in comparison to image size). We will show that this joint characterization is effective for describing errors with spatial continuity. Our approach is computationally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02266","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-18T00:30:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LU9+UaMCF68A7apFK//yg1zLgwMcua1d31+7VQrasNgZMmlj/4aDzEHozNXOv4dYU0f9h5ZrUtShibm+rsWvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:00:05.637353Z"},"content_sha256":"84055d62572f803aa052c427ed4c7a5c3f4e4ba035f9c44ce827a67a14e3f3a7","schema_version":"1.0","event_id":"sha256:84055d62572f803aa052c427ed4c7a5c3f4e4ba035f9c44ce827a67a14e3f3a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BZJBXQNIENZRN4SW47YTQZYM3/bundle.json","state_url":"https://pith.science/pith/5BZJBXQNIENZRN4SW47YTQZYM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BZJBXQNIENZRN4SW47YTQZYM3/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-30T04:00:05Z","links":{"resolver":"https://pith.science/pith/5BZJBXQNIENZRN4SW47YTQZYM3","bundle":"https://pith.science/pith/5BZJBXQNIENZRN4SW47YTQZYM3/bundle.json","state":"https://pith.science/pith/5BZJBXQNIENZRN4SW47YTQZYM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BZJBXQNIENZRN4SW47YTQZYM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5BZJBXQNIENZRN4SW47YTQZYM3","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":"60d7d52ec3bda9973125e4ad338689f88b371f8bd347a533d16d0cc7c62c49fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-08T02:45:33Z","title_canon_sha256":"6bb60d18aea30aa4aa9dd95b3cfffd3590c5c30666cff270e4e5fc4dc829320d"},"schema_version":"1.0","source":{"id":"1605.02266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02266","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02266v2","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02266","created_at":"2026-05-18T00:30:49Z"},{"alias_kind":"pith_short_12","alias_value":"5BZJBXQNIENZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BZJBXQNIENZRN4S","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BZJBXQN","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:84055d62572f803aa052c427ed4c7a5c3f4e4ba035f9c44ce827a67a14e3f3a7","target":"graph","created_at":"2026-05-18T00:30:49Z","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":"In this paper we propose an iterative method to address the face identification problem with block occlusions. Our approach utilizes a robust representation based on two characteristics in order to model contiguous errors (e.g., block occlusion) effectively. The first fits to the errors a distribution described by a tailored loss function. The second describes the error image as having a specific structure (resulting in low-rank in comparison to image size). We will show that this joint characterization is effective for describing errors with spatial continuity. Our approach is computationally","authors_text":"Aggelos K. Katsaggelos, Haohong Wang, Michael Iliadis, Rafael Molina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-08T02:45:33Z","title":"Robust and Low-Rank Representation for Fast Face Identification with Occlusions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02266","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:162b1003bd8da98748d2b00da80f04f226cfcf551f5abe038f2fe3e17b464120","target":"record","created_at":"2026-05-18T00:30:49Z","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":"60d7d52ec3bda9973125e4ad338689f88b371f8bd347a533d16d0cc7c62c49fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-08T02:45:33Z","title_canon_sha256":"6bb60d18aea30aa4aa9dd95b3cfffd3590c5c30666cff270e4e5fc4dc829320d"},"schema_version":"1.0","source":{"id":"1605.02266","kind":"arxiv","version":2}},"canonical_sha256":"e87290de0d411b98b792b73f89c33866e17efcc71501762b8fe6b0d59044778e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e87290de0d411b98b792b73f89c33866e17efcc71501762b8fe6b0d59044778e","first_computed_at":"2026-05-18T00:30:49.056042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:49.056042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+CROcCGn+Agw801VfAASWCKGV78YZr8/+A7+v4UYtcostIxVV/lWto0Ub+vxe/QlArUhR5w+cxy9hrUJN8iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:49.056642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:162b1003bd8da98748d2b00da80f04f226cfcf551f5abe038f2fe3e17b464120","sha256:84055d62572f803aa052c427ed4c7a5c3f4e4ba035f9c44ce827a67a14e3f3a7"],"state_sha256":"1e3e11d3991ae6851da43ab280288e875592d2ec6d1acc849a32a2f31cd239db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqe/NPYbu3z3iRdhp3fFWS2X9HGVontZZpp1RvEcdzkEDYPZ+j0KyxbeOk0X3cBwQBJOfvtB9LQzVz2SiChqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:00:05.640692Z","bundle_sha256":"bac2324e96c215d23f7160fa4fbb39a4337de87a4bc54dfeb9a9558afd554ebd"}}