{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CKV7B57K47UO7DF2C5ZUJ5UJMS","short_pith_number":"pith:CKV7B57K","canonical_record":{"source":{"id":"1111.1432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-06T16:26:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"183a6a399e4d1f4a891e7da18a64c76601026a7eb660a0a012a0857656121ad9","abstract_canon_sha256":"7f424b36b1ceaea274af0d900a19b31f5f79388688c8ddb53f994cd3882e61bf"},"schema_version":"1.0"},"canonical_sha256":"12abf0f7eae7e8ef8cba177344f68964bb79f53b83df5654882fd1148c05cd81","source":{"kind":"arxiv","id":"1111.1432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1432","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1432v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1432","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"CKV7B57K47UO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CKV7B57K47UO7DF2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CKV7B57K","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CKV7B57K47UO7DF2C5ZUJ5UJMS","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-06T16:26:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"183a6a399e4d1f4a891e7da18a64c76601026a7eb660a0a012a0857656121ad9","abstract_canon_sha256":"7f424b36b1ceaea274af0d900a19b31f5f79388688c8ddb53f994cd3882e61bf"},"schema_version":"1.0"},"canonical_sha256":"12abf0f7eae7e8ef8cba177344f68964bb79f53b83df5654882fd1148c05cd81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.154699Z","signature_b64":"sORMmczZcSgnzhInzx5dFMBDliAoy7BuFTRQPmCbiEAmUZYqzyaYD0nKPDKShtwfwdz00o/j+yea5Tc3fOzbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12abf0f7eae7e8ef8cba177344f68964bb79f53b83df5654882fd1148c05cd81","last_reissued_at":"2026-05-18T04:09:26.154094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.154094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1432","source_version":1,"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-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTBm0BlIxErXe8nHbHcoQhWejO1Sc6DvPNGIT3BuXbu0fuWi+nftrhcDbl8N4xghDpJK3E8/ZGatUWOsVimnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:02:16.469939Z"},"content_sha256":"ed0dd02d9a6723520beb5d25c598be641729db11573a8d5c48e55ee25f52508d","schema_version":"1.0","event_id":"sha256:ed0dd02d9a6723520beb5d25c598be641729db11573a8d5c48e55ee25f52508d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CKV7B57K47UO7DF2C5ZUJ5UJMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Lossless Data Compression Via Binary Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"E.-h. Yang, J. Kieffer, P. Flajolet","submitted_at":"2011-11-06T16:26:22Z","abstract_excerpt":"A binary string of length $2^k$ induces the Boolean function of $k$ variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The given binary string is fully recoverable from this ROBDD. We exhibit a lossless data compression algorithm in which a binary string of length a power of two is compressed via compression of the ROBDD associated to it as described above.\n  We show that when binary strings of length $n$ a power of two are compressed via this algorithm, the maximal pointwise re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1432","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"},"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-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBUJS5EgGDjrfn+ZX2uoFecyf+3hPaC3LPtcN5MgLLqQE3OyQdFc0AFa25L1bUPt+XO1hUwSrCJQperg8DOlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:02:16.470283Z"},"content_sha256":"2942688b9d554d8a79b0827ad170c06bb73bf1db064f33a2b84aede541b1947e","schema_version":"1.0","event_id":"sha256:2942688b9d554d8a79b0827ad170c06bb73bf1db064f33a2b84aede541b1947e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/bundle.json","state_url":"https://pith.science/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/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-25T07:02:16Z","links":{"resolver":"https://pith.science/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS","bundle":"https://pith.science/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/bundle.json","state":"https://pith.science/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKV7B57K47UO7DF2C5ZUJ5UJMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CKV7B57K47UO7DF2C5ZUJ5UJMS","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":"7f424b36b1ceaea274af0d900a19b31f5f79388688c8ddb53f994cd3882e61bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-06T16:26:22Z","title_canon_sha256":"183a6a399e4d1f4a891e7da18a64c76601026a7eb660a0a012a0857656121ad9"},"schema_version":"1.0","source":{"id":"1111.1432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1432","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1432v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1432","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"CKV7B57K47UO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CKV7B57K47UO7DF2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CKV7B57K","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:2942688b9d554d8a79b0827ad170c06bb73bf1db064f33a2b84aede541b1947e","target":"graph","created_at":"2026-05-18T04:09: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"},"paper":{"abstract_excerpt":"A binary string of length $2^k$ induces the Boolean function of $k$ variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The given binary string is fully recoverable from this ROBDD. We exhibit a lossless data compression algorithm in which a binary string of length a power of two is compressed via compression of the ROBDD associated to it as described above.\n  We show that when binary strings of length $n$ a power of two are compressed via this algorithm, the maximal pointwise re","authors_text":"E.-h. Yang, J. Kieffer, P. Flajolet","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-06T16:26:22Z","title":"Universal Lossless Data Compression Via Binary Decision Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1432","kind":"arxiv","version":1},"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:ed0dd02d9a6723520beb5d25c598be641729db11573a8d5c48e55ee25f52508d","target":"record","created_at":"2026-05-18T04:09: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":"7f424b36b1ceaea274af0d900a19b31f5f79388688c8ddb53f994cd3882e61bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-06T16:26:22Z","title_canon_sha256":"183a6a399e4d1f4a891e7da18a64c76601026a7eb660a0a012a0857656121ad9"},"schema_version":"1.0","source":{"id":"1111.1432","kind":"arxiv","version":1}},"canonical_sha256":"12abf0f7eae7e8ef8cba177344f68964bb79f53b83df5654882fd1148c05cd81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12abf0f7eae7e8ef8cba177344f68964bb79f53b83df5654882fd1148c05cd81","first_computed_at":"2026-05-18T04:09:26.154094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:26.154094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sORMmczZcSgnzhInzx5dFMBDliAoy7BuFTRQPmCbiEAmUZYqzyaYD0nKPDKShtwfwdz00o/j+yea5Tc3fOzbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:26.154699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0dd02d9a6723520beb5d25c598be641729db11573a8d5c48e55ee25f52508d","sha256:2942688b9d554d8a79b0827ad170c06bb73bf1db064f33a2b84aede541b1947e"],"state_sha256":"6371f6853792ca66741fe80115cb5f4e03f58a2ac2b1941b5d54b986d73cba50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYFht1nphlKa5KNY1Lm5Lx7wi8BR0ghNMuchnG8TVil8wpU/dYkB+nQ0dbMdx/fB/PBPgo3xIFgDWX+P0/4lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:02:16.472246Z","bundle_sha256":"dcca995b95a4921d5262f161f8fbdf0436b99577ae661824a05dc2c1c787a9b9"}}