{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5SLO2RQEBUG3D2ELUHUKYDHRII","short_pith_number":"pith:5SLO2RQE","schema_version":"1.0","canonical_sha256":"ec96ed46040d0db1e88ba1e8ac0cf142026c21003ddb5a342d35bc1ea3718e51","source":{"kind":"arxiv","id":"1801.02294","version":5},"attestation_state":"computed","paper":{"title":"Learning Tree-based Deep Model for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Guozheng Li, Han Li, Han Zhu, Jie He, Kun Gai, Pengye Zhang, Xiang Li","submitted_at":"2018-01-08T02:52:20Z","abstract_excerpt":"Model-based methods for recommender systems have been studied extensively in recent years. In systems with large corpus, however, the calculation cost for the learnt model to predict all user-item preferences is tremendous, which makes full corpus retrieval extremely difficult. To overcome the calculation barriers, models such as matrix factorization resort to inner product form (i.e., model user-item preference as the inner product of user, item latent factors) and indexes to facilitate efficient approximate k-nearest neighbor searches. However, it still remains challenging to incorporate mor"},"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":"1801.02294","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-08T02:52:20Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"ce51f49a44c9ebe9083de45af97db6a4df990ffaa2ed1a27973673345bdd80f5","abstract_canon_sha256":"71435047798b2b44ec22cffde99d262ac75127175ca4e75520e44e462d7107eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:48.733549Z","signature_b64":"ogCmZgRlWlnHGE3lWprpPfYD/n+toaIoUzpN0Vk1Ii/T/hro7u+6Crg/XqEeSpCwFRf0r+yFcM0cixfxLkZjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec96ed46040d0db1e88ba1e8ac0cf142026c21003ddb5a342d35bc1ea3718e51","last_reissued_at":"2026-05-17T23:57:48.733019Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:48.733019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Tree-based Deep Model for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Guozheng Li, Han Li, Han Zhu, Jie He, Kun Gai, Pengye Zhang, Xiang Li","submitted_at":"2018-01-08T02:52:20Z","abstract_excerpt":"Model-based methods for recommender systems have been studied extensively in recent years. In systems with large corpus, however, the calculation cost for the learnt model to predict all user-item preferences is tremendous, which makes full corpus retrieval extremely difficult. To overcome the calculation barriers, models such as matrix factorization resort to inner product form (i.e., model user-item preference as the inner product of user, item latent factors) and indexes to facilitate efficient approximate k-nearest neighbor searches. However, it still remains challenging to incorporate mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02294","kind":"arxiv","version":5},"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":"1801.02294","created_at":"2026-05-17T23:57:48.733101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02294v5","created_at":"2026-05-17T23:57:48.733101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02294","created_at":"2026-05-17T23:57:48.733101+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SLO2RQEBUG3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SLO2RQEBUG3D2EL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SLO2RQE","created_at":"2026-05-18T12:32:08.215937+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/5SLO2RQEBUG3D2ELUHUKYDHRII","json":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII.json","graph_json":"https://pith.science/api/pith-number/5SLO2RQEBUG3D2ELUHUKYDHRII/graph.json","events_json":"https://pith.science/api/pith-number/5SLO2RQEBUG3D2ELUHUKYDHRII/events.json","paper":"https://pith.science/paper/5SLO2RQE"},"agent_actions":{"view_html":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII","download_json":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII.json","view_paper":"https://pith.science/paper/5SLO2RQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02294&json=true","fetch_graph":"https://pith.science/api/pith-number/5SLO2RQEBUG3D2ELUHUKYDHRII/graph.json","fetch_events":"https://pith.science/api/pith-number/5SLO2RQEBUG3D2ELUHUKYDHRII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII/action/storage_attestation","attest_author":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII/action/author_attestation","sign_citation":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII/action/citation_signature","submit_replication":"https://pith.science/pith/5SLO2RQEBUG3D2ELUHUKYDHRII/action/replication_record"}},"created_at":"2026-05-17T23:57:48.733101+00:00","updated_at":"2026-05-17T23:57:48.733101+00:00"}