{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UBY7HQGHPVN6RNIX6WZTHTHJOZ","short_pith_number":"pith:UBY7HQGH","schema_version":"1.0","canonical_sha256":"a071f3c0c77d5be8b517f5b333cce97671e26bf3af825ef9ff208f81d5241c2d","source":{"kind":"arxiv","id":"2102.07575","version":2},"attestation_state":"computed","paper":{"title":"User Embedding based Neighborhood Aggregation Method for Inductive Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Arun Iyer, Rahul Ragesh, Ramakrishna Bairi, Sundararajan Sellamanickam, Vijay Lingam","submitted_at":"2021-02-15T14:30:01Z","abstract_excerpt":"We consider the problem of learning latent features (aka embedding) for users and items in a recommendation setting. Given only a user-item interaction graph, the goal is to recommend items for each user. Traditional approaches employ matrix factorization-based collaborative filtering methods. Recent methods using graph convolutional networks (e.g., LightGCN) achieve state-of-the-art performance. They learn both user and item embedding. One major drawback of most existing methods is that they are not inductive; they do not generalize for users and items unseen during training. Besides, existin"},"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":"2102.07575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-15T14:30:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc2308dd78507cc54cb1aca779f87e5b0366fb3a409c78452c8dfe41e3e69ca5","abstract_canon_sha256":"3334a2a59be1f2de2658a70c772bd1d1aa0f65d643f9586aa23bb7d08288f517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:43.184121Z","signature_b64":"9rLPc0o8YUep+GxvfaULKGKkU0HFjOpXe0BD8ASrP00gECvMMn+6gb18Xk3NZ2o6O5aePO7EenVXQizj778eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a071f3c0c77d5be8b517f5b333cce97671e26bf3af825ef9ff208f81d5241c2d","last_reissued_at":"2026-07-05T02:15:43.183640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:43.183640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Embedding based Neighborhood Aggregation Method for Inductive Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Arun Iyer, Rahul Ragesh, Ramakrishna Bairi, Sundararajan Sellamanickam, Vijay Lingam","submitted_at":"2021-02-15T14:30:01Z","abstract_excerpt":"We consider the problem of learning latent features (aka embedding) for users and items in a recommendation setting. Given only a user-item interaction graph, the goal is to recommend items for each user. Traditional approaches employ matrix factorization-based collaborative filtering methods. Recent methods using graph convolutional networks (e.g., LightGCN) achieve state-of-the-art performance. They learn both user and item embedding. One major drawback of most existing methods is that they are not inductive; they do not generalize for users and items unseen during training. Besides, existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07575","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/2102.07575/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":"2102.07575","created_at":"2026-07-05T02:15:43.183701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07575v2","created_at":"2026-07-05T02:15:43.183701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07575","created_at":"2026-07-05T02:15:43.183701+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBY7HQGHPVN6","created_at":"2026-07-05T02:15:43.183701+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBY7HQGHPVN6RNIX","created_at":"2026-07-05T02:15:43.183701+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBY7HQGH","created_at":"2026-07-05T02:15:43.183701+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/UBY7HQGHPVN6RNIX6WZTHTHJOZ","json":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ.json","graph_json":"https://pith.science/api/pith-number/UBY7HQGHPVN6RNIX6WZTHTHJOZ/graph.json","events_json":"https://pith.science/api/pith-number/UBY7HQGHPVN6RNIX6WZTHTHJOZ/events.json","paper":"https://pith.science/paper/UBY7HQGH"},"agent_actions":{"view_html":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ","download_json":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ.json","view_paper":"https://pith.science/paper/UBY7HQGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07575&json=true","fetch_graph":"https://pith.science/api/pith-number/UBY7HQGHPVN6RNIX6WZTHTHJOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UBY7HQGHPVN6RNIX6WZTHTHJOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ/action/storage_attestation","attest_author":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ/action/author_attestation","sign_citation":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ/action/citation_signature","submit_replication":"https://pith.science/pith/UBY7HQGHPVN6RNIX6WZTHTHJOZ/action/replication_record"}},"created_at":"2026-07-05T02:15:43.183701+00:00","updated_at":"2026-07-05T02:15:43.183701+00:00"}