{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EOY3LFE7UD2TZZLLDXQXVCSGGO","short_pith_number":"pith:EOY3LFE7","schema_version":"1.0","canonical_sha256":"23b1b5949fa0f53ce56b1de17a8a4633bcafcacea57a502acac4d7348a008621","source":{"kind":"arxiv","id":"2412.07184","version":2},"attestation_state":"computed","paper":{"title":"Automatic Doubly Robust Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Junting Duan, Vasilis Syrgkanis, Victor Chernozhukov, Zhaomeng Chen","submitted_at":"2024-12-10T04:45:50Z","abstract_excerpt":"This paper proposes the automatic Doubly Robust Random Forest (DRRF) algorithm for estimating the conditional expectation of a moment functional in the presence of high-dimensional nuisance functions. DRRF extends the automatic debiasing framework based on the Riesz representer to the conditional setting and enables nonparametric, forest-based estimation (Athey et al., 2019; Oprescu et al., 2019). In contrast to existing methods, DRRF does not require prior knowledge of the form of the debiasing term or impose restrictive parametric or semi-parametric assumptions on the target quantity. Additi"},"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":"2412.07184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-12-10T04:45:50Z","cross_cats_sorted":["cs.LG","econ.EM","math.ST","stat.TH"],"title_canon_sha256":"6da5101f199582fc375722bd81e97feba3c43b26282ccb12881717af680aa1a4","abstract_canon_sha256":"69ca3002e34715965e917c9ea21a23fbe995a6e2d3bdce79c0a998b7f5fe98d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:38.764719Z","signature_b64":"cUPV/G/vwoFxxHxgHcDohSVA+CEadjMwW4vJhsMIrG0+Gf2aSm4NInWPMV2GaJ6Hihzy4smN6lEQe39bJbW7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b1b5949fa0f53ce56b1de17a8a4633bcafcacea57a502acac4d7348a008621","last_reissued_at":"2026-07-05T11:17:38.764245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:38.764245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Doubly Robust Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Junting Duan, Vasilis Syrgkanis, Victor Chernozhukov, Zhaomeng Chen","submitted_at":"2024-12-10T04:45:50Z","abstract_excerpt":"This paper proposes the automatic Doubly Robust Random Forest (DRRF) algorithm for estimating the conditional expectation of a moment functional in the presence of high-dimensional nuisance functions. DRRF extends the automatic debiasing framework based on the Riesz representer to the conditional setting and enables nonparametric, forest-based estimation (Athey et al., 2019; Oprescu et al., 2019). In contrast to existing methods, DRRF does not require prior knowledge of the form of the debiasing term or impose restrictive parametric or semi-parametric assumptions on the target quantity. Additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07184","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/2412.07184/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":"2412.07184","created_at":"2026-07-05T11:17:38.764302+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07184v2","created_at":"2026-07-05T11:17:38.764302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07184","created_at":"2026-07-05T11:17:38.764302+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOY3LFE7UD2T","created_at":"2026-07-05T11:17:38.764302+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOY3LFE7UD2TZZLL","created_at":"2026-07-05T11:17:38.764302+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOY3LFE7","created_at":"2026-07-05T11:17:38.764302+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07852","citing_title":"Pre-Trained AI Model Assisted Online Decision-Making under Missing Covariates: A Theoretical Perspective","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO","json":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO.json","graph_json":"https://pith.science/api/pith-number/EOY3LFE7UD2TZZLLDXQXVCSGGO/graph.json","events_json":"https://pith.science/api/pith-number/EOY3LFE7UD2TZZLLDXQXVCSGGO/events.json","paper":"https://pith.science/paper/EOY3LFE7"},"agent_actions":{"view_html":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO","download_json":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO.json","view_paper":"https://pith.science/paper/EOY3LFE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07184&json=true","fetch_graph":"https://pith.science/api/pith-number/EOY3LFE7UD2TZZLLDXQXVCSGGO/graph.json","fetch_events":"https://pith.science/api/pith-number/EOY3LFE7UD2TZZLLDXQXVCSGGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO/action/storage_attestation","attest_author":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO/action/author_attestation","sign_citation":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO/action/citation_signature","submit_replication":"https://pith.science/pith/EOY3LFE7UD2TZZLLDXQXVCSGGO/action/replication_record"}},"created_at":"2026-07-05T11:17:38.764302+00:00","updated_at":"2026-07-05T11:17:38.764302+00:00"}