{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FICOAYMU5DDOKGJNUKKSLQZYAT","short_pith_number":"pith:FICOAYMU","schema_version":"1.0","canonical_sha256":"2a04e06194e8c6e5192da29525c33804cac30cae55e454ce56d3f3fac6048b61","source":{"kind":"arxiv","id":"2209.13964","version":3},"attestation_state":"computed","paper":{"title":"Graph Soft-Contrastive Learning via Neighborhood Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Denghui Zhang, Pengfei Wang, Pengyang Wang, Wei Fan, Yi Du, Yuanchun Zhou, Zhiyuan Ning, Ziyue Qiao","submitted_at":"2022-09-28T09:52:15Z","abstract_excerpt":"Graph Contrastive Learning (GCL) has emerged as a promising approach in the realm of graph self-supervised learning. Prevailing GCL methods mainly derive from the principles of contrastive learning in the field of computer vision: modeling invariance by specifying absolutely similar pairs. However, when applied to graph data, this paradigm encounters two significant limitations: (1) the validity of the generated views cannot be guaranteed: graph perturbation may produce invalid views against semantics and intrinsic topology of graph data; (2) specifying absolutely similar pairs in the graph vi"},"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":"2209.13964","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-28T09:52:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ed61d67606613d71f45778a68b540b3b6a034e0cc91c54f4e3644b6d5ff3a12e","abstract_canon_sha256":"6af2bfdd7437a72290be077969ee0c522c7fcf75ee626b56ab72377df2176fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:02.593152Z","signature_b64":"uQ8LUBLytJZT7trfkzPfFLwMeV8TaT9afsDMk3wI9ZoudY0Y7SZuXkWGAqwXqU0fnAmrX0Wj15+0SBJhkOFsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a04e06194e8c6e5192da29525c33804cac30cae55e454ce56d3f3fac6048b61","last_reissued_at":"2026-07-05T06:37:02.592682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:02.592682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Soft-Contrastive Learning via Neighborhood Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Denghui Zhang, Pengfei Wang, Pengyang Wang, Wei Fan, Yi Du, Yuanchun Zhou, Zhiyuan Ning, Ziyue Qiao","submitted_at":"2022-09-28T09:52:15Z","abstract_excerpt":"Graph Contrastive Learning (GCL) has emerged as a promising approach in the realm of graph self-supervised learning. Prevailing GCL methods mainly derive from the principles of contrastive learning in the field of computer vision: modeling invariance by specifying absolutely similar pairs. However, when applied to graph data, this paradigm encounters two significant limitations: (1) the validity of the generated views cannot be guaranteed: graph perturbation may produce invalid views against semantics and intrinsic topology of graph data; (2) specifying absolutely similar pairs in the graph vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13964","kind":"arxiv","version":3},"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/2209.13964/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":"2209.13964","created_at":"2026-07-05T06:37:02.592740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13964v3","created_at":"2026-07-05T06:37:02.592740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13964","created_at":"2026-07-05T06:37:02.592740+00:00"},{"alias_kind":"pith_short_12","alias_value":"FICOAYMU5DDO","created_at":"2026-07-05T06:37:02.592740+00:00"},{"alias_kind":"pith_short_16","alias_value":"FICOAYMU5DDOKGJN","created_at":"2026-07-05T06:37:02.592740+00:00"},{"alias_kind":"pith_short_8","alias_value":"FICOAYMU","created_at":"2026-07-05T06:37:02.592740+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05866","citing_title":"Beyond Paper-to-Paper: Structured Profiling and Rubric Scoring for Paper-Reviewer Matching","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT","json":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT.json","graph_json":"https://pith.science/api/pith-number/FICOAYMU5DDOKGJNUKKSLQZYAT/graph.json","events_json":"https://pith.science/api/pith-number/FICOAYMU5DDOKGJNUKKSLQZYAT/events.json","paper":"https://pith.science/paper/FICOAYMU"},"agent_actions":{"view_html":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT","download_json":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT.json","view_paper":"https://pith.science/paper/FICOAYMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13964&json=true","fetch_graph":"https://pith.science/api/pith-number/FICOAYMU5DDOKGJNUKKSLQZYAT/graph.json","fetch_events":"https://pith.science/api/pith-number/FICOAYMU5DDOKGJNUKKSLQZYAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT/action/storage_attestation","attest_author":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT/action/author_attestation","sign_citation":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT/action/citation_signature","submit_replication":"https://pith.science/pith/FICOAYMU5DDOKGJNUKKSLQZYAT/action/replication_record"}},"created_at":"2026-07-05T06:37:02.592740+00:00","updated_at":"2026-07-05T06:37:02.592740+00:00"}