{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OE6XLKFKSEBV33N7QWFQDXLWCF","short_pith_number":"pith:OE6XLKFK","schema_version":"1.0","canonical_sha256":"713d75a8aa91035dedbf858b01dd76114af858084b83102b85f5925bb2dd899d","source":{"kind":"arxiv","id":"1909.06312","version":2},"attestation_state":"computed","paper":{"title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Artem Babenko, Sergei Popov, Stanislav Morozov","submitted_at":"2019-09-13T16:11:28Z","abstract_excerpt":"Nowadays, deep neural networks (DNNs) have become the main instrument for machine learning tasks within a wide range of domains, including vision, NLP, and speech. Meanwhile, in an important case of heterogenous tabular data, the advantage of DNNs over shallow counterparts remains questionable. In particular, there is no sufficient evidence that deep learning machinery allows constructing methods that outperform gradient boosting decision trees (GBDT), which are often the top choice for tabular problems. In this paper, we introduce Neural Oblivious Decision Ensembles (NODE), a new deep learnin"},"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":"1909.06312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T16:11:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3a6d05ad9e765c001de9f8fcf2ab20e6b33654cc64ecff9fb195c2faf53ee988","abstract_canon_sha256":"6fbf111eaad197fb19b0057be9ddeb0b8a415c6899b8af661b7842731eb0e043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:46.134934Z","signature_b64":"Cd5XhbERdnhb3juvXezQsW+B0QqvBCCnnp52TRbC8x7XIIl0fkvU3kvtnWEM7Z0CVsrZxndb8DSofFtInoAoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713d75a8aa91035dedbf858b01dd76114af858084b83102b85f5925bb2dd899d","last_reissued_at":"2026-07-05T00:05:46.134504Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:46.134504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Artem Babenko, Sergei Popov, Stanislav Morozov","submitted_at":"2019-09-13T16:11:28Z","abstract_excerpt":"Nowadays, deep neural networks (DNNs) have become the main instrument for machine learning tasks within a wide range of domains, including vision, NLP, and speech. Meanwhile, in an important case of heterogenous tabular data, the advantage of DNNs over shallow counterparts remains questionable. In particular, there is no sufficient evidence that deep learning machinery allows constructing methods that outperform gradient boosting decision trees (GBDT), which are often the top choice for tabular problems. In this paper, we introduce Neural Oblivious Decision Ensembles (NODE), a new deep learnin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06312","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/1909.06312/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":"1909.06312","created_at":"2026-07-05T00:05:46.134560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06312v2","created_at":"2026-07-05T00:05:46.134560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06312","created_at":"2026-07-05T00:05:46.134560+00:00"},{"alias_kind":"pith_short_12","alias_value":"OE6XLKFKSEBV","created_at":"2026-07-05T00:05:46.134560+00:00"},{"alias_kind":"pith_short_16","alias_value":"OE6XLKFKSEBV33N7","created_at":"2026-07-05T00:05:46.134560+00:00"},{"alias_kind":"pith_short_8","alias_value":"OE6XLKFK","created_at":"2026-07-05T00:05:46.134560+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02384","citing_title":"TabPrep: Closing the Feature Engineering Gap in Tabular Benchmarks","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2403.20208","citing_title":"Unlock the Potential of Large Language Models for Predictive Tabular Tasks in Data Science with Table-Specific Pretraining","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19662","citing_title":"When Tabular Foundation Models Meet Strategic Tabular Data: A Prior Alignment Approach","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18422","citing_title":"Generalized Functional ANOVA in Closed-Form: A Unified View of Additive Explanations","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08796","citing_title":"Evaluating Deep Learning Models for Multiclass Classification of LIGO Gravitational-Wave Glitches","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05635","citing_title":"From Uniform to Learned Knots: A Study of Spline-Based Numerical Encodings for Tabular Deep Learning","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF","json":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF.json","graph_json":"https://pith.science/api/pith-number/OE6XLKFKSEBV33N7QWFQDXLWCF/graph.json","events_json":"https://pith.science/api/pith-number/OE6XLKFKSEBV33N7QWFQDXLWCF/events.json","paper":"https://pith.science/paper/OE6XLKFK"},"agent_actions":{"view_html":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF","download_json":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF.json","view_paper":"https://pith.science/paper/OE6XLKFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06312&json=true","fetch_graph":"https://pith.science/api/pith-number/OE6XLKFKSEBV33N7QWFQDXLWCF/graph.json","fetch_events":"https://pith.science/api/pith-number/OE6XLKFKSEBV33N7QWFQDXLWCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF/action/storage_attestation","attest_author":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF/action/author_attestation","sign_citation":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF/action/citation_signature","submit_replication":"https://pith.science/pith/OE6XLKFKSEBV33N7QWFQDXLWCF/action/replication_record"}},"created_at":"2026-07-05T00:05:46.134560+00:00","updated_at":"2026-07-05T00:05:46.134560+00:00"}