{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y7EMMJCW43C52N2KGXLVIFLKCE","short_pith_number":"pith:Y7EMMJCW","schema_version":"1.0","canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","source":{"kind":"arxiv","id":"1805.09484","version":3},"attestation_state":"computed","paper":{"title":"Multi-Level Deep Cascade Trees for Conversion Rate Prediction in Recommendation System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hong Wen, Jing Zhang, Keping Yang, Pipei Huang, Quan Lin","submitted_at":"2018-05-24T02:22:08Z","abstract_excerpt":"Developing effective and efficient recommendation methods is very challenging for modern e-commerce platforms. Generally speaking, two essential modules named \"Click-Through Rate Prediction\" (\\textit{CTR}) and \"Conversion Rate Prediction\" (\\textit{CVR}) are included, where \\textit{CVR} module is a crucial factor that affects the final purchasing volume directly. However, it is indeed very challenging due to its sparseness nature. In this paper, we tackle this problem by proposing multi-Level Deep Cascade Trees (\\textit{ldcTree}), which is a novel decision tree ensemble approach. It leverages d"},"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":"1805.09484","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-24T02:22:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e92819c87f65e1b691b3a191f4b6b4f011555ef39fcbdaf2a8aba6394b701b13","abstract_canon_sha256":"48d66f0e503eab44946686382011d481b765bfc06261f4d01c0f331a086fea98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.268138Z","signature_b64":"yNA+U5yAMEzsiezozeRRbW1yUqysSO1CL27sEendA/CknEcrmybGzgCEKGe+MwqxDMVYoeKsa0e+0ZfvCj+HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","last_reissued_at":"2026-05-18T00:00:30.267607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.267607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Level Deep Cascade Trees for Conversion Rate Prediction in Recommendation System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hong Wen, Jing Zhang, Keping Yang, Pipei Huang, Quan Lin","submitted_at":"2018-05-24T02:22:08Z","abstract_excerpt":"Developing effective and efficient recommendation methods is very challenging for modern e-commerce platforms. Generally speaking, two essential modules named \"Click-Through Rate Prediction\" (\\textit{CTR}) and \"Conversion Rate Prediction\" (\\textit{CVR}) are included, where \\textit{CVR} module is a crucial factor that affects the final purchasing volume directly. However, it is indeed very challenging due to its sparseness nature. In this paper, we tackle this problem by proposing multi-Level Deep Cascade Trees (\\textit{ldcTree}), which is a novel decision tree ensemble approach. It leverages d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09484","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":""},"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":"1805.09484","created_at":"2026-05-18T00:00:30.267691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09484v3","created_at":"2026-05-18T00:00:30.267691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09484","created_at":"2026-05-18T00:00:30.267691+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7EMMJCW43C5","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7EMMJCW43C52N2K","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7EMMJCW","created_at":"2026-05-18T12:33:04.347982+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/Y7EMMJCW43C52N2KGXLVIFLKCE","json":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE.json","graph_json":"https://pith.science/api/pith-number/Y7EMMJCW43C52N2KGXLVIFLKCE/graph.json","events_json":"https://pith.science/api/pith-number/Y7EMMJCW43C52N2KGXLVIFLKCE/events.json","paper":"https://pith.science/paper/Y7EMMJCW"},"agent_actions":{"view_html":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE","download_json":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE.json","view_paper":"https://pith.science/paper/Y7EMMJCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09484&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7EMMJCW43C52N2KGXLVIFLKCE/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7EMMJCW43C52N2KGXLVIFLKCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/action/storage_attestation","attest_author":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/action/author_attestation","sign_citation":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/action/citation_signature","submit_replication":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/action/replication_record"}},"created_at":"2026-05-18T00:00:30.267691+00:00","updated_at":"2026-05-18T00:00:30.267691+00:00"}