{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PNZCWVEVGG2NN56QNLTAHSZRMS","short_pith_number":"pith:PNZCWVEV","canonical_record":{"source":{"id":"1509.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-15T00:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"a317e6c5a5be274d00a47293ebba320d25056d6b906832d455d5cd5fc27de700","abstract_canon_sha256":"8d3347fe5480689f341794e2f0f762b79064b194c4a0d35685c685b9d4f6a172"},"schema_version":"1.0"},"canonical_sha256":"7b722b549531b4d6f7d06ae603cb3164baf75a4cd0b3d7672546e6c0116609dd","source":{"kind":"arxiv","id":"1509.04355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04355","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04355v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04355","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"PNZCWVEVGG2N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNZCWVEVGG2NN56Q","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNZCWVEV","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PNZCWVEVGG2NN56QNLTAHSZRMS","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-15T00:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"a317e6c5a5be274d00a47293ebba320d25056d6b906832d455d5cd5fc27de700","abstract_canon_sha256":"8d3347fe5480689f341794e2f0f762b79064b194c4a0d35685c685b9d4f6a172"},"schema_version":"1.0"},"canonical_sha256":"7b722b549531b4d6f7d06ae603cb3164baf75a4cd0b3d7672546e6c0116609dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.394008Z","signature_b64":"cjIPjyeos5F8Uqx7IN+HCbDzr6r+dq5O7yC06fJ4yvqTOnje3tOlZTj9hIeRtRUWXYwzZAgZcyNOV7XuEkXuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b722b549531b4d6f7d06ae603cb3164baf75a4cd0b3d7672546e6c0116609dd","last_reissued_at":"2026-05-18T01:33:07.393557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.393557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04355","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-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARg8mVLEHgGKpIZmh7DQu3AC56mAm/HeeSzO2QM+t2k7lXBmfDGNmFmQOjdP1Phl3NqhPwQtJ9kT+plLstClAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:46.755901Z"},"content_sha256":"bfabe579de7e6a690c551bacf434485de4ba31bd040b0b1ac5716c52dd95586e","schema_version":"1.0","event_id":"sha256:bfabe579de7e6a690c551bacf434485de4ba31bd040b0b1ac5716c52dd95586e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PNZCWVEVGG2NN56QNLTAHSZRMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Making High Dimensional Distance Metric Learning Practical","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Qi Qian, Rong Jin, Shenghuo Zhu","submitted_at":"2015-09-15T00:04:24Z","abstract_excerpt":"In this work, we study distance metric learning (DML) for high dimensional data. A typical approach for DML with high dimensional data is to perform the dimensionality reduction first before learning the distance metric. The main shortcoming of this approach is that it may result in a suboptimal solution due to the subspace removed by the dimensionality reduction method. In this work, we present a dual random projection frame for DML with high dimensional data that explicitly addresses the limitation of dimensionality reduction for DML. The key idea is to first project all the data points into"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04355","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-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwhNKmMSeHQBVGQ9L8zkf1Tm0jjtPa26uXxF8uG7dTfK1zDV2iiDoppSVyvQQ8uu4yskZ6xrAcIrkmj7wp3+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:46.756564Z"},"content_sha256":"ad15c393df838cd822b9771f763e7186fa408bcf76539ee21a68e27f04edfcf9","schema_version":"1.0","event_id":"sha256:ad15c393df838cd822b9771f763e7186fa408bcf76539ee21a68e27f04edfcf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/bundle.json","state_url":"https://pith.science/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/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-26T16:37:46Z","links":{"resolver":"https://pith.science/pith/PNZCWVEVGG2NN56QNLTAHSZRMS","bundle":"https://pith.science/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/bundle.json","state":"https://pith.science/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNZCWVEVGG2NN56QNLTAHSZRMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PNZCWVEVGG2NN56QNLTAHSZRMS","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":"8d3347fe5480689f341794e2f0f762b79064b194c4a0d35685c685b9d4f6a172","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-15T00:04:24Z","title_canon_sha256":"a317e6c5a5be274d00a47293ebba320d25056d6b906832d455d5cd5fc27de700"},"schema_version":"1.0","source":{"id":"1509.04355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04355","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04355v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04355","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"PNZCWVEVGG2N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNZCWVEVGG2NN56Q","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNZCWVEV","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:ad15c393df838cd822b9771f763e7186fa408bcf76539ee21a68e27f04edfcf9","target":"graph","created_at":"2026-05-18T01:33:07Z","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 work, we study distance metric learning (DML) for high dimensional data. A typical approach for DML with high dimensional data is to perform the dimensionality reduction first before learning the distance metric. The main shortcoming of this approach is that it may result in a suboptimal solution due to the subspace removed by the dimensionality reduction method. In this work, we present a dual random projection frame for DML with high dimensional data that explicitly addresses the limitation of dimensionality reduction for DML. The key idea is to first project all the data points into","authors_text":"Lijun Zhang, Qi Qian, Rong Jin, Shenghuo Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-15T00:04:24Z","title":"Towards Making High Dimensional Distance Metric Learning Practical"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04355","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:bfabe579de7e6a690c551bacf434485de4ba31bd040b0b1ac5716c52dd95586e","target":"record","created_at":"2026-05-18T01:33:07Z","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":"8d3347fe5480689f341794e2f0f762b79064b194c4a0d35685c685b9d4f6a172","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-15T00:04:24Z","title_canon_sha256":"a317e6c5a5be274d00a47293ebba320d25056d6b906832d455d5cd5fc27de700"},"schema_version":"1.0","source":{"id":"1509.04355","kind":"arxiv","version":1}},"canonical_sha256":"7b722b549531b4d6f7d06ae603cb3164baf75a4cd0b3d7672546e6c0116609dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b722b549531b4d6f7d06ae603cb3164baf75a4cd0b3d7672546e6c0116609dd","first_computed_at":"2026-05-18T01:33:07.393557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.393557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjIPjyeos5F8Uqx7IN+HCbDzr6r+dq5O7yC06fJ4yvqTOnje3tOlZTj9hIeRtRUWXYwzZAgZcyNOV7XuEkXuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.394008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfabe579de7e6a690c551bacf434485de4ba31bd040b0b1ac5716c52dd95586e","sha256:ad15c393df838cd822b9771f763e7186fa408bcf76539ee21a68e27f04edfcf9"],"state_sha256":"f6ad296a7ff3522db54063f75a954ce268155475a1396edc4fb156aa8aba0778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEANw/Lv3pcm3PbBjSQg0Gn8YZ09ZzN5eazZw3tDBOF+wp08yNs/K4xoFne2GHUND4uUWLlNsHG68L4cHyY7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:37:46.760097Z","bundle_sha256":"ddad85b0ef5c6dcbb66b31fe4f3b2d73c2d54ff4af19048f42563dda7c7f6847"}}