{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:3QIOY4Y7MVS7NTL5M7WOPEKXVY","short_pith_number":"pith:3QIOY4Y7","canonical_record":{"source":{"id":"cs/0605099","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-05-23T19:55:47Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b8df28804d3efea5b08af8423c8b88f98f96988d1d0f3a21bf28a34e561b8b02","abstract_canon_sha256":"63c8b6cf4b74ad4c933cb7234cb4e3565b0e9f3ab37240f67d52db9d80acaf10"},"schema_version":"1.0"},"canonical_sha256":"dc10ec731f6565f6cd7d67ece79157ae15ca162b678f56febd8261e768e034b6","source":{"kind":"arxiv","id":"cs/0605099","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605099","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605099v3","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605099","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"3QIOY4Y7MVS7","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_16","alias_value":"3QIOY4Y7MVS7NTL5","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_8","alias_value":"3QIOY4Y7","created_at":"2026-07-04T15:40:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:3QIOY4Y7MVS7NTL5M7WOPEKXVY","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0605099","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-05-23T19:55:47Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b8df28804d3efea5b08af8423c8b88f98f96988d1d0f3a21bf28a34e561b8b02","abstract_canon_sha256":"63c8b6cf4b74ad4c933cb7234cb4e3565b0e9f3ab37240f67d52db9d80acaf10"},"schema_version":"1.0"},"canonical_sha256":"dc10ec731f6565f6cd7d67ece79157ae15ca162b678f56febd8261e768e034b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:40:14.125121Z","signature_b64":"uldhqjamqRUSDu4EqwuxWHjma4r5RCoPlrmNPDe+Vhm4jNwqI7gjr0sV/QX1AjmxAM5bmehIPig1q3pVWZqRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc10ec731f6565f6cd7d67ece79157ae15ca162b678f56febd8261e768e034b6","last_reissued_at":"2026-07-04T15:40:14.124724Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:40:14.124724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0605099","source_version":3,"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-04T15:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjltFOwTh184wukXMqswEiNFlWn5Tb7uq88Ta7WdJZa9jWEUGT1TNRggEBUbKyHG4AKL4yGXZZ1B23OEVpUcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:30:27.488650Z"},"content_sha256":"1e14d231edde5a0c2107894b901a9327793cf67aebf6ace14ee766765cfe38a9","schema_version":"1.0","event_id":"sha256:1e14d231edde5a0c2107894b901a9327793cf67aebf6ace14ee766765cfe38a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:3QIOY4Y7MVS7NTL5M7WOPEKXVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alphabetic Coding with Exponential Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2006-05-23T19:55:47Z","abstract_excerpt":"An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing $\\sum_{i=1}^n w(i) l(i)$, this variant involves minimizing $\\log_a \\sum_{i=1}^n w(i) a^{l(i)}$ for a given $a \\in (0,1)$. This note introduces a dynamic programming algorithm that finds the optimal solution in polynomial time and space, and shows that methods traditionally used to improve the speed of optimizations in related problems, such as the Hu-Tucker pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605099","kind":"arxiv","version":3},"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/0605099/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-04T15:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HomqQDoCJ9ytmHzzmxu+xP8L8abPgV8/JpBvis3OvN1SWAnOhwRftaocNYN2s46BmjLONFyQqb3l1JzbqR71CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:30:27.489045Z"},"content_sha256":"59364144c9b19783d1daf428c20b6ea411a6ec9164cc51be7b574ae92004f092","schema_version":"1.0","event_id":"sha256:59364144c9b19783d1daf428c20b6ea411a6ec9164cc51be7b574ae92004f092"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/bundle.json","state_url":"https://pith.science/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/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-04T17:30:27Z","links":{"resolver":"https://pith.science/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY","bundle":"https://pith.science/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/bundle.json","state":"https://pith.science/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QIOY4Y7MVS7NTL5M7WOPEKXVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:3QIOY4Y7MVS7NTL5M7WOPEKXVY","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":"63c8b6cf4b74ad4c933cb7234cb4e3565b0e9f3ab37240f67d52db9d80acaf10","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-05-23T19:55:47Z","title_canon_sha256":"b8df28804d3efea5b08af8423c8b88f98f96988d1d0f3a21bf28a34e561b8b02"},"schema_version":"1.0","source":{"id":"cs/0605099","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605099","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605099v3","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605099","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"3QIOY4Y7MVS7","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_16","alias_value":"3QIOY4Y7MVS7NTL5","created_at":"2026-07-04T15:40:14Z"},{"alias_kind":"pith_short_8","alias_value":"3QIOY4Y7","created_at":"2026-07-04T15:40:14Z"}],"graph_snapshots":[{"event_id":"sha256:59364144c9b19783d1daf428c20b6ea411a6ec9164cc51be7b574ae92004f092","target":"graph","created_at":"2026-07-04T15:40:14Z","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/0605099/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing $\\sum_{i=1}^n w(i) l(i)$, this variant involves minimizing $\\log_a \\sum_{i=1}^n w(i) a^{l(i)}$ for a given $a \\in (0,1)$. This note introduces a dynamic programming algorithm that finds the optimal solution in polynomial time and space, and shows that methods traditionally used to improve the speed of optimizations in related problems, such as the Hu-Tucker pr","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-05-23T19:55:47Z","title":"Alphabetic Coding with Exponential Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605099","kind":"arxiv","version":3},"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:1e14d231edde5a0c2107894b901a9327793cf67aebf6ace14ee766765cfe38a9","target":"record","created_at":"2026-07-04T15:40:14Z","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":"63c8b6cf4b74ad4c933cb7234cb4e3565b0e9f3ab37240f67d52db9d80acaf10","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-05-23T19:55:47Z","title_canon_sha256":"b8df28804d3efea5b08af8423c8b88f98f96988d1d0f3a21bf28a34e561b8b02"},"schema_version":"1.0","source":{"id":"cs/0605099","kind":"arxiv","version":3}},"canonical_sha256":"dc10ec731f6565f6cd7d67ece79157ae15ca162b678f56febd8261e768e034b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc10ec731f6565f6cd7d67ece79157ae15ca162b678f56febd8261e768e034b6","first_computed_at":"2026-07-04T15:40:14.124724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:40:14.124724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uldhqjamqRUSDu4EqwuxWHjma4r5RCoPlrmNPDe+Vhm4jNwqI7gjr0sV/QX1AjmxAM5bmehIPig1q3pVWZqRAA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:40:14.125121Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605099","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e14d231edde5a0c2107894b901a9327793cf67aebf6ace14ee766765cfe38a9","sha256:59364144c9b19783d1daf428c20b6ea411a6ec9164cc51be7b574ae92004f092"],"state_sha256":"4c42c77dcb0c75f511b5de51b1b534371737b5e44472124926d0c90e366b3427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qr+8viIUwq6vKUfFSB20DSzP7gW6GflS/xciYtdOZMPWmALE6N+mfpwtLKgh70jnwt64q3rXHCpNXRVl4d8VCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T17:30:27.491252Z","bundle_sha256":"4e9d58eb0f3619334689ae76b41cb7a44aa1a60ee46d666e7498c1a2e48f0faa"}}