{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SAVXE2WD5MSBMT7BCAI7WLT2BI","short_pith_number":"pith:SAVXE2WD","schema_version":"1.0","canonical_sha256":"902b726ac3eb24164fe11011fb2e7a0a378f5a8e1e7bbe72c5672e204de9e8e2","source":{"kind":"arxiv","id":"1902.07565","version":2},"attestation_state":"computed","paper":{"title":"Joint Optimization of Tree-based Index and Deep Model for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Daqing Chang, Han Li, Han Zhu, Jian Xu, Jie He, Kun Gai, Pengye Zhang, Xiang Li, Ziru Xu","submitted_at":"2019-02-19T08:52:58Z","abstract_excerpt":"Large-scale industrial recommender systems are usually confronted with computational problems due to the enormous corpus size. To retrieve and recommend the most relevant items to users under response time limits, resorting to an efficient index structure is an effective and practical solution. The previous work Tree-based Deep Model (TDM) \\cite{zhu2018learning} greatly improves recommendation accuracy using tree index. By indexing items in a tree hierarchy and training a user-node preference prediction model satisfying a max-heap like property in the tree, TDM provides logarithmic computation"},"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":"1902.07565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-19T08:52:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6e846bf3022a6eb74e16a2dc2cbfd4326c0947e3c04347297d502a14b06f73ca","abstract_canon_sha256":"6aa74846a9516e9b4e902ff06734404830261f38c441f765ca76c6e2cacba619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:30.972517Z","signature_b64":"ArnyqUCrVl2GQpY40MxX0YorNg31M6GRtdB1vLJACcbzu9S/ZF2IoIjTFPUT9+0SGv0r7RHDpc6Tbb6IxoXsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902b726ac3eb24164fe11011fb2e7a0a378f5a8e1e7bbe72c5672e204de9e8e2","last_reissued_at":"2026-07-05T00:20:30.972109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:30.972109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Optimization of Tree-based Index and Deep Model for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Daqing Chang, Han Li, Han Zhu, Jian Xu, Jie He, Kun Gai, Pengye Zhang, Xiang Li, Ziru Xu","submitted_at":"2019-02-19T08:52:58Z","abstract_excerpt":"Large-scale industrial recommender systems are usually confronted with computational problems due to the enormous corpus size. To retrieve and recommend the most relevant items to users under response time limits, resorting to an efficient index structure is an effective and practical solution. The previous work Tree-based Deep Model (TDM) \\cite{zhu2018learning} greatly improves recommendation accuracy using tree index. By indexing items in a tree hierarchy and training a user-node preference prediction model satisfying a max-heap like property in the tree, TDM provides logarithmic computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07565","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/1902.07565/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":"1902.07565","created_at":"2026-07-05T00:20:30.972165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07565v2","created_at":"2026-07-05T00:20:30.972165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07565","created_at":"2026-07-05T00:20:30.972165+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAVXE2WD5MSB","created_at":"2026-07-05T00:20:30.972165+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAVXE2WD5MSBMT7B","created_at":"2026-07-05T00:20:30.972165+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAVXE2WD","created_at":"2026-07-05T00:20:30.972165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29970","citing_title":"From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI","json":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI.json","graph_json":"https://pith.science/api/pith-number/SAVXE2WD5MSBMT7BCAI7WLT2BI/graph.json","events_json":"https://pith.science/api/pith-number/SAVXE2WD5MSBMT7BCAI7WLT2BI/events.json","paper":"https://pith.science/paper/SAVXE2WD"},"agent_actions":{"view_html":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI","download_json":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI.json","view_paper":"https://pith.science/paper/SAVXE2WD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07565&json=true","fetch_graph":"https://pith.science/api/pith-number/SAVXE2WD5MSBMT7BCAI7WLT2BI/graph.json","fetch_events":"https://pith.science/api/pith-number/SAVXE2WD5MSBMT7BCAI7WLT2BI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI/action/storage_attestation","attest_author":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI/action/author_attestation","sign_citation":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI/action/citation_signature","submit_replication":"https://pith.science/pith/SAVXE2WD5MSBMT7BCAI7WLT2BI/action/replication_record"}},"created_at":"2026-07-05T00:20:30.972165+00:00","updated_at":"2026-07-05T00:20:30.972165+00:00"}