{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:3MHJJM575DCKOMRSBPBSTTGPGX","short_pith_number":"pith:3MHJJM57","canonical_record":{"source":{"id":"cs/0604016","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.PF","submitted_at":"2006-04-06T00:54:44Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"963385d54d5221f9cc20cecea3f4cd20e172ba7208bfa84900dc43df5ce628c6","abstract_canon_sha256":"9ad746b9e5f6644f95798fe301b89f1f33770383e7053444be2b660f1d91588d"},"schema_version":"1.0"},"canonical_sha256":"db0e94b3bfe8c4a732320bc329cccf35d0d77512e8a3ed11eb9514e58badc220","source":{"kind":"arxiv","id":"cs/0604016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604016","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604016v2","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604016","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"3MHJJM575DCK","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"3MHJJM575DCKOMRS","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"3MHJJM57","created_at":"2026-07-04T14:54:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:3MHJJM575DCKOMRSBPBSTTGPGX","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0604016","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.PF","submitted_at":"2006-04-06T00:54:44Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"963385d54d5221f9cc20cecea3f4cd20e172ba7208bfa84900dc43df5ce628c6","abstract_canon_sha256":"9ad746b9e5f6644f95798fe301b89f1f33770383e7053444be2b660f1d91588d"},"schema_version":"1.0"},"canonical_sha256":"db0e94b3bfe8c4a732320bc329cccf35d0d77512e8a3ed11eb9514e58badc220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:54:26.603729Z","signature_b64":"lenCh/YgnhaOKv05jOkLU9uSuUtgk8AZix2QgX77e5Kmhyc616wOFw/bPuFb9ciPbWDSrbJka9ZI4ER6VMU0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db0e94b3bfe8c4a732320bc329cccf35d0d77512e8a3ed11eb9514e58badc220","last_reissued_at":"2026-07-04T14:54:26.603387Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:54:26.603387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0604016","source_version":2,"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-07-04T14:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8ogXV7r/m9CQNOpC028JEVhzl8cgRLbudELmT4XadULWPWrBLNV7NRzO0c3zAHrEDljpAx7TcEeMd+UhhejAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:47:09.223352Z"},"content_sha256":"f836b6282d6cfb02fdd8e9148e5a420427c1bf586db0547183f80eb934df8251","schema_version":"1.0","event_id":"sha256:f836b6282d6cfb02fdd8e9148e5a420427c1bf586db0547183f80eb934df8251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:3MHJJM575DCKOMRSBPBSTTGPGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Conditional Branches in Optimal Search Trees","license":"","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.PF","authors_text":"Michael B. Baer","submitted_at":"2006-04-06T00:54:44Z","abstract_excerpt":"Algorithms for efficiently finding optimal alphabetic decision trees -- such as the Hu-Tucker algorithm -- are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus independent of the outcome of the decision. The few algorithms without this assumption instead use one cost if the decision outcome is ``less than'' and another cost otherwise. In practice, neither assumption is accurate for software optimized for today's microprocessors. Such software generally has one cost for the more likely decision outcome and a greater cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604016","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0604016/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMurDYHrrg3dIkiH/8/4oYjOwi+ZGYIrXBOCZfFBFQ2TzUqPmNWS0tUnCwUstEIu1wUh0oCURzC7TvS08B8aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:47:09.223756Z"},"content_sha256":"697aec07ff26328a43beeaf0ce2747bc4f0bbdc46a9080b0d54e9d6a5ad8aa2d","schema_version":"1.0","event_id":"sha256:697aec07ff26328a43beeaf0ce2747bc4f0bbdc46a9080b0d54e9d6a5ad8aa2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MHJJM575DCKOMRSBPBSTTGPGX/bundle.json","state_url":"https://pith.science/pith/3MHJJM575DCKOMRSBPBSTTGPGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MHJJM575DCKOMRSBPBSTTGPGX/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-07-04T19:47:09Z","links":{"resolver":"https://pith.science/pith/3MHJJM575DCKOMRSBPBSTTGPGX","bundle":"https://pith.science/pith/3MHJJM575DCKOMRSBPBSTTGPGX/bundle.json","state":"https://pith.science/pith/3MHJJM575DCKOMRSBPBSTTGPGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MHJJM575DCKOMRSBPBSTTGPGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:3MHJJM575DCKOMRSBPBSTTGPGX","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":"9ad746b9e5f6644f95798fe301b89f1f33770383e7053444be2b660f1d91588d","cross_cats_sorted":["cs.DS","cs.IR"],"license":"","primary_cat":"cs.PF","submitted_at":"2006-04-06T00:54:44Z","title_canon_sha256":"963385d54d5221f9cc20cecea3f4cd20e172ba7208bfa84900dc43df5ce628c6"},"schema_version":"1.0","source":{"id":"cs/0604016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604016","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604016v2","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604016","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"3MHJJM575DCK","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"3MHJJM575DCKOMRS","created_at":"2026-07-04T14:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"3MHJJM57","created_at":"2026-07-04T14:54:26Z"}],"graph_snapshots":[{"event_id":"sha256:697aec07ff26328a43beeaf0ce2747bc4f0bbdc46a9080b0d54e9d6a5ad8aa2d","target":"graph","created_at":"2026-07-04T14:54: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0604016/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Algorithms for efficiently finding optimal alphabetic decision trees -- such as the Hu-Tucker algorithm -- are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus independent of the outcome of the decision. The few algorithms without this assumption instead use one cost if the decision outcome is ``less than'' and another cost otherwise. In practice, neither assumption is accurate for software optimized for today's microprocessors. Such software generally has one cost for the more likely decision outcome and a greater cos","authors_text":"Michael B. Baer","cross_cats":["cs.DS","cs.IR"],"headline":"","license":"","primary_cat":"cs.PF","submitted_at":"2006-04-06T00:54:44Z","title":"On Conditional Branches in Optimal Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604016","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:f836b6282d6cfb02fdd8e9148e5a420427c1bf586db0547183f80eb934df8251","target":"record","created_at":"2026-07-04T14:54: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":"9ad746b9e5f6644f95798fe301b89f1f33770383e7053444be2b660f1d91588d","cross_cats_sorted":["cs.DS","cs.IR"],"license":"","primary_cat":"cs.PF","submitted_at":"2006-04-06T00:54:44Z","title_canon_sha256":"963385d54d5221f9cc20cecea3f4cd20e172ba7208bfa84900dc43df5ce628c6"},"schema_version":"1.0","source":{"id":"cs/0604016","kind":"arxiv","version":2}},"canonical_sha256":"db0e94b3bfe8c4a732320bc329cccf35d0d77512e8a3ed11eb9514e58badc220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db0e94b3bfe8c4a732320bc329cccf35d0d77512e8a3ed11eb9514e58badc220","first_computed_at":"2026-07-04T14:54:26.603387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:54:26.603387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lenCh/YgnhaOKv05jOkLU9uSuUtgk8AZix2QgX77e5Kmhyc616wOFw/bPuFb9ciPbWDSrbJka9ZI4ER6VMU0Bg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:54:26.603729Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0604016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f836b6282d6cfb02fdd8e9148e5a420427c1bf586db0547183f80eb934df8251","sha256:697aec07ff26328a43beeaf0ce2747bc4f0bbdc46a9080b0d54e9d6a5ad8aa2d"],"state_sha256":"d63032cc4993c4c12b4c4289177d44f835fb523a52e91b492ce66b724f3f8932"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3RMYGlpAnSbSzo8sZ1t9/elbNlrJfQLtMVjt+qIj6v7sJa9EhOIVjdayOMWxKwaRPlnNQ8yIp6Uuzt64O3+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T19:47:09.225845Z","bundle_sha256":"004091f5cd74b534a5b0724cba332d0fed285353aabfbf24456a31147f0da7d2"}}