{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CRQAOP5HHOGGAQ6SOVM32ZZI2T","short_pith_number":"pith:CRQAOP5H","schema_version":"1.0","canonical_sha256":"1460073fa73b8c6043d27559bd6728d4dc362ac9826fc385ff571de912214980","source":{"kind":"arxiv","id":"2504.04443","version":1},"attestation_state":"computed","paper":{"title":"Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jinfeng Xu, Yutong Wei, Zheyu Chen, Ziyue Peng","submitted_at":"2025-04-06T11:30:59Z","abstract_excerpt":"Contrastive Learning (CL) has recently emerged as a powerful technique in recommendation systems, particularly for its capability to harness self-supervised signals from perturbed views to mitigate the persistent challenge of data sparsity. The process of constructing perturbed views of the user-item bipartite graph and performing contrastive learning between perturbed views in a graph convolutional network (GCN) is called graph contrastive learning (GCL), which aims to enhance the robustness of representation learning. Although existing GCL-based models are effective, the weight assignment me"},"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":"2504.04443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-04-06T11:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"a49a9a318ba64fdfaaeeeb86058cf48f28f4026078de15a88eaec0319bc45016","abstract_canon_sha256":"7cb1c62dd4714a1f921c73aabd8729d977a642060bfcfefa3923f3a47811935f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:24.033724Z","signature_b64":"zC4cSwmfTjlxKCC89TYbv9IfdbIbFt4zCPvVE0R4GSCyRv1Xz5K+/RL8Q8n3pCOLegybuJEi2Q9/CCoSfRQ0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1460073fa73b8c6043d27559bd6728d4dc362ac9826fc385ff571de912214980","last_reissued_at":"2026-07-05T10:45:24.033328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:24.033328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jinfeng Xu, Yutong Wei, Zheyu Chen, Ziyue Peng","submitted_at":"2025-04-06T11:30:59Z","abstract_excerpt":"Contrastive Learning (CL) has recently emerged as a powerful technique in recommendation systems, particularly for its capability to harness self-supervised signals from perturbed views to mitigate the persistent challenge of data sparsity. The process of constructing perturbed views of the user-item bipartite graph and performing contrastive learning between perturbed views in a graph convolutional network (GCN) is called graph contrastive learning (GCL), which aims to enhance the robustness of representation learning. Although existing GCL-based models are effective, the weight assignment me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04443","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/2504.04443/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":"2504.04443","created_at":"2026-07-05T10:45:24.033387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04443v1","created_at":"2026-07-05T10:45:24.033387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04443","created_at":"2026-07-05T10:45:24.033387+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRQAOP5HHOGG","created_at":"2026-07-05T10:45:24.033387+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRQAOP5HHOGGAQ6S","created_at":"2026-07-05T10:45:24.033387+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRQAOP5H","created_at":"2026-07-05T10:45:24.033387+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07522","citing_title":"NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T","json":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T.json","graph_json":"https://pith.science/api/pith-number/CRQAOP5HHOGGAQ6SOVM32ZZI2T/graph.json","events_json":"https://pith.science/api/pith-number/CRQAOP5HHOGGAQ6SOVM32ZZI2T/events.json","paper":"https://pith.science/paper/CRQAOP5H"},"agent_actions":{"view_html":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T","download_json":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T.json","view_paper":"https://pith.science/paper/CRQAOP5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04443&json=true","fetch_graph":"https://pith.science/api/pith-number/CRQAOP5HHOGGAQ6SOVM32ZZI2T/graph.json","fetch_events":"https://pith.science/api/pith-number/CRQAOP5HHOGGAQ6SOVM32ZZI2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T/action/storage_attestation","attest_author":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T/action/author_attestation","sign_citation":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T/action/citation_signature","submit_replication":"https://pith.science/pith/CRQAOP5HHOGGAQ6SOVM32ZZI2T/action/replication_record"}},"created_at":"2026-07-05T10:45:24.033387+00:00","updated_at":"2026-07-05T10:45:24.033387+00:00"}