{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Z7SL4GYYA3MVOUZ5NZM7FWAARL","short_pith_number":"pith:Z7SL4GYY","schema_version":"1.0","canonical_sha256":"cfe4be1b1806d957533d6e59f2d8008aff5fcb6a94cb9bfa8ee405e0699b5131","source":{"kind":"arxiv","id":"2006.05639","version":2},"attestation_state":"computed","paper":{"title":"Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.IR","authors_text":"Guorui Zhou, Kun Gai, Lejian Ren, Pi Qi, Xiaoqiang Zhu, Ying Fan, Yujing Zhang, Zhe Wang","submitted_at":"2020-06-10T03:41:15Z","abstract_excerpt":"Rich user behavior data has been proven to be of great value for click-through rate prediction tasks, especially in industrial applications such as recommender systems and online advertising. Both industry and academy have paid much attention to this topic and propose different approaches to modeling with long sequential user behavior data. Among them, memory network based model MIMN proposed by Alibaba, achieves SOTA with the co-design of both learning algorithm and serving system. MIMN is the first industrial solution that can model sequential user behavior data with length scaling up to 100"},"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":"2006.05639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-06-10T03:41:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6540026af0deeefe73611968573d17a3008ebe14249bb3632f2ba9940bd6bf3e","abstract_canon_sha256":"616a2060975bc88458d16fd666b325991f5359adc3c996030f174d360b327dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:14:01.260213Z","signature_b64":"pzNbdEJy82pAQtmVmxZ8JqG4uVezMFL38hTW9DPUuf3UjA69wxquUcZgsuMU7526A7XJuMsTR4xvwqc3MXzJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfe4be1b1806d957533d6e59f2d8008aff5fcb6a94cb9bfa8ee405e0699b5131","last_reissued_at":"2026-07-05T01:14:01.259680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:14:01.259680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.IR","authors_text":"Guorui Zhou, Kun Gai, Lejian Ren, Pi Qi, Xiaoqiang Zhu, Ying Fan, Yujing Zhang, Zhe Wang","submitted_at":"2020-06-10T03:41:15Z","abstract_excerpt":"Rich user behavior data has been proven to be of great value for click-through rate prediction tasks, especially in industrial applications such as recommender systems and online advertising. Both industry and academy have paid much attention to this topic and propose different approaches to modeling with long sequential user behavior data. Among them, memory network based model MIMN proposed by Alibaba, achieves SOTA with the co-design of both learning algorithm and serving system. MIMN is the first industrial solution that can model sequential user behavior data with length scaling up to 100"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05639","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/2006.05639/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":"2006.05639","created_at":"2026-07-05T01:14:01.259751+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05639v2","created_at":"2026-07-05T01:14:01.259751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05639","created_at":"2026-07-05T01:14:01.259751+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7SL4GYYA3MV","created_at":"2026-07-05T01:14:01.259751+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7SL4GYYA3MVOUZ5","created_at":"2026-07-05T01:14:01.259751+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7SL4GYY","created_at":"2026-07-05T01:14:01.259751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25726","citing_title":"SIREN: Unified Multi-Granularity Semantic Interaction for Multi-Modal Lifelong User Interest Modeling","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27450","citing_title":"Context Features Are Cheap: Rank-Aware Decomposition for Efficient Feature Interaction in Recommender Systems","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25583","citing_title":"LENS: A Staged Design for Interaction Granularity in Sequential CTR Prediction","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2411.11508","citing_title":"Beyond the Trigger: Learning Collaborative Context for Generalizable Trigger-Induced Recommendation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2411.11502","citing_title":"All-domain Moveline Evolution Network for Click-Through Rate Prediction","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2510.11317","citing_title":"Next Interest Flow: A Generative Pre-training Paradigm for Recommender Systems by Modeling All-domain Movelines","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24806","citing_title":"Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL","json":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL.json","graph_json":"https://pith.science/api/pith-number/Z7SL4GYYA3MVOUZ5NZM7FWAARL/graph.json","events_json":"https://pith.science/api/pith-number/Z7SL4GYYA3MVOUZ5NZM7FWAARL/events.json","paper":"https://pith.science/paper/Z7SL4GYY"},"agent_actions":{"view_html":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL","download_json":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL.json","view_paper":"https://pith.science/paper/Z7SL4GYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05639&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7SL4GYYA3MVOUZ5NZM7FWAARL/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7SL4GYYA3MVOUZ5NZM7FWAARL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL/action/storage_attestation","attest_author":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL/action/author_attestation","sign_citation":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL/action/citation_signature","submit_replication":"https://pith.science/pith/Z7SL4GYYA3MVOUZ5NZM7FWAARL/action/replication_record"}},"created_at":"2026-07-05T01:14:01.259751+00:00","updated_at":"2026-07-05T01:14:01.259751+00:00"}