{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7KKAH6NHWYCMEJT2LF7QDT66CW","short_pith_number":"pith:7KKAH6NH","schema_version":"1.0","canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","source":{"kind":"arxiv","id":"1612.00086","version":2},"attestation_state":"computed","paper":{"title":"Semi-supervised Kernel Metric Learning Using Relative Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Antti Ukkonen, Aristides Gionis, Ehsan Amid","submitted_at":"2016-12-01T00:16:53Z","abstract_excerpt":"We consider the problem of metric learning subject to a set of constraints on relative-distance comparisons between the data items. Such constraints are meant to reflect side-information that is not expressed directly in the feature vectors of the data items. The relative-distance constraints used in this work are particularly effective in expressing structures at finer level of detail than must-link (ML) and cannot-link (CL) constraints, which are most commonly used for semi-supervised clustering. Relative-distance constraints are thus useful in settings where providing an ML or a CL constrai"},"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.00086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-01T00:16:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"658c0d35ad0a5521d962328268bc5f3745b2cec315a4082975f655842efd4c2e","abstract_canon_sha256":"ddbbf97b916f083282431450793c9dc719191f4914a3c6c078de9ca611ff053e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:54.045169Z","signature_b64":"RsOtfPc1oB3O/yglUP2oDA355lb5wsEf6g+OJ3zWT6BkBcSHFYlVjvpVzU8wvaBCabx2BxV6o9QWYXqg2GymCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","last_reissued_at":"2026-05-18T00:55:54.044817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:54.044817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Kernel Metric Learning Using Relative Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Antti Ukkonen, Aristides Gionis, Ehsan Amid","submitted_at":"2016-12-01T00:16:53Z","abstract_excerpt":"We consider the problem of metric learning subject to a set of constraints on relative-distance comparisons between the data items. Such constraints are meant to reflect side-information that is not expressed directly in the feature vectors of the data items. The relative-distance constraints used in this work are particularly effective in expressing structures at finer level of detail than must-link (ML) and cannot-link (CL) constraints, which are most commonly used for semi-supervised clustering. Relative-distance constraints are thus useful in settings where providing an ML or a CL constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00086","kind":"arxiv","version":2},"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.00086","created_at":"2026-05-18T00:55:54.044873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00086v2","created_at":"2026-05-18T00:55:54.044873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00086","created_at":"2026-05-18T00:55:54.044873+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KKAH6NHWYCM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KKAH6NHWYCMEJT2","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KKAH6NH","created_at":"2026-05-18T12:30:04.600751+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/7KKAH6NHWYCMEJT2LF7QDT66CW","json":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW.json","graph_json":"https://pith.science/api/pith-number/7KKAH6NHWYCMEJT2LF7QDT66CW/graph.json","events_json":"https://pith.science/api/pith-number/7KKAH6NHWYCMEJT2LF7QDT66CW/events.json","paper":"https://pith.science/paper/7KKAH6NH"},"agent_actions":{"view_html":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW","download_json":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW.json","view_paper":"https://pith.science/paper/7KKAH6NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00086&json=true","fetch_graph":"https://pith.science/api/pith-number/7KKAH6NHWYCMEJT2LF7QDT66CW/graph.json","fetch_events":"https://pith.science/api/pith-number/7KKAH6NHWYCMEJT2LF7QDT66CW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/action/storage_attestation","attest_author":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/action/author_attestation","sign_citation":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/action/citation_signature","submit_replication":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/action/replication_record"}},"created_at":"2026-05-18T00:55:54.044873+00:00","updated_at":"2026-05-18T00:55:54.044873+00:00"}