{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4CXZ4DBBQR5U3PJ67FHM7LNVNG","short_pith_number":"pith:4CXZ4DBB","schema_version":"1.0","canonical_sha256":"e0af9e0c21847b4dbd3ef94ecfadb56990b1e0574518a0b6fd1e452dab723f3d","source":{"kind":"arxiv","id":"2402.03365","version":4},"attestation_state":"computed","paper":{"title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.IR","authors_text":"Mostafa Haghir Chehreghani, Nemat Gholinejad","submitted_at":"2024-01-31T11:03:58Z","abstract_excerpt":"In recent years, graph neural networks (GNNs) have become a popular tool to improve the accuracy and performance of recommender systems. Modern recommender systems are not only designed to serve end users, but also to benefit other participants, such as items and item providers. These participants may have different or conflicting goals and interests, which raises the need for fairness and popularity bias considerations. GNN-based recommendation methods also face the challenges of unfairness and popularity bias, and their normalization and aggregation processes suffer from these challenges. In"},"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":"2402.03365","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-01-31T11:03:58Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"ee6d01724b248cd0f01c6f2d683df5bbcf863d9638dff1ce76c2d4b69832c192","abstract_canon_sha256":"51625e1577bbbeda634083629bf88cc8df2d41f13d687af965cf6c2aa48541d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:45.301631Z","signature_b64":"XlfmNHSO1TGx124YE3IroedP9czXJ4Fx8E/VwYencAI5tH0VYvI+uQzBsnkvehOrD8Hux4QAHvgEOcm9UgQFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0af9e0c21847b4dbd3ef94ecfadb56990b1e0574518a0b6fd1e452dab723f3d","last_reissued_at":"2026-07-05T11:48:45.301212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:45.301212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.IR","authors_text":"Mostafa Haghir Chehreghani, Nemat Gholinejad","submitted_at":"2024-01-31T11:03:58Z","abstract_excerpt":"In recent years, graph neural networks (GNNs) have become a popular tool to improve the accuracy and performance of recommender systems. Modern recommender systems are not only designed to serve end users, but also to benefit other participants, such as items and item providers. These participants may have different or conflicting goals and interests, which raises the need for fairness and popularity bias considerations. GNN-based recommendation methods also face the challenges of unfairness and popularity bias, and their normalization and aggregation processes suffer from these challenges. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03365","kind":"arxiv","version":4},"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/2402.03365/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":"2402.03365","created_at":"2026-07-05T11:48:45.301261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.03365v4","created_at":"2026-07-05T11:48:45.301261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03365","created_at":"2026-07-05T11:48:45.301261+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CXZ4DBBQR5U","created_at":"2026-07-05T11:48:45.301261+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CXZ4DBBQR5U3PJ6","created_at":"2026-07-05T11:48:45.301261+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CXZ4DBB","created_at":"2026-07-05T11:48:45.301261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.15699","citing_title":"Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2504.13614","citing_title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2507.19067","citing_title":"PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG","json":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG.json","graph_json":"https://pith.science/api/pith-number/4CXZ4DBBQR5U3PJ67FHM7LNVNG/graph.json","events_json":"https://pith.science/api/pith-number/4CXZ4DBBQR5U3PJ67FHM7LNVNG/events.json","paper":"https://pith.science/paper/4CXZ4DBB"},"agent_actions":{"view_html":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG","download_json":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG.json","view_paper":"https://pith.science/paper/4CXZ4DBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.03365&json=true","fetch_graph":"https://pith.science/api/pith-number/4CXZ4DBBQR5U3PJ67FHM7LNVNG/graph.json","fetch_events":"https://pith.science/api/pith-number/4CXZ4DBBQR5U3PJ67FHM7LNVNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG/action/storage_attestation","attest_author":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG/action/author_attestation","sign_citation":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG/action/citation_signature","submit_replication":"https://pith.science/pith/4CXZ4DBBQR5U3PJ67FHM7LNVNG/action/replication_record"}},"created_at":"2026-07-05T11:48:45.301261+00:00","updated_at":"2026-07-05T11:48:45.301261+00:00"}