{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FQD4THBEWJRQDA7I563HJP435R","short_pith_number":"pith:FQD4THBE","schema_version":"1.0","canonical_sha256":"2c07c99c24b2630183e8efb674bf9bec58f4017c60d3d1a7a8e5c06fd2460c33","source":{"kind":"arxiv","id":"2402.15164","version":3},"attestation_state":"computed","paper":{"title":"EasyRL4Rec: An Easy-to-use Library for Reinforcement Learning Based Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Chongming Gao, Heng Tang, Jiawei Chen, Min Zhang, Qian Chen, Weizhi Ma, Yuanqing Yu, Yuefeng Sun","submitted_at":"2024-02-23T07:54:26Z","abstract_excerpt":"Reinforcement Learning (RL)-Based Recommender Systems (RSs) have gained rising attention for their potential to enhance long-term user engagement. However, research in this field faces challenges, including the lack of user-friendly frameworks, inconsistent evaluation metrics, and difficulties in reproducing existing studies. To tackle these issues, we introduce EasyRL4Rec, an easy-to-use code library designed specifically for RL-based RSs. This library provides lightweight and diverse RL environments based on five public datasets and includes core modules with rich options, simplifying model "},"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":"2402.15164","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-23T07:54:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7749f36cafae9d85020e00970c04e236a65d2e10751d142f13f1bbd41cedec69","abstract_canon_sha256":"e85f0033ba626662a8fef517cfe766dd73e905d39ffc152ddc872090a3831a53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:37.871970Z","signature_b64":"rV7HmJ/edFLexskEXS2L6yQHDWNdaqEBYYuh74WjOq9t9x2Ye+K20vP50viL1CD6ubGrhxvRe2gLi2n1e3x4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c07c99c24b2630183e8efb674bf9bec58f4017c60d3d1a7a8e5c06fd2460c33","last_reissued_at":"2026-07-05T08:22:37.871435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:37.871435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EasyRL4Rec: An Easy-to-use Library for Reinforcement Learning Based Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Chongming Gao, Heng Tang, Jiawei Chen, Min Zhang, Qian Chen, Weizhi Ma, Yuanqing Yu, Yuefeng Sun","submitted_at":"2024-02-23T07:54:26Z","abstract_excerpt":"Reinforcement Learning (RL)-Based Recommender Systems (RSs) have gained rising attention for their potential to enhance long-term user engagement. However, research in this field faces challenges, including the lack of user-friendly frameworks, inconsistent evaluation metrics, and difficulties in reproducing existing studies. To tackle these issues, we introduce EasyRL4Rec, an easy-to-use code library designed specifically for RL-based RSs. This library provides lightweight and diverse RL environments based on five public datasets and includes core modules with rich options, simplifying model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15164","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/2402.15164/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":"2402.15164","created_at":"2026-07-05T08:22:37.871501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.15164v3","created_at":"2026-07-05T08:22:37.871501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15164","created_at":"2026-07-05T08:22:37.871501+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQD4THBEWJRQ","created_at":"2026-07-05T08:22:37.871501+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQD4THBEWJRQDA7I","created_at":"2026-07-05T08:22:37.871501+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQD4THBE","created_at":"2026-07-05T08:22:37.871501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01352","citing_title":"FlowTime: Towards Continuous Generative Watch Time Prediction via Flow-based Personalized Priors","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R","json":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R.json","graph_json":"https://pith.science/api/pith-number/FQD4THBEWJRQDA7I563HJP435R/graph.json","events_json":"https://pith.science/api/pith-number/FQD4THBEWJRQDA7I563HJP435R/events.json","paper":"https://pith.science/paper/FQD4THBE"},"agent_actions":{"view_html":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R","download_json":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R.json","view_paper":"https://pith.science/paper/FQD4THBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.15164&json=true","fetch_graph":"https://pith.science/api/pith-number/FQD4THBEWJRQDA7I563HJP435R/graph.json","fetch_events":"https://pith.science/api/pith-number/FQD4THBEWJRQDA7I563HJP435R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R/action/storage_attestation","attest_author":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R/action/author_attestation","sign_citation":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R/action/citation_signature","submit_replication":"https://pith.science/pith/FQD4THBEWJRQDA7I563HJP435R/action/replication_record"}},"created_at":"2026-07-05T08:22:37.871501+00:00","updated_at":"2026-07-05T08:22:37.871501+00:00"}