{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NRI3GWR7AEQCEYVTUZYGIZBFKC","short_pith_number":"pith:NRI3GWR7","schema_version":"1.0","canonical_sha256":"6c51b35a3f01202262b3a6706464255093c6792d6248bf41cb0a21fc3ac5f06e","source":{"kind":"arxiv","id":"1208.1154","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.1154","created_at":"2026-05-18T00:08:31.835543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1154v1","created_at":"2026-05-18T00:08:31.835543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1154","created_at":"2026-05-18T00:08:31.835543+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRI3GWR7AEQC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRI3GWR7AEQCEYVT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRI3GWR7","created_at":"2026-05-18T12:27:16.716162+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/NRI3GWR7AEQCEYVTUZYGIZBFKC","json":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC.json","graph_json":"https://pith.science/api/pith-number/NRI3GWR7AEQCEYVTUZYGIZBFKC/graph.json","events_json":"https://pith.science/api/pith-number/NRI3GWR7AEQCEYVTUZYGIZBFKC/events.json","paper":"https://pith.science/paper/NRI3GWR7"},"agent_actions":{"view_html":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC","download_json":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC.json","view_paper":"https://pith.science/paper/NRI3GWR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1154&json=true","fetch_graph":"https://pith.science/api/pith-number/NRI3GWR7AEQCEYVTUZYGIZBFKC/graph.json","fetch_events":"https://pith.science/api/pith-number/NRI3GWR7AEQCEYVTUZYGIZBFKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/action/storage_attestation","attest_author":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/action/author_attestation","sign_citation":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/action/citation_signature","submit_replication":"https://pith.science/pith/NRI3GWR7AEQCEYVTUZYGIZBFKC/action/replication_record"}},"created_at":"2026-05-18T00:08:31.835543+00:00","updated_at":"2026-05-18T00:08:31.835543+00:00"}