{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MCEPMF7G4W5OHAG4DH5QTVUTK2","short_pith_number":"pith:MCEPMF7G","schema_version":"1.0","canonical_sha256":"6088f617e6e5bae380dc19fb09d69356af171a31a22abad22f06b90c021aafc0","source":{"kind":"arxiv","id":"2401.05730","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Contrastive Learning with Efficient Combinatorial Positive Pairing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Duhun Hwang, Eunjung Lee, Jaeill Kim, Jangwon Suh, Jimyeong Kim, Wonjong Rhee","submitted_at":"2024-01-11T08:18:30Z","abstract_excerpt":"In the past few years, contrastive learning has played a central role for the success of visual unsupervised representation learning. Around the same time, high-performance non-contrastive learning methods have been developed as well. While most of the works utilize only two views, we carefully review the existing multi-view methods and propose a general multi-view strategy that can improve learning speed and performance of any contrastive or non-contrastive method. We first analyze CMC's full-graph paradigm and empirically show that the learning speed of $K$-views can be increased by $_{K}\\ma"},"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":"2401.05730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-01-11T08:18:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fa0c28615a4f4ba7b1685fbc0a2044e050bda3d68c3bb5441642e6af6b0e4a18","abstract_canon_sha256":"a74195e00912e4c481c77ee8b81256a211d45def4dfb85b39efd2cadcffbb9b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:34.628363Z","signature_b64":"Tx6RBn0s+yy3dXLtofVCrYF5ceJ/MhPVEaeX96SVUOUpxxPZJ4oeqMjotl5ABFPDHO8P1R5SW9YAgE7tEtUNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6088f617e6e5bae380dc19fb09d69356af171a31a22abad22f06b90c021aafc0","last_reissued_at":"2026-07-05T07:32:34.627899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:34.627899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Contrastive Learning with Efficient Combinatorial Positive Pairing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Duhun Hwang, Eunjung Lee, Jaeill Kim, Jangwon Suh, Jimyeong Kim, Wonjong Rhee","submitted_at":"2024-01-11T08:18:30Z","abstract_excerpt":"In the past few years, contrastive learning has played a central role for the success of visual unsupervised representation learning. Around the same time, high-performance non-contrastive learning methods have been developed as well. While most of the works utilize only two views, we carefully review the existing multi-view methods and propose a general multi-view strategy that can improve learning speed and performance of any contrastive or non-contrastive method. We first analyze CMC's full-graph paradigm and empirically show that the learning speed of $K$-views can be increased by $_{K}\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05730","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/2401.05730/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":"2401.05730","created_at":"2026-07-05T07:32:34.627954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.05730v1","created_at":"2026-07-05T07:32:34.627954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05730","created_at":"2026-07-05T07:32:34.627954+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCEPMF7G4W5O","created_at":"2026-07-05T07:32:34.627954+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCEPMF7G4W5OHAG4","created_at":"2026-07-05T07:32:34.627954+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCEPMF7G","created_at":"2026-07-05T07:32:34.627954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11525","citing_title":"Learning Object Manipulation from Scratch via Contrastive Interaction","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2","json":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2.json","graph_json":"https://pith.science/api/pith-number/MCEPMF7G4W5OHAG4DH5QTVUTK2/graph.json","events_json":"https://pith.science/api/pith-number/MCEPMF7G4W5OHAG4DH5QTVUTK2/events.json","paper":"https://pith.science/paper/MCEPMF7G"},"agent_actions":{"view_html":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2","download_json":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2.json","view_paper":"https://pith.science/paper/MCEPMF7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.05730&json=true","fetch_graph":"https://pith.science/api/pith-number/MCEPMF7G4W5OHAG4DH5QTVUTK2/graph.json","fetch_events":"https://pith.science/api/pith-number/MCEPMF7G4W5OHAG4DH5QTVUTK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2/action/storage_attestation","attest_author":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2/action/author_attestation","sign_citation":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2/action/citation_signature","submit_replication":"https://pith.science/pith/MCEPMF7G4W5OHAG4DH5QTVUTK2/action/replication_record"}},"created_at":"2026-07-05T07:32:34.627954+00:00","updated_at":"2026-07-05T07:32:34.627954+00:00"}