{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:JJQOJLS7ZJTUDYBI7C4L63SFCR","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":"b50390e39552f2d9b1dfa9159821a844a6a86b2c3bea4c40acadd0740997041d","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.PF","submitted_at":"2006-11-09T03:57:33Z","title_canon_sha256":"c09febc7713d8c2c8c00491b3dc7f514b59592447356e958bd50e3ee025ebfe0"},"schema_version":"1.0","source":{"id":"cs/0611037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611037","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611037v2","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611037","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"JJQOJLS7ZJTU","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"JJQOJLS7ZJTUDYBI","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"JJQOJLS7","created_at":"2026-07-04T15:02:53Z"}],"graph_snapshots":[{"event_id":"sha256:d50e3f6b444a1adde7fd66ea4ff4dd69f9fb2a0b1fe44612812521aa5ee7f242","target":"graph","created_at":"2026-07-04T15:02:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0611037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The decision tree is one of the most fundamental programming abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) ``less than'' versus ''greater than or equal to'' tests in order to determine one of $n$ outcome events. The process of finding an optimal alphabetic binary tree for a known probability distribution on outcome events usually has the underlying assumption that the cost (time) per decision is uniform and thus independent of the outcome of the decision. This assumption, however, is incorrect in the case of software ","authors_text":"Michael B. Baer","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.PF","submitted_at":"2006-11-09T03:57:33Z","title":"On Conditional Branches in Optimal Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611037","kind":"arxiv","version":2},"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:c4266e503967eb1cee135d86bcdaba1b093ff53e4465d0e076b43cdb135a5cd3","target":"record","created_at":"2026-07-04T15:02:53Z","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":"b50390e39552f2d9b1dfa9159821a844a6a86b2c3bea4c40acadd0740997041d","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.PF","submitted_at":"2006-11-09T03:57:33Z","title_canon_sha256":"c09febc7713d8c2c8c00491b3dc7f514b59592447356e958bd50e3ee025ebfe0"},"schema_version":"1.0","source":{"id":"cs/0611037","kind":"arxiv","version":2}},"canonical_sha256":"4a60e4ae5fca6741e028f8b8bf6e45144f97c1073666b9d830d4f0aa352c297a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a60e4ae5fca6741e028f8b8bf6e45144f97c1073666b9d830d4f0aa352c297a","first_computed_at":"2026-07-04T15:02:53.931990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:53.931990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mepwVQFsjGaa8Dnf+UICcuT/wUYvXIH8BDYHD6ogroRuy7xHaT972SNzqypwfUNUtCUWC3jHJjke7wJHLFe2CQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:53.932375Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0611037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4266e503967eb1cee135d86bcdaba1b093ff53e4465d0e076b43cdb135a5cd3","sha256:d50e3f6b444a1adde7fd66ea4ff4dd69f9fb2a0b1fe44612812521aa5ee7f242"],"state_sha256":"7568ce788a19e9493fd8546f2a6f8b9672ba3f726b9d1d071c04a0335b5c2038"}