{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HOJUTVSHHGRGMXAS2P23RAI5T6","short_pith_number":"pith:HOJUTVSH","canonical_record":{"source":{"id":"1302.3219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T08:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"9ae8884b0f0f926291c133f31df7a759e8a2ec74bc635e61020a22fb76f60449","abstract_canon_sha256":"c53b3b5fb80c25fa9bd23ffcf4a685f00d1e8506eafe35379accbd380f4fb33a"},"schema_version":"1.0"},"canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","source":{"kind":"arxiv","id":"1302.3219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3219","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3219v1","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3219","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"HOJUTVSHHGRG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOJUTVSHHGRGMXAS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOJUTVSH","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HOJUTVSHHGRGMXAS2P23RAI5T6","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T08:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"9ae8884b0f0f926291c133f31df7a759e8a2ec74bc635e61020a22fb76f60449","abstract_canon_sha256":"c53b3b5fb80c25fa9bd23ffcf4a685f00d1e8506eafe35379accbd380f4fb33a"},"schema_version":"1.0"},"canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:39.489658Z","signature_b64":"KViWbMz0/hPz7VepFvmhUANqKQTZpQjtPPc8Itn4wrZolzSM/n7l0VSQ4cELIcLsaEGLh0XI9jhBc1pmMvaOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","last_reissued_at":"2026-05-18T03:33:39.489061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:39.489061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3219","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:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8C/e15zzqqg5VkuiTHkZyoRFFrRYvhFaCNT174bE19rH3SCGkrM0nNBcwkjq6EE/N3Vj6oXV824NyPMlyf9PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:11:27.849279Z"},"content_sha256":"3cc16e77b38d2be01d518ef2476d923e4d56156192eee0c0a849307f6aed7dc0","schema_version":"1.0","event_id":"sha256:3cc16e77b38d2be01d518ef2476d923e4d56156192eee0c0a849307f6aed7dc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HOJUTVSHHGRGMXAS2P23RAI5T6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Dual Approach to Distance Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Fayao Liu, Junae Kim, Lei Wang","submitted_at":"2013-02-13T08:48:53Z","abstract_excerpt":"Distance metric learning is of fundamental interest in machine learning   because the distance metric employed can significantly affect the   performance of many learning methods. Quadratic Mahalanobis metric learning is a popular approach to the problem, but typically requires solving a semidefinite programming (SDP) problem, which is computationally expensive. Standard interior-point SDP solvers typically have a complexity of $O(D^{6.5})$ (with $D$ the dimension of input data), and can thus only practically solve problems exhibiting less than a few thousand  variables. Since the number of va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3219","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:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faoW8NvG0USVJXFwdixMYzK9ZRgX9COYEHg3+lgxsJXhj4Ao4fhvALYWhGHGC/ovXpqjqvpagH3MBHEHsgMLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:11:27.849958Z"},"content_sha256":"c24fb70be949dae25948ec590bcbb1cbc33957988f50463248e9358a5002955c","schema_version":"1.0","event_id":"sha256:c24fb70be949dae25948ec590bcbb1cbc33957988f50463248e9358a5002955c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/bundle.json","state_url":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/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-31T05:11:27Z","links":{"resolver":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6","bundle":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/bundle.json","state":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HOJUTVSHHGRGMXAS2P23RAI5T6","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":"c53b3b5fb80c25fa9bd23ffcf4a685f00d1e8506eafe35379accbd380f4fb33a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T08:48:53Z","title_canon_sha256":"9ae8884b0f0f926291c133f31df7a759e8a2ec74bc635e61020a22fb76f60449"},"schema_version":"1.0","source":{"id":"1302.3219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3219","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3219v1","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3219","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"HOJUTVSHHGRG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOJUTVSHHGRGMXAS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOJUTVSH","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:c24fb70be949dae25948ec590bcbb1cbc33957988f50463248e9358a5002955c","target":"graph","created_at":"2026-05-18T03:33:39Z","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":"Distance metric learning is of fundamental interest in machine learning   because the distance metric employed can significantly affect the   performance of many learning methods. Quadratic Mahalanobis metric learning is a popular approach to the problem, but typically requires solving a semidefinite programming (SDP) problem, which is computationally expensive. Standard interior-point SDP solvers typically have a complexity of $O(D^{6.5})$ (with $D$ the dimension of input data), and can thus only practically solve problems exhibiting less than a few thousand  variables. Since the number of va","authors_text":"Anton van den Hengel, Chunhua Shen, Fayao Liu, Junae Kim, Lei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T08:48:53Z","title":"An Efficient Dual Approach to Distance Metric Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3219","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:3cc16e77b38d2be01d518ef2476d923e4d56156192eee0c0a849307f6aed7dc0","target":"record","created_at":"2026-05-18T03:33:39Z","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":"c53b3b5fb80c25fa9bd23ffcf4a685f00d1e8506eafe35379accbd380f4fb33a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T08:48:53Z","title_canon_sha256":"9ae8884b0f0f926291c133f31df7a759e8a2ec74bc635e61020a22fb76f60449"},"schema_version":"1.0","source":{"id":"1302.3219","kind":"arxiv","version":1}},"canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","first_computed_at":"2026-05-18T03:33:39.489061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:39.489061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KViWbMz0/hPz7VepFvmhUANqKQTZpQjtPPc8Itn4wrZolzSM/n7l0VSQ4cELIcLsaEGLh0XI9jhBc1pmMvaOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:39.489658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cc16e77b38d2be01d518ef2476d923e4d56156192eee0c0a849307f6aed7dc0","sha256:c24fb70be949dae25948ec590bcbb1cbc33957988f50463248e9358a5002955c"],"state_sha256":"c367e356e43fcefaa644424da97755d5b20d283ba0c8b2f348a4bf7de2496d9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaQ0f50XTDSgHFN1ar+acHqRpChV8TNL2vlQSQNUXeiNBx3mgK+jadx2fj/RZVL7KiPC3wnZHNWKf1k6qkCLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:11:27.852765Z","bundle_sha256":"ece5da54fe52c7ecaece77140ea8c5500755ff79977fc25293c5e615115a1aef"}}