{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DJDNNMWLPLOXPRTH4JYS7ECGA6","short_pith_number":"pith:DJDNNMWL","schema_version":"1.0","canonical_sha256":"1a46d6b2cb7add77c667e2712f90460784bb09fd68c2f30d031ed380322ee1b3","source":{"kind":"arxiv","id":"1612.04853","version":1},"attestation_state":"computed","paper":{"title":"Constraint Selection in Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hoel Le Capitaine","submitted_at":"2016-12-14T21:45:14Z","abstract_excerpt":"A number of machine learning algorithms are using a metric, or a distance, in order to compare individuals. The Euclidean distance is usually employed, but it may be more efficient to learn a parametric distance such as Mahalanobis metric. Learning such a metric is a hot topic since more than ten years now, and a number of methods have been proposed to efficiently learn it. However, the nature of the problem makes it quite difficult for large scale data, as well as data for which classes overlap. This paper presents a simple way of improving accuracy and scalability of any iterative metric lea"},"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":"1612.04853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-14T21:45:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4a6fb3ef4674c36cfb0bfa6769cad3f722554b0ff91cf64b5f84d6fc0856d877","abstract_canon_sha256":"6855c5310306218d5c3bcd2e95c867eb569f6ae6971ce6f5ddface21a2ed8099"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.566562Z","signature_b64":"9DwNfuYWjpz8zJxN2eEaNDofrGW7CRTy/lfsGvWyNrp0iNOc6ykt1gEb6MiEWe05oR7+48iTiNSM6oi0z9pFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a46d6b2cb7add77c667e2712f90460784bb09fd68c2f30d031ed380322ee1b3","last_reissued_at":"2026-05-18T00:54:57.565824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.565824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint Selection in Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hoel Le Capitaine","submitted_at":"2016-12-14T21:45:14Z","abstract_excerpt":"A number of machine learning algorithms are using a metric, or a distance, in order to compare individuals. The Euclidean distance is usually employed, but it may be more efficient to learn a parametric distance such as Mahalanobis metric. Learning such a metric is a hot topic since more than ten years now, and a number of methods have been proposed to efficiently learn it. However, the nature of the problem makes it quite difficult for large scale data, as well as data for which classes overlap. This paper presents a simple way of improving accuracy and scalability of any iterative metric lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04853","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":"1612.04853","created_at":"2026-05-18T00:54:57.565940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04853v1","created_at":"2026-05-18T00:54:57.565940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04853","created_at":"2026-05-18T00:54:57.565940+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJDNNMWLPLOX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJDNNMWLPLOXPRTH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJDNNMWL","created_at":"2026-05-18T12:30:12.583610+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/DJDNNMWLPLOXPRTH4JYS7ECGA6","json":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6.json","graph_json":"https://pith.science/api/pith-number/DJDNNMWLPLOXPRTH4JYS7ECGA6/graph.json","events_json":"https://pith.science/api/pith-number/DJDNNMWLPLOXPRTH4JYS7ECGA6/events.json","paper":"https://pith.science/paper/DJDNNMWL"},"agent_actions":{"view_html":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6","download_json":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6.json","view_paper":"https://pith.science/paper/DJDNNMWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04853&json=true","fetch_graph":"https://pith.science/api/pith-number/DJDNNMWLPLOXPRTH4JYS7ECGA6/graph.json","fetch_events":"https://pith.science/api/pith-number/DJDNNMWLPLOXPRTH4JYS7ECGA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6/action/storage_attestation","attest_author":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6/action/author_attestation","sign_citation":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6/action/citation_signature","submit_replication":"https://pith.science/pith/DJDNNMWLPLOXPRTH4JYS7ECGA6/action/replication_record"}},"created_at":"2026-05-18T00:54:57.565940+00:00","updated_at":"2026-05-18T00:54:57.565940+00:00"}