{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NBMFQ5VDZIIH7SSMJVOA43R7EL","short_pith_number":"pith:NBMFQ5VD","schema_version":"1.0","canonical_sha256":"68585876a3ca107fca4c4d5c0e6e3f22cc955d8c99de8981e1336da4e584d3a1","source":{"kind":"arxiv","id":"2402.06282","version":7},"attestation_state":"computed","paper":{"title":"Retrieve, Merge, Predict: Augmenting Tables with Data Lakes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"(2) Dataiku, (3) EURECOM), Aimee Coelho (2), Felix Lefebvre (1), Gael Varoquaux (1) ((1) SODA Team - Inria Saclay, Paolo Papotti (3), Riccardo Cappuzzo (1)","submitted_at":"2024-02-09T09:48:38Z","abstract_excerpt":"Machine-learning from a disparate set of tables, a data lake, requires assembling features by merging and aggregating tables. Data discovery can extend autoML to data tables by automating these steps. We present an in-depth analysis of such automated table augmentation for machine learning tasks, analyzing different methods for the three main steps: retrieving joinable tables, merging information, and predicting with the resultant table. We use two data lakes: Open Data US, a well-referenced real data lake, and a novel semi-synthetic dataset, YADL (Yet Another Data Lake), which we developed as"},"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":"2402.06282","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-09T09:48:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"784531f303b2f26efc8c4a9cc183d7f0fb9c1b292c4ff0297d40c03b704b71d8","abstract_canon_sha256":"2f605ed5b3285b35e45ca52c12bb84f4c6ca85f0526d9495c1d8d090e778bcf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:35.718586Z","signature_b64":"3ngeiPWTto1cqUCswSLWYckc4vh8aZzZpuMbcEus+dg+aWxUGIt+LY9Gd8UkSziloTJxGgeMMC0pyKLfbV+9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68585876a3ca107fca4c4d5c0e6e3f22cc955d8c99de8981e1336da4e584d3a1","last_reissued_at":"2026-07-05T11:04:35.717993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:35.717993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Retrieve, Merge, Predict: Augmenting Tables with Data Lakes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"(2) Dataiku, (3) EURECOM), Aimee Coelho (2), Felix Lefebvre (1), Gael Varoquaux (1) ((1) SODA Team - Inria Saclay, Paolo Papotti (3), Riccardo Cappuzzo (1)","submitted_at":"2024-02-09T09:48:38Z","abstract_excerpt":"Machine-learning from a disparate set of tables, a data lake, requires assembling features by merging and aggregating tables. Data discovery can extend autoML to data tables by automating these steps. We present an in-depth analysis of such automated table augmentation for machine learning tasks, analyzing different methods for the three main steps: retrieving joinable tables, merging information, and predicting with the resultant table. We use two data lakes: Open Data US, a well-referenced real data lake, and a novel semi-synthetic dataset, YADL (Yet Another Data Lake), which we developed as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06282","kind":"arxiv","version":7},"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/2402.06282/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":"2402.06282","created_at":"2026-07-05T11:04:35.718079+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06282v7","created_at":"2026-07-05T11:04:35.718079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06282","created_at":"2026-07-05T11:04:35.718079+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBMFQ5VDZIIH","created_at":"2026-07-05T11:04:35.718079+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBMFQ5VDZIIH7SSM","created_at":"2026-07-05T11:04:35.718079+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBMFQ5VD","created_at":"2026-07-05T11:04:35.718079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02020","citing_title":"Template-Based Schema Matching of Multi-Layout Tenancy Schedules:A Comparative Study of a Template-Based Hybrid Matcher and the ALITE Full Disjunction Model","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL","json":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL.json","graph_json":"https://pith.science/api/pith-number/NBMFQ5VDZIIH7SSMJVOA43R7EL/graph.json","events_json":"https://pith.science/api/pith-number/NBMFQ5VDZIIH7SSMJVOA43R7EL/events.json","paper":"https://pith.science/paper/NBMFQ5VD"},"agent_actions":{"view_html":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL","download_json":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL.json","view_paper":"https://pith.science/paper/NBMFQ5VD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06282&json=true","fetch_graph":"https://pith.science/api/pith-number/NBMFQ5VDZIIH7SSMJVOA43R7EL/graph.json","fetch_events":"https://pith.science/api/pith-number/NBMFQ5VDZIIH7SSMJVOA43R7EL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL/action/storage_attestation","attest_author":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL/action/author_attestation","sign_citation":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL/action/citation_signature","submit_replication":"https://pith.science/pith/NBMFQ5VDZIIH7SSMJVOA43R7EL/action/replication_record"}},"created_at":"2026-07-05T11:04:35.718079+00:00","updated_at":"2026-07-05T11:04:35.718079+00:00"}