{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BCAIBP6D5GN3YUSHARGERYR6XA","short_pith_number":"pith:BCAIBP6D","canonical_record":{"source":{"id":"1207.5879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-25T03:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"76cf88eea0ed89d8d20b080b4afdf768c10ffa6817e36d285896a4b41d3d6783","abstract_canon_sha256":"070a94b573a18c3650c77928281fe358739d13ba64ea281eda15d5edeffd5d2e"},"schema_version":"1.0"},"canonical_sha256":"088080bfc3e99bbc5247044c48e23eb823436b65e9aae1e086d05cd68ed2c953","source":{"kind":"arxiv","id":"1207.5879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5879","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5879v1","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5879","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"BCAIBP6D5GN3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BCAIBP6D5GN3YUSH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BCAIBP6D","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BCAIBP6D5GN3YUSHARGERYR6XA","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-25T03:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"76cf88eea0ed89d8d20b080b4afdf768c10ffa6817e36d285896a4b41d3d6783","abstract_canon_sha256":"070a94b573a18c3650c77928281fe358739d13ba64ea281eda15d5edeffd5d2e"},"schema_version":"1.0"},"canonical_sha256":"088080bfc3e99bbc5247044c48e23eb823436b65e9aae1e086d05cd68ed2c953","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:10.049196Z","signature_b64":"55gLxG4D/7lpuBs1LHELAg1SF+l/J1AzhaPmpJzBiPMwQUaBL/CE7qmI1LJ/fyV/qBjxN+JXVNxARw1lblXHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088080bfc3e99bbc5247044c48e23eb823436b65e9aae1e086d05cd68ed2c953","last_reissued_at":"2026-05-18T03:50:10.048439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:10.048439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5879","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-18T03:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIDhsVG29J61mXEY4O6knxF03N6Vinu7SndjfvpKYZOX/VcppIWDuTjmb9g08HK5GhFRjwlqW8UeQSnXAPkXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:37.628672Z"},"content_sha256":"ad6ff02ecf8e8a1edf8fa384934454818725ce8d6b32488b4ad299ebe684bc72","schema_version":"1.0","event_id":"sha256:ad6ff02ecf8e8a1edf8fa384934454818725ce8d6b32488b4ad299ebe684bc72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BCAIBP6D5GN3YUSHARGERYR6XA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting Computations: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Tolpin, Nicholas Hay, Solomon Eyal Shimony, Stuart Russell","submitted_at":"2012-07-25T03:31:08Z","abstract_excerpt":"Sequential decision problems are often approximately solvable by simulating possible future action sequences. {\\em Metalevel} decision procedures have been developed for selecting {\\em which} action sequences to simulate, based on estimating the expected improvement in decision quality that would result from any particular simulation; an example is the recent work on using bandit algorithms to control Monte Carlo tree search in the game of Go. In this paper we develop a theoretical basis for metalevel decisions in the statistical framework of Bayesian {\\em selection problems}, arguing (as othe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5879","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-18T03:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dadxANkHqlX1tJt2tCaiMUeSKGlQFbkrQTxDTHiResQMw9kmMz01yz55ymR+Dv9dPbJfbbd0za3TA1zwdEHnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:37.629100Z"},"content_sha256":"0968a22f42d929ee5827173290e83d296481363e44101c734dd617175c1e0d79","schema_version":"1.0","event_id":"sha256:0968a22f42d929ee5827173290e83d296481363e44101c734dd617175c1e0d79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCAIBP6D5GN3YUSHARGERYR6XA/bundle.json","state_url":"https://pith.science/pith/BCAIBP6D5GN3YUSHARGERYR6XA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCAIBP6D5GN3YUSHARGERYR6XA/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-26T21:42:37Z","links":{"resolver":"https://pith.science/pith/BCAIBP6D5GN3YUSHARGERYR6XA","bundle":"https://pith.science/pith/BCAIBP6D5GN3YUSHARGERYR6XA/bundle.json","state":"https://pith.science/pith/BCAIBP6D5GN3YUSHARGERYR6XA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCAIBP6D5GN3YUSHARGERYR6XA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BCAIBP6D5GN3YUSHARGERYR6XA","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":"070a94b573a18c3650c77928281fe358739d13ba64ea281eda15d5edeffd5d2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-25T03:31:08Z","title_canon_sha256":"76cf88eea0ed89d8d20b080b4afdf768c10ffa6817e36d285896a4b41d3d6783"},"schema_version":"1.0","source":{"id":"1207.5879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5879","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5879v1","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5879","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"BCAIBP6D5GN3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BCAIBP6D5GN3YUSH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BCAIBP6D","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:0968a22f42d929ee5827173290e83d296481363e44101c734dd617175c1e0d79","target":"graph","created_at":"2026-05-18T03:50:10Z","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":"Sequential decision problems are often approximately solvable by simulating possible future action sequences. {\\em Metalevel} decision procedures have been developed for selecting {\\em which} action sequences to simulate, based on estimating the expected improvement in decision quality that would result from any particular simulation; an example is the recent work on using bandit algorithms to control Monte Carlo tree search in the game of Go. In this paper we develop a theoretical basis for metalevel decisions in the statistical framework of Bayesian {\\em selection problems}, arguing (as othe","authors_text":"David Tolpin, Nicholas Hay, Solomon Eyal Shimony, Stuart Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-25T03:31:08Z","title":"Selecting Computations: Theory and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5879","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:ad6ff02ecf8e8a1edf8fa384934454818725ce8d6b32488b4ad299ebe684bc72","target":"record","created_at":"2026-05-18T03:50:10Z","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":"070a94b573a18c3650c77928281fe358739d13ba64ea281eda15d5edeffd5d2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-25T03:31:08Z","title_canon_sha256":"76cf88eea0ed89d8d20b080b4afdf768c10ffa6817e36d285896a4b41d3d6783"},"schema_version":"1.0","source":{"id":"1207.5879","kind":"arxiv","version":1}},"canonical_sha256":"088080bfc3e99bbc5247044c48e23eb823436b65e9aae1e086d05cd68ed2c953","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"088080bfc3e99bbc5247044c48e23eb823436b65e9aae1e086d05cd68ed2c953","first_computed_at":"2026-05-18T03:50:10.048439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:10.048439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55gLxG4D/7lpuBs1LHELAg1SF+l/J1AzhaPmpJzBiPMwQUaBL/CE7qmI1LJ/fyV/qBjxN+JXVNxARw1lblXHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:10.049196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6ff02ecf8e8a1edf8fa384934454818725ce8d6b32488b4ad299ebe684bc72","sha256:0968a22f42d929ee5827173290e83d296481363e44101c734dd617175c1e0d79"],"state_sha256":"bed533a66fcae0dc5b978e7691a89fae8827d003a02cae760a8cf1ec982c6f3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2LLSdBhJmKlurEO2pR176MinxE+LH/TI8ctqVXaIEldcLTDiTF3CSPfrPnAfA2ynf3EmUx+Zxqz9SIt/0JyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:42:37.631933Z","bundle_sha256":"cde09364e57a5e817347396f44b716f18c52ae1c932c688f56e905c093e174fd"}}