{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BJAAP4G4C4DQ5DU365UUL5GD6K","short_pith_number":"pith:BJAAP4G4","canonical_record":{"source":{"id":"1212.6094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-12-25T22:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"12a0a1a4a6b50632ab345a47f7c63fc952ea06dbdee26e1aa3f99d1e972447d6","abstract_canon_sha256":"dcf9cdb2e5332875cf2df6524afbaa23018e3171f3b327922d032eeb3da6e2cf"},"schema_version":"1.0"},"canonical_sha256":"0a4007f0dc17070e8e9bf76945f4c3f281bf239decfad4e791fbe644e434b44b","source":{"kind":"arxiv","id":"1212.6094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6094","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6094v1","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6094","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"BJAAP4G4C4DQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BJAAP4G4C4DQ5DU3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BJAAP4G4","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BJAAP4G4C4DQ5DU365UUL5GD6K","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-12-25T22:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"12a0a1a4a6b50632ab345a47f7c63fc952ea06dbdee26e1aa3f99d1e972447d6","abstract_canon_sha256":"dcf9cdb2e5332875cf2df6524afbaa23018e3171f3b327922d032eeb3da6e2cf"},"schema_version":"1.0"},"canonical_sha256":"0a4007f0dc17070e8e9bf76945f4c3f281bf239decfad4e791fbe644e434b44b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.789689Z","signature_b64":"L86vEsCBAPdFLcGEXmdqW7/yG/J16b6O+OX85fcjSdUfAy2dZcpmUHeE4RVbrJQuAkPluU/j3knEJTU3lMZmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4007f0dc17070e8e9bf76945f4c3f281bf239decfad4e791fbe644e434b44b","last_reissued_at":"2026-05-18T03:37:42.789027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.789027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6094","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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zATh5SVPeVgTVP6SYLsKNUiMv56YzTL1gPSNoRmmJPtNfudS8SkqwzTplJJhs1Ls31AGoo7vQIIfTw088RbLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:25:56.976226Z"},"content_sha256":"b2660f5a2cf2ac19fa540f64ac34b65decbbf192eb95d33f73199f53286fdad8","schema_version":"1.0","event_id":"sha256:b2660f5a2cf2ac19fa540f64ac34b65decbbf192eb95d33f73199f53286fdad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BJAAP4G4C4DQ5DU365UUL5GD6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Scale Strongly Supervised Ensemble Metric Learning, with Applications to Face Verification and Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chang Huang, Kai Yu, Shenghuo Zhu","submitted_at":"2012-12-25T22:49:31Z","abstract_excerpt":"Learning Mahanalobis distance metrics in a high- dimensional feature space is very difficult especially when structural sparsity and low rank are enforced to improve com- putational efficiency in testing phase. This paper addresses both aspects by an ensemble metric learning approach that consists of sparse block diagonal metric ensembling and join- t metric learning as two consecutive steps. The former step pursues a highly sparse block diagonal metric by selecting effective feature groups while the latter one further exploits correlations between selected feature groups to obtain an accurate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6094","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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5xFJcQHJTJEJ2RWkgKh2PC9YeHUAd7gND11scfr9hYu4+eXgBAEEjuofQjalY0DdAr4/rqVOYYtIU+MyvPpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:25:56.976889Z"},"content_sha256":"7fadff705e9567b84bab6071e462d0fd608927c0ff15fef890f0fe4ef51aad6a","schema_version":"1.0","event_id":"sha256:7fadff705e9567b84bab6071e462d0fd608927c0ff15fef890f0fe4ef51aad6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/bundle.json","state_url":"https://pith.science/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/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-29T16:25:56Z","links":{"resolver":"https://pith.science/pith/BJAAP4G4C4DQ5DU365UUL5GD6K","bundle":"https://pith.science/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/bundle.json","state":"https://pith.science/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJAAP4G4C4DQ5DU365UUL5GD6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BJAAP4G4C4DQ5DU365UUL5GD6K","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":"dcf9cdb2e5332875cf2df6524afbaa23018e3171f3b327922d032eeb3da6e2cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-12-25T22:49:31Z","title_canon_sha256":"12a0a1a4a6b50632ab345a47f7c63fc952ea06dbdee26e1aa3f99d1e972447d6"},"schema_version":"1.0","source":{"id":"1212.6094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6094","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6094v1","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6094","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"BJAAP4G4C4DQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BJAAP4G4C4DQ5DU3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BJAAP4G4","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:7fadff705e9567b84bab6071e462d0fd608927c0ff15fef890f0fe4ef51aad6a","target":"graph","created_at":"2026-05-18T03:37:42Z","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":"Learning Mahanalobis distance metrics in a high- dimensional feature space is very difficult especially when structural sparsity and low rank are enforced to improve com- putational efficiency in testing phase. This paper addresses both aspects by an ensemble metric learning approach that consists of sparse block diagonal metric ensembling and join- t metric learning as two consecutive steps. The former step pursues a highly sparse block diagonal metric by selecting effective feature groups while the latter one further exploits correlations between selected feature groups to obtain an accurate","authors_text":"Chang Huang, Kai Yu, Shenghuo Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-12-25T22:49:31Z","title":"Large Scale Strongly Supervised Ensemble Metric Learning, with Applications to Face Verification and Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6094","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:b2660f5a2cf2ac19fa540f64ac34b65decbbf192eb95d33f73199f53286fdad8","target":"record","created_at":"2026-05-18T03:37:42Z","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":"dcf9cdb2e5332875cf2df6524afbaa23018e3171f3b327922d032eeb3da6e2cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-12-25T22:49:31Z","title_canon_sha256":"12a0a1a4a6b50632ab345a47f7c63fc952ea06dbdee26e1aa3f99d1e972447d6"},"schema_version":"1.0","source":{"id":"1212.6094","kind":"arxiv","version":1}},"canonical_sha256":"0a4007f0dc17070e8e9bf76945f4c3f281bf239decfad4e791fbe644e434b44b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a4007f0dc17070e8e9bf76945f4c3f281bf239decfad4e791fbe644e434b44b","first_computed_at":"2026-05-18T03:37:42.789027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:42.789027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L86vEsCBAPdFLcGEXmdqW7/yG/J16b6O+OX85fcjSdUfAy2dZcpmUHeE4RVbrJQuAkPluU/j3knEJTU3lMZmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:42.789689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2660f5a2cf2ac19fa540f64ac34b65decbbf192eb95d33f73199f53286fdad8","sha256:7fadff705e9567b84bab6071e462d0fd608927c0ff15fef890f0fe4ef51aad6a"],"state_sha256":"cfef42b22d49d9e5f0adbf0c0a63e1b3132f10c0150b1fc688d6c6d7c061208d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0buriOLRwRLwft8edWa2dekefRD3jbs+TPJFd35rKvO8WPY7IGM+sFD8BLEUdJPBp6xHsVB9YrXb/wjTRZpzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:25:56.980750Z","bundle_sha256":"32407e3358e386de6c6d9866c067a28d9dbd2b5c56e28349292b89c8c73c0474"}}