{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UI3PYMZSC7ZRENVXZFUEPO2GTK","short_pith_number":"pith:UI3PYMZS","schema_version":"1.0","canonical_sha256":"a236fc333217f31236b7c96847bb469ab498184b8fab3804660c60c20f896d10","source":{"kind":"arxiv","id":"1607.08456","version":2},"attestation_state":"computed","paper":{"title":"Kernel functions based on triplet comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Matth\\\"aus Kleindessner, Ulrike von Luxburg","submitted_at":"2016-07-28T13:46:06Z","abstract_excerpt":"Given only information in the form of similarity triplets \"Object A is more similar to object B than to object C\" about a data set, we propose two ways of defining a kernel function on the data set. While previous approaches construct a low-dimensional Euclidean embedding of the data set that reflects the given similarity triplets, we aim at defining kernel functions that correspond to high-dimensional embeddings. These kernel functions can subsequently be used to apply any kernel method to the data set."},"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":"1607.08456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-28T13:46:06Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e9fb2c0a326a7eb1845c47ffddcabd19ff639e7a2065f7cbfd9b68be8ec47534","abstract_canon_sha256":"9ec1ea51bcad1db2e6c8aae5fba039331518379b73c360c4cf50f50bcc4e5016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.987744Z","signature_b64":"/3sfMuxkcNzVk72Oxfe2O0XE2TubgZvU66uIGnhzRGj706UePd0MQ34s1YDriacNUc71HjtDBYKZgpGXVIoWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a236fc333217f31236b7c96847bb469ab498184b8fab3804660c60c20f896d10","last_reissued_at":"2026-05-18T00:31:51.987153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.987153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernel functions based on triplet comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Matth\\\"aus Kleindessner, Ulrike von Luxburg","submitted_at":"2016-07-28T13:46:06Z","abstract_excerpt":"Given only information in the form of similarity triplets \"Object A is more similar to object B than to object C\" about a data set, we propose two ways of defining a kernel function on the data set. While previous approaches construct a low-dimensional Euclidean embedding of the data set that reflects the given similarity triplets, we aim at defining kernel functions that correspond to high-dimensional embeddings. These kernel functions can subsequently be used to apply any kernel method to the data set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08456","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":"1607.08456","created_at":"2026-05-18T00:31:51.987231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08456v2","created_at":"2026-05-18T00:31:51.987231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08456","created_at":"2026-05-18T00:31:51.987231+00:00"},{"alias_kind":"pith_short_12","alias_value":"UI3PYMZSC7ZR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UI3PYMZSC7ZRENVX","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UI3PYMZS","created_at":"2026-05-18T12:30:46.583412+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/UI3PYMZSC7ZRENVXZFUEPO2GTK","json":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK.json","graph_json":"https://pith.science/api/pith-number/UI3PYMZSC7ZRENVXZFUEPO2GTK/graph.json","events_json":"https://pith.science/api/pith-number/UI3PYMZSC7ZRENVXZFUEPO2GTK/events.json","paper":"https://pith.science/paper/UI3PYMZS"},"agent_actions":{"view_html":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK","download_json":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK.json","view_paper":"https://pith.science/paper/UI3PYMZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08456&json=true","fetch_graph":"https://pith.science/api/pith-number/UI3PYMZSC7ZRENVXZFUEPO2GTK/graph.json","fetch_events":"https://pith.science/api/pith-number/UI3PYMZSC7ZRENVXZFUEPO2GTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK/action/storage_attestation","attest_author":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK/action/author_attestation","sign_citation":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK/action/citation_signature","submit_replication":"https://pith.science/pith/UI3PYMZSC7ZRENVXZFUEPO2GTK/action/replication_record"}},"created_at":"2026-05-18T00:31:51.987231+00:00","updated_at":"2026-05-18T00:31:51.987231+00:00"}