{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XGARD27APIDODSVJJCVDJS6GO6","short_pith_number":"pith:XGARD27A","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"},"canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","source":{"kind":"arxiv","id":"1011.6509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6509","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6509v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6509","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"XGARD27APIDO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XGARD27APIDODSVJ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XGARD27A","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XGARD27APIDODSVJJCVDJS6GO6","target":"record","payload":{"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"},"canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","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"},"source_kind":"arxiv","source_id":"1011.6509","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skOz2UIohKIEhJXPuW4dTiOcGjyLf2ORFC1l5ljuLRC5pnWdyjGiNMWC4raTwUAJM0AAidFFOs5XfnMErvEXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:52:34.909142Z"},"content_sha256":"aa4d184aa010962f522a0121cce5510265234ecd8850ec5463c9d588ff3f6c7e","schema_version":"1.0","event_id":"sha256:aa4d184aa010962f522a0121cce5510265234ecd8850ec5463c9d588ff3f6c7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XGARD27APIDODSVJJCVDJS6GO6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVkZHvEpUBjt89iZPoYixdEYjM0nUT+hwQtlF//X1tB0PbfiXAdEL95Sg0W70f5pk8GZ7x3pOwkP5opPnAE/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:52:34.909506Z"},"content_sha256":"f50c803414c32fcb807e0886919193af015f4afd9923635997219fad41394f62","schema_version":"1.0","event_id":"sha256:f50c803414c32fcb807e0886919193af015f4afd9923635997219fad41394f62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/bundle.json","state_url":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGARD27APIDODSVJJCVDJS6GO6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T03:52:34Z","links":{"resolver":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6","bundle":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/bundle.json","state":"https://pith.science/pith/XGARD27APIDODSVJJCVDJS6GO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGARD27APIDODSVJJCVDJS6GO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XGARD27APIDODSVJJCVDJS6GO6","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":"c3a1fed1c250c5734532924f62868263d90addef7a35b25c30f2b788f9b1d569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-30T10:08:40Z","title_canon_sha256":"7d0a7bc1a2a06613a7178b5657f947b84cd6a7f0f62dd5c30b2757354055c81f"},"schema_version":"1.0","source":{"id":"1011.6509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6509","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6509v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6509","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"XGARD27APIDO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XGARD27APIDODSVJ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XGARD27A","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:f50c803414c32fcb807e0886919193af015f4afd9923635997219fad41394f62","target":"graph","created_at":"2026-05-18T04:34:26Z","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"},"paper":{"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","authors_text":"Jay Bartroff, Tze Leung Lai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-30T10:08:40Z","title":"Approximate Dynamic Programming and Its Applications to the Design of Phase I Cancer Trials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6509","kind":"arxiv","version":1},"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:aa4d184aa010962f522a0121cce5510265234ecd8850ec5463c9d588ff3f6c7e","target":"record","created_at":"2026-05-18T04:34:26Z","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":"c3a1fed1c250c5734532924f62868263d90addef7a35b25c30f2b788f9b1d569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-30T10:08:40Z","title_canon_sha256":"7d0a7bc1a2a06613a7178b5657f947b84cd6a7f0f62dd5c30b2757354055c81f"},"schema_version":"1.0","source":{"id":"1011.6509","kind":"arxiv","version":1}},"canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b98111ebe07a06e1caa948aa34cbc677b447a41ada1b4e330e1eeee4d61b6b98","first_computed_at":"2026-05-18T04:34:26.756546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:26.756546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gfGGKqmsNqMln4eVmYfUsYzculTuAD703UEvvNbSEwZkf1lQYBgk2qc2lZwu6TySmC6jkwbQu0YVFBZp0rYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:26.756969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa4d184aa010962f522a0121cce5510265234ecd8850ec5463c9d588ff3f6c7e","sha256:f50c803414c32fcb807e0886919193af015f4afd9923635997219fad41394f62"],"state_sha256":"33f0f8c861d6c13015b199c004fcbfe3c22a21a5480e59860d08bdb27a61bf54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLn81SrTDMh0HGRTisx50kDGhhVPthfs2RjfzSoPjVh7bs0wyA2mB7WOCVWwnQ+dBldW4vSOkWhL/ggzqA9dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:52:34.911712Z","bundle_sha256":"79d482816bc5dcbba26da35d509d371bce28d720cca8e0113e18baaa537fffd7"}}