{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:73JG6QEW2NZGQWXAVQSR7M32JZ","short_pith_number":"pith:73JG6QEW","schema_version":"1.0","canonical_sha256":"fed26f4096d372685ae0ac251fb37a4e57657d8eb03d3e444218d254799e42bd","source":{"kind":"arxiv","id":"2102.10056","version":2},"attestation_state":"computed","paper":{"title":"Molecular Contrastive Learning of Representations via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"cs.LG","authors_text":"Amir Barati Farimani, Jianren Wang, Yuyang Wang, Zhonglin Cao","submitted_at":"2021-02-19T17:35:18Z","abstract_excerpt":"Molecular Machine Learning (ML) bears promise for efficient molecule property prediction and drug discovery. However, labeled molecule data can be expensive and time-consuming to acquire. Due to the limited labeled data, it is a great challenge for supervised-learning ML models to generalize to the giant chemical space. In this work, we present MolCLR: Molecular Contrastive Learning of Representations via Graph Neural Networks (GNNs), a self-supervised learning framework that leverages large unlabeled data (~10M unique molecules). In MolCLR pre-training, we build molecule graphs and develop GN"},"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":"2102.10056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-19T17:35:18Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"9592f31f3c9090b6ac19a7fd44cbc69f8689b631b5c0100fb81331dcb4804bc9","abstract_canon_sha256":"b67d0e5383f5f9e02d40b4037e84284a2d1967917b7d70778ba2caa6e58377ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:11.793288Z","signature_b64":"BfFydVTKrx5S2xHN1BtTPjf68sqbwoVmMPtyHzv/054ftNTVeO2won7xUCiScPZtVx9clk7Wu52STSOalrzZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed26f4096d372685ae0ac251fb37a4e57657d8eb03d3e444218d254799e42bd","last_reissued_at":"2026-07-05T04:10:11.792787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:11.792787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Molecular Contrastive Learning of Representations via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"cs.LG","authors_text":"Amir Barati Farimani, Jianren Wang, Yuyang Wang, Zhonglin Cao","submitted_at":"2021-02-19T17:35:18Z","abstract_excerpt":"Molecular Machine Learning (ML) bears promise for efficient molecule property prediction and drug discovery. However, labeled molecule data can be expensive and time-consuming to acquire. Due to the limited labeled data, it is a great challenge for supervised-learning ML models to generalize to the giant chemical space. In this work, we present MolCLR: Molecular Contrastive Learning of Representations via Graph Neural Networks (GNNs), a self-supervised learning framework that leverages large unlabeled data (~10M unique molecules). In MolCLR pre-training, we build molecule graphs and develop GN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10056","kind":"arxiv","version":2},"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/2102.10056/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":"2102.10056","created_at":"2026-07-05T04:10:11.792843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10056v2","created_at":"2026-07-05T04:10:11.792843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10056","created_at":"2026-07-05T04:10:11.792843+00:00"},{"alias_kind":"pith_short_12","alias_value":"73JG6QEW2NZG","created_at":"2026-07-05T04:10:11.792843+00:00"},{"alias_kind":"pith_short_16","alias_value":"73JG6QEW2NZGQWXA","created_at":"2026-07-05T04:10:11.792843+00:00"},{"alias_kind":"pith_short_8","alias_value":"73JG6QEW","created_at":"2026-07-05T04:10:11.792843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17667","citing_title":"Handling Feature Heterogeneity with Learnable Graph Patches","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ","json":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ.json","graph_json":"https://pith.science/api/pith-number/73JG6QEW2NZGQWXAVQSR7M32JZ/graph.json","events_json":"https://pith.science/api/pith-number/73JG6QEW2NZGQWXAVQSR7M32JZ/events.json","paper":"https://pith.science/paper/73JG6QEW"},"agent_actions":{"view_html":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ","download_json":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ.json","view_paper":"https://pith.science/paper/73JG6QEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10056&json=true","fetch_graph":"https://pith.science/api/pith-number/73JG6QEW2NZGQWXAVQSR7M32JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/73JG6QEW2NZGQWXAVQSR7M32JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ/action/storage_attestation","attest_author":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ/action/author_attestation","sign_citation":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ/action/citation_signature","submit_replication":"https://pith.science/pith/73JG6QEW2NZGQWXAVQSR7M32JZ/action/replication_record"}},"created_at":"2026-07-05T04:10:11.792843+00:00","updated_at":"2026-07-05T04:10:11.792843+00:00"}