{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U326WVLKXFQDPBIV6NG5CZ2F4F","short_pith_number":"pith:U326WVLK","schema_version":"1.0","canonical_sha256":"a6f5eb556ab960378515f34dd16745e159e7a7cc445768febe42039a2f156b3d","source":{"kind":"arxiv","id":"1703.05291","version":1},"attestation_state":"computed","paper":{"title":"Deep Embedding Forest: Forest-based Serving with Deep Embedding Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dong Yu, Holakou Rahmanian, JC Mao, Jie Zhu, Ying Shan, Yi Zhang","submitted_at":"2017-03-15T17:48:09Z","abstract_excerpt":"Deep Neural Networks (DNN) have demonstrated superior ability to extract high level embedding vectors from low level features. Despite the success, the serving time is still the bottleneck due to expensive run-time computation of multiple layers of dense matrices. GPGPU, FPGA, or ASIC-based serving systems require additional hardware that are not in the mainstream design of most commercial applications. In contrast, tree or forest-based models are widely adopted because of low serving cost, but heavily depend on carefully engineered features. This work proposes a Deep Embedding Forest model th"},"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":"1703.05291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T17:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"b3719a6b7db38eb0f27a205eebc8b77b7cdf1ccac350256a50adce126c9ec957","abstract_canon_sha256":"72578ed3ddd1add8cc08c0de2a61f6c11be20bea42dc77ba8fc47827a6ca05cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:37.880293Z","signature_b64":"kT2qTVFX8DLkQVMFoVyF2Ohr2FvrlB7uksSHajwIYYXgbMbYGdnYXQI2Li3hvDByu1ODKmuzOd3xHvSelKP7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f5eb556ab960378515f34dd16745e159e7a7cc445768febe42039a2f156b3d","last_reissued_at":"2026-05-18T00:48:37.879738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:37.879738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Embedding Forest: Forest-based Serving with Deep Embedding Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dong Yu, Holakou Rahmanian, JC Mao, Jie Zhu, Ying Shan, Yi Zhang","submitted_at":"2017-03-15T17:48:09Z","abstract_excerpt":"Deep Neural Networks (DNN) have demonstrated superior ability to extract high level embedding vectors from low level features. Despite the success, the serving time is still the bottleneck due to expensive run-time computation of multiple layers of dense matrices. GPGPU, FPGA, or ASIC-based serving systems require additional hardware that are not in the mainstream design of most commercial applications. In contrast, tree or forest-based models are widely adopted because of low serving cost, but heavily depend on carefully engineered features. This work proposes a Deep Embedding Forest model th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05291","kind":"arxiv","version":1},"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":"1703.05291","created_at":"2026-05-18T00:48:37.879832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05291v1","created_at":"2026-05-18T00:48:37.879832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05291","created_at":"2026-05-18T00:48:37.879832+00:00"},{"alias_kind":"pith_short_12","alias_value":"U326WVLKXFQD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U326WVLKXFQDPBIV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U326WVLK","created_at":"2026-05-18T12:31:46.661854+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/U326WVLKXFQDPBIV6NG5CZ2F4F","json":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F.json","graph_json":"https://pith.science/api/pith-number/U326WVLKXFQDPBIV6NG5CZ2F4F/graph.json","events_json":"https://pith.science/api/pith-number/U326WVLKXFQDPBIV6NG5CZ2F4F/events.json","paper":"https://pith.science/paper/U326WVLK"},"agent_actions":{"view_html":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F","download_json":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F.json","view_paper":"https://pith.science/paper/U326WVLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05291&json=true","fetch_graph":"https://pith.science/api/pith-number/U326WVLKXFQDPBIV6NG5CZ2F4F/graph.json","fetch_events":"https://pith.science/api/pith-number/U326WVLKXFQDPBIV6NG5CZ2F4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F/action/storage_attestation","attest_author":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F/action/author_attestation","sign_citation":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F/action/citation_signature","submit_replication":"https://pith.science/pith/U326WVLKXFQDPBIV6NG5CZ2F4F/action/replication_record"}},"created_at":"2026-05-18T00:48:37.879832+00:00","updated_at":"2026-05-18T00:48:37.879832+00:00"}