{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7KKAH6NHWYCMEJT2LF7QDT66CW","short_pith_number":"pith:7KKAH6NH","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"},"canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","source":{"kind":"arxiv","id":"1612.00086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00086","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00086v2","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00086","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"7KKAH6NHWYCM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KKAH6NHWYCMEJT2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KKAH6NH","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7KKAH6NHWYCMEJT2LF7QDT66CW","target":"record","payload":{"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"},"canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","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"},"source_kind":"arxiv","source_id":"1612.00086","source_version":2,"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-18T00:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RxEocQwTk/99JgFRIIwjGNJ4pE+wTn7Jhs1N54CBaz9dVfWxJjmtFuVUfDSfKh3+2g53hywEVHkF1wMNlU/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:09:22.628940Z"},"content_sha256":"4c1e58632ab9c0b2b6646341baba2a8b8bc12bc031fe979f93833710fffa3a47","schema_version":"1.0","event_id":"sha256:4c1e58632ab9c0b2b6646341baba2a8b8bc12bc031fe979f93833710fffa3a47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7KKAH6NHWYCMEJT2LF7QDT66CW","target":"graph","payload":{"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"},"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-18T00:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdwRqNMPj9gCKbYjxuPt8KXDXlvOVCFmoj0GPs3eLEhDADsfLUXhKWNoXMNrBS4Pix+nHRjANtBsA+HmubqMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:09:22.629595Z"},"content_sha256":"4836fde8d557b4c8985947456c5038f9cddb076c8f459e1e4b0475e0a0120840","schema_version":"1.0","event_id":"sha256:4836fde8d557b4c8985947456c5038f9cddb076c8f459e1e4b0475e0a0120840"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/bundle.json","state_url":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/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-18T20:09:22Z","links":{"resolver":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW","bundle":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/bundle.json","state":"https://pith.science/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KKAH6NHWYCMEJT2LF7QDT66CW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7KKAH6NHWYCMEJT2LF7QDT66CW","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":"ddbbf97b916f083282431450793c9dc719191f4914a3c6c078de9ca611ff053e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-01T00:16:53Z","title_canon_sha256":"658c0d35ad0a5521d962328268bc5f3745b2cec315a4082975f655842efd4c2e"},"schema_version":"1.0","source":{"id":"1612.00086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00086","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00086v2","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00086","created_at":"2026-05-18T00:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"7KKAH6NHWYCM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KKAH6NHWYCMEJT2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KKAH6NH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:4836fde8d557b4c8985947456c5038f9cddb076c8f459e1e4b0475e0a0120840","target":"graph","created_at":"2026-05-18T00:55:54Z","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":"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","authors_text":"Antti Ukkonen, Aristides Gionis, Ehsan Amid","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-01T00:16:53Z","title":"Semi-supervised Kernel Metric Learning Using Relative Comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00086","kind":"arxiv","version":2},"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:4c1e58632ab9c0b2b6646341baba2a8b8bc12bc031fe979f93833710fffa3a47","target":"record","created_at":"2026-05-18T00:55:54Z","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":"ddbbf97b916f083282431450793c9dc719191f4914a3c6c078de9ca611ff053e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-01T00:16:53Z","title_canon_sha256":"658c0d35ad0a5521d962328268bc5f3745b2cec315a4082975f655842efd4c2e"},"schema_version":"1.0","source":{"id":"1612.00086","kind":"arxiv","version":2}},"canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa9403f9a7b604c2267a597f01cfde158ab5cdcc3fe5be156fbe4f8e5274a2d2","first_computed_at":"2026-05-18T00:55:54.044817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:54.044817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsOtfPc1oB3O/yglUP2oDA355lb5wsEf6g+OJ3zWT6BkBcSHFYlVjvpVzU8wvaBCabx2BxV6o9QWYXqg2GymCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:54.045169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c1e58632ab9c0b2b6646341baba2a8b8bc12bc031fe979f93833710fffa3a47","sha256:4836fde8d557b4c8985947456c5038f9cddb076c8f459e1e4b0475e0a0120840"],"state_sha256":"4f2ad3f3a8a225a5999b2cd9f2635908b57360c48596a4545c23903fc563f402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfuimWCh3S30xp9ZIH17i1FIt9D9XQCq6khe4pGLb/7ArVGKCO5cZqDLsPKnUctGytGMEF3LjV5wCKkpliQ/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:09:22.631565Z","bundle_sha256":"6e255a1f7174d54be138fc468c19637150f9251f7c0acf6cc8ef16f190301227"}}