{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZJKIA7KCH6Y5FMVW6OTW2OWPDT","short_pith_number":"pith:ZJKIA7KC","schema_version":"1.0","canonical_sha256":"ca54807d423fb1d2b2b6f3a76d3acf1cff1adf7f0c1fd302c8114ae94b9a65c7","source":{"kind":"arxiv","id":"1801.00435","version":1},"attestation_state":"computed","paper":{"title":"Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Mahdi Nangir, Mahmoud Ahmadian-Attari, Reza Asvadi","submitted_at":"2018-01-01T12:01:58Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.00435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-01T12:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e9ea9ef4f3f48a303c33e358aa76a0e60d0e79e32b916266126677da1ba7a6ce","abstract_canon_sha256":"97138bdf0dc0409160c160f70fdd987c4a11e7193fff47a23c26b00251fe818e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:48.835705Z","signature_b64":"AvUD/Q/UQU7pEZHOEK/jbrzGxms4szbRnN6am3FOUVpGByKG29nXUDKiN30Noa6CbtXrRf7zTl9w5No6azzpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca54807d423fb1d2b2b6f3a76d3acf1cff1adf7f0c1fd302c8114ae94b9a65c7","last_reissued_at":"2026-05-18T00:26:48.835164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:48.835164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Mahdi Nangir, Mahmoud Ahmadian-Attari, Reza Asvadi","submitted_at":"2018-01-01T12:01:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00435","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00435","created_at":"2026-05-18T00:26:48.835249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00435v1","created_at":"2026-05-18T00:26:48.835249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00435","created_at":"2026-05-18T00:26:48.835249+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJKIA7KCH6Y5","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJKIA7KCH6Y5FMVW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJKIA7KC","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT","json":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT.json","graph_json":"https://pith.science/api/pith-number/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/graph.json","events_json":"https://pith.science/api/pith-number/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/events.json","paper":"https://pith.science/paper/ZJKIA7KC"},"agent_actions":{"view_html":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT","download_json":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT.json","view_paper":"https://pith.science/paper/ZJKIA7KC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00435&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/action/storage_attestation","attest_author":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/action/author_attestation","sign_citation":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/action/citation_signature","submit_replication":"https://pith.science/pith/ZJKIA7KCH6Y5FMVW6OTW2OWPDT/action/replication_record"}},"created_at":"2026-05-18T00:26:48.835249+00:00","updated_at":"2026-05-18T00:26:48.835249+00:00"}