{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PWN7I7LOK6UCKEXMYFTVTPRHBU","short_pith_number":"pith:PWN7I7LO","schema_version":"1.0","canonical_sha256":"7d9bf47d6e57a82512ecc16759be270d3dd1ecccbc98cab600038044da4e1431","source":{"kind":"arxiv","id":"2302.08191","version":3},"attestation_state":"computed","paper":{"title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Chao Huang, Lianghao Xia, Xubin Ren, Xuheng Cai","submitted_at":"2023-02-16T10:16:21Z","abstract_excerpt":"Graph neural network (GNN) is a powerful learning approach for graph-based recommender systems. Recently, GNNs integrated with contrastive learning have shown superior performance in recommendation with their data augmentation schemes, aiming at dealing with highly sparse data. Despite their success, most existing graph contrastive learning methods either perform stochastic augmentation (e.g., node/edge perturbation) on the user-item interaction graph, or rely on the heuristic-based augmentation techniques (e.g., user clustering) for generating contrastive views. We argue that these methods ca"},"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":"2302.08191","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-02-16T10:16:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bb4cd50ab092ff1a513a42d5cfcb5f9282f65062ed294eb46b386fc6cb067e70","abstract_canon_sha256":"a8d2dd231dbc2ef1bfbaf8f398f24a889873cdade7b6cbdfea8653af7eda40a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:40.749879Z","signature_b64":"YOFB99qwNdwxkdmGAM0I7W74Lx2WHKnnUMmFERe1d0jZbgsBYDtwRv6yc1OnxDmBrscPPppPpkaJuwp8iZxGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9bf47d6e57a82512ecc16759be270d3dd1ecccbc98cab600038044da4e1431","last_reissued_at":"2026-07-05T06:20:40.749429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:40.749429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Chao Huang, Lianghao Xia, Xubin Ren, Xuheng Cai","submitted_at":"2023-02-16T10:16:21Z","abstract_excerpt":"Graph neural network (GNN) is a powerful learning approach for graph-based recommender systems. Recently, GNNs integrated with contrastive learning have shown superior performance in recommendation with their data augmentation schemes, aiming at dealing with highly sparse data. Despite their success, most existing graph contrastive learning methods either perform stochastic augmentation (e.g., node/edge perturbation) on the user-item interaction graph, or rely on the heuristic-based augmentation techniques (e.g., user clustering) for generating contrastive views. We argue that these methods ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08191","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/2302.08191/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":"2302.08191","created_at":"2026-07-05T06:20:40.749486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.08191v3","created_at":"2026-07-05T06:20:40.749486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08191","created_at":"2026-07-05T06:20:40.749486+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWN7I7LOK6UC","created_at":"2026-07-05T06:20:40.749486+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWN7I7LOK6UCKEXM","created_at":"2026-07-05T06:20:40.749486+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWN7I7LO","created_at":"2026-07-05T06:20:40.749486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20858","citing_title":"Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04530","citing_title":"SLSREC: Self-Supervised Contrastive Learning for Adaptive Fusion of Long- and Short-Term User Interests","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15699","citing_title":"Frequency-Corrupt Based Graph Self-Supervised Learning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU","json":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU.json","graph_json":"https://pith.science/api/pith-number/PWN7I7LOK6UCKEXMYFTVTPRHBU/graph.json","events_json":"https://pith.science/api/pith-number/PWN7I7LOK6UCKEXMYFTVTPRHBU/events.json","paper":"https://pith.science/paper/PWN7I7LO"},"agent_actions":{"view_html":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU","download_json":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU.json","view_paper":"https://pith.science/paper/PWN7I7LO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.08191&json=true","fetch_graph":"https://pith.science/api/pith-number/PWN7I7LOK6UCKEXMYFTVTPRHBU/graph.json","fetch_events":"https://pith.science/api/pith-number/PWN7I7LOK6UCKEXMYFTVTPRHBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU/action/storage_attestation","attest_author":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU/action/author_attestation","sign_citation":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU/action/citation_signature","submit_replication":"https://pith.science/pith/PWN7I7LOK6UCKEXMYFTVTPRHBU/action/replication_record"}},"created_at":"2026-07-05T06:20:40.749486+00:00","updated_at":"2026-07-05T06:20:40.749486+00:00"}