{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4KXYZZYOAL6CTQOAHW6BLN3YHB","short_pith_number":"pith:4KXYZZYO","schema_version":"1.0","canonical_sha256":"e2af8ce70e02fc29c1c03dbc15b7783859a0af203aa9e0e93f02205a031e5777","source":{"kind":"arxiv","id":"2605.02116","version":2},"attestation_state":"computed","paper":{"title":"Statistical Consistency and Generalization of Contrastive Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Contrastive loss is statistically consistent with optimal ranking in retrieval tasks","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tianbao Yang, Xiyuan Wei, Yiming Ying, Yuanfan Li","submitted_at":"2026-05-04T00:38:29Z","abstract_excerpt":"Contrastive representation learning (CRL) underpins many modern foundation models. Despite recent theoretical progress, existing analyses suffer from several key limitations: (i) the statistical consistency of CRL remains poorly understood; (ii) available generalization bounds deteriorate as the number of negative samples increases, contradicting the empirical benefits of large negative sets; and (iii) the retrieval performance of CRL has received limited theoretical attention. In this paper, we develop a unified statistical learning theory for CRL. For downstream tasks, we evaluate retrieval "},"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":"2605.02116","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-04T00:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"e31927de8b7349f6052390c6f4c1970324cac524aeb4393aaf41facb000fe3f1","abstract_canon_sha256":"9800b4b057f16bb7270417674de90b5c0c839a1d45f18e8ce12d401ee95a77fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:26.658208Z","signature_b64":"2YVuQFp+kkaZtl11C3sIXwG4aNHPt8Rtp9hl+AhiF4ocqdSdMEUuDTKAPP2rz3w4bVRIgO6qEARG/3HKthFTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2af8ce70e02fc29c1c03dbc15b7783859a0af203aa9e0e93f02205a031e5777","last_reissued_at":"2026-05-21T01:04:26.657450Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:26.657450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Consistency and Generalization of Contrastive Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Contrastive loss is statistically consistent with optimal ranking in retrieval tasks","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tianbao Yang, Xiyuan Wei, Yiming Ying, Yuanfan Li","submitted_at":"2026-05-04T00:38:29Z","abstract_excerpt":"Contrastive representation learning (CRL) underpins many modern foundation models. Despite recent theoretical progress, existing analyses suffer from several key limitations: (i) the statistical consistency of CRL remains poorly understood; (ii) available generalization bounds deteriorate as the number of negative samples increases, contradicting the empirical benefits of large negative sets; and (iii) the retrieval performance of CRL has received limited theoretical attention. In this paper, we develop a unified statistical learning theory for CRL. For downstream tasks, we evaluate retrieval "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that the contrastive loss is statistically consistent with optimal ranking and derive generalization bounds of order O(1/m + 1/sqrt(n)) and O(1/sqrt(m) + 1/sqrt(n)) for supervised and self-supervised CRL respectively.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The paper does not state the weakest assumption explicitly in the abstract; the bounds and consistency results are likely to rest on standard statistical-learning assumptions such as i.i.d. sampling, bounded loss functions, and appropriate regularity conditions on the data distribution that are not detailed here.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Contrastive representation learning is statistically consistent for optimal retrieval and admits generalization bounds of order O(1/m + 1/sqrt(n)) supervised and O(1/sqrt(m) + 1/sqrt(n)) self-supervised that benefit from large negative-sample counts m.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Contrastive loss is statistically consistent with optimal ranking in retrieval tasks","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5ba978c8ed98c321c22678001f012980c211e13824edf06855ec4830aefe9c32"},"source":{"id":"2605.02116","kind":"arxiv","version":2},"verdict":{"id":"0264c3e4-f5dc-4e19-b5d2-3e99d21d7892","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T16:52:33.174189Z","strongest_claim":"We show that the contrastive loss is statistically consistent with optimal ranking and derive generalization bounds of order O(1/m + 1/sqrt(n)) and O(1/sqrt(m) + 1/sqrt(n)) for supervised and self-supervised CRL respectively.","one_line_summary":"Contrastive representation learning is statistically consistent for optimal retrieval and admits generalization bounds of order O(1/m + 1/sqrt(n)) supervised and O(1/sqrt(m) + 1/sqrt(n)) self-supervised that benefit from large negative-sample counts m.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The paper does not state the weakest assumption explicitly in the abstract; the bounds and consistency results are likely to rest on standard statistical-learning assumptions such as i.i.d. sampling, bounded loss functions, and appropriate regularity conditions on the data distribution that are not detailed here.","pith_extraction_headline":"Contrastive loss is statistically consistent with optimal ranking in retrieval tasks"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02116/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T16:37:40.598294Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T04:01:22.646763Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:39:39.227981Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7e055980203754714e3434be3efad1e3797fd7a368fa4093da582dcb5f288c56"},"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":"2605.02116","created_at":"2026-05-21T01:04:26.657574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.02116v2","created_at":"2026-05-21T01:04:26.657574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02116","created_at":"2026-05-21T01:04:26.657574+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KXYZZYOAL6C","created_at":"2026-05-21T01:04:26.657574+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KXYZZYOAL6CTQOA","created_at":"2026-05-21T01:04:26.657574+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KXYZZYO","created_at":"2026-05-21T01:04:26.657574+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/4KXYZZYOAL6CTQOAHW6BLN3YHB","json":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB.json","graph_json":"https://pith.science/api/pith-number/4KXYZZYOAL6CTQOAHW6BLN3YHB/graph.json","events_json":"https://pith.science/api/pith-number/4KXYZZYOAL6CTQOAHW6BLN3YHB/events.json","paper":"https://pith.science/paper/4KXYZZYO"},"agent_actions":{"view_html":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB","download_json":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB.json","view_paper":"https://pith.science/paper/4KXYZZYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.02116&json=true","fetch_graph":"https://pith.science/api/pith-number/4KXYZZYOAL6CTQOAHW6BLN3YHB/graph.json","fetch_events":"https://pith.science/api/pith-number/4KXYZZYOAL6CTQOAHW6BLN3YHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB/action/storage_attestation","attest_author":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB/action/author_attestation","sign_citation":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB/action/citation_signature","submit_replication":"https://pith.science/pith/4KXYZZYOAL6CTQOAHW6BLN3YHB/action/replication_record"}},"created_at":"2026-05-21T01:04:26.657574+00:00","updated_at":"2026-05-21T01:04:26.657574+00:00"}