{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MYPAEFGZEMGFWKBSIWTZAA5WP4","short_pith_number":"pith:MYPAEFGZ","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"},"canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","source":{"kind":"arxiv","id":"1602.07194","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07194","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07194v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07194","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"MYPAEFGZEMGF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYPAEFGZEMGFWKBS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYPAEFGZ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MYPAEFGZEMGFWKBSIWTZAA5WP4","target":"record","payload":{"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"},"canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","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"},"source_kind":"arxiv","source_id":"1602.07194","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:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4fHW5DVXDi8DdlRKzch7Z9YGSzZ9UApX/LqwYj8O1HivF/NOEgzHBPD4tuoHuyrJ5fx0tPM7d7M6NoDi8UMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:00:54.545994Z"},"content_sha256":"c42f6305ca01a1a6cbd789d3cd9196fe8bc62acc0b0ba379c351ead3d1364b41","schema_version":"1.0","event_id":"sha256:c42f6305ca01a1a6cbd789d3cd9196fe8bc62acc0b0ba379c351ead3d1364b41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MYPAEFGZEMGFWKBSIWTZAA5WP4","target":"graph","payload":{"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"},"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:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEHVAtDJ1l57Z32gpmrkxA9U7s7qUF/B3NnP263U8QO+7RGVjxHqNWIjCCiCFG+toqC9pYFcgN33nhOr12ydCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:00:54.546723Z"},"content_sha256":"271ba48311c5d3bd938c3755f4bb9df9239cc3f3583779ca27bdc2aaafc39bf6","schema_version":"1.0","event_id":"sha256:271ba48311c5d3bd938c3755f4bb9df9239cc3f3583779ca27bdc2aaafc39bf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/bundle.json","state_url":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/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-25T17:00:54Z","links":{"resolver":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4","bundle":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/bundle.json","state":"https://pith.science/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYPAEFGZEMGFWKBSIWTZAA5WP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MYPAEFGZEMGFWKBSIWTZAA5WP4","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":"9226408c54b4f2a00a7b3e03709a4e63af4caebc8eb6331005c121f339e79c4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-23T15:30:46Z","title_canon_sha256":"36ea96ad2f2ff6b7313cc0ec6506771608dd3c6d872e9cc6307bb249d0447d65"},"schema_version":"1.0","source":{"id":"1602.07194","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07194","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07194v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07194","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"MYPAEFGZEMGF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYPAEFGZEMGFWKBS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYPAEFGZ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:271ba48311c5d3bd938c3755f4bb9df9239cc3f3583779ca27bdc2aaafc39bf6","target":"graph","created_at":"2026-05-18T00:39:47Z","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":"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","authors_text":"Matth\\\"aus Kleindessner, Ulrike von Luxburg","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-23T15:30:46Z","title":"Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07194","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:c42f6305ca01a1a6cbd789d3cd9196fe8bc62acc0b0ba379c351ead3d1364b41","target":"record","created_at":"2026-05-18T00:39:47Z","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":"9226408c54b4f2a00a7b3e03709a4e63af4caebc8eb6331005c121f339e79c4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-23T15:30:46Z","title_canon_sha256":"36ea96ad2f2ff6b7313cc0ec6506771608dd3c6d872e9cc6307bb249d0447d65"},"schema_version":"1.0","source":{"id":"1602.07194","kind":"arxiv","version":2}},"canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"661e0214d9230c5b283245a79003b67f3da99ef349a38a51b1d4a4a08b45adc3","first_computed_at":"2026-05-18T00:39:47.910007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:47.910007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/x6GibYcxCdUi2CIOTQL+nUEx6tq7yic8uLRKNFwKFVR7CN4YXYNwYx3wvoigGJw+hva+Kyhfae80nflzJ+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:47.910673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07194","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c42f6305ca01a1a6cbd789d3cd9196fe8bc62acc0b0ba379c351ead3d1364b41","sha256:271ba48311c5d3bd938c3755f4bb9df9239cc3f3583779ca27bdc2aaafc39bf6"],"state_sha256":"355e8ab0c67e157f6553dca1ec77881386a569f22a9769c094ee6d71301329ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJxmG5HUhEMIQvORSvd4hkY/0yWwy1c2Duwl6Fmi7WTgtuLwtqBPhjCq0xuARyBixIEe3C9V117NJZE9IsV+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:00:54.550667Z","bundle_sha256":"f56aa385a9ddf0e6d9a76bd5b2d28ddbd106a4c04f6017a123270eec1e8865e3"}}