{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7FDVYOMN7OZWC5UHDLFXXB2QFM","short_pith_number":"pith:7FDVYOMN","schema_version":"1.0","canonical_sha256":"f9475c398dfbb36176871acb7b87502b2819f219dd85a9e1f245bb3150c25a6c","source":{"kind":"arxiv","id":"1909.04276","version":4},"attestation_state":"computed","paper":{"title":"NISER: Normalized Item and Session Representations to Handle Popularity Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Diksha Garg, Gautam Shroff, Lovekesh Vig, Pankaj Malhotra, Priyanka Gupta","submitted_at":"2019-09-10T04:24:35Z","abstract_excerpt":"The goal of session-based recommendation (SR) models is to utilize the information from past actions (e.g. item/product clicks) in a session to recommend items that a user is likely to click next. Recently it has been shown that the sequence of item interactions in a session can be modeled as graph-structured data to better account for complex item transitions. Graph neural networks (GNNs) can learn useful representations for such session-graphs, and have been shown to improve over sequential models such as recurrent neural networks [14]. However, we note that these GNN-based recommendation mo"},"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":"1909.04276","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-09-10T04:24:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fdcdaed694e96ac766303c58ae1d797d5823421e095c92619bd196aea497ea0e","abstract_canon_sha256":"a7957880a9abe3b82914bd383d116f86f4b87acb78aa47f52be65e684b3bf181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:12.469015Z","signature_b64":"36A0jqQfDQNY+/XP8+oN0swX9XpyS7oXI1/SEsDRqKQ+kbBFPV+if5IRJeF9tIg9fNC7YpwAx9haFJFzIctOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9475c398dfbb36176871acb7b87502b2819f219dd85a9e1f245bb3150c25a6c","last_reissued_at":"2026-07-05T02:20:12.468576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:12.468576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NISER: Normalized Item and Session Representations to Handle Popularity Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Diksha Garg, Gautam Shroff, Lovekesh Vig, Pankaj Malhotra, Priyanka Gupta","submitted_at":"2019-09-10T04:24:35Z","abstract_excerpt":"The goal of session-based recommendation (SR) models is to utilize the information from past actions (e.g. item/product clicks) in a session to recommend items that a user is likely to click next. Recently it has been shown that the sequence of item interactions in a session can be modeled as graph-structured data to better account for complex item transitions. Graph neural networks (GNNs) can learn useful representations for such session-graphs, and have been shown to improve over sequential models such as recurrent neural networks [14]. However, we note that these GNN-based recommendation mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04276","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/1909.04276/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":"1909.04276","created_at":"2026-07-05T02:20:12.468641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04276v4","created_at":"2026-07-05T02:20:12.468641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04276","created_at":"2026-07-05T02:20:12.468641+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FDVYOMN7OZW","created_at":"2026-07-05T02:20:12.468641+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FDVYOMN7OZWC5UH","created_at":"2026-07-05T02:20:12.468641+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FDVYOMN","created_at":"2026-07-05T02:20:12.468641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.19067","citing_title":"PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM","json":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM.json","graph_json":"https://pith.science/api/pith-number/7FDVYOMN7OZWC5UHDLFXXB2QFM/graph.json","events_json":"https://pith.science/api/pith-number/7FDVYOMN7OZWC5UHDLFXXB2QFM/events.json","paper":"https://pith.science/paper/7FDVYOMN"},"agent_actions":{"view_html":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM","download_json":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM.json","view_paper":"https://pith.science/paper/7FDVYOMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04276&json=true","fetch_graph":"https://pith.science/api/pith-number/7FDVYOMN7OZWC5UHDLFXXB2QFM/graph.json","fetch_events":"https://pith.science/api/pith-number/7FDVYOMN7OZWC5UHDLFXXB2QFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM/action/storage_attestation","attest_author":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM/action/author_attestation","sign_citation":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM/action/citation_signature","submit_replication":"https://pith.science/pith/7FDVYOMN7OZWC5UHDLFXXB2QFM/action/replication_record"}},"created_at":"2026-07-05T02:20:12.468641+00:00","updated_at":"2026-07-05T02:20:12.468641+00:00"}