{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DMQKK4UIJKBQVXFRF642TTEZR4","short_pith_number":"pith:DMQKK4UI","canonical_record":{"source":{"id":"1701.02827","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T02:10:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf2c3691d25c3518d66a3cd715053d4b0302b2b349c2682e540e510f4fbc3cdc","abstract_canon_sha256":"9f57c992ac4bb19ccbf434a39520c2da742c0154aadbb0fd7df2f514a7b17912"},"schema_version":"1.0"},"canonical_sha256":"1b20a572884a830adcb12fb9a9cc998f1fb4e5bb85cbc285d1f55ea0ed6217e7","source":{"kind":"arxiv","id":"1701.02827","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02827","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02827v4","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02827","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"DMQKK4UIJKBQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMQKK4UIJKBQVXFR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMQKK4UI","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DMQKK4UIJKBQVXFRF642TTEZR4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02827","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T02:10:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf2c3691d25c3518d66a3cd715053d4b0302b2b349c2682e540e510f4fbc3cdc","abstract_canon_sha256":"9f57c992ac4bb19ccbf434a39520c2da742c0154aadbb0fd7df2f514a7b17912"},"schema_version":"1.0"},"canonical_sha256":"1b20a572884a830adcb12fb9a9cc998f1fb4e5bb85cbc285d1f55ea0ed6217e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.387784Z","signature_b64":"dS/IBm77CaHYXHixBwR+S97uGEXfykooBT45thMHlNAV483qB5W2oapBrqN7yOqzdHy13WUUb1HVuuAPBHB9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b20a572884a830adcb12fb9a9cc998f1fb4e5bb85cbc285d1f55ea0ed6217e7","last_reissued_at":"2026-05-17T23:58:50.387211Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.387211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02827","source_version":4,"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDLFJVPw0WqqV5l9QnorRacfVZou1w66lPH0xFUuYYwPO/mId+BzbVikNjulcpzw1JZUmFAb8nW6XSiZyjV4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:08.687884Z"},"content_sha256":"b23f72ef1fa2a82ffc32f9e6947094f58ba2e59bcfb332c4614fe74673f3965b","schema_version":"1.0","event_id":"sha256:b23f72ef1fa2a82ffc32f9e6947094f58ba2e59bcfb332c4614fe74673f3965b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DMQKK4UIJKBQVXFRF642TTEZR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Functional Representation Lemma and Applications to Coding Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Cheuk Ting Li","submitted_at":"2017-01-11T02:10:17Z","abstract_excerpt":"This paper shows that for any random variables $X$ and $Y$, it is possible to represent $Y$ as a function of $(X,Z)$ such that $Z$ is independent of $X$ and $I(X;Z|Y)\\le\\log(I(X;Y)+1)+4$ bits. We use this strong functional representation lemma (SFRL) to establish a bound on the rate needed for one-shot exact channel simulation for general (discrete or continuous) random variables, strengthening the results by Harsha et al. and Braverman and Garg, and to establish new and simple achievability results for one-shot variable-length lossy source coding, multiple description coding and Gray-Wyner sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02827","kind":"arxiv","version":4},"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPkGJNnnziR3pZ8j7di444obqCtOtGKhZKRZ8QVKXryvGqpXQkwJH36Wizm0oXCaMJXzD3mlCUPfCWuOj5RnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:08.688222Z"},"content_sha256":"7dbc06ecea3154a105d64bc2d73a9d1cf32b2d73168269b504a608df650e59ff","schema_version":"1.0","event_id":"sha256:7dbc06ecea3154a105d64bc2d73a9d1cf32b2d73168269b504a608df650e59ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMQKK4UIJKBQVXFRF642TTEZR4/bundle.json","state_url":"https://pith.science/pith/DMQKK4UIJKBQVXFRF642TTEZR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMQKK4UIJKBQVXFRF642TTEZR4/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-03T13:08:08Z","links":{"resolver":"https://pith.science/pith/DMQKK4UIJKBQVXFRF642TTEZR4","bundle":"https://pith.science/pith/DMQKK4UIJKBQVXFRF642TTEZR4/bundle.json","state":"https://pith.science/pith/DMQKK4UIJKBQVXFRF642TTEZR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMQKK4UIJKBQVXFRF642TTEZR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DMQKK4UIJKBQVXFRF642TTEZR4","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":"9f57c992ac4bb19ccbf434a39520c2da742c0154aadbb0fd7df2f514a7b17912","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T02:10:17Z","title_canon_sha256":"cf2c3691d25c3518d66a3cd715053d4b0302b2b349c2682e540e510f4fbc3cdc"},"schema_version":"1.0","source":{"id":"1701.02827","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02827","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02827v4","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02827","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"DMQKK4UIJKBQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMQKK4UIJKBQVXFR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMQKK4UI","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7dbc06ecea3154a105d64bc2d73a9d1cf32b2d73168269b504a608df650e59ff","target":"graph","created_at":"2026-05-17T23:58:50Z","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":"This paper shows that for any random variables $X$ and $Y$, it is possible to represent $Y$ as a function of $(X,Z)$ such that $Z$ is independent of $X$ and $I(X;Z|Y)\\le\\log(I(X;Y)+1)+4$ bits. We use this strong functional representation lemma (SFRL) to establish a bound on the rate needed for one-shot exact channel simulation for general (discrete or continuous) random variables, strengthening the results by Harsha et al. and Braverman and Garg, and to establish new and simple achievability results for one-shot variable-length lossy source coding, multiple description coding and Gray-Wyner sy","authors_text":"Abbas El Gamal, Cheuk Ting Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T02:10:17Z","title":"Strong Functional Representation Lemma and Applications to Coding Theorems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02827","kind":"arxiv","version":4},"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:b23f72ef1fa2a82ffc32f9e6947094f58ba2e59bcfb332c4614fe74673f3965b","target":"record","created_at":"2026-05-17T23:58:50Z","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":"9f57c992ac4bb19ccbf434a39520c2da742c0154aadbb0fd7df2f514a7b17912","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T02:10:17Z","title_canon_sha256":"cf2c3691d25c3518d66a3cd715053d4b0302b2b349c2682e540e510f4fbc3cdc"},"schema_version":"1.0","source":{"id":"1701.02827","kind":"arxiv","version":4}},"canonical_sha256":"1b20a572884a830adcb12fb9a9cc998f1fb4e5bb85cbc285d1f55ea0ed6217e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b20a572884a830adcb12fb9a9cc998f1fb4e5bb85cbc285d1f55ea0ed6217e7","first_computed_at":"2026-05-17T23:58:50.387211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:50.387211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dS/IBm77CaHYXHixBwR+S97uGEXfykooBT45thMHlNAV483qB5W2oapBrqN7yOqzdHy13WUUb1HVuuAPBHB9Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:50.387784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02827","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b23f72ef1fa2a82ffc32f9e6947094f58ba2e59bcfb332c4614fe74673f3965b","sha256:7dbc06ecea3154a105d64bc2d73a9d1cf32b2d73168269b504a608df650e59ff"],"state_sha256":"f48b1a22f4d26b9f57d2c3bd706dcb6eccbe52fc46b1469544c46888c2240934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6XkzTE4aAqFS2fscqv3MDQsyRXlSKS6ApeceU4JYVowdxt5stz8Wik8wz9PS3TfyUXHHdwSyG+0/fKBM9mdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:08:08.690157Z","bundle_sha256":"b693b252f5d8f0467254daacebd06a3233ceb27ad5ed322949bc0ea059bf30e3"}}