{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KXASW4ZYY4LFB4JDTHQTCS4RW7","short_pith_number":"pith:KXASW4ZY","schema_version":"1.0","canonical_sha256":"55c12b7338c71650f12399e1314b91b7e6c6a3e9070e6dc6159f8f89d2b29784","source":{"kind":"arxiv","id":"2408.11623","version":2},"attestation_state":"computed","paper":{"title":"End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dugang Liu, Hao Yang, Xing Tang, Xiuqiang He, Yunpeng Weng, Zexu Sun","submitted_at":"2024-08-21T13:48:00Z","abstract_excerpt":"In modern online platforms, incentives are essential factors that enhance user engagement and increase platform revenue. Over recent years, uplift modeling has been introduced as a strategic approach to assign incentives to individual customers. Especially in many real-world applications, online platforms can only incentivize customers with specific budget constraints. This problem can be reformulated as the multi-choice knapsack problem. This optimization aims to select the optimal incentive for each customer to maximize the return on investment. Recent works in this field frequently tackle t"},"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":"2408.11623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-08-21T13:48:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c9503ca18ea025c2d91f9573f0b99b280b372690bd613f5c8f768db098492a4e","abstract_canon_sha256":"142dd265ec7a7c4f22359556ca2790960f14d2a8b0544e80f85be9f02f6e9383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:47.162304Z","signature_b64":"AOq8ciznGwXErpBB1HDtaQQGXBLaBJaNOi2iT8MNb+c+V8dFAOSGY/4H09LSdhH0sT5ga+QomrJWLW4Y/MBzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c12b7338c71650f12399e1314b91b7e6c6a3e9070e6dc6159f8f89d2b29784","last_reissued_at":"2026-07-05T08:58:47.161851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:47.161851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dugang Liu, Hao Yang, Xing Tang, Xiuqiang He, Yunpeng Weng, Zexu Sun","submitted_at":"2024-08-21T13:48:00Z","abstract_excerpt":"In modern online platforms, incentives are essential factors that enhance user engagement and increase platform revenue. Over recent years, uplift modeling has been introduced as a strategic approach to assign incentives to individual customers. Especially in many real-world applications, online platforms can only incentivize customers with specific budget constraints. This problem can be reformulated as the multi-choice knapsack problem. This optimization aims to select the optimal incentive for each customer to maximize the return on investment. Recent works in this field frequently tackle t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11623","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/2408.11623/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":"2408.11623","created_at":"2026-07-05T08:58:47.161917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11623v2","created_at":"2026-07-05T08:58:47.161917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11623","created_at":"2026-07-05T08:58:47.161917+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXASW4ZYY4LF","created_at":"2026-07-05T08:58:47.161917+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXASW4ZYY4LFB4JD","created_at":"2026-07-05T08:58:47.161917+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXASW4ZY","created_at":"2026-07-05T08:58:47.161917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05511","citing_title":"Deep Learning of Continuous and Structured Policies for Aggregated Heterogeneous Treatment Effects","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7","json":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7.json","graph_json":"https://pith.science/api/pith-number/KXASW4ZYY4LFB4JDTHQTCS4RW7/graph.json","events_json":"https://pith.science/api/pith-number/KXASW4ZYY4LFB4JDTHQTCS4RW7/events.json","paper":"https://pith.science/paper/KXASW4ZY"},"agent_actions":{"view_html":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7","download_json":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7.json","view_paper":"https://pith.science/paper/KXASW4ZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11623&json=true","fetch_graph":"https://pith.science/api/pith-number/KXASW4ZYY4LFB4JDTHQTCS4RW7/graph.json","fetch_events":"https://pith.science/api/pith-number/KXASW4ZYY4LFB4JDTHQTCS4RW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7/action/storage_attestation","attest_author":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7/action/author_attestation","sign_citation":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7/action/citation_signature","submit_replication":"https://pith.science/pith/KXASW4ZYY4LFB4JDTHQTCS4RW7/action/replication_record"}},"created_at":"2026-07-05T08:58:47.161917+00:00","updated_at":"2026-07-05T08:58:47.161917+00:00"}