{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XGARD27APIDODSVJJCVDJS6GO6","short_pith_number":"pith:XGARD27A","schema_version":"1.0","canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","source":{"kind":"arxiv","id":"1011.6509","version":1},"attestation_state":"computed","paper":{"title":"Approximate Dynamic Programming and Its Applications to the Design of Phase I Cancer Trials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jay Bartroff, Tze Leung Lai","submitted_at":"2010-11-30T10:08:40Z","abstract_excerpt":"Optimal design of a Phase I cancer trial can be formulated as a stochastic optimization problem. By making use of recent advances in approximate dynamic programming to tackle the problem, we develop an approximation of the Bayesian optimal design. The resulting design is a convex combination of a \"treatment\" design, such as Babb et al.'s (1998) escalation with overdose control, and a \"learning\" design, such as Haines et al.'s (2003) $c$-optimal design, thus directly addressing the treatment versus experimentation dilemma inherent in Phase I trials and providing a simple and intuitive design fo"},"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":"1011.6509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-30T10:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"7d0a7bc1a2a06613a7178b5657f947b84cd6a7f0f62dd5c30b2757354055c81f","abstract_canon_sha256":"c3a1fed1c250c5734532924f62868263d90addef7a35b25c30f2b788f9b1d569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:26.756969Z","signature_b64":"6gfGGKqmsNqMln4eVmYfUsYzculTuAD703UEvvNbSEwZkf1lQYBgk2qc2lZwu6TySmC6jkwbQu0YVFBZp0rYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","last_reissued_at":"2026-05-18T04:34:26.756546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:26.756546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Dynamic Programming and Its Applications to the Design of Phase I Cancer Trials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jay Bartroff, Tze Leung Lai","submitted_at":"2010-11-30T10:08:40Z","abstract_excerpt":"Optimal design of a Phase I cancer trial can be formulated as a stochastic optimization problem. By making use of recent advances in approximate dynamic programming to tackle the problem, we develop an approximation of the Bayesian optimal design. The resulting design is a convex combination of a \"treatment\" design, such as Babb et al.'s (1998) escalation with overdose control, and a \"learning\" design, such as Haines et al.'s (2003) $c$-optimal design, thus directly addressing the treatment versus experimentation dilemma inherent in Phase I trials and providing a simple and intuitive design fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6509","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":"1011.6509","created_at":"2026-05-18T04:34:26.756601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6509v1","created_at":"2026-05-18T04:34:26.756601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6509","created_at":"2026-05-18T04:34:26.756601+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGARD27APIDO","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGARD27APIDODSVJ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGARD27A","created_at":"2026-05-18T12:26:17.028572+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/XGARD27APIDODSVJJCVDJS6GO6","json":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6.json","graph_json":"https://pith.science/api/pith-number/XGARD27APIDODSVJJCVDJS6GO6/graph.json","events_json":"https://pith.science/api/pith-number/XGARD27APIDODSVJJCVDJS6GO6/events.json","paper":"https://pith.science/paper/XGARD27A"},"agent_actions":{"view_html":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6","download_json":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6.json","view_paper":"https://pith.science/paper/XGARD27A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6509&json=true","fetch_graph":"https://pith.science/api/pith-number/XGARD27APIDODSVJJCVDJS6GO6/graph.json","fetch_events":"https://pith.science/api/pith-number/XGARD27APIDODSVJJCVDJS6GO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/action/storage_attestation","attest_author":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/action/author_attestation","sign_citation":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/action/citation_signature","submit_replication":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/action/replication_record"}},"created_at":"2026-05-18T04:34:26.756601+00:00","updated_at":"2026-05-18T04:34:26.756601+00:00"}