{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YYV6TZ5GLASTBJWEAGITJUI35Q","short_pith_number":"pith:YYV6TZ5G","canonical_record":{"source":{"id":"1504.05666","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T06:37:45Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"8e4684b27257e02323f7f9a12576b76316686de4213565ebed6d490786cd88fd","abstract_canon_sha256":"612b6686e49aa6fd63595a29d1243a958ac0a225d2b701fb9f801f6cb3c3d358"},"schema_version":"1.0"},"canonical_sha256":"c62be9e7a6582530a6c4019134d11bec077cc9b0a9b5d8d55593cb7c62335681","source":{"kind":"arxiv","id":"1504.05666","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05666","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05666v3","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05666","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"YYV6TZ5GLAST","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YYV6TZ5GLASTBJWE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YYV6TZ5G","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YYV6TZ5GLASTBJWEAGITJUI35Q","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05666","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T06:37:45Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"8e4684b27257e02323f7f9a12576b76316686de4213565ebed6d490786cd88fd","abstract_canon_sha256":"612b6686e49aa6fd63595a29d1243a958ac0a225d2b701fb9f801f6cb3c3d358"},"schema_version":"1.0"},"canonical_sha256":"c62be9e7a6582530a6c4019134d11bec077cc9b0a9b5d8d55593cb7c62335681","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.761899Z","signature_b64":"uzWJoq2B3JQL5bJsock6/H6CKVyo4RHnpZczt1NVUucka831gjy7JL480RnMB1V2Dl237Y6rSlOorF1HptgdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62be9e7a6582530a6c4019134d11bec077cc9b0a9b5d8d55593cb7c62335681","last_reissued_at":"2026-05-18T01:21:40.761377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.761377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05666","source_version":3,"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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A49h+aOmBiHvkVmovqVWDd9NnDx1xZ8yEnzAukM0/foqKSUHlTo96hVRJQTCItNj2gvZ+qJ8xq6ecZ/6g8nnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:41.102144Z"},"content_sha256":"cfb2f22d55b0f3a1ab848279c12ee3855adf1fbf73274e764969324c35102857","schema_version":"1.0","event_id":"sha256:cfb2f22d55b0f3a1ab848279c12ee3855adf1fbf73274e764969324c35102857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YYV6TZ5GLASTBJWEAGITJUI35Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Complexity Density and Simulation of Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Pramod Viswanath, Shaileshh Venkatakrishnan, Shun Watanabe","submitted_at":"2015-04-22T06:37:45Z","abstract_excerpt":"Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical distance of the joint distribution of the input and the transcript of the original protocol? We present an information spectrum approach for this problem whereby the information complexity of the protocol is replaced by its information complexity density. Our single-shot bounds relate the communication complexity of simulating a protocol to tail bounds for inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05666","kind":"arxiv","version":3},"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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CGG3OrIM365soLJh/kHCfC1CDatNM6444rsVFhnjDQXQY95f186SWls+90DSHXQAiyJj5qY3J7BZSBl8HTjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:41.102856Z"},"content_sha256":"afb3d39f0c3bc4a996f3208d054de4c283d8b4f7ce43b579cde6ea08e5f7223c","schema_version":"1.0","event_id":"sha256:afb3d39f0c3bc4a996f3208d054de4c283d8b4f7ce43b579cde6ea08e5f7223c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/bundle.json","state_url":"https://pith.science/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/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-25T10:59:41Z","links":{"resolver":"https://pith.science/pith/YYV6TZ5GLASTBJWEAGITJUI35Q","bundle":"https://pith.science/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/bundle.json","state":"https://pith.science/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYV6TZ5GLASTBJWEAGITJUI35Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YYV6TZ5GLASTBJWEAGITJUI35Q","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":"612b6686e49aa6fd63595a29d1243a958ac0a225d2b701fb9f801f6cb3c3d358","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T06:37:45Z","title_canon_sha256":"8e4684b27257e02323f7f9a12576b76316686de4213565ebed6d490786cd88fd"},"schema_version":"1.0","source":{"id":"1504.05666","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05666","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05666v3","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05666","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"YYV6TZ5GLAST","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YYV6TZ5GLASTBJWE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YYV6TZ5G","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:afb3d39f0c3bc4a996f3208d054de4c283d8b4f7ce43b579cde6ea08e5f7223c","target":"graph","created_at":"2026-05-18T01:21:40Z","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":"Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical distance of the joint distribution of the input and the transcript of the original protocol? We present an information spectrum approach for this problem whereby the information complexity of the protocol is replaced by its information complexity density. Our single-shot bounds relate the communication complexity of simulating a protocol to tail bounds for inf","authors_text":"Himanshu Tyagi, Pramod Viswanath, Shaileshh Venkatakrishnan, Shun Watanabe","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T06:37:45Z","title":"Information Complexity Density and Simulation of Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05666","kind":"arxiv","version":3},"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:cfb2f22d55b0f3a1ab848279c12ee3855adf1fbf73274e764969324c35102857","target":"record","created_at":"2026-05-18T01:21:40Z","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":"612b6686e49aa6fd63595a29d1243a958ac0a225d2b701fb9f801f6cb3c3d358","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T06:37:45Z","title_canon_sha256":"8e4684b27257e02323f7f9a12576b76316686de4213565ebed6d490786cd88fd"},"schema_version":"1.0","source":{"id":"1504.05666","kind":"arxiv","version":3}},"canonical_sha256":"c62be9e7a6582530a6c4019134d11bec077cc9b0a9b5d8d55593cb7c62335681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c62be9e7a6582530a6c4019134d11bec077cc9b0a9b5d8d55593cb7c62335681","first_computed_at":"2026-05-18T01:21:40.761377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:40.761377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzWJoq2B3JQL5bJsock6/H6CKVyo4RHnpZczt1NVUucka831gjy7JL480RnMB1V2Dl237Y6rSlOorF1HptgdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:40.761899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05666","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfb2f22d55b0f3a1ab848279c12ee3855adf1fbf73274e764969324c35102857","sha256:afb3d39f0c3bc4a996f3208d054de4c283d8b4f7ce43b579cde6ea08e5f7223c"],"state_sha256":"9e3872703e854aba9907e07b30578e812518bdffd9f687b34d4cec095496d9ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGOWSv0YYngXJmHRVSykIEzgo4K81ShydwEYSytDAxK3idi8IPrl9CDdOgIEuENPYM7ELPWlfcpnbLJbbDS5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:59:41.106545Z","bundle_sha256":"fd51b4e9744da791dd743ce91086838db5b27f8297e817d7859cacff6f923048"}}