{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U7OOPHRYSKED7STTLEC7W4GWZ2","short_pith_number":"pith:U7OOPHRY","schema_version":"1.0","canonical_sha256":"a7dce79e3892883fca735905fb70d6ce923205bfc4c36c5dd3264cc82ae64556","source":{"kind":"arxiv","id":"2308.14355","version":3},"attestation_state":"computed","paper":{"title":"TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Chaozhuo Li, Feiran Huang, Peiyan Zhang, Senzhang Wang, Sunghun Kim, Xi Zhang, Yuchen Yan","submitted_at":"2023-08-28T07:03:08Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as promising solutions for collaborative filtering (CF) through the modeling of user-item interaction graphs. The nucleus of existing GNN-based recommender systems involves recursive message passing along user-item interaction edges to refine encoded embeddings. Despite their demonstrated effectiveness, current GNN-based methods encounter challenges of limited receptive fields and the presence of noisy \"interest-irrelevant\" connections. In contrast, Transformer-based methods excel in aggregating information adaptively and globally. Nevertheless, their "},"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":"2308.14355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-28T07:03:08Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c7c93e3ffa2e8efbaab6dc1b47507b11029a129fb3edcae3209d2cb3e814b5a3","abstract_canon_sha256":"f2390406f24c0e0aed9b3460953a4fd6c7eda9d964aee8a66563c22403df5087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:24.095643Z","signature_b64":"dVeU+r1o2Xqznl3n0lFT2BKMY3GeX0NHxe0huIWOmDOjGu2B7MiFBSwEWjIc7hJdGUviRCGvn0CQrEvZc9CfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7dce79e3892883fca735905fb70d6ce923205bfc4c36c5dd3264cc82ae64556","last_reissued_at":"2026-07-05T08:20:24.095189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:24.095189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Chaozhuo Li, Feiran Huang, Peiyan Zhang, Senzhang Wang, Sunghun Kim, Xi Zhang, Yuchen Yan","submitted_at":"2023-08-28T07:03:08Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as promising solutions for collaborative filtering (CF) through the modeling of user-item interaction graphs. The nucleus of existing GNN-based recommender systems involves recursive message passing along user-item interaction edges to refine encoded embeddings. Despite their demonstrated effectiveness, current GNN-based methods encounter challenges of limited receptive fields and the presence of noisy \"interest-irrelevant\" connections. In contrast, Transformer-based methods excel in aggregating information adaptively and globally. Nevertheless, their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14355","kind":"arxiv","version":3},"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/2308.14355/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":"2308.14355","created_at":"2026-07-05T08:20:24.095244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.14355v3","created_at":"2026-07-05T08:20:24.095244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14355","created_at":"2026-07-05T08:20:24.095244+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7OOPHRYSKED","created_at":"2026-07-05T08:20:24.095244+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7OOPHRYSKED7STT","created_at":"2026-07-05T08:20:24.095244+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7OOPHRY","created_at":"2026-07-05T08:20:24.095244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15458","citing_title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2","json":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2.json","graph_json":"https://pith.science/api/pith-number/U7OOPHRYSKED7STTLEC7W4GWZ2/graph.json","events_json":"https://pith.science/api/pith-number/U7OOPHRYSKED7STTLEC7W4GWZ2/events.json","paper":"https://pith.science/paper/U7OOPHRY"},"agent_actions":{"view_html":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2","download_json":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2.json","view_paper":"https://pith.science/paper/U7OOPHRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.14355&json=true","fetch_graph":"https://pith.science/api/pith-number/U7OOPHRYSKED7STTLEC7W4GWZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/U7OOPHRYSKED7STTLEC7W4GWZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2/action/storage_attestation","attest_author":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2/action/author_attestation","sign_citation":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2/action/citation_signature","submit_replication":"https://pith.science/pith/U7OOPHRYSKED7STTLEC7W4GWZ2/action/replication_record"}},"created_at":"2026-07-05T08:20:24.095244+00:00","updated_at":"2026-07-05T08:20:24.095244+00:00"}