{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ULHFAE6RJGUT4A3LW5YBGK6N7L","short_pith_number":"pith:ULHFAE6R","canonical_record":{"source":{"id":"1801.05372","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-16T17:18:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f13edd4038cc994bcddf0009c6ed0a1b158d116ba7379cb49401940bfe654dfd","abstract_canon_sha256":"e2c9a2449472ae868be85a22bc5c9fec209af7b955f70530b0b5a076ee263aab"},"schema_version":"1.0"},"canonical_sha256":"a2ce5013d149a93e036bb770132bcdfafe208c46f4b7c42038ccc0f196bf5037","source":{"kind":"arxiv","id":"1801.05372","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05372","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05372v4","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05372","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"ULHFAE6RJGUT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULHFAE6RJGUT4A3L","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULHFAE6R","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ULHFAE6RJGUT4A3LW5YBGK6N7L","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05372","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-16T17:18:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f13edd4038cc994bcddf0009c6ed0a1b158d116ba7379cb49401940bfe654dfd","abstract_canon_sha256":"e2c9a2449472ae868be85a22bc5c9fec209af7b955f70530b0b5a076ee263aab"},"schema_version":"1.0"},"canonical_sha256":"a2ce5013d149a93e036bb770132bcdfafe208c46f4b7c42038ccc0f196bf5037","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:18.282987Z","signature_b64":"DGOPA+01ySWeNRX09g9aJq7PxvUIrDge8s+VCD62PYIKpco5xTOvMSC2QjHaVCp7T7WW9RFVP6VkPBEvNWRrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2ce5013d149a93e036bb770132bcdfafe208c46f4b7c42038ccc0f196bf5037","last_reissued_at":"2026-05-17T23:43:18.282413Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:18.282413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05372","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5rJ13xqgBSHLDDnYC52MmIzrGyX22AjEHFFm1Lth6hLv+MopxM8sePGfR0OiQrsbNpmfKlg0xSKnKrvyfrQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:25:06.679721Z"},"content_sha256":"962a3368c6d27205a8b5dff9a68d1ef87cb0934479b404cc767ee27fcec8797a","schema_version":"1.0","event_id":"sha256:962a3368c6d27205a8b5dff9a68d1ef87cb0934479b404cc767ee27fcec8797a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ULHFAE6RJGUT4A3LW5YBGK6N7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Feature Learning From Relational Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Beat Buesser, Hoang Thanh Lam, Martin Wistuba, Mathieu Sinn, Tran Ngoc Minh","submitted_at":"2018-01-16T17:18:29Z","abstract_excerpt":"Feature engineering is one of the most important but most tedious tasks in data science. This work studies automation of feature learning from relational database. We first prove theoretically that finding the optimal features from relational data for predictive tasks is NP-hard. We propose an efficient rule-based approach based on heuristics and a deep neural network to automatically learn appropriate features from relational data. We benchmark our approaches in ensembles in past Kaggle competitions. Our new approach wins late medals and beats the state-of-the-art solutions with significant m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05372","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc0hyapAWStKjJGkQFlYi6W6Q8DxIxpK1CmgfXNVJq5JSujajCDmkjsty4b3vqhFtPwblW6xv18tzkuU8RYQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:25:06.680223Z"},"content_sha256":"cdad20b51923121acbd96d164c48dedffb9430828f25112d60af94a6580f5d3f","schema_version":"1.0","event_id":"sha256:cdad20b51923121acbd96d164c48dedffb9430828f25112d60af94a6580f5d3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/bundle.json","state_url":"https://pith.science/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T16:25:06Z","links":{"resolver":"https://pith.science/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L","bundle":"https://pith.science/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/bundle.json","state":"https://pith.science/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULHFAE6RJGUT4A3LW5YBGK6N7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ULHFAE6RJGUT4A3LW5YBGK6N7L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e2c9a2449472ae868be85a22bc5c9fec209af7b955f70530b0b5a076ee263aab","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-16T17:18:29Z","title_canon_sha256":"f13edd4038cc994bcddf0009c6ed0a1b158d116ba7379cb49401940bfe654dfd"},"schema_version":"1.0","source":{"id":"1801.05372","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05372","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05372v4","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05372","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"ULHFAE6RJGUT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULHFAE6RJGUT4A3L","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULHFAE6R","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:cdad20b51923121acbd96d164c48dedffb9430828f25112d60af94a6580f5d3f","target":"graph","created_at":"2026-05-17T23:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Feature engineering is one of the most important but most tedious tasks in data science. This work studies automation of feature learning from relational database. We first prove theoretically that finding the optimal features from relational data for predictive tasks is NP-hard. We propose an efficient rule-based approach based on heuristics and a deep neural network to automatically learn appropriate features from relational data. We benchmark our approaches in ensembles in past Kaggle competitions. Our new approach wins late medals and beats the state-of-the-art solutions with significant m","authors_text":"Beat Buesser, Hoang Thanh Lam, Martin Wistuba, Mathieu Sinn, Tran Ngoc Minh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-16T17:18:29Z","title":"Neural Feature Learning From Relational Database"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05372","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:962a3368c6d27205a8b5dff9a68d1ef87cb0934479b404cc767ee27fcec8797a","target":"record","created_at":"2026-05-17T23:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e2c9a2449472ae868be85a22bc5c9fec209af7b955f70530b0b5a076ee263aab","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-01-16T17:18:29Z","title_canon_sha256":"f13edd4038cc994bcddf0009c6ed0a1b158d116ba7379cb49401940bfe654dfd"},"schema_version":"1.0","source":{"id":"1801.05372","kind":"arxiv","version":4}},"canonical_sha256":"a2ce5013d149a93e036bb770132bcdfafe208c46f4b7c42038ccc0f196bf5037","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2ce5013d149a93e036bb770132bcdfafe208c46f4b7c42038ccc0f196bf5037","first_computed_at":"2026-05-17T23:43:18.282413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:18.282413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DGOPA+01ySWeNRX09g9aJq7PxvUIrDge8s+VCD62PYIKpco5xTOvMSC2QjHaVCp7T7WW9RFVP6VkPBEvNWRrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:18.282987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05372","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:962a3368c6d27205a8b5dff9a68d1ef87cb0934479b404cc767ee27fcec8797a","sha256:cdad20b51923121acbd96d164c48dedffb9430828f25112d60af94a6580f5d3f"],"state_sha256":"6a27864ea4ca6120104e1c8a900eb641c882307aace5ff43d7d00374c7dd7e19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hh48Rg9on9zXg+G5jnKGns21/GIp+RBjNJhRJdcpSzhDZKUvcOMoHNl4fYtZGMaOVJOIlNp7I8lPVZuEui/1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:25:06.682671Z","bundle_sha256":"19b0085534a65c49789c41ef1a488095e5500e5dda0410d42e5d4d37826e0099"}}