{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KQ5XNPWFHVM3UJV54RPUKAMM4X","short_pith_number":"pith:KQ5XNPWF","canonical_record":{"source":{"id":"1705.00410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-01T03:15:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5377a3e5d60779013b9d797d8c3dcc05b9f19877cdd3b84072df2365d83e0d6","abstract_canon_sha256":"a8be1b8e602e825380eea96a2dedd37515c5e9e71b4f8c0825a70758424f2973"},"schema_version":"1.0"},"canonical_sha256":"543b76bec53d59ba26bde45f45018ce5c7d95f4e05f6913b75d51588740a0888","source":{"kind":"arxiv","id":"1705.00410","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00410","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00410v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00410","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"KQ5XNPWFHVM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KQ5XNPWFHVM3UJV5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KQ5XNPWF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KQ5XNPWFHVM3UJV54RPUKAMM4X","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-01T03:15:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5377a3e5d60779013b9d797d8c3dcc05b9f19877cdd3b84072df2365d83e0d6","abstract_canon_sha256":"a8be1b8e602e825380eea96a2dedd37515c5e9e71b4f8c0825a70758424f2973"},"schema_version":"1.0"},"canonical_sha256":"543b76bec53d59ba26bde45f45018ce5c7d95f4e05f6913b75d51588740a0888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:17.337154Z","signature_b64":"VgsXbaASChnsGm66OwkNS9e4mSJ3iA3s4+esSYATqc7VPQVqKRlH9a5vtv6pliitJ3Nvjycpf+B1aRfxvrtBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543b76bec53d59ba26bde45f45018ce5c7d95f4e05f6913b75d51588740a0888","last_reissued_at":"2026-05-18T00:45:17.336446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:17.336446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00410","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:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Fp4agqJm7DjKnFbqs6bq3KQscYMrVXscjSX6vognn9TZ76OxtWnG89AA2UQw6wKtJRVl00dhnbSPHY3sulMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:50.605096Z"},"content_sha256":"b51d5a4213c3c3e6ab65fc3c2424b11d9e3a4f15f0d034acaafd3a2dd7546f17","schema_version":"1.0","event_id":"sha256:b51d5a4213c3c3e6ab65fc3c2424b11d9e3a4f15f0d034acaafd3a2dd7546f17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KQ5XNPWFHVM3UJV54RPUKAMM4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sub-optimality of Single-Letter Coding over Networks","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-05-01T03:15:24Z","abstract_excerpt":"In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a new upper bound on the correlation between the outputs of these functions. The upper bound may find applications in problems in many areas which deal with common information. We build upon Witsenhausen's result on maximum correlation. The present upper bound takes into account the effective length of the Boolean functions in characterizing the correlation.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00410","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:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgpfsWAk4n0oVDqSOYQXdVQOjM4pmdALyRKaw+a0YxDb1T4r1fLDMKqcVmC+jFqx7LdOq228zMvpBSG22sGIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:50.605735Z"},"content_sha256":"ce50b455c79d876e176d750b91a064739c01907899374d7db50228d6ba8a9a97","schema_version":"1.0","event_id":"sha256:ce50b455c79d876e176d750b91a064739c01907899374d7db50228d6ba8a9a97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/bundle.json","state_url":"https://pith.science/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/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-06-07T14:16:50Z","links":{"resolver":"https://pith.science/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X","bundle":"https://pith.science/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/bundle.json","state":"https://pith.science/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQ5XNPWFHVM3UJV54RPUKAMM4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KQ5XNPWFHVM3UJV54RPUKAMM4X","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":"a8be1b8e602e825380eea96a2dedd37515c5e9e71b4f8c0825a70758424f2973","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-01T03:15:24Z","title_canon_sha256":"f5377a3e5d60779013b9d797d8c3dcc05b9f19877cdd3b84072df2365d83e0d6"},"schema_version":"1.0","source":{"id":"1705.00410","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00410","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00410v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00410","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"KQ5XNPWFHVM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KQ5XNPWFHVM3UJV5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KQ5XNPWF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ce50b455c79d876e176d750b91a064739c01907899374d7db50228d6ba8a9a97","target":"graph","created_at":"2026-05-18T00:45:17Z","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 establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a new upper bound on the correlation between the outputs of these functions. The upper bound may find applications in problems in many areas which deal with common information. We build upon Witsenhausen's result on maximum correlation. The present upper bound takes into account the effective length of the Boolean functions in characterizing the correlation.\n","authors_text":"Farhad Shirani, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-01T03:15:24Z","title":"On the Sub-optimality of Single-Letter Coding over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00410","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:b51d5a4213c3c3e6ab65fc3c2424b11d9e3a4f15f0d034acaafd3a2dd7546f17","target":"record","created_at":"2026-05-18T00:45:17Z","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":"a8be1b8e602e825380eea96a2dedd37515c5e9e71b4f8c0825a70758424f2973","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-01T03:15:24Z","title_canon_sha256":"f5377a3e5d60779013b9d797d8c3dcc05b9f19877cdd3b84072df2365d83e0d6"},"schema_version":"1.0","source":{"id":"1705.00410","kind":"arxiv","version":1}},"canonical_sha256":"543b76bec53d59ba26bde45f45018ce5c7d95f4e05f6913b75d51588740a0888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"543b76bec53d59ba26bde45f45018ce5c7d95f4e05f6913b75d51588740a0888","first_computed_at":"2026-05-18T00:45:17.336446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:17.336446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VgsXbaASChnsGm66OwkNS9e4mSJ3iA3s4+esSYATqc7VPQVqKRlH9a5vtv6pliitJ3Nvjycpf+B1aRfxvrtBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:17.337154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00410","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b51d5a4213c3c3e6ab65fc3c2424b11d9e3a4f15f0d034acaafd3a2dd7546f17","sha256:ce50b455c79d876e176d750b91a064739c01907899374d7db50228d6ba8a9a97"],"state_sha256":"885f501499b84c997afda87b3a0f8c66c174d137394d139d254767b0fcb27713"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZBnvycB8fetBOcX3ByE8jZBFKVklsVw/yckTmrtiLVuc45Wn2bWA9X3O6q8TOnFSk8Zg1G9SUgXAcclA2hrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:16:50.609267Z","bundle_sha256":"8e8f87961f5655b2a8875c52ea283a9f28792da5789575356ad5bc05b7c4229e"}}