{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FLTOQPYC5GW6OYDBFH24IHPAYY","short_pith_number":"pith:FLTOQPYC","schema_version":"1.0","canonical_sha256":"2ae6e83f02e9ade7606129f5c41de0c617388409b94ccfaaea0eb860c1bf9e90","source":{"kind":"arxiv","id":"1511.05939","version":2},"attestation_state":"computed","paper":{"title":"Metric Learning with Adaptive Density Discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Lubomir Bourdev, Manohar Paluri, Oren Rippel, Piotr Dollar","submitted_at":"2015-11-18T20:41:05Z","abstract_excerpt":"Distance metric learning (DML) approaches learn a transformation to a representation space where distance is in correspondence with a predefined notion of similarity. While such models offer a number of compelling benefits, it has been difficult for these to compete with modern classification algorithms in performance and even in feature extraction.\n  In this work, we propose a novel approach explicitly designed to address a number of subtle yet important issues which have stymied earlier DML algorithms. It maintains an explicit model of the distributions of the different classes in representa"},"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":"1511.05939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-18T20:41:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7556b475edd0cc5f90b3a1d8e490ebcf2d8f3b9ae1aa6dc35ed8ad752c8918ac","abstract_canon_sha256":"f6e901fdaddb77304abb04144250d6d167e9f10117ec23fd6da1585a87b3f40f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:44.031887Z","signature_b64":"/wM/HKb8duWx5it5mOkieFN5tqglsnqdywIKWdInSvuhNTYU+xiCd1o3UuwS08xXy738j1h8RZWjF7BwIfVdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae6e83f02e9ade7606129f5c41de0c617388409b94ccfaaea0eb860c1bf9e90","last_reissued_at":"2026-05-18T01:19:44.031467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:44.031467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Learning with Adaptive Density Discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Lubomir Bourdev, Manohar Paluri, Oren Rippel, Piotr Dollar","submitted_at":"2015-11-18T20:41:05Z","abstract_excerpt":"Distance metric learning (DML) approaches learn a transformation to a representation space where distance is in correspondence with a predefined notion of similarity. While such models offer a number of compelling benefits, it has been difficult for these to compete with modern classification algorithms in performance and even in feature extraction.\n  In this work, we propose a novel approach explicitly designed to address a number of subtle yet important issues which have stymied earlier DML algorithms. It maintains an explicit model of the distributions of the different classes in representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05939","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":"1511.05939","created_at":"2026-05-18T01:19:44.031531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05939v2","created_at":"2026-05-18T01:19:44.031531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05939","created_at":"2026-05-18T01:19:44.031531+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLTOQPYC5GW6","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLTOQPYC5GW6OYDB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLTOQPYC","created_at":"2026-05-18T12:29:19.899920+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/FLTOQPYC5GW6OYDBFH24IHPAYY","json":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY.json","graph_json":"https://pith.science/api/pith-number/FLTOQPYC5GW6OYDBFH24IHPAYY/graph.json","events_json":"https://pith.science/api/pith-number/FLTOQPYC5GW6OYDBFH24IHPAYY/events.json","paper":"https://pith.science/paper/FLTOQPYC"},"agent_actions":{"view_html":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY","download_json":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY.json","view_paper":"https://pith.science/paper/FLTOQPYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05939&json=true","fetch_graph":"https://pith.science/api/pith-number/FLTOQPYC5GW6OYDBFH24IHPAYY/graph.json","fetch_events":"https://pith.science/api/pith-number/FLTOQPYC5GW6OYDBFH24IHPAYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY/action/storage_attestation","attest_author":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY/action/author_attestation","sign_citation":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY/action/citation_signature","submit_replication":"https://pith.science/pith/FLTOQPYC5GW6OYDBFH24IHPAYY/action/replication_record"}},"created_at":"2026-05-18T01:19:44.031531+00:00","updated_at":"2026-05-18T01:19:44.031531+00:00"}