{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MYPAEFGZEMGFWKBSIWTZAA5WP4","short_pith_number":"pith:MYPAEFGZ","schema_version":"1.0","canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","source":{"kind":"arxiv","id":"1602.07194","version":2},"attestation_state":"computed","paper":{"title":"Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis","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-02-23T15:30:46Z","abstract_excerpt":"In recent years it has become popular to study machine learning problems in a setting of ordinal distance information rather than numerical distance measurements. By ordinal distance information we refer to binary answers to distance comparisons such as $d(A,B)<d(C,D)$. For many problems in machine learning and statistics it is unclear how to solve them in such a scenario. Up to now, the main approach is to explicitly construct an ordinal embedding of the data points in the Euclidean space, an approach that has a number of drawbacks. In this paper, we propose algorithms for the problems of med"},"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":"1602.07194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-23T15:30:46Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"36ea96ad2f2ff6b7313cc0ec6506771608dd3c6d872e9cc6307bb249d0447d65","abstract_canon_sha256":"9226408c54b4f2a00a7b3e03709a4e63af4caebc8eb6331005c121f339e79c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:47.910673Z","signature_b64":"Y/x6GibYcxCdUi2CIOTQL+nUEx6tq7yic8uLRKNFwKFVR7CN4YXYNwYx3wvoigGJw+hva+Kyhfae80nflzJ+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","last_reissued_at":"2026-05-18T00:39:47.910007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:47.910007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis","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-02-23T15:30:46Z","abstract_excerpt":"In recent years it has become popular to study machine learning problems in a setting of ordinal distance information rather than numerical distance measurements. By ordinal distance information we refer to binary answers to distance comparisons such as $d(A,B)<d(C,D)$. For many problems in machine learning and statistics it is unclear how to solve them in such a scenario. Up to now, the main approach is to explicitly construct an ordinal embedding of the data points in the Euclidean space, an approach that has a number of drawbacks. In this paper, we propose algorithms for the problems of med"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07194","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":"1602.07194","created_at":"2026-05-18T00:39:47.910102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07194v2","created_at":"2026-05-18T00:39:47.910102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07194","created_at":"2026-05-18T00:39:47.910102+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYPAEFGZEMGF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYPAEFGZEMGFWKBS","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYPAEFGZ","created_at":"2026-05-18T12:30:32.724797+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/MYPAEFGZEMGFWKBSIWTZAA5WP4","json":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4.json","graph_json":"https://pith.science/api/pith-number/MYPAEFGZEMGFWKBSIWTZAA5WP4/graph.json","events_json":"https://pith.science/api/pith-number/MYPAEFGZEMGFWKBSIWTZAA5WP4/events.json","paper":"https://pith.science/paper/MYPAEFGZ"},"agent_actions":{"view_html":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4","download_json":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4.json","view_paper":"https://pith.science/paper/MYPAEFGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07194&json=true","fetch_graph":"https://pith.science/api/pith-number/MYPAEFGZEMGFWKBSIWTZAA5WP4/graph.json","fetch_events":"https://pith.science/api/pith-number/MYPAEFGZEMGFWKBSIWTZAA5WP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/action/storage_attestation","attest_author":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/action/author_attestation","sign_citation":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/action/citation_signature","submit_replication":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/action/replication_record"}},"created_at":"2026-05-18T00:39:47.910102+00:00","updated_at":"2026-05-18T00:39:47.910102+00:00"}