{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WW7A5J5PYDBIHPZKPP2JSPEQWE","short_pith_number":"pith:WW7A5J5P","schema_version":"1.0","canonical_sha256":"b5be0ea7afc0c283bf2a7bf4993c90b13fc38f1e57c78d64fd651a295dcf040b","source":{"kind":"arxiv","id":"2108.13628","version":2},"attestation_state":"computed","paper":{"title":"Learning Optimal Prescriptive Trees from Observational Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es G\\'omez, Nathanael Jo, Phebe Vayanos, Sina Aghaei","submitted_at":"2021-08-31T05:38:36Z","abstract_excerpt":"We consider the problem of learning an optimal prescriptive tree (i.e., an interpretable treatment assignment policy in the form of a binary tree) of moderate depth, from observational data. This problem arises in numerous socially important domains such as public health and personalized medicine, where interpretable and data-driven interventions are sought based on data gathered in deployment -- through passive collection of data -- rather than from randomized trials. We propose a method for learning optimal prescriptive trees using mixed-integer optimization (MIO) technology. We show that un"},"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":"2108.13628","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-31T05:38:36Z","cross_cats_sorted":["cs.CY","stat.ML"],"title_canon_sha256":"6cd0c53087edba40ea5ef045bc405adf73465c34e8d6093b757b5686b6e91b55","abstract_canon_sha256":"4537892fcc27cdcae921998be39d1d1e4bd7b711ab434128f1e0ad3dfa5479c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:39.151848Z","signature_b64":"GRW4MSqUm59R026Qzhr8tJrozfAbf+v3iGFS0QLZE6j9g+TjKGhIMF1o311/zcULbyCVBtEDjmfbSJfHl+wTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5be0ea7afc0c283bf2a7bf4993c90b13fc38f1e57c78d64fd651a295dcf040b","last_reissued_at":"2026-07-05T06:33:39.151298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:39.151298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Prescriptive Trees from Observational Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es G\\'omez, Nathanael Jo, Phebe Vayanos, Sina Aghaei","submitted_at":"2021-08-31T05:38:36Z","abstract_excerpt":"We consider the problem of learning an optimal prescriptive tree (i.e., an interpretable treatment assignment policy in the form of a binary tree) of moderate depth, from observational data. This problem arises in numerous socially important domains such as public health and personalized medicine, where interpretable and data-driven interventions are sought based on data gathered in deployment -- through passive collection of data -- rather than from randomized trials. We propose a method for learning optimal prescriptive trees using mixed-integer optimization (MIO) technology. We show that un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.13628","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/2108.13628/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":"2108.13628","created_at":"2026-07-05T06:33:39.151365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.13628v2","created_at":"2026-07-05T06:33:39.151365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.13628","created_at":"2026-07-05T06:33:39.151365+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW7A5J5PYDBI","created_at":"2026-07-05T06:33:39.151365+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW7A5J5PYDBIHPZK","created_at":"2026-07-05T06:33:39.151365+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW7A5J5P","created_at":"2026-07-05T06:33:39.151365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05857","citing_title":"Responsible Machine Learning via Mixed-Integer Optimization","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE","json":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE.json","graph_json":"https://pith.science/api/pith-number/WW7A5J5PYDBIHPZKPP2JSPEQWE/graph.json","events_json":"https://pith.science/api/pith-number/WW7A5J5PYDBIHPZKPP2JSPEQWE/events.json","paper":"https://pith.science/paper/WW7A5J5P"},"agent_actions":{"view_html":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE","download_json":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE.json","view_paper":"https://pith.science/paper/WW7A5J5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.13628&json=true","fetch_graph":"https://pith.science/api/pith-number/WW7A5J5PYDBIHPZKPP2JSPEQWE/graph.json","fetch_events":"https://pith.science/api/pith-number/WW7A5J5PYDBIHPZKPP2JSPEQWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE/action/storage_attestation","attest_author":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE/action/author_attestation","sign_citation":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE/action/citation_signature","submit_replication":"https://pith.science/pith/WW7A5J5PYDBIHPZKPP2JSPEQWE/action/replication_record"}},"created_at":"2026-07-05T06:33:39.151365+00:00","updated_at":"2026-07-05T06:33:39.151365+00:00"}