{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RQFIF6JSZH74ON7LSHAWYLDOPO","short_pith_number":"pith:RQFIF6JS","canonical_record":{"source":{"id":"1607.07247","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T12:44:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d963973ad66e7208fa6e4247765e9f98a557dabd8964e4f9811d8362ee318b25","abstract_canon_sha256":"b5fa9b28d33d4e56638f9d1464c4aeff6d3f658774f593066e2eef7be10aceec"},"schema_version":"1.0"},"canonical_sha256":"8c0a82f932c9ffc737eb91c16c2c6e7b986b1c68919d9b4b1ff27760cb392ff1","source":{"kind":"arxiv","id":"1607.07247","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07247","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07247v4","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07247","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"RQFIF6JSZH74","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQFIF6JSZH74ON7L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQFIF6JS","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RQFIF6JSZH74ON7LSHAWYLDOPO","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07247","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T12:44:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d963973ad66e7208fa6e4247765e9f98a557dabd8964e4f9811d8362ee318b25","abstract_canon_sha256":"b5fa9b28d33d4e56638f9d1464c4aeff6d3f658774f593066e2eef7be10aceec"},"schema_version":"1.0"},"canonical_sha256":"8c0a82f932c9ffc737eb91c16c2c6e7b986b1c68919d9b4b1ff27760cb392ff1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:07.131932Z","signature_b64":"BFo8qC5YXUYcPE7j6eVVYRzEJqIrorTUI/zEEmY6uBZrzOVxZQD3tginNvcegrDzWDDOI/ysWM6PbF7w2hb3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0a82f932c9ffc737eb91c16c2c6e7b986b1c68919d9b4b1ff27760cb392ff1","last_reissued_at":"2026-05-18T00:39:07.131405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:07.131405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07247","source_version":4,"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:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHJh8oC71hW+ZCszPWjZbs6vAQXw+JgjWksum9AQcpO3deuMCXGPTewjKb0YFlpwVilAGSEx8fhwievKpaHTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:57:59.256770Z"},"content_sha256":"b046a8c10661798477e4b5759555c45fb04c8f37600e39a5e038d6bba3255a2d","schema_version":"1.0","event_id":"sha256:b046a8c10661798477e4b5759555c45fb04c8f37600e39a5e038d6bba3255a2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RQFIF6JSZH74ON7LSHAWYLDOPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hirosuke Yamamoto, Junya Honda, Weihua Hu","submitted_at":"2016-07-25T12:44:10Z","abstract_excerpt":"Binary AIFV codes are lossless codes that generalize the class of instantaneous FV codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07247","kind":"arxiv","version":4},"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:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ht4bBK+XluDFSC+ZNYaR4myb9Up48cYpYcaDWwTRiPf4VRLQ5tDe9Tu2EYu6Q8UCMxzgXKsDHT7WtN/NAMcZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:57:59.257117Z"},"content_sha256":"e73557f4b0570a908a8563886d8b013e630a9f94f08b0960e9cd3b7d656bb331","schema_version":"1.0","event_id":"sha256:e73557f4b0570a908a8563886d8b013e630a9f94f08b0960e9cd3b7d656bb331"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/bundle.json","state_url":"https://pith.science/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/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-21T20:57:59Z","links":{"resolver":"https://pith.science/pith/RQFIF6JSZH74ON7LSHAWYLDOPO","bundle":"https://pith.science/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/bundle.json","state":"https://pith.science/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQFIF6JSZH74ON7LSHAWYLDOPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RQFIF6JSZH74ON7LSHAWYLDOPO","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":"b5fa9b28d33d4e56638f9d1464c4aeff6d3f658774f593066e2eef7be10aceec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T12:44:10Z","title_canon_sha256":"d963973ad66e7208fa6e4247765e9f98a557dabd8964e4f9811d8362ee318b25"},"schema_version":"1.0","source":{"id":"1607.07247","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07247","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07247v4","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07247","created_at":"2026-05-18T00:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"RQFIF6JSZH74","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQFIF6JSZH74ON7L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQFIF6JS","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e73557f4b0570a908a8563886d8b013e630a9f94f08b0960e9cd3b7d656bb331","target":"graph","created_at":"2026-05-18T00:39:07Z","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":"Binary AIFV codes are lossless codes that generalize the class of instantaneous FV codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy i","authors_text":"Hirosuke Yamamoto, Junya Honda, Weihua Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T12:44:10Z","title":"Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07247","kind":"arxiv","version":4},"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:b046a8c10661798477e4b5759555c45fb04c8f37600e39a5e038d6bba3255a2d","target":"record","created_at":"2026-05-18T00:39:07Z","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":"b5fa9b28d33d4e56638f9d1464c4aeff6d3f658774f593066e2eef7be10aceec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-25T12:44:10Z","title_canon_sha256":"d963973ad66e7208fa6e4247765e9f98a557dabd8964e4f9811d8362ee318b25"},"schema_version":"1.0","source":{"id":"1607.07247","kind":"arxiv","version":4}},"canonical_sha256":"8c0a82f932c9ffc737eb91c16c2c6e7b986b1c68919d9b4b1ff27760cb392ff1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c0a82f932c9ffc737eb91c16c2c6e7b986b1c68919d9b4b1ff27760cb392ff1","first_computed_at":"2026-05-18T00:39:07.131405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:07.131405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BFo8qC5YXUYcPE7j6eVVYRzEJqIrorTUI/zEEmY6uBZrzOVxZQD3tginNvcegrDzWDDOI/ysWM6PbF7w2hb3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:07.131932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07247","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b046a8c10661798477e4b5759555c45fb04c8f37600e39a5e038d6bba3255a2d","sha256:e73557f4b0570a908a8563886d8b013e630a9f94f08b0960e9cd3b7d656bb331"],"state_sha256":"99c0fec315efcadf6c739462c25d0c02dc87c46c75c2e7082aa73e6fa1975f40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF1z3FgsEE3w9qBRp+Sjvekzg9md1dbunnMVB+Vw73kAVBlombfxjFZ+z6XWx1DBUnpHxRsX6VpuRXQC4cq7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:57:59.259043Z","bundle_sha256":"1a98609d5c4e2658cd55b122cf4a8d2fc5747c5f6d62fc7ad78d60957ac7739d"}}