{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HOJUTVSHHGRGMXAS2P23RAI5T6","short_pith_number":"pith:HOJUTVSH","schema_version":"1.0","canonical_sha256":"3b9349d64739a2665c12d3f5b8811d9f9470a170d31ef15ac4a6cc6c4628a924","source":{"kind":"arxiv","id":"1302.3219","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3219","created_at":"2026-05-18T03:33:39.489137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3219v1","created_at":"2026-05-18T03:33:39.489137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3219","created_at":"2026-05-18T03:33:39.489137+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOJUTVSHHGRG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOJUTVSHHGRGMXAS","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOJUTVSH","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6","json":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6.json","graph_json":"https://pith.science/api/pith-number/HOJUTVSHHGRGMXAS2P23RAI5T6/graph.json","events_json":"https://pith.science/api/pith-number/HOJUTVSHHGRGMXAS2P23RAI5T6/events.json","paper":"https://pith.science/paper/HOJUTVSH"},"agent_actions":{"view_html":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6","download_json":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6.json","view_paper":"https://pith.science/paper/HOJUTVSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3219&json=true","fetch_graph":"https://pith.science/api/pith-number/HOJUTVSHHGRGMXAS2P23RAI5T6/graph.json","fetch_events":"https://pith.science/api/pith-number/HOJUTVSHHGRGMXAS2P23RAI5T6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/action/storage_attestation","attest_author":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/action/author_attestation","sign_citation":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/action/citation_signature","submit_replication":"https://pith.science/pith/HOJUTVSHHGRGMXAS2P23RAI5T6/action/replication_record"}},"created_at":"2026-05-18T03:33:39.489137+00:00","updated_at":"2026-05-18T03:33:39.489137+00:00"}