{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ENI2A36TNOI2N4UVPKRDQJPPD7","short_pith_number":"pith:ENI2A36T","schema_version":"1.0","canonical_sha256":"2351a06fd36b91a6f2957aa23825ef1fe7339093f5fba06804bc0b25778f153c","source":{"kind":"arxiv","id":"1702.01376","version":1},"attestation_state":"computed","paper":{"title":"On the Sub-optimality of Single-letter Coding in Multi-terminal Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, S. Sandeep Pradhan","submitted_at":"2017-02-05T07:30:54Z","abstract_excerpt":"We investigate binary block-codes (BBC). A BBC is defined as a vector of Boolean functions. We consider BBCs which are generated randomly, and using single-letter distributions. We characterize the vector of dependency spectrums of these BBCs. We use this vector to upper-bound the correlation between the outputs of two distributed BBCs. Finally, the upper-bound is used to show that the large blocklength single-letter coding schemes in the literature are sub-optimal in some multiterminal communication settings."},"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":"1702.01376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-05T07:30:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc1b91b70035aadad961a5d60615c2df38255a22f8cae9b725f18610e120acab","abstract_canon_sha256":"69ff2730e5994a4a852d7ab6afdca821a82b184b350b5742f79129a51a7e500b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.612195Z","signature_b64":"aS4rgVFrPmjD5nN9BFA7IPvzNVYi2hWA+N9uoaudODKNLxk022jjxbnSdhrA7cnDvP2VyPPx9y1xQzZGpmQODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2351a06fd36b91a6f2957aa23825ef1fe7339093f5fba06804bc0b25778f153c","last_reissued_at":"2026-05-18T00:51:23.611536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.611536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sub-optimality of Single-letter Coding in Multi-terminal Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, S. Sandeep Pradhan","submitted_at":"2017-02-05T07:30:54Z","abstract_excerpt":"We investigate binary block-codes (BBC). A BBC is defined as a vector of Boolean functions. We consider BBCs which are generated randomly, and using single-letter distributions. We characterize the vector of dependency spectrums of these BBCs. We use this vector to upper-bound the correlation between the outputs of two distributed BBCs. Finally, the upper-bound is used to show that the large blocklength single-letter coding schemes in the literature are sub-optimal in some multiterminal communication settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01376","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":"1702.01376","created_at":"2026-05-18T00:51:23.611644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01376v1","created_at":"2026-05-18T00:51:23.611644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01376","created_at":"2026-05-18T00:51:23.611644+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENI2A36TNOI2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENI2A36TNOI2N4UV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENI2A36T","created_at":"2026-05-18T12:31:12.930513+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/ENI2A36TNOI2N4UVPKRDQJPPD7","json":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7.json","graph_json":"https://pith.science/api/pith-number/ENI2A36TNOI2N4UVPKRDQJPPD7/graph.json","events_json":"https://pith.science/api/pith-number/ENI2A36TNOI2N4UVPKRDQJPPD7/events.json","paper":"https://pith.science/paper/ENI2A36T"},"agent_actions":{"view_html":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7","download_json":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7.json","view_paper":"https://pith.science/paper/ENI2A36T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01376&json=true","fetch_graph":"https://pith.science/api/pith-number/ENI2A36TNOI2N4UVPKRDQJPPD7/graph.json","fetch_events":"https://pith.science/api/pith-number/ENI2A36TNOI2N4UVPKRDQJPPD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7/action/storage_attestation","attest_author":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7/action/author_attestation","sign_citation":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7/action/citation_signature","submit_replication":"https://pith.science/pith/ENI2A36TNOI2N4UVPKRDQJPPD7/action/replication_record"}},"created_at":"2026-05-18T00:51:23.611644+00:00","updated_at":"2026-05-18T00:51:23.611644+00:00"}