{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QQKMR2RER533UK6FOXKVOMVGA2","short_pith_number":"pith:QQKMR2RE","canonical_record":{"source":{"id":"1106.3595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T23:49:11Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"64e74465cfcf8ba80c6341fb78b750b313d2feda680c5b9fd5848960ebb5ed51","abstract_canon_sha256":"26283e6d19a80ea9731adde062818caa8f18fc1f9bb1669ff273f7383a7c0ddf"},"schema_version":"1.0"},"canonical_sha256":"8414c8ea248f77ba2bc575d55732a6068f73cd0f5ac84cc49690ac583dcd9b25","source":{"kind":"arxiv","id":"1106.3595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3595","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3595v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3595","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"QQKMR2RER533","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QQKMR2RER533UK6F","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QQKMR2RE","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QQKMR2RER533UK6FOXKVOMVGA2","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T23:49:11Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"64e74465cfcf8ba80c6341fb78b750b313d2feda680c5b9fd5848960ebb5ed51","abstract_canon_sha256":"26283e6d19a80ea9731adde062818caa8f18fc1f9bb1669ff273f7383a7c0ddf"},"schema_version":"1.0"},"canonical_sha256":"8414c8ea248f77ba2bc575d55732a6068f73cd0f5ac84cc49690ac583dcd9b25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.704336Z","signature_b64":"TXJyujhpXTaNhSg1OoGJA80yVTpKAisBm70LZEs1jKG7l+nopiUH4Rv0eaGAJMuQDHnNQWTjJOj6jgl45tuODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8414c8ea248f77ba2bc575d55732a6068f73cd0f5ac84cc49690ac583dcd9b25","last_reissued_at":"2026-05-18T04:19:42.703669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.703669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3595","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byES+3PpyDVn9qNiQ2zmBOXji9VO/+mC7K0SQVM2Yh3I9TIpKprFrSPafG7XXJOVeXUfSA7531/tNbTlHs5wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:28:42.018205Z"},"content_sha256":"7eaa2256e7610239328e4237db665cb9996e9e0d809beb3f420c1a5ea04af953","schema_version":"1.0","event_id":"sha256:7eaa2256e7610239328e4237db665cb9996e9e0d809beb3f420c1a5ea04af953"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QQKMR2RER533UK6FOXKVOMVGA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Equals Amortized Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Anup Rao, Mark Braverman","submitted_at":"2011-06-17T23:49:11Z","abstract_excerpt":"We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver. This is a generalization and strengthening of the Slepian-Wolf theorem, which shows how to carry out such a simulation with low amortized communication in the case that M is a deterministic function of X. A caveat is that our simulation is interactive.\n  As a consequence, we prove that the internal information cost ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3595","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gUIIhnsasI32iQQjVzO+BRMzqpk+iVAxcL7hLKwf7sDE+vDzW+ATM5apS2/t8Hug0LVyyxpjbvJ2+mmbP32Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:28:42.018568Z"},"content_sha256":"dbbf679ed71df94e172a8b5be3ddd67eede12562df7ae137d44ff8dfd59a5cb7","schema_version":"1.0","event_id":"sha256:dbbf679ed71df94e172a8b5be3ddd67eede12562df7ae137d44ff8dfd59a5cb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQKMR2RER533UK6FOXKVOMVGA2/bundle.json","state_url":"https://pith.science/pith/QQKMR2RER533UK6FOXKVOMVGA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQKMR2RER533UK6FOXKVOMVGA2/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-12T00:28:42Z","links":{"resolver":"https://pith.science/pith/QQKMR2RER533UK6FOXKVOMVGA2","bundle":"https://pith.science/pith/QQKMR2RER533UK6FOXKVOMVGA2/bundle.json","state":"https://pith.science/pith/QQKMR2RER533UK6FOXKVOMVGA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQKMR2RER533UK6FOXKVOMVGA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QQKMR2RER533UK6FOXKVOMVGA2","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":"26283e6d19a80ea9731adde062818caa8f18fc1f9bb1669ff273f7383a7c0ddf","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T23:49:11Z","title_canon_sha256":"64e74465cfcf8ba80c6341fb78b750b313d2feda680c5b9fd5848960ebb5ed51"},"schema_version":"1.0","source":{"id":"1106.3595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3595","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3595v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3595","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"QQKMR2RER533","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QQKMR2RER533UK6F","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QQKMR2RE","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:dbbf679ed71df94e172a8b5be3ddd67eede12562df7ae137d44ff8dfd59a5cb7","target":"graph","created_at":"2026-05-18T04:19:42Z","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":"We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver. This is a generalization and strengthening of the Slepian-Wolf theorem, which shows how to carry out such a simulation with low amortized communication in the case that M is a deterministic function of X. A caveat is that our simulation is interactive.\n  As a consequence, we prove that the internal information cost (","authors_text":"Anup Rao, Mark Braverman","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T23:49:11Z","title":"Information Equals Amortized Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3595","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:7eaa2256e7610239328e4237db665cb9996e9e0d809beb3f420c1a5ea04af953","target":"record","created_at":"2026-05-18T04:19:42Z","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":"26283e6d19a80ea9731adde062818caa8f18fc1f9bb1669ff273f7383a7c0ddf","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T23:49:11Z","title_canon_sha256":"64e74465cfcf8ba80c6341fb78b750b313d2feda680c5b9fd5848960ebb5ed51"},"schema_version":"1.0","source":{"id":"1106.3595","kind":"arxiv","version":1}},"canonical_sha256":"8414c8ea248f77ba2bc575d55732a6068f73cd0f5ac84cc49690ac583dcd9b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8414c8ea248f77ba2bc575d55732a6068f73cd0f5ac84cc49690ac583dcd9b25","first_computed_at":"2026-05-18T04:19:42.703669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:42.703669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TXJyujhpXTaNhSg1OoGJA80yVTpKAisBm70LZEs1jKG7l+nopiUH4Rv0eaGAJMuQDHnNQWTjJOj6jgl45tuODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:42.704336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eaa2256e7610239328e4237db665cb9996e9e0d809beb3f420c1a5ea04af953","sha256:dbbf679ed71df94e172a8b5be3ddd67eede12562df7ae137d44ff8dfd59a5cb7"],"state_sha256":"95723871ed060a5d26850775f16faba2f761826a2db73a8e4708e8885bcd1e22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOM2N4pKq70HNazxY98vnS03+3cpcn/aR4gb6ff4bNho5zqMbn4QdeO6mwz02n/kZrjAhSRz2b4WmdMFsU3PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:28:42.020566Z","bundle_sha256":"ec445167873cbc431cdedafb975209482059fc3834f7ce4c9dbefeb4242f5a44"}}