{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LOG525VE53OQLXC7EJICNHM4ZA","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":"84f5f5b67ea9dfb7cc9aada8b360bbb95042ab0ee7affc0572abbf48dca1266a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-07T11:39:07Z","title_canon_sha256":"237fe1c9cafdc1e3cf245f7b6c435405c41bb63adec4beffa0ca36972cefeb7b"},"schema_version":"1.0","source":{"id":"1803.02605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02605","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02605v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02605","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"LOG525VE53OQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOG525VE53OQLXC7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOG525VE","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:9727cd7dd78d04ee2440f6a833694c4d5bd04a4d6ca53b474869e8ae7380a255","target":"graph","created_at":"2026-05-18T00:21:49Z","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":"An $l$-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graph-based codes. A successive coding scheme is proposed for converting an $l$-link binary CEO problem to the $(2l-1)$ single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes the received data by employing the well-known Sum-Product (SP) algorithm and leverages them to reconstruct the source. The sum-rate distortion perf","authors_text":"Jun Chen, Mahdi Nangir, Mahmoud Ahmadian-Attari, Reza Asvadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-07T11:39:07Z","title":"Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02605","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:7dc581629a46e6781ce5c5f69916ff4a1fd84ef230784568518438701d26f6d6","target":"record","created_at":"2026-05-18T00:21:49Z","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":"84f5f5b67ea9dfb7cc9aada8b360bbb95042ab0ee7affc0572abbf48dca1266a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-07T11:39:07Z","title_canon_sha256":"237fe1c9cafdc1e3cf245f7b6c435405c41bb63adec4beffa0ca36972cefeb7b"},"schema_version":"1.0","source":{"id":"1803.02605","kind":"arxiv","version":1}},"canonical_sha256":"5b8ddd76a4eedd05dc5f2250269d9cc831f8c6af4e223bb2f94cddc8ceb207a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b8ddd76a4eedd05dc5f2250269d9cc831f8c6af4e223bb2f94cddc8ceb207a1","first_computed_at":"2026-05-18T00:21:49.697627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.697627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZ7WuKblLxWlOQ1qWPnAI1HpsYgIHHbc0hTcQf/4WEjyzlRIgNsJQfzB5VnHzLloFr2CCyK/FtAa5lnZOgB3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.698313Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dc581629a46e6781ce5c5f69916ff4a1fd84ef230784568518438701d26f6d6","sha256:9727cd7dd78d04ee2440f6a833694c4d5bd04a4d6ca53b474869e8ae7380a255"],"state_sha256":"38720f2efbb36eb6ed5371e4cde767b096e23cdb52e04a0cd000b6794b061043"}