{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PCMM7FC25CJDKYUGFZ7PI2NUNU","short_pith_number":"pith:PCMM7FC2","schema_version":"1.0","canonical_sha256":"7898cf945ae8923562862e7ef469b46d3477351ce82caf0325b47367ba12f83e","source":{"kind":"arxiv","id":"2306.04095","version":2},"attestation_state":"computed","paper":{"title":"PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chaokun Wang, Cheng Wu, Jingcao Xu, Kai Zheng, Kun Gai, Na Mou, Yang Song, Ziyang Liu","submitted_at":"2023-06-07T01:31:12Z","abstract_excerpt":"Recommender systems play a crucial role in addressing the issue of information overload by delivering personalized recommendations to users. In recent years, there has been a growing interest in leveraging graph neural networks (GNNs) for recommender systems, capitalizing on advancements in graph representation learning. These GNN-based models primarily focus on analyzing users' positive feedback while overlooking the valuable insights provided by their negative feedback. In this paper, we propose PANE-GNN, an innovative recommendation model that unifies Positive And Negative Edges in Graph Ne"},"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":"2306.04095","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-06-07T01:31:12Z","cross_cats_sorted":[],"title_canon_sha256":"6a5876e540c713d0d9ba1922c0bb68ec3e1bba9d8608e6e0dd93a5e93affb64d","abstract_canon_sha256":"70f596bf7bcb8f1299726cafc74bfad22394bb83f3c5ab0dbbbf1b7fba2c02f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:39.785445Z","signature_b64":"n1JMFsbqZoX0+zdn+QbmRgjaMqJBgqG795hCJCkpN6xCfF71tQ2WBQ3flnsBuuAgozBCoNjTh6TXqFw/x0irDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7898cf945ae8923562862e7ef469b46d3477351ce82caf0325b47367ba12f83e","last_reissued_at":"2026-07-05T06:18:39.784889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:39.784889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chaokun Wang, Cheng Wu, Jingcao Xu, Kai Zheng, Kun Gai, Na Mou, Yang Song, Ziyang Liu","submitted_at":"2023-06-07T01:31:12Z","abstract_excerpt":"Recommender systems play a crucial role in addressing the issue of information overload by delivering personalized recommendations to users. In recent years, there has been a growing interest in leveraging graph neural networks (GNNs) for recommender systems, capitalizing on advancements in graph representation learning. These GNN-based models primarily focus on analyzing users' positive feedback while overlooking the valuable insights provided by their negative feedback. In this paper, we propose PANE-GNN, an innovative recommendation model that unifies Positive And Negative Edges in Graph Ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04095","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/2306.04095/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":"2306.04095","created_at":"2026-07-05T06:18:39.784954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04095v2","created_at":"2026-07-05T06:18:39.784954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04095","created_at":"2026-07-05T06:18:39.784954+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCMM7FC25CJD","created_at":"2026-07-05T06:18:39.784954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCMM7FC25CJDKYUG","created_at":"2026-07-05T06:18:39.784954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCMM7FC2","created_at":"2026-07-05T06:18:39.784954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17854","citing_title":"Learning over Positive and Negative Edges with Contrastive Message Passing","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU","json":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU.json","graph_json":"https://pith.science/api/pith-number/PCMM7FC25CJDKYUGFZ7PI2NUNU/graph.json","events_json":"https://pith.science/api/pith-number/PCMM7FC25CJDKYUGFZ7PI2NUNU/events.json","paper":"https://pith.science/paper/PCMM7FC2"},"agent_actions":{"view_html":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU","download_json":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU.json","view_paper":"https://pith.science/paper/PCMM7FC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04095&json=true","fetch_graph":"https://pith.science/api/pith-number/PCMM7FC25CJDKYUGFZ7PI2NUNU/graph.json","fetch_events":"https://pith.science/api/pith-number/PCMM7FC25CJDKYUGFZ7PI2NUNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU/action/storage_attestation","attest_author":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU/action/author_attestation","sign_citation":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU/action/citation_signature","submit_replication":"https://pith.science/pith/PCMM7FC25CJDKYUGFZ7PI2NUNU/action/replication_record"}},"created_at":"2026-07-05T06:18:39.784954+00:00","updated_at":"2026-07-05T06:18:39.784954+00:00"}