{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZJKIA7KCH6Y5FMVW6OTW2OWPDT","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":"97138bdf0dc0409160c160f70fdd987c4a11e7193fff47a23c26b00251fe818e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-01T12:01:58Z","title_canon_sha256":"e9ea9ef4f3f48a303c33e358aa76a0e60d0e79e32b916266126677da1ba7a6ce"},"schema_version":"1.0","source":{"id":"1801.00435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00435","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00435v1","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00435","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"ZJKIA7KCH6Y5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZJKIA7KCH6Y5FMVW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZJKIA7KC","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e07c2aa5ba955a31b0739923bd221383f1a962262d92ba5f4807c54fa77aece5","target":"graph","created_at":"2026-05-18T00:26:48Z","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":"In this paper, we propose an efficient coding scheme for the binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. Courtade and Weissman obtained the exact rate-distortion bound for a two-link binary CEO problem under this criterion. We find the optimal test-channel model and its parameters for the encoder of each link by using the given bound. Furthermore, an efficient encoding scheme based on compound LDGM-LDPC codes is presented to achieve the theoretical rates. In the proposed encoding scheme, a binary quantizer using LDGM codes and a syndrome-decoding employing LD","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-01-01T12:01:58Z","title":"Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00435","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:ab6f4061703dc0ac0b4fc59330db762ea2bb4458ba6a3a813314eb0fae1c7222","target":"record","created_at":"2026-05-18T00:26:48Z","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":"97138bdf0dc0409160c160f70fdd987c4a11e7193fff47a23c26b00251fe818e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-01T12:01:58Z","title_canon_sha256":"e9ea9ef4f3f48a303c33e358aa76a0e60d0e79e32b916266126677da1ba7a6ce"},"schema_version":"1.0","source":{"id":"1801.00435","kind":"arxiv","version":1}},"canonical_sha256":"ca54807d423fb1d2b2b6f3a76d3acf1cff1adf7f0c1fd302c8114ae94b9a65c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca54807d423fb1d2b2b6f3a76d3acf1cff1adf7f0c1fd302c8114ae94b9a65c7","first_computed_at":"2026-05-18T00:26:48.835164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:48.835164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AvUD/Q/UQU7pEZHOEK/jbrzGxms4szbRnN6am3FOUVpGByKG29nXUDKiN30Noa6CbtXrRf7zTl9w5No6azzpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:48.835705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab6f4061703dc0ac0b4fc59330db762ea2bb4458ba6a3a813314eb0fae1c7222","sha256:e07c2aa5ba955a31b0739923bd221383f1a962262d92ba5f4807c54fa77aece5"],"state_sha256":"b80ebf7a2185fd589dea7ccffd6bcf955882f14f979c64fcdeda5fcbcb8a5ad1"}