{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C547TS2CZIC2YU4Q7AYMOJ3I4I","short_pith_number":"pith:C547TS2C","schema_version":"1.0","canonical_sha256":"1779f9cb42ca05ac5390f830c72768e211c9fbdb03d0ae999fc1b60931118a6e","source":{"kind":"arxiv","id":"2302.14299","version":1},"attestation_state":"computed","paper":{"title":"Gradient-Boosted Based Structured and Unstructured Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrea Trevi\\~no Gavito, Diego Klabjan, Jean Utke","submitted_at":"2023-02-28T04:16:42Z","abstract_excerpt":"We propose two frameworks to deal with problem settings in which both structured and unstructured data are available. Structured data problems are best solved by traditional machine learning models such as boosting and tree-based algorithms, whereas deep learning has been widely applied to problems dealing with images, text, audio, and other unstructured data sources. However, for the setting in which both structured and unstructured data are accessible, it is not obvious what the best modeling approach is to enhance performance on both data sources simultaneously. Our proposed frameworks allo"},"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":"2302.14299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T04:16:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ccd25ca6ce223c884ab7b1146c05d057a09bbb6e442c3532abf7ff47c4070ef0","abstract_canon_sha256":"f9fd6d47bb692c1928c1e19284b7ba91e221b4ed613c0f38d21783aaab1d78fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:43.091570Z","signature_b64":"LrHZ+XHg9LQ3wfvCpx0F6PBxTI7EVyINwXwchAd+Aai2I4j2bZ2XlJfLC3qxyEOnL1CTFwW4W83JW+UoGOP1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1779f9cb42ca05ac5390f830c72768e211c9fbdb03d0ae999fc1b60931118a6e","last_reissued_at":"2026-07-05T05:46:43.091215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:43.091215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-Boosted Based Structured and Unstructured Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrea Trevi\\~no Gavito, Diego Klabjan, Jean Utke","submitted_at":"2023-02-28T04:16:42Z","abstract_excerpt":"We propose two frameworks to deal with problem settings in which both structured and unstructured data are available. Structured data problems are best solved by traditional machine learning models such as boosting and tree-based algorithms, whereas deep learning has been widely applied to problems dealing with images, text, audio, and other unstructured data sources. However, for the setting in which both structured and unstructured data are accessible, it is not obvious what the best modeling approach is to enhance performance on both data sources simultaneously. Our proposed frameworks allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14299","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.14299/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":"2302.14299","created_at":"2026-07-05T05:46:43.091271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.14299v1","created_at":"2026-07-05T05:46:43.091271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14299","created_at":"2026-07-05T05:46:43.091271+00:00"},{"alias_kind":"pith_short_12","alias_value":"C547TS2CZIC2","created_at":"2026-07-05T05:46:43.091271+00:00"},{"alias_kind":"pith_short_16","alias_value":"C547TS2CZIC2YU4Q","created_at":"2026-07-05T05:46:43.091271+00:00"},{"alias_kind":"pith_short_8","alias_value":"C547TS2C","created_at":"2026-07-05T05:46:43.091271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08771","citing_title":"Paths to Causality: Finding Informative Subgraphs Within Knowledge Graphs for Knowledge-Based Causal Discovery","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I","json":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I.json","graph_json":"https://pith.science/api/pith-number/C547TS2CZIC2YU4Q7AYMOJ3I4I/graph.json","events_json":"https://pith.science/api/pith-number/C547TS2CZIC2YU4Q7AYMOJ3I4I/events.json","paper":"https://pith.science/paper/C547TS2C"},"agent_actions":{"view_html":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I","download_json":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I.json","view_paper":"https://pith.science/paper/C547TS2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.14299&json=true","fetch_graph":"https://pith.science/api/pith-number/C547TS2CZIC2YU4Q7AYMOJ3I4I/graph.json","fetch_events":"https://pith.science/api/pith-number/C547TS2CZIC2YU4Q7AYMOJ3I4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I/action/storage_attestation","attest_author":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I/action/author_attestation","sign_citation":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I/action/citation_signature","submit_replication":"https://pith.science/pith/C547TS2CZIC2YU4Q7AYMOJ3I4I/action/replication_record"}},"created_at":"2026-07-05T05:46:43.091271+00:00","updated_at":"2026-07-05T05:46:43.091271+00:00"}