{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y7EMMJCW43C52N2KGXLVIFLKCE","short_pith_number":"pith:Y7EMMJCW","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"},"canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","source":{"kind":"arxiv","id":"1805.09484","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09484","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09484v3","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09484","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y7EMMJCW43C5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y7EMMJCW43C52N2K","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y7EMMJCW","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y7EMMJCW43C52N2KGXLVIFLKCE","target":"record","payload":{"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"},"canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","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"},"source_kind":"arxiv","source_id":"1805.09484","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFEReuTBEghqqkOSQO0Jf+arZPxkGZU6EVuPYyUX310SFtcL6bNi5prXmyb1cOQLFoEfyf0Df9uQjRU0IrL2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:48:31.380071Z"},"content_sha256":"478fbbaa15298c55b1cef90f16f029a640542e5e3e86cefbab839d7c18fd785f","schema_version":"1.0","event_id":"sha256:478fbbaa15298c55b1cef90f16f029a640542e5e3e86cefbab839d7c18fd785f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y7EMMJCW43C52N2KGXLVIFLKCE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwMiHVko/LmhDN+rkbQ8dmpyAz1L6m2k2OALlXrnWtz0FwdOZURccAbgVYIHPIGejjsSV8+4gj/BYDAlxtQ+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:48:31.380675Z"},"content_sha256":"e3059208836e5ac338218adc6ef9b9043072078ffe2e3fab54bd835400a70fd5","schema_version":"1.0","event_id":"sha256:e3059208836e5ac338218adc6ef9b9043072078ffe2e3fab54bd835400a70fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/bundle.json","state_url":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T07:48:31Z","links":{"resolver":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE","bundle":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/bundle.json","state":"https://pith.science/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7EMMJCW43C52N2KGXLVIFLKCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y7EMMJCW43C52N2KGXLVIFLKCE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48d66f0e503eab44946686382011d481b765bfc06261f4d01c0f331a086fea98","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-24T02:22:08Z","title_canon_sha256":"e92819c87f65e1b691b3a191f4b6b4f011555ef39fcbdaf2a8aba6394b701b13"},"schema_version":"1.0","source":{"id":"1805.09484","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09484","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09484v3","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09484","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y7EMMJCW43C5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y7EMMJCW43C52N2K","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y7EMMJCW","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:e3059208836e5ac338218adc6ef9b9043072078ffe2e3fab54bd835400a70fd5","target":"graph","created_at":"2026-05-18T00:00:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hong Wen, Jing Zhang, Keping Yang, Pipei Huang, Quan Lin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-24T02:22:08Z","title":"Multi-Level Deep Cascade Trees for Conversion Rate Prediction in Recommendation System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09484","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:478fbbaa15298c55b1cef90f16f029a640542e5e3e86cefbab839d7c18fd785f","target":"record","created_at":"2026-05-18T00:00:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48d66f0e503eab44946686382011d481b765bfc06261f4d01c0f331a086fea98","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-24T02:22:08Z","title_canon_sha256":"e92819c87f65e1b691b3a191f4b6b4f011555ef39fcbdaf2a8aba6394b701b13"},"schema_version":"1.0","source":{"id":"1805.09484","kind":"arxiv","version":3}},"canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7c8c62456e6c5dd374a35d754156a11224aae05d680fe3071f5cecae363e0d9","first_computed_at":"2026-05-18T00:00:30.267607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:30.267607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yNA+U5yAMEzsiezozeRRbW1yUqysSO1CL27sEendA/CknEcrmybGzgCEKGe+MwqxDMVYoeKsa0e+0ZfvCj+HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:30.268138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09484","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:478fbbaa15298c55b1cef90f16f029a640542e5e3e86cefbab839d7c18fd785f","sha256:e3059208836e5ac338218adc6ef9b9043072078ffe2e3fab54bd835400a70fd5"],"state_sha256":"bebca220b777d83360a68f477eacecc5a35c19e2d13dafe3772701afd46ee1b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f13JZpU8K/b/tYT5mvBLuP3mvFIMzvvpOuJ6/4h+3amzd+xI327S97iJX7FDiEuUD4MC/JWR10kT6LIvpNqSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:48:31.383629Z","bundle_sha256":"2da1aea2594e84f8668d2fb7dae85907143b8998783ec1a68a84fd0dbe6956eb"}}