{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YREO6BUBMTGLF55FSM3IXVPTH6","short_pith_number":"pith:YREO6BUB","schema_version":"1.0","canonical_sha256":"c448ef068164ccb2f7a593368bd5f33fb66d226974a07b8e30833093b75b5698","source":{"kind":"arxiv","id":"2506.10658","version":1},"attestation_state":"computed","paper":{"title":"Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.IR","authors_text":"Mostafa Haghir Chehreghani, Narges Nemati","submitted_at":"2025-06-12T12:47:35Z","abstract_excerpt":"Matrix completion is a widely adopted framework in recommender systems, as predicting the missing entries in the user-item rating matrix enables a comprehensive understanding of user preferences. However, current graph neural network (GNN)-based approaches are highly sensitive to noisy or irrelevant edges--due to their inherent message-passing mechanisms--and are prone to overfitting, which limits their generalizability. To overcome these challenges, we propose a novel method called Matrix Completion using Contrastive Learning (MCCL). Our approach begins by extracting local neighborhood subgra"},"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":"2506.10658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-06-12T12:47:35Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"3a71e9ce92ee6e23fa002a8656b6697d02e003dd919d9db4d0c717da555cff57","abstract_canon_sha256":"670b3180b8c40af0b18fd6ef94fe30c4f33b9d567992e671b18a8a8a9fd04461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:28.108882Z","signature_b64":"IG2hxk1UkzA22mWmuHk4vlq4fVXvOYaIif/TfODfFigqxERcTqYmk6tsg7DhsFm5BfHUkONN+KLE5XHt35WhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c448ef068164ccb2f7a593368bd5f33fb66d226974a07b8e30833093b75b5698","last_reissued_at":"2026-07-05T11:20:28.108396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:28.108396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.IR","authors_text":"Mostafa Haghir Chehreghani, Narges Nemati","submitted_at":"2025-06-12T12:47:35Z","abstract_excerpt":"Matrix completion is a widely adopted framework in recommender systems, as predicting the missing entries in the user-item rating matrix enables a comprehensive understanding of user preferences. However, current graph neural network (GNN)-based approaches are highly sensitive to noisy or irrelevant edges--due to their inherent message-passing mechanisms--and are prone to overfitting, which limits their generalizability. To overcome these challenges, we propose a novel method called Matrix Completion using Contrastive Learning (MCCL). Our approach begins by extracting local neighborhood subgra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10658","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/2506.10658/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":"2506.10658","created_at":"2026-07-05T11:20:28.108456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10658v1","created_at":"2026-07-05T11:20:28.108456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10658","created_at":"2026-07-05T11:20:28.108456+00:00"},{"alias_kind":"pith_short_12","alias_value":"YREO6BUBMTGL","created_at":"2026-07-05T11:20:28.108456+00:00"},{"alias_kind":"pith_short_16","alias_value":"YREO6BUBMTGLF55F","created_at":"2026-07-05T11:20:28.108456+00:00"},{"alias_kind":"pith_short_8","alias_value":"YREO6BUB","created_at":"2026-07-05T11:20:28.108456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6","json":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6.json","graph_json":"https://pith.science/api/pith-number/YREO6BUBMTGLF55FSM3IXVPTH6/graph.json","events_json":"https://pith.science/api/pith-number/YREO6BUBMTGLF55FSM3IXVPTH6/events.json","paper":"https://pith.science/paper/YREO6BUB"},"agent_actions":{"view_html":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6","download_json":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6.json","view_paper":"https://pith.science/paper/YREO6BUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10658&json=true","fetch_graph":"https://pith.science/api/pith-number/YREO6BUBMTGLF55FSM3IXVPTH6/graph.json","fetch_events":"https://pith.science/api/pith-number/YREO6BUBMTGLF55FSM3IXVPTH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6/action/storage_attestation","attest_author":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6/action/author_attestation","sign_citation":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6/action/citation_signature","submit_replication":"https://pith.science/pith/YREO6BUBMTGLF55FSM3IXVPTH6/action/replication_record"}},"created_at":"2026-07-05T11:20:28.108456+00:00","updated_at":"2026-07-05T11:20:28.108456+00:00"}