{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:W6AI67XDMLEEWKCBBJEOYVVWKO","short_pith_number":"pith:W6AI67XD","schema_version":"1.0","canonical_sha256":"b7808f7ee362c84b28410a48ec56b6539fa0ad87e4873eccbb03728053d4c8a2","source":{"kind":"arxiv","id":"2307.09193","version":2},"attestation_state":"computed","paper":{"title":"ESMC: Entire Space Multi-Task Model for Post-Click Conversion Rate via Parameter Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Biao Zeng, Hao Feng, Jia Jia, Jicong Fan, Jie Zhang, Jin Liu, Ning Hu, Xingyu Chen, Xuguang Lan, Zhenhao Jiang","submitted_at":"2023-07-18T12:25:40Z","abstract_excerpt":"Large-scale online recommender system spreads all over the Internet being in charge of two basic tasks: Click-Through Rate (CTR) and Post-Click Conversion Rate (CVR) estimations. However, traditional CVR estimators suffer from well-known Sample Selection Bias and Data Sparsity issues. Entire space models were proposed to address the two issues via tracing the decision-making path of \"exposure_click_purchase\". Further, some researchers observed that there are purchase-related behaviors between click and purchase, which can better draw the user's decision-making intention and improve the recomme"},"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":"2307.09193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-18T12:25:40Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"eb04ad4c3649ce0111d3b2ec664acc15dff8d74fac25d03afb4a611cff7ee1c4","abstract_canon_sha256":"33a05b4a96938a2341f14bad92dce870fc4ced0f296647516e69c25972573422"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:53.381209Z","signature_b64":"GPbrwn8NhSN+t0O1wfWO4VmAZJnatqwyq5WBDYOc5Ivxd/y4yfcf4CvmEZs540ZPQu/uBKUKHWKAnBsVWGhtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7808f7ee362c84b28410a48ec56b6539fa0ad87e4873eccbb03728053d4c8a2","last_reissued_at":"2026-07-05T06:35:53.380794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:53.380794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ESMC: Entire Space Multi-Task Model for Post-Click Conversion Rate via Parameter Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Biao Zeng, Hao Feng, Jia Jia, Jicong Fan, Jie Zhang, Jin Liu, Ning Hu, Xingyu Chen, Xuguang Lan, Zhenhao Jiang","submitted_at":"2023-07-18T12:25:40Z","abstract_excerpt":"Large-scale online recommender system spreads all over the Internet being in charge of two basic tasks: Click-Through Rate (CTR) and Post-Click Conversion Rate (CVR) estimations. However, traditional CVR estimators suffer from well-known Sample Selection Bias and Data Sparsity issues. Entire space models were proposed to address the two issues via tracing the decision-making path of \"exposure_click_purchase\". Further, some researchers observed that there are purchase-related behaviors between click and purchase, which can better draw the user's decision-making intention and improve the recomme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.09193","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/2307.09193/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":"2307.09193","created_at":"2026-07-05T06:35:53.380849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.09193v2","created_at":"2026-07-05T06:35:53.380849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.09193","created_at":"2026-07-05T06:35:53.380849+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6AI67XDMLEE","created_at":"2026-07-05T06:35:53.380849+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6AI67XDMLEEWKCB","created_at":"2026-07-05T06:35:53.380849+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6AI67XD","created_at":"2026-07-05T06:35:53.380849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14268","citing_title":"Pre-train and Fine-tune: Recommenders as Large Models","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO","json":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO.json","graph_json":"https://pith.science/api/pith-number/W6AI67XDMLEEWKCBBJEOYVVWKO/graph.json","events_json":"https://pith.science/api/pith-number/W6AI67XDMLEEWKCBBJEOYVVWKO/events.json","paper":"https://pith.science/paper/W6AI67XD"},"agent_actions":{"view_html":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO","download_json":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO.json","view_paper":"https://pith.science/paper/W6AI67XD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.09193&json=true","fetch_graph":"https://pith.science/api/pith-number/W6AI67XDMLEEWKCBBJEOYVVWKO/graph.json","fetch_events":"https://pith.science/api/pith-number/W6AI67XDMLEEWKCBBJEOYVVWKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO/action/storage_attestation","attest_author":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO/action/author_attestation","sign_citation":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO/action/citation_signature","submit_replication":"https://pith.science/pith/W6AI67XDMLEEWKCBBJEOYVVWKO/action/replication_record"}},"created_at":"2026-07-05T06:35:53.380849+00:00","updated_at":"2026-07-05T06:35:53.380849+00:00"}