{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZDAFSLOTFCYZS4FI2DSDNLMFEJ","short_pith_number":"pith:ZDAFSLOT","schema_version":"1.0","canonical_sha256":"c8c0592dd328b19970a8d0e436ad85225dc8e41041a8629cb4c14fe1b67e1db0","source":{"kind":"arxiv","id":"1906.05990","version":1},"attestation_state":"computed","paper":{"title":"Divide and Conquer the Embedding Space for Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Artsiom Sanakoyeu, Bj\\\"orn Ommer, Uta B\\\"uchler, Vadim Tschernezki","submitted_at":"2019-06-14T02:43:01Z","abstract_excerpt":"Learning the embedding space, where semantically similar objects are located close together and dissimilar objects far apart, is a cornerstone of many computer vision applications. Existing approaches usually learn a single metric in the embedding space for all available data points, which may have a very complex non-uniform distribution with different notions of similarity between objects, e.g. appearance, shape, color or semantic meaning. Approaches for learning a single distance metric often struggle to encode all different types of relationships and do not generalize well. In this work, we"},"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":"1906.05990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-14T02:43:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"91b63ae9c80add763e359020f35fb3b65930ac00a185dca08afaee1a2ec7607a","abstract_canon_sha256":"845fa925534694270fcb2ac6861f75a1a2eab7ae67d4b96abb58172d9ebcf850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:20.089659Z","signature_b64":"jCqPA+4lzRG9sL5njlEIhD3fzO5rAWQyV3dSwg0mP+0NZC2/t/+I+neFzX0KSN7tBgUuE7jl4L0hZ/nxa0tfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8c0592dd328b19970a8d0e436ad85225dc8e41041a8629cb4c14fe1b67e1db0","last_reissued_at":"2026-05-17T23:43:20.089068Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:20.089068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide and Conquer the Embedding Space for Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Artsiom Sanakoyeu, Bj\\\"orn Ommer, Uta B\\\"uchler, Vadim Tschernezki","submitted_at":"2019-06-14T02:43:01Z","abstract_excerpt":"Learning the embedding space, where semantically similar objects are located close together and dissimilar objects far apart, is a cornerstone of many computer vision applications. Existing approaches usually learn a single metric in the embedding space for all available data points, which may have a very complex non-uniform distribution with different notions of similarity between objects, e.g. appearance, shape, color or semantic meaning. Approaches for learning a single distance metric often struggle to encode all different types of relationships and do not generalize well. In this work, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05990","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.05990","created_at":"2026-05-17T23:43:20.089163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05990v1","created_at":"2026-05-17T23:43:20.089163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05990","created_at":"2026-05-17T23:43:20.089163+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDAFSLOTFCYZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDAFSLOTFCYZS4FI","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDAFSLOT","created_at":"2026-05-18T12:33:33.725879+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/ZDAFSLOTFCYZS4FI2DSDNLMFEJ","json":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ.json","graph_json":"https://pith.science/api/pith-number/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/graph.json","events_json":"https://pith.science/api/pith-number/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/events.json","paper":"https://pith.science/paper/ZDAFSLOT"},"agent_actions":{"view_html":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ","download_json":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ.json","view_paper":"https://pith.science/paper/ZDAFSLOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05990&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZDAFSLOTFCYZS4FI2DSDNLMFEJ/action/replication_record"}},"created_at":"2026-05-17T23:43:20.089163+00:00","updated_at":"2026-05-17T23:43:20.089163+00:00"}