{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4CKBHQMN6TBF5YFGGKBOMWYBJR","short_pith_number":"pith:4CKBHQMN","schema_version":"1.0","canonical_sha256":"e09413c18df4c25ee0a63282e65b014c79f5307570e60f6b116e248e4bc8d0b7","source":{"kind":"arxiv","id":"2302.07920","version":1},"attestation_state":"computed","paper":{"title":"InfoNCE Loss Provably Learns Cluster-Preserving Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Advait Parulekar, Aryan Mokhtari, Karthikeyan Shanmugam, Liam Collins, Sanjay Shakkottai","submitted_at":"2023-02-15T19:45:35Z","abstract_excerpt":"The goal of contrasting learning is to learn a representation that preserves underlying clusters by keeping samples with similar content, e.g. the ``dogness'' of a dog, close to each other in the space generated by the representation. A common and successful approach for tackling this unsupervised learning problem is minimizing the InfoNCE loss associated with the training samples, where each sample is associated with their augmentations (positive samples such as rotation, crop) and a batch of negative samples (unrelated samples). To the best of our knowledge, it was unanswered if the represen"},"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":"2302.07920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-15T19:45:35Z","cross_cats_sorted":[],"title_canon_sha256":"fead76abcf3e33ec2a28b666f62250e4ed2b08ffe286c37430c12fcb6d26e8ff","abstract_canon_sha256":"57aab3afffe8d5997dab0ae2a2ceee28b270a41cd752566c269ab0690d088cfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:42:31.907747Z","signature_b64":"TICrtnH2+8hqdtiH6tfdE2nMag2M5MTAAQD1ca5ObDHgS+VcGYD2XTzUTD0hK8Xga2QY4vHBtMcitO/VoHoeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09413c18df4c25ee0a63282e65b014c79f5307570e60f6b116e248e4bc8d0b7","last_reissued_at":"2026-07-05T05:42:31.907262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:42:31.907262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"InfoNCE Loss Provably Learns Cluster-Preserving Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Advait Parulekar, Aryan Mokhtari, Karthikeyan Shanmugam, Liam Collins, Sanjay Shakkottai","submitted_at":"2023-02-15T19:45:35Z","abstract_excerpt":"The goal of contrasting learning is to learn a representation that preserves underlying clusters by keeping samples with similar content, e.g. the ``dogness'' of a dog, close to each other in the space generated by the representation. A common and successful approach for tackling this unsupervised learning problem is minimizing the InfoNCE loss associated with the training samples, where each sample is associated with their augmentations (positive samples such as rotation, crop) and a batch of negative samples (unrelated samples). To the best of our knowledge, it was unanswered if the represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07920","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/2302.07920/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":"2302.07920","created_at":"2026-07-05T05:42:31.907322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07920v1","created_at":"2026-07-05T05:42:31.907322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07920","created_at":"2026-07-05T05:42:31.907322+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CKBHQMN6TBF","created_at":"2026-07-05T05:42:31.907322+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CKBHQMN6TBF5YFG","created_at":"2026-07-05T05:42:31.907322+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CKBHQMN","created_at":"2026-07-05T05:42:31.907322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21590","citing_title":"Radial Basis Function Networks as Projection Heads in Self-Supervised Learning","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11291","citing_title":"Optimal Representations for Generalized Contrastive Learning with Imbalanced Datasets","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR","json":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR.json","graph_json":"https://pith.science/api/pith-number/4CKBHQMN6TBF5YFGGKBOMWYBJR/graph.json","events_json":"https://pith.science/api/pith-number/4CKBHQMN6TBF5YFGGKBOMWYBJR/events.json","paper":"https://pith.science/paper/4CKBHQMN"},"agent_actions":{"view_html":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR","download_json":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR.json","view_paper":"https://pith.science/paper/4CKBHQMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07920&json=true","fetch_graph":"https://pith.science/api/pith-number/4CKBHQMN6TBF5YFGGKBOMWYBJR/graph.json","fetch_events":"https://pith.science/api/pith-number/4CKBHQMN6TBF5YFGGKBOMWYBJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR/action/storage_attestation","attest_author":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR/action/author_attestation","sign_citation":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR/action/citation_signature","submit_replication":"https://pith.science/pith/4CKBHQMN6TBF5YFGGKBOMWYBJR/action/replication_record"}},"created_at":"2026-07-05T05:42:31.907322+00:00","updated_at":"2026-07-05T05:42:31.907322+00:00"}