{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IZAXSU4EFQU6KMMAX2MOPCKMHM","short_pith_number":"pith:IZAXSU4E","schema_version":"1.0","canonical_sha256":"46417953842c29e53180be98e7894c3b29cbabbdc225d511d3b057bfa2762670","source":{"kind":"arxiv","id":"2002.10436","version":1},"attestation_state":"computed","paper":{"title":"Selecting and ranking individualized treatment rules with unmeasured confounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bo Zhang, Dylan S Small, Jordan Weiss, Qingyuan Zhao","submitted_at":"2020-02-24T18:33:03Z","abstract_excerpt":"It is common to compare individualized treatment rules based on the value function, which is the expected potential outcome under the treatment rule. Although the value function is not point-identified when there is unmeasured confounding, it still defines a partial order among the treatment rules under Rosenbaum's sensitivity analysis model. We first consider how to compare two treatment rules with unmeasured confounding in the single-decision setting and then use this pairwise test to rank multiple treatment rules. We consider how to, among many treatment rules, select the best rules and sel"},"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":"2002.10436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-24T18:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"8a32af7d407407bc18c8e971c6dafe05afc73dacc7c2481cefda8d20761c9207","abstract_canon_sha256":"b19cf1b48f347b63538931f1588e3359417608421e1b5fbe9f1cd0c509f95802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:41.212874Z","signature_b64":"T5+FnNlTePO74cBGSJKIJDdMbVploqBI7coSe2M8vihslM/oLzib1qkW+Zx55ybd2QjIDxrffEYA1Rond29hDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46417953842c29e53180be98e7894c3b29cbabbdc225d511d3b057bfa2762670","last_reissued_at":"2026-07-05T01:37:41.212508Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:41.212508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting and ranking individualized treatment rules with unmeasured confounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bo Zhang, Dylan S Small, Jordan Weiss, Qingyuan Zhao","submitted_at":"2020-02-24T18:33:03Z","abstract_excerpt":"It is common to compare individualized treatment rules based on the value function, which is the expected potential outcome under the treatment rule. Although the value function is not point-identified when there is unmeasured confounding, it still defines a partial order among the treatment rules under Rosenbaum's sensitivity analysis model. We first consider how to compare two treatment rules with unmeasured confounding in the single-decision setting and then use this pairwise test to rank multiple treatment rules. We consider how to, among many treatment rules, select the best rules and sel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10436","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/2002.10436/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":"2002.10436","created_at":"2026-07-05T01:37:41.212572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10436v1","created_at":"2026-07-05T01:37:41.212572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10436","created_at":"2026-07-05T01:37:41.212572+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZAXSU4EFQU6","created_at":"2026-07-05T01:37:41.212572+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZAXSU4EFQU6KMMA","created_at":"2026-07-05T01:37:41.212572+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZAXSU4E","created_at":"2026-07-05T01:37:41.212572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16519","citing_title":"Reinforcement Learning for Bidding Strategy Optimization in Day-Ahead Energy Market","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM","json":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM.json","graph_json":"https://pith.science/api/pith-number/IZAXSU4EFQU6KMMAX2MOPCKMHM/graph.json","events_json":"https://pith.science/api/pith-number/IZAXSU4EFQU6KMMAX2MOPCKMHM/events.json","paper":"https://pith.science/paper/IZAXSU4E"},"agent_actions":{"view_html":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM","download_json":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM.json","view_paper":"https://pith.science/paper/IZAXSU4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10436&json=true","fetch_graph":"https://pith.science/api/pith-number/IZAXSU4EFQU6KMMAX2MOPCKMHM/graph.json","fetch_events":"https://pith.science/api/pith-number/IZAXSU4EFQU6KMMAX2MOPCKMHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM/action/storage_attestation","attest_author":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM/action/author_attestation","sign_citation":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM/action/citation_signature","submit_replication":"https://pith.science/pith/IZAXSU4EFQU6KMMAX2MOPCKMHM/action/replication_record"}},"created_at":"2026-07-05T01:37:41.212572+00:00","updated_at":"2026-07-05T01:37:41.212572+00:00"}