{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3FT247ZJXHUYQ35CFFVFU66Z3K","short_pith_number":"pith:3FT247ZJ","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"},"canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","source":{"kind":"arxiv","id":"1801.02976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02976","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02976v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02976","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"3FT247ZJXHUY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FT247ZJXHUYQ35C","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FT247ZJ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3FT247ZJXHUYQ35CFFVFU66Z3K","target":"record","payload":{"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"},"canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","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"},"source_kind":"arxiv","source_id":"1801.02976","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-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHnekMxuWECMADptyLM6FGt/Ppit5k9OzMFzjDUNvR07ZT0KwA1G7ENgb4WCGjOHzfHbSSS4w7H7+kZNuuZ2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:27:52.016294Z"},"content_sha256":"deaf7a9f1005bb8743cb42ee5ee38b0a93ae8d9f414862a993af5bd55568d582","schema_version":"1.0","event_id":"sha256:deaf7a9f1005bb8743cb42ee5ee38b0a93ae8d9f414862a993af5bd55568d582"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3FT247ZJXHUYQ35CFFVFU66Z3K","target":"graph","payload":{"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"},"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-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0T1LPYVHqWVdj1Shs1vX3jisjBb6JGXM85/46v9KrEk9JIzbu1nV8UaojKqyIj8PApLkb0+a2NT6FOCMhQsnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:27:52.016704Z"},"content_sha256":"b9bb6e51251a389088c2b54e0a21537539f434927a3d2f256194afa566dfc3f8","schema_version":"1.0","event_id":"sha256:b9bb6e51251a389088c2b54e0a21537539f434927a3d2f256194afa566dfc3f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/bundle.json","state_url":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/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-05-30T09:27:52Z","links":{"resolver":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K","bundle":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/bundle.json","state":"https://pith.science/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FT247ZJXHUYQ35CFFVFU66Z3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3FT247ZJXHUYQ35CFFVFU66Z3K","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":"899ecac5de0ea60e233ebdbd7ab0fb17530f9e46b08fe7f98daebed50758790c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T10:04:20Z","title_canon_sha256":"9319d87107933d99a1e966fb69dcd0af2a186e42fa396dac0d9cbd8332fe56ff"},"schema_version":"1.0","source":{"id":"1801.02976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02976","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02976v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02976","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"3FT247ZJXHUY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FT247ZJXHUYQ35C","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FT247ZJ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:b9bb6e51251a389088c2b54e0a21537539f434927a3d2f256194afa566dfc3f8","target":"graph","created_at":"2026-05-18T00:26:21Z","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 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","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-06T10:04:20Z","title":"Binary CEO Problem under Log-Loss with BSC Test-Channel Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02976","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:deaf7a9f1005bb8743cb42ee5ee38b0a93ae8d9f414862a993af5bd55568d582","target":"record","created_at":"2026-05-18T00:26:21Z","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":"899ecac5de0ea60e233ebdbd7ab0fb17530f9e46b08fe7f98daebed50758790c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-06T10:04:20Z","title_canon_sha256":"9319d87107933d99a1e966fb69dcd0af2a186e42fa396dac0d9cbd8332fe56ff"},"schema_version":"1.0","source":{"id":"1801.02976","kind":"arxiv","version":1}},"canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d967ae7f29b9e9886fa2296a5a7bd9da8b21b160d68638418bae6dd3fbd135c9","first_computed_at":"2026-05-18T00:26:21.856395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:21.856395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VPRfME0aBGE7+cuOlFzWvERLF3ah2lz2ghV6FBwmtZpiZe9Zhj9EkNh7MJPpmhZts0RQY7WaBqle5u+Z9UTACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:21.857000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:deaf7a9f1005bb8743cb42ee5ee38b0a93ae8d9f414862a993af5bd55568d582","sha256:b9bb6e51251a389088c2b54e0a21537539f434927a3d2f256194afa566dfc3f8"],"state_sha256":"9a55a211a715c06bc1744e1ad7ad9d35f08b147fb658c6d4ca79174eadfe0e69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CAyU/K9DhcQAfNcIquzEZdG2G17NKT1/CpxSXhKc38qEyzqIdG7ULwfmeRFeCqOAEGSAgrAa/rFUYx+VdsOrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:27:52.018788Z","bundle_sha256":"a3d394d82da596ec1edbe02701be7bef23b7c66ddd0a70004bbe61042bdb96f9"}}