{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3FT247ZJXHUYQ35CFFVFU66Z3K","short_pith_number":"pith:3FT247ZJ","schema_version":"1.0","canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","source":{"kind":"arxiv","id":"1801.02976","version":1},"attestation_state":"computed","paper":{"title":"Binary CEO Problem under Log-Loss with BSC Test-Channel Model","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-06T10:04:20Z","abstract_excerpt":"In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound for a two-link binary CEO problem under the logarithmic loss has been obtained by Courtade and Weissman. We propose an encoding scheme based on compound LDGM-LDPC codes to achieve the theoretical bounds. In the proposed encoding, a binary quantizer using LDGM codes and a syndrome-coding employing LDPC codes are applied. An iterative joint decoding is also designed as a fusion center. The proposed CEO decoder is base"},"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.02976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T10:04:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9319d87107933d99a1e966fb69dcd0af2a186e42fa396dac0d9cbd8332fe56ff","abstract_canon_sha256":"899ecac5de0ea60e233ebdbd7ab0fb17530f9e46b08fe7f98daebed50758790c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:21.857000Z","signature_b64":"VPRfME0aBGE7+cuOlFzWvERLF3ah2lz2ghV6FBwmtZpiZe9Zhj9EkNh7MJPpmhZts0RQY7WaBqle5u+Z9UTACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","last_reissued_at":"2026-05-18T00:26:21.856395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:21.856395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary CEO Problem under Log-Loss with BSC Test-Channel Model","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-06T10:04:20Z","abstract_excerpt":"In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound for a two-link binary CEO problem under the logarithmic loss has been obtained by Courtade and Weissman. We propose an encoding scheme based on compound LDGM-LDPC codes to achieve the theoretical bounds. In the proposed encoding, a binary quantizer using LDGM codes and a syndrome-coding employing LDPC codes are applied. An iterative joint decoding is also designed as a fusion center. The proposed CEO decoder is base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02976","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.02976","created_at":"2026-05-18T00:26:21.856476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02976v1","created_at":"2026-05-18T00:26:21.856476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02976","created_at":"2026-05-18T00:26:21.856476+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FT247ZJXHUY","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FT247ZJXHUYQ35C","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FT247ZJ","created_at":"2026-05-18T12:32:02.567920+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/3FT247ZJXHUYQ35CFFVFU66Z3K","json":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K.json","graph_json":"https://pith.science/api/pith-number/3FT247ZJXHUYQ35CFFVFU66Z3K/graph.json","events_json":"https://pith.science/api/pith-number/3FT247ZJXHUYQ35CFFVFU66Z3K/events.json","paper":"https://pith.science/paper/3FT247ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K","download_json":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K.json","view_paper":"https://pith.science/paper/3FT247ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02976&json=true","fetch_graph":"https://pith.science/api/pith-number/3FT247ZJXHUYQ35CFFVFU66Z3K/graph.json","fetch_events":"https://pith.science/api/pith-number/3FT247ZJXHUYQ35CFFVFU66Z3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/action/storage_attestation","attest_author":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/action/author_attestation","sign_citation":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/action/citation_signature","submit_replication":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/action/replication_record"}},"created_at":"2026-05-18T00:26:21.856476+00:00","updated_at":"2026-05-18T00:26:21.856476+00:00"}