{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R2MMOMD3UANRGN6KVQL75TUI4F","short_pith_number":"pith:R2MMOMD3","schema_version":"1.0","canonical_sha256":"8e98c7307ba01b1337caac17fece88e153bfd5f81fe9f72225b6b779bd84adac","source":{"kind":"arxiv","id":"2407.07912","version":1},"attestation_state":"computed","paper":{"title":"ITEM: Improving Training and Evaluation of Message-Passing based GNNs for top-k recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Elias Ramzi, Nicolas Thome, Rapha\\\"el Fournier-S'niehotta, Yannis Karmim","submitted_at":"2024-07-03T13:35:23Z","abstract_excerpt":"Graph Neural Networks (GNNs), especially message-passing-based models, have become prominent in top-k recommendation tasks, outperforming matrix factorization models due to their ability to efficiently aggregate information from a broader context. Although GNNs are evaluated with ranking-based metrics, e.g NDCG@k and Recall@k, they remain largely trained with proxy losses, e.g the BPR loss. In this work we explore the use of ranking loss functions to directly optimize the evaluation metrics, an area not extensively investigated in the GNN community for collaborative filtering. We take advantag"},"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":"2407.07912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-07-03T13:35:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3227a484012e5ebf39a6a113d7a39097f820348dcd00d81cbb2bc145c7a1d087","abstract_canon_sha256":"882c190b5883f4e7a55837efc1be57217dbdf4f1ab9ea4f80234f6544b261252"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:39.941000Z","signature_b64":"GQmgnfsSfJLLVFbRcM+Qx6dCUTE3MO/oEXI4kVlBaw4DGUhg/YIu7jpoyk27n2KEnJ93Gh9YsTE91YcWu4a7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e98c7307ba01b1337caac17fece88e153bfd5f81fe9f72225b6b779bd84adac","last_reissued_at":"2026-07-05T08:42:39.940511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:39.940511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ITEM: Improving Training and Evaluation of Message-Passing based GNNs for top-k recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Elias Ramzi, Nicolas Thome, Rapha\\\"el Fournier-S'niehotta, Yannis Karmim","submitted_at":"2024-07-03T13:35:23Z","abstract_excerpt":"Graph Neural Networks (GNNs), especially message-passing-based models, have become prominent in top-k recommendation tasks, outperforming matrix factorization models due to their ability to efficiently aggregate information from a broader context. Although GNNs are evaluated with ranking-based metrics, e.g NDCG@k and Recall@k, they remain largely trained with proxy losses, e.g the BPR loss. In this work we explore the use of ranking loss functions to directly optimize the evaluation metrics, an area not extensively investigated in the GNN community for collaborative filtering. We take advantag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07912","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/2407.07912/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":"2407.07912","created_at":"2026-07-05T08:42:39.940572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.07912v1","created_at":"2026-07-05T08:42:39.940572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07912","created_at":"2026-07-05T08:42:39.940572+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2MMOMD3UANR","created_at":"2026-07-05T08:42:39.940572+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2MMOMD3UANRGN6K","created_at":"2026-07-05T08:42:39.940572+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2MMOMD3","created_at":"2026-07-05T08:42:39.940572+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/R2MMOMD3UANRGN6KVQL75TUI4F","json":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F.json","graph_json":"https://pith.science/api/pith-number/R2MMOMD3UANRGN6KVQL75TUI4F/graph.json","events_json":"https://pith.science/api/pith-number/R2MMOMD3UANRGN6KVQL75TUI4F/events.json","paper":"https://pith.science/paper/R2MMOMD3"},"agent_actions":{"view_html":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F","download_json":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F.json","view_paper":"https://pith.science/paper/R2MMOMD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.07912&json=true","fetch_graph":"https://pith.science/api/pith-number/R2MMOMD3UANRGN6KVQL75TUI4F/graph.json","fetch_events":"https://pith.science/api/pith-number/R2MMOMD3UANRGN6KVQL75TUI4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F/action/storage_attestation","attest_author":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F/action/author_attestation","sign_citation":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F/action/citation_signature","submit_replication":"https://pith.science/pith/R2MMOMD3UANRGN6KVQL75TUI4F/action/replication_record"}},"created_at":"2026-07-05T08:42:39.940572+00:00","updated_at":"2026-07-05T08:42:39.940572+00:00"}