{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FWZETDJDBLNWRM6OSGN6NYJMLW","short_pith_number":"pith:FWZETDJD","schema_version":"1.0","canonical_sha256":"2db2498d230adb68b3ce919be6e12c5db66723f2ed3f7d680ac294f0cb53200a","source":{"kind":"arxiv","id":"2307.05906","version":1},"attestation_state":"computed","paper":{"title":"Mini-Batch Optimization of Contrastive Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Lee, Dimitris Papailiopoulos, Jaewoong Cho, Jeong-Gwan Lee, Jy-yong Sohn, Kangwook Lee, Kartik Sreenivasan, Keon Lee, Kyunghoo Mun, Soheun Yi","submitted_at":"2023-07-12T04:23:26Z","abstract_excerpt":"Contrastive learning has gained significant attention as a method for self-supervised learning. The contrastive loss function ensures that embeddings of positive sample pairs (e.g., different samples from the same class or different views of the same object) are similar, while embeddings of negative pairs are dissimilar. Practical constraints such as large memory requirements make it challenging to consider all possible positive and negative pairs, leading to the use of mini-batch optimization. In this paper, we investigate the theoretical aspects of mini-batch optimization in contrastive lear"},"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":"2307.05906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-12T04:23:26Z","cross_cats_sorted":[],"title_canon_sha256":"f793eba09aeb5d4791daed73497464eab449d1776068177a8649a2eeb322781f","abstract_canon_sha256":"55e0659ce4de20dd87396fb35f5fa953ecd4c1a49c32fac1f6b9197805354e19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:14.016332Z","signature_b64":"YMss6a0BXFICRfectu9mQCEvVmdDK6pHXh6i5d2vGdtQrXMxh8FHSkmNWQGgAyItYSKmDMO6nlOcUEDpnCEADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db2498d230adb68b3ce919be6e12c5db66723f2ed3f7d680ac294f0cb53200a","last_reissued_at":"2026-07-05T06:30:14.015904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:14.015904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mini-Batch Optimization of Contrastive Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Lee, Dimitris Papailiopoulos, Jaewoong Cho, Jeong-Gwan Lee, Jy-yong Sohn, Kangwook Lee, Kartik Sreenivasan, Keon Lee, Kyunghoo Mun, Soheun Yi","submitted_at":"2023-07-12T04:23:26Z","abstract_excerpt":"Contrastive learning has gained significant attention as a method for self-supervised learning. The contrastive loss function ensures that embeddings of positive sample pairs (e.g., different samples from the same class or different views of the same object) are similar, while embeddings of negative pairs are dissimilar. Practical constraints such as large memory requirements make it challenging to consider all possible positive and negative pairs, leading to the use of mini-batch optimization. In this paper, we investigate the theoretical aspects of mini-batch optimization in contrastive lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05906","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/2307.05906/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":"2307.05906","created_at":"2026-07-05T06:30:14.015963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.05906v1","created_at":"2026-07-05T06:30:14.015963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05906","created_at":"2026-07-05T06:30:14.015963+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWZETDJDBLNW","created_at":"2026-07-05T06:30:14.015963+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWZETDJDBLNWRM6O","created_at":"2026-07-05T06:30:14.015963+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWZETDJD","created_at":"2026-07-05T06:30:14.015963+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/FWZETDJDBLNWRM6OSGN6NYJMLW","json":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW.json","graph_json":"https://pith.science/api/pith-number/FWZETDJDBLNWRM6OSGN6NYJMLW/graph.json","events_json":"https://pith.science/api/pith-number/FWZETDJDBLNWRM6OSGN6NYJMLW/events.json","paper":"https://pith.science/paper/FWZETDJD"},"agent_actions":{"view_html":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW","download_json":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW.json","view_paper":"https://pith.science/paper/FWZETDJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.05906&json=true","fetch_graph":"https://pith.science/api/pith-number/FWZETDJDBLNWRM6OSGN6NYJMLW/graph.json","fetch_events":"https://pith.science/api/pith-number/FWZETDJDBLNWRM6OSGN6NYJMLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW/action/storage_attestation","attest_author":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW/action/author_attestation","sign_citation":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW/action/citation_signature","submit_replication":"https://pith.science/pith/FWZETDJDBLNWRM6OSGN6NYJMLW/action/replication_record"}},"created_at":"2026-07-05T06:30:14.015963+00:00","updated_at":"2026-07-05T06:30:14.015963+00:00"}