{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ROQMLJFYEJ4LUC3IPSQHKUOTZ7","short_pith_number":"pith:ROQMLJFY","canonical_record":{"source":{"id":"1807.06981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-18T14:47:54Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"08103c85a1fc916aa5876aa819f399b31d6b1b6fe9787f24c178ee4ab9a5f9a4","abstract_canon_sha256":"a1e52272ffd32350aee213004588f0815bb2eac12deca16d01319279e091c37b"},"schema_version":"1.0"},"canonical_sha256":"8ba0c5a4b82278ba0b687ca07551d3cff8c78b55ab67e428392d3151bccc737f","source":{"kind":"arxiv","id":"1807.06981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06981","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06981v1","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06981","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"ROQMLJFYEJ4L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROQMLJFYEJ4LUC3I","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROQMLJFY","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ROQMLJFYEJ4LUC3IPSQHKUOTZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-18T14:47:54Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"08103c85a1fc916aa5876aa819f399b31d6b1b6fe9787f24c178ee4ab9a5f9a4","abstract_canon_sha256":"a1e52272ffd32350aee213004588f0815bb2eac12deca16d01319279e091c37b"},"schema_version":"1.0"},"canonical_sha256":"8ba0c5a4b82278ba0b687ca07551d3cff8c78b55ab67e428392d3151bccc737f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.491297Z","signature_b64":"2oJVAZhLBlJxn03EqS/xlukgOPxz097U71iCnhq/0nr0+wAJ2snwXdszLU/Hx8JQ1Bgaa+YucPiqk24Kl+hdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ba0c5a4b82278ba0b687ca07551d3cff8c78b55ab67e428392d3151bccc737f","last_reissued_at":"2026-05-17T23:55:38.490806Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.490806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06981","source_version":1,"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-17T23:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nM5UzoV15YUN8/ieXx2SxksNpjrNkBDqIziG705SW6vKsJQxxaOcMaFtKmG6L5x2NEzbfLEB5uWAMQa+XhGtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:54:40.180749Z"},"content_sha256":"4932ac8dc817fee9b12108dc140ad7dec546f7a7a668a5dd271b1662da307580","schema_version":"1.0","event_id":"sha256:4932ac8dc817fee9b12108dc140ad7dec546f7a7a668a5dd271b1662da307580"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ROQMLJFYEJ4LUC3IPSQHKUOTZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probabilistic Theory of Supervised Similarity Learning for Pointwise ROC Curve Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aur\\'elien Bellet, Robin Vogel, St\\'ephan Cl\\'emen\\c{c}on","submitted_at":"2018-07-18T14:47:54Z","abstract_excerpt":"The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so that observations with the same (resp. different) label are as close (resp. far) as possible. In this paper, similarity learning is investigated from the perspective of pairwise bipartite ranking, where the goal is to rank the elements of a database by decreasing order of the probability that they share the same label with some query data point, based on the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06981","kind":"arxiv","version":1},"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-17T23:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0+bNS0qq2ea7KizyfhNRDBfGQbE3dE5lCf8CFP7XdSdynPhdUt4OHz9xaJ6ExZNGK4hK18hZmKZr5jbX5kaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:54:40.181103Z"},"content_sha256":"45ddfa13c170cae77a6bcf127e758c13a36292e21bdfbb8c06f70666e1592d67","schema_version":"1.0","event_id":"sha256:45ddfa13c170cae77a6bcf127e758c13a36292e21bdfbb8c06f70666e1592d67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/bundle.json","state_url":"https://pith.science/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/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-06-01T04:54:40Z","links":{"resolver":"https://pith.science/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7","bundle":"https://pith.science/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/bundle.json","state":"https://pith.science/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROQMLJFYEJ4LUC3IPSQHKUOTZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ROQMLJFYEJ4LUC3IPSQHKUOTZ7","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":"a1e52272ffd32350aee213004588f0815bb2eac12deca16d01319279e091c37b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-18T14:47:54Z","title_canon_sha256":"08103c85a1fc916aa5876aa819f399b31d6b1b6fe9787f24c178ee4ab9a5f9a4"},"schema_version":"1.0","source":{"id":"1807.06981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06981","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06981v1","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06981","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"ROQMLJFYEJ4L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROQMLJFYEJ4LUC3I","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROQMLJFY","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:45ddfa13c170cae77a6bcf127e758c13a36292e21bdfbb8c06f70666e1592d67","target":"graph","created_at":"2026-05-17T23:55:38Z","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":"The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so that observations with the same (resp. different) label are as close (resp. far) as possible. In this paper, similarity learning is investigated from the perspective of pairwise bipartite ranking, where the goal is to rank the elements of a database by decreasing order of the probability that they share the same label with some query data point, based on the s","authors_text":"Aur\\'elien Bellet, Robin Vogel, St\\'ephan Cl\\'emen\\c{c}on","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-18T14:47:54Z","title":"A Probabilistic Theory of Supervised Similarity Learning for Pointwise ROC Curve Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06981","kind":"arxiv","version":1},"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:4932ac8dc817fee9b12108dc140ad7dec546f7a7a668a5dd271b1662da307580","target":"record","created_at":"2026-05-17T23:55:38Z","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":"a1e52272ffd32350aee213004588f0815bb2eac12deca16d01319279e091c37b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-18T14:47:54Z","title_canon_sha256":"08103c85a1fc916aa5876aa819f399b31d6b1b6fe9787f24c178ee4ab9a5f9a4"},"schema_version":"1.0","source":{"id":"1807.06981","kind":"arxiv","version":1}},"canonical_sha256":"8ba0c5a4b82278ba0b687ca07551d3cff8c78b55ab67e428392d3151bccc737f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ba0c5a4b82278ba0b687ca07551d3cff8c78b55ab67e428392d3151bccc737f","first_computed_at":"2026-05-17T23:55:38.490806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:38.490806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2oJVAZhLBlJxn03EqS/xlukgOPxz097U71iCnhq/0nr0+wAJ2snwXdszLU/Hx8JQ1Bgaa+YucPiqk24Kl+hdCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:38.491297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4932ac8dc817fee9b12108dc140ad7dec546f7a7a668a5dd271b1662da307580","sha256:45ddfa13c170cae77a6bcf127e758c13a36292e21bdfbb8c06f70666e1592d67"],"state_sha256":"aee09bbd955b49180812f6c49c2bf28806a226dae1ae1df067d1740119dce429"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7iSNZ4bBlf4AWuXYkZNp0oTWgtmaesSBeR8GiKPicFc8MtkgGbWmsGeyr+0hcHTwk3pf8Pr+0PkwzczAo6nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:54:40.183239Z","bundle_sha256":"4300e9617b2b206ae8e253bd9b081ed5b297da0dfcfeae9320d027737d944f81"}}