{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NRI3GWR7AEQCEYVTUZYGIZBFKC","short_pith_number":"pith:NRI3GWR7","canonical_record":{"source":{"id":"1208.1154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-08-06T12:58:47Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ac49e503f9b9bb32d67b88513e10c2a4dff34a0c53df87acf03b00b90165d071","abstract_canon_sha256":"c437e5c6446851538b5b5681aa04fc695779492d32774deb1ada696646511cf7"},"schema_version":"1.0"},"canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","source":{"kind":"arxiv","id":"1208.1154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1154","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1154v1","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1154","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"NRI3GWR7AEQC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NRI3GWR7AEQCEYVT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NRI3GWR7","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NRI3GWR7AEQCEYVTUZYGIZBFKC","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-08-06T12:58:47Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ac49e503f9b9bb32d67b88513e10c2a4dff34a0c53df87acf03b00b90165d071","abstract_canon_sha256":"c437e5c6446851538b5b5681aa04fc695779492d32774deb1ada696646511cf7"},"schema_version":"1.0"},"canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.835966Z","signature_b64":"PYVBo+0H+6QpIYrEm2et37t17fSn3akuM5ZsPybE8e8/cev3QsmyhGFdit9UVTtkz+Nd9QHjUpVHEEoECpuxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","last_reissued_at":"2026-05-18T00:08:31.835459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.835459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1154","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-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOon6I6RX9DfMq8WpmiWpLftlKfnrMLPhuymOCIMra6Liaq0ffLUc7W6n9GFCyvVGsxjkBxbYOAPi02pIVorAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:56.837660Z"},"content_sha256":"8bc347d137bddab86b387ae65880fa98a724c6510722035bb17e73101e6bc103","schema_version":"1.0","event_id":"sha256:8bc347d137bddab86b387ae65880fa98a724c6510722035bb17e73101e6bc103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NRI3GWR7AEQCEYVTUZYGIZBFKC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying subtree perfectness in decision trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Matthias C. M. Troffaes, Nathan Huntley","submitted_at":"2012-08-06T12:58:47Z","abstract_excerpt":"In decision problems, often, utilities and probabilities are hard to determine. In such cases, one can resort to so-called choice functions. They provide a means to determine which options in a particular set are optimal, and allow incomparability among any number of options. Applying choice functions in sequential decision problems can be highly non-trivial, as the usual properties of maximising expected utility may no longer be satisfied. In this paper, we study one of these properties: we revisit and reinterpret Selten's concept of subgame perfectness in the context of decision trees, leadi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1154","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-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm908yfWrO9uQFNF7KKfAwLVy9QwNukheGdaN6zz+XWTOT/dsRh88YlwCurNS7R1hqRqXTaLSJKYK3V7lqAAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:56.838049Z"},"content_sha256":"4b3a6ef81273856c87d56d97b8997bda94ed77537d609d014bbaaecf8773a1cc","schema_version":"1.0","event_id":"sha256:4b3a6ef81273856c87d56d97b8997bda94ed77537d609d014bbaaecf8773a1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/bundle.json","state_url":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/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-06-04T20:26:56Z","links":{"resolver":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC","bundle":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/bundle.json","state":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NRI3GWR7AEQCEYVTUZYGIZBFKC","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":"c437e5c6446851538b5b5681aa04fc695779492d32774deb1ada696646511cf7","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-08-06T12:58:47Z","title_canon_sha256":"ac49e503f9b9bb32d67b88513e10c2a4dff34a0c53df87acf03b00b90165d071"},"schema_version":"1.0","source":{"id":"1208.1154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1154","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1154v1","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1154","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"NRI3GWR7AEQC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NRI3GWR7AEQCEYVT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NRI3GWR7","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4b3a6ef81273856c87d56d97b8997bda94ed77537d609d014bbaaecf8773a1cc","target":"graph","created_at":"2026-05-18T00:08:31Z","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":"In decision problems, often, utilities and probabilities are hard to determine. In such cases, one can resort to so-called choice functions. They provide a means to determine which options in a particular set are optimal, and allow incomparability among any number of options. Applying choice functions in sequential decision problems can be highly non-trivial, as the usual properties of maximising expected utility may no longer be satisfied. In this paper, we study one of these properties: we revisit and reinterpret Selten's concept of subgame perfectness in the context of decision trees, leadi","authors_text":"Matthias C. M. Troffaes, Nathan Huntley","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-08-06T12:58:47Z","title":"Identifying subtree perfectness in decision trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1154","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:8bc347d137bddab86b387ae65880fa98a724c6510722035bb17e73101e6bc103","target":"record","created_at":"2026-05-18T00:08:31Z","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":"c437e5c6446851538b5b5681aa04fc695779492d32774deb1ada696646511cf7","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-08-06T12:58:47Z","title_canon_sha256":"ac49e503f9b9bb32d67b88513e10c2a4dff34a0c53df87acf03b00b90165d071"},"schema_version":"1.0","source":{"id":"1208.1154","kind":"arxiv","version":1}},"canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","first_computed_at":"2026-05-18T00:08:31.835459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:31.835459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PYVBo+0H+6QpIYrEm2et37t17fSn3akuM5ZsPybE8e8/cev3QsmyhGFdit9UVTtkz+Nd9QHjUpVHEEoECpuxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:31.835966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bc347d137bddab86b387ae65880fa98a724c6510722035bb17e73101e6bc103","sha256:4b3a6ef81273856c87d56d97b8997bda94ed77537d609d014bbaaecf8773a1cc"],"state_sha256":"5469531302a1dec52134aa0355d053a28daf28b5d7bb522ebd4f461569319db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEhgNIVeHEmCIwQ4QnRfJx+xwdFg7MUCjGI3WYTAHiOu3WxZvR0c4mf04TYDxQ70QpIMbqFzfUVDlga92QIHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:26:56.840051Z","bundle_sha256":"5217f426d061de98bee0b104ff7f1137e27b900b0e4f9438ee5bec5b20ec5b64"}}