{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCXNVBDN5GXPOMC2UFLTSMOV6P","short_pith_number":"pith:XCXNVBDN","schema_version":"1.0","canonical_sha256":"b8aeda846de9aef7305aa1573931d5f3f567c5d3723a985e1938384bceb3c3e7","source":{"kind":"arxiv","id":"1709.03683","version":1},"attestation_state":"computed","paper":{"title":"A Practically Competitive and Provably Consistent Algorithm for Uplift Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Xiao Fang, Yan Zhao","submitted_at":"2017-09-12T03:49:57Z","abstract_excerpt":"Randomized experiments have been critical tools of decision making for decades. However, subjects can show significant heterogeneity in response to treatments in many important applications. Therefore it is not enough to simply know which treatment is optimal for the entire population. What we need is a model that correctly customize treatment assignment base on subject characteristics. The problem of constructing such models from randomized experiments data is known as Uplift Modeling in the literature. Many algorithms have been proposed for uplift modeling and some have generated promising r"},"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":"1709.03683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-12T03:49:57Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"78ff0343e1ee76ce1bcdb180fe86567dce91b2949167d87b12f658304617af84","abstract_canon_sha256":"355828e2dbb04c47fe4b8ae030417c96801abc9fd00e5d15e0314afbd93905fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.802512Z","signature_b64":"8i5JEA3qW+cuJjQCIXjtLjDB6kkNrNOa/ZVpKnKXqHKLY9GqBhX2xO1OQfJRGhRyq708H9I67QH+bdG41FM6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8aeda846de9aef7305aa1573931d5f3f567c5d3723a985e1938384bceb3c3e7","last_reissued_at":"2026-05-18T00:35:29.801917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.801917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practically Competitive and Provably Consistent Algorithm for Uplift Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Xiao Fang, Yan Zhao","submitted_at":"2017-09-12T03:49:57Z","abstract_excerpt":"Randomized experiments have been critical tools of decision making for decades. However, subjects can show significant heterogeneity in response to treatments in many important applications. Therefore it is not enough to simply know which treatment is optimal for the entire population. What we need is a model that correctly customize treatment assignment base on subject characteristics. The problem of constructing such models from randomized experiments data is known as Uplift Modeling in the literature. Many algorithms have been proposed for uplift modeling and some have generated promising r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03683","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":""},"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":"1709.03683","created_at":"2026-05-18T00:35:29.802002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03683v1","created_at":"2026-05-18T00:35:29.802002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03683","created_at":"2026-05-18T00:35:29.802002+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCXNVBDN5GXP","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCXNVBDN5GXPOMC2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCXNVBDN","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P","json":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P.json","graph_json":"https://pith.science/api/pith-number/XCXNVBDN5GXPOMC2UFLTSMOV6P/graph.json","events_json":"https://pith.science/api/pith-number/XCXNVBDN5GXPOMC2UFLTSMOV6P/events.json","paper":"https://pith.science/paper/XCXNVBDN"},"agent_actions":{"view_html":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P","download_json":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P.json","view_paper":"https://pith.science/paper/XCXNVBDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03683&json=true","fetch_graph":"https://pith.science/api/pith-number/XCXNVBDN5GXPOMC2UFLTSMOV6P/graph.json","fetch_events":"https://pith.science/api/pith-number/XCXNVBDN5GXPOMC2UFLTSMOV6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P/action/storage_attestation","attest_author":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P/action/author_attestation","sign_citation":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P/action/citation_signature","submit_replication":"https://pith.science/pith/XCXNVBDN5GXPOMC2UFLTSMOV6P/action/replication_record"}},"created_at":"2026-05-18T00:35:29.802002+00:00","updated_at":"2026-05-18T00:35:29.802002+00:00"}