{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CJD6BRIRU6HO7VYVXLQBBRTELM","short_pith_number":"pith:CJD6BRIR","schema_version":"1.0","canonical_sha256":"1247e0c511a78eefd715bae010c6645b289ebb59be9e2166f1d35f0d7117a525","source":{"kind":"arxiv","id":"2002.08473","version":9},"attestation_state":"computed","paper":{"title":"Revisiting Training Strategies and Generalization Performance in Deep Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bj\\\"orn Ommer, Joseph Paul Cohen, Karsten Roth, Prateek Gupta, Samarth Sinha, Timo Milbich","submitted_at":"2020-02-19T22:16:12Z","abstract_excerpt":"Deep Metric Learning (DML) is arguably one of the most influential lines of research for learning visual similarities with many proposed approaches every year. Although the field benefits from the rapid progress, the divergence in training protocols, architectures, and parameter choices make an unbiased comparison difficult. To provide a consistent reference point, we revisit the most widely used DML objective functions and conduct a study of the crucial parameter choices as well as the commonly neglected mini-batch sampling process. Under consistent comparison, DML objectives show much higher"},"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":"2002.08473","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T22:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"564570c5a7b24a534b6133e82bd3b1dd3f4753c6ec649af092aae760c4dc6046","abstract_canon_sha256":"82d0b400694005ff0cccd7b5e4880808ee8bb04d1efc921c24b6d324e2e3a86b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:57.322196Z","signature_b64":"YDW8xIsDfSwjmo88uD/7DSR/JMiQGiWJHe+HjG2ATIEGvravc/uw53CSx2IzXnGRnd6qk2rdWEKQI5XNI29yBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1247e0c511a78eefd715bae010c6645b289ebb59be9e2166f1d35f0d7117a525","last_reissued_at":"2026-07-05T01:23:57.321771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:57.321771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Training Strategies and Generalization Performance in Deep Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bj\\\"orn Ommer, Joseph Paul Cohen, Karsten Roth, Prateek Gupta, Samarth Sinha, Timo Milbich","submitted_at":"2020-02-19T22:16:12Z","abstract_excerpt":"Deep Metric Learning (DML) is arguably one of the most influential lines of research for learning visual similarities with many proposed approaches every year. Although the field benefits from the rapid progress, the divergence in training protocols, architectures, and parameter choices make an unbiased comparison difficult. To provide a consistent reference point, we revisit the most widely used DML objective functions and conduct a study of the crucial parameter choices as well as the commonly neglected mini-batch sampling process. Under consistent comparison, DML objectives show much higher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08473","kind":"arxiv","version":9},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.08473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.08473","created_at":"2026-07-05T01:23:57.321841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.08473v9","created_at":"2026-07-05T01:23:57.321841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08473","created_at":"2026-07-05T01:23:57.321841+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJD6BRIRU6HO","created_at":"2026-07-05T01:23:57.321841+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJD6BRIRU6HO7VYV","created_at":"2026-07-05T01:23:57.321841+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJD6BRIR","created_at":"2026-07-05T01:23:57.321841+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01025","citing_title":"Towards Adversarially Robust Deep Metric Learning","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM","json":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM.json","graph_json":"https://pith.science/api/pith-number/CJD6BRIRU6HO7VYVXLQBBRTELM/graph.json","events_json":"https://pith.science/api/pith-number/CJD6BRIRU6HO7VYVXLQBBRTELM/events.json","paper":"https://pith.science/paper/CJD6BRIR"},"agent_actions":{"view_html":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM","download_json":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM.json","view_paper":"https://pith.science/paper/CJD6BRIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.08473&json=true","fetch_graph":"https://pith.science/api/pith-number/CJD6BRIRU6HO7VYVXLQBBRTELM/graph.json","fetch_events":"https://pith.science/api/pith-number/CJD6BRIRU6HO7VYVXLQBBRTELM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM/action/storage_attestation","attest_author":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM/action/author_attestation","sign_citation":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM/action/citation_signature","submit_replication":"https://pith.science/pith/CJD6BRIRU6HO7VYVXLQBBRTELM/action/replication_record"}},"created_at":"2026-07-05T01:23:57.321841+00:00","updated_at":"2026-07-05T01:23:57.321841+00:00"}