{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Y2QAIWOODXAB6VJSIUWQ7DLTT5","short_pith_number":"pith:Y2QAIWOO","schema_version":"1.0","canonical_sha256":"c6a00459ce1dc01f5532452d0f8d739f5eebbcfc3c3128f3647168836b8d082b","source":{"kind":"arxiv","id":"2401.01369","version":1},"attestation_state":"computed","paper":{"title":"RL-MPCA: A Reinforcement Learning Based Multi-Phase Computation Allocation Approach for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Bo Tang, Dong Wang, Guoliang Yang, Jiahong Zhou, Lebin Lin, Qianlong Xie, Shunhui Mao, Xingxing Wang","submitted_at":"2023-12-27T12:40:19Z","abstract_excerpt":"Recommender systems aim to recommend the most suitable items to users from a large number of candidates. Their computation cost grows as the number of user requests and the complexity of services (or models) increases. Under the limitation of computation resources (CRs), how to make a trade-off between computation cost and business revenue becomes an essential question. The existing studies focus on dynamically allocating CRs in queue truncation scenarios (i.e., allocating the size of candidates), and formulate the CR allocation problem as an optimization problem with constraints. Some of them"},"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":"2401.01369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-12-27T12:40:19Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4bad95b21d3f023d0d473bef11876231493c849deb0228f8bb571e660a765ddb","abstract_canon_sha256":"f18e857559991573ef959ca9b6ba9eccf6e68b6778b8fcf56929cdee661a0618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:42.042504Z","signature_b64":"t64WgwJqJNXRBd4HWHWxFviorSvyDivBjDS71h8SkuW1DEO9hW+ExXldva58Et93TmBunJ6LN1wzzUJz0tCCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a00459ce1dc01f5532452d0f8d739f5eebbcfc3c3128f3647168836b8d082b","last_reissued_at":"2026-07-05T07:29:42.042112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:42.042112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RL-MPCA: A Reinforcement Learning Based Multi-Phase Computation Allocation Approach for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Bo Tang, Dong Wang, Guoliang Yang, Jiahong Zhou, Lebin Lin, Qianlong Xie, Shunhui Mao, Xingxing Wang","submitted_at":"2023-12-27T12:40:19Z","abstract_excerpt":"Recommender systems aim to recommend the most suitable items to users from a large number of candidates. Their computation cost grows as the number of user requests and the complexity of services (or models) increases. Under the limitation of computation resources (CRs), how to make a trade-off between computation cost and business revenue becomes an essential question. The existing studies focus on dynamically allocating CRs in queue truncation scenarios (i.e., allocating the size of candidates), and formulate the CR allocation problem as an optimization problem with constraints. Some of them"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01369","kind":"arxiv","version":1},"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/2401.01369/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":"2401.01369","created_at":"2026-07-05T07:29:42.042162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01369v1","created_at":"2026-07-05T07:29:42.042162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01369","created_at":"2026-07-05T07:29:42.042162+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2QAIWOODXAB","created_at":"2026-07-05T07:29:42.042162+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2QAIWOODXAB6VJS","created_at":"2026-07-05T07:29:42.042162+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2QAIWOO","created_at":"2026-07-05T07:29:42.042162+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/Y2QAIWOODXAB6VJSIUWQ7DLTT5","json":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5.json","graph_json":"https://pith.science/api/pith-number/Y2QAIWOODXAB6VJSIUWQ7DLTT5/graph.json","events_json":"https://pith.science/api/pith-number/Y2QAIWOODXAB6VJSIUWQ7DLTT5/events.json","paper":"https://pith.science/paper/Y2QAIWOO"},"agent_actions":{"view_html":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5","download_json":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5.json","view_paper":"https://pith.science/paper/Y2QAIWOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01369&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2QAIWOODXAB6VJSIUWQ7DLTT5/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2QAIWOODXAB6VJSIUWQ7DLTT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5/action/storage_attestation","attest_author":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5/action/author_attestation","sign_citation":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5/action/citation_signature","submit_replication":"https://pith.science/pith/Y2QAIWOODXAB6VJSIUWQ7DLTT5/action/replication_record"}},"created_at":"2026-07-05T07:29:42.042162+00:00","updated_at":"2026-07-05T07:29:42.042162+00:00"}