{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QTSNU6Y4GDNR35HYEO2NBVAKVL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0349d9d17de3ceb2623ebc9c9730d6b2e573526401748fd7dee57f826abafb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T09:17:48Z","title_canon_sha256":"75aaf245606e1109371046571ce6cf2e5709aafad5cd4d340c0dc9ecff1bc1d0"},"schema_version":"1.0","source":{"id":"2007.00973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00973","created_at":"2026-07-05T02:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00973v2","created_at":"2026-07-05T02:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00973","created_at":"2026-07-05T02:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"QTSNU6Y4GDNR","created_at":"2026-07-05T02:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"QTSNU6Y4GDNR35HY","created_at":"2026-07-05T02:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"QTSNU6Y4","created_at":"2026-07-05T02:15:58Z"}],"graph_snapshots":[{"event_id":"sha256:f92cd1c0cac57ff5791b19c0a74d87ed30dd8c1ea3ff0037ca6263973d94a36c","target":"graph","created_at":"2026-07-05T02:15:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.00973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding an effective medical treatment often requires a search by trial and error. Making this search more efficient by minimizing the number of unnecessary trials could lower both costs and patient suffering. We formalize this problem as learning a policy for finding a near-optimal treatment in a minimum number of trials using a causal inference framework. We give a model-based dynamic programming algorithm which learns from observational data while being robust to unmeasured confounding. To reduce time complexity, we suggest a greedy algorithm which bounds the near-optimality constraint. The","authors_text":"Fredrik D. Johansson, Omer Gottesman, Samuel H{\\aa}kansson, Viktor Lindblom","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T09:17:48Z","title":"Learning to search efficiently for causally near-optimal treatments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00973","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f0b3f132a74d441716d9ddad50555ba3be5f6ed64da5ca6e0ba7508c76dee8aa","target":"record","created_at":"2026-07-05T02:15:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0349d9d17de3ceb2623ebc9c9730d6b2e573526401748fd7dee57f826abafb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T09:17:48Z","title_canon_sha256":"75aaf245606e1109371046571ce6cf2e5709aafad5cd4d340c0dc9ecff1bc1d0"},"schema_version":"1.0","source":{"id":"2007.00973","kind":"arxiv","version":2}},"canonical_sha256":"84e4da7b1c30db1df4f823b4d0d40aaadb3be0369eff4832357f9603eb6d3a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84e4da7b1c30db1df4f823b4d0d40aaadb3be0369eff4832357f9603eb6d3a8a","first_computed_at":"2026-07-05T02:15:58.445866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:15:58.445866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LofMXgymszMcVAm3QgsewjjycmtLt4A8HCYgJDj1v+FZlyshTs9WroZ8sSrxNPtfpmTe0hpTaNfyw/cBxBYCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:15:58.446345Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.00973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0b3f132a74d441716d9ddad50555ba3be5f6ed64da5ca6e0ba7508c76dee8aa","sha256:f92cd1c0cac57ff5791b19c0a74d87ed30dd8c1ea3ff0037ca6263973d94a36c"],"state_sha256":"ae3f9ea50cdec4a21c04e1aa68af69deee18dbe67a9c01fbedf4589b64cd0c40"}