{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZWUFML7GS4DDDMY5W4FBKP7N62","short_pith_number":"pith:ZWUFML7G","schema_version":"1.0","canonical_sha256":"cda8562fe6970631b31db70a153fedf6a1e18ddbe94eeb11270d6fa352a3f6b8","source":{"kind":"arxiv","id":"2406.10244","version":3},"attestation_state":"computed","paper":{"title":"GLINT-RU: Gated Lightweight Intelligent Recurrent Units for Sequential Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jingtong Gao, Maolin Wang, Sheng Zhang, Tong Xu, Wanyu Wang, Xiangyu Zhao, Xuetao Wei, Yu Yang, Zitao Liu","submitted_at":"2024-06-06T13:55:55Z","abstract_excerpt":"Transformer-based models have gained significant traction in sequential recommender systems (SRSs) for their ability to capture user-item interactions effectively. However, these models often suffer from high computational costs and slow inference. Meanwhile, existing efficient SRS approaches struggle to embed high-quality semantic and positional information into latent representations. To tackle these challenges, this paper introduces GLINT-RU, a lightweight and efficient SRS leveraging a single-layer dense selective Gated Recurrent Units (GRU) module to accelerate inference. By incorporating"},"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":"2406.10244","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-06-06T13:55:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d5884edc06414b73b529351ed5bff3972bd08473611dbad2439cc1dd1f2f36f4","abstract_canon_sha256":"80be6f70551e270147b1f269a10e189c12a8646f2ba41652b955133d6734d9cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:16.881692Z","signature_b64":"E0oL8R+eeeoh/c0O3psdY5/JCNzW4pinbgdtgbHiW5mv8bHMGrT2r07H51KtLSKm/gcA8RNucdfwfyhEkFLIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda8562fe6970631b31db70a153fedf6a1e18ddbe94eeb11270d6fa352a3f6b8","last_reissued_at":"2026-07-05T10:48:16.881120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:16.881120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GLINT-RU: Gated Lightweight Intelligent Recurrent Units for Sequential Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jingtong Gao, Maolin Wang, Sheng Zhang, Tong Xu, Wanyu Wang, Xiangyu Zhao, Xuetao Wei, Yu Yang, Zitao Liu","submitted_at":"2024-06-06T13:55:55Z","abstract_excerpt":"Transformer-based models have gained significant traction in sequential recommender systems (SRSs) for their ability to capture user-item interactions effectively. However, these models often suffer from high computational costs and slow inference. Meanwhile, existing efficient SRS approaches struggle to embed high-quality semantic and positional information into latent representations. To tackle these challenges, this paper introduces GLINT-RU, a lightweight and efficient SRS leveraging a single-layer dense selective Gated Recurrent Units (GRU) module to accelerate inference. By incorporating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10244","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/2406.10244/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":"2406.10244","created_at":"2026-07-05T10:48:16.881191+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10244v3","created_at":"2026-07-05T10:48:16.881191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10244","created_at":"2026-07-05T10:48:16.881191+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWUFML7GS4DD","created_at":"2026-07-05T10:48:16.881191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWUFML7GS4DDDMY5","created_at":"2026-07-05T10:48:16.881191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWUFML7G","created_at":"2026-07-05T10:48:16.881191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03484","citing_title":"STAR-Rec: Making Peace with Length Variance and Pattern Diversity in Sequential Recommendation","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62","json":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62.json","graph_json":"https://pith.science/api/pith-number/ZWUFML7GS4DDDMY5W4FBKP7N62/graph.json","events_json":"https://pith.science/api/pith-number/ZWUFML7GS4DDDMY5W4FBKP7N62/events.json","paper":"https://pith.science/paper/ZWUFML7G"},"agent_actions":{"view_html":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62","download_json":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62.json","view_paper":"https://pith.science/paper/ZWUFML7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10244&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWUFML7GS4DDDMY5W4FBKP7N62/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWUFML7GS4DDDMY5W4FBKP7N62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62/action/storage_attestation","attest_author":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62/action/author_attestation","sign_citation":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62/action/citation_signature","submit_replication":"https://pith.science/pith/ZWUFML7GS4DDDMY5W4FBKP7N62/action/replication_record"}},"created_at":"2026-07-05T10:48:16.881191+00:00","updated_at":"2026-07-05T10:48:16.881191+00:00"}