{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DJZVXWESLUB2YGBIMVZHEIZ5S2","short_pith_number":"pith:DJZVXWES","schema_version":"1.0","canonical_sha256":"1a735bd8925d03ac1828657272233d968d9962f0dfcfb72b99330fa6e5722eb1","source":{"kind":"arxiv","id":"2010.02037","version":1},"attestation_state":"computed","paper":{"title":"Conditional Negative Sampling for Contrastive Learning of Visual Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chengxu Zhuang, Daniel Yamins, Mike Wu, Milan Mosse, Noah Goodman","submitted_at":"2020-10-05T14:17:32Z","abstract_excerpt":"Recent methods for learning unsupervised visual representations, dubbed contrastive learning, optimize the noise-contrastive estimation (NCE) bound on mutual information between two views of an image. NCE uses randomly sampled negative examples to normalize the objective. In this paper, we show that choosing difficult negatives, or those more similar to the current instance, can yield stronger representations. To do this, we introduce a family of mutual information estimators that sample negatives conditionally -- in a \"ring\" around each positive. We prove that these estimators lower-bound mut"},"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":"2010.02037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T14:17:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7e6f5a05ee19be187c000969498c339838a6010b7cc7f0e3b3196262340137e4","abstract_canon_sha256":"ca3d52259dd4e2d6b0bd60b9f2c57ef4bb83388c013a802505dc6b67c8510e55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:11.773549Z","signature_b64":"6K+BXtBdSA9P6vFq2f8UlJN+oM7nCxmAZ1pSpyxcM2sVXmrGZaucPuwMNy+5jnHZQyCqJC54RCSazKIQiaHCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a735bd8925d03ac1828657272233d968d9962f0dfcfb72b99330fa6e5722eb1","last_reissued_at":"2026-07-05T01:40:11.773076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:11.773076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Negative Sampling for Contrastive Learning of Visual Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chengxu Zhuang, Daniel Yamins, Mike Wu, Milan Mosse, Noah Goodman","submitted_at":"2020-10-05T14:17:32Z","abstract_excerpt":"Recent methods for learning unsupervised visual representations, dubbed contrastive learning, optimize the noise-contrastive estimation (NCE) bound on mutual information between two views of an image. NCE uses randomly sampled negative examples to normalize the objective. In this paper, we show that choosing difficult negatives, or those more similar to the current instance, can yield stronger representations. To do this, we introduce a family of mutual information estimators that sample negatives conditionally -- in a \"ring\" around each positive. We prove that these estimators lower-bound mut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02037","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.02037/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":"2010.02037","created_at":"2026-07-05T01:40:11.773134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.02037v1","created_at":"2026-07-05T01:40:11.773134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02037","created_at":"2026-07-05T01:40:11.773134+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJZVXWESLUB2","created_at":"2026-07-05T01:40:11.773134+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJZVXWESLUB2YGBI","created_at":"2026-07-05T01:40:11.773134+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJZVXWES","created_at":"2026-07-05T01:40:11.773134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29526","citing_title":"Temporal Motif-aware Graph Test-time Adaptation for OOD Blockchain Anomaly Detection","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11291","citing_title":"Optimal Representations for Generalized Contrastive Learning with Imbalanced Datasets","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2","json":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2.json","graph_json":"https://pith.science/api/pith-number/DJZVXWESLUB2YGBIMVZHEIZ5S2/graph.json","events_json":"https://pith.science/api/pith-number/DJZVXWESLUB2YGBIMVZHEIZ5S2/events.json","paper":"https://pith.science/paper/DJZVXWES"},"agent_actions":{"view_html":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2","download_json":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2.json","view_paper":"https://pith.science/paper/DJZVXWES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.02037&json=true","fetch_graph":"https://pith.science/api/pith-number/DJZVXWESLUB2YGBIMVZHEIZ5S2/graph.json","fetch_events":"https://pith.science/api/pith-number/DJZVXWESLUB2YGBIMVZHEIZ5S2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2/action/storage_attestation","attest_author":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2/action/author_attestation","sign_citation":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2/action/citation_signature","submit_replication":"https://pith.science/pith/DJZVXWESLUB2YGBIMVZHEIZ5S2/action/replication_record"}},"created_at":"2026-07-05T01:40:11.773134+00:00","updated_at":"2026-07-05T01:40:11.773134+00:00"}