{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7KT4BFURWMSCF2VB45RKCCWDZ3","short_pith_number":"pith:7KT4BFUR","canonical_record":{"source":{"id":"1908.07367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-20T14:08:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92d23bece9274110316b1d1e2ea39e3b489205368a088d575b333c747724d763","abstract_canon_sha256":"ecaf66cb0692b4765048852cfa028101097b35bfa9fb728b3c0e9b1f7734d6c4"},"schema_version":"1.0"},"canonical_sha256":"faa7c09691b32422eaa1e762a10ac3ced7eef718f0a02a9ef90b0ddaf2b34151","source":{"kind":"arxiv","id":"1908.07367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07367","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07367v2","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07367","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"7KT4BFURWMSC","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"7KT4BFURWMSCF2VB","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"7KT4BFUR","created_at":"2026-07-05T03:05:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7KT4BFURWMSCF2VB45RKCCWDZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-20T14:08:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92d23bece9274110316b1d1e2ea39e3b489205368a088d575b333c747724d763","abstract_canon_sha256":"ecaf66cb0692b4765048852cfa028101097b35bfa9fb728b3c0e9b1f7734d6c4"},"schema_version":"1.0"},"canonical_sha256":"faa7c09691b32422eaa1e762a10ac3ced7eef718f0a02a9ef90b0ddaf2b34151","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:09.495869Z","signature_b64":"uKJwm0KlV+RJk1QaUankeYlrusKF4xhGU72FzK254jl1BD7TcTiGTvtt+89S/7QX70rwCIabHoJpJ4oNbkbVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa7c09691b32422eaa1e762a10ac3ced7eef718f0a02a9ef90b0ddaf2b34151","last_reissued_at":"2026-07-05T03:05:09.495500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:09.495500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07367","source_version":2,"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-07-05T03:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N9DzH/tup/q/nUGCO2SWX4T3WWnBbOHeeajcx7Ik6pbZDc9S9WbF8POemJduaBpjZmTZTItnPX9//HmGBHWRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:25:54.604916Z"},"content_sha256":"734b97bf9d79d6c4626b82fd2c1b08e96367a21d99977079d3727e57642fe63d","schema_version":"1.0","event_id":"sha256:734b97bf9d79d6c4626b82fd2c1b08e96367a21d99977079d3727e57642fe63d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7KT4BFURWMSCF2VB45RKCCWDZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Assaf Ben-Yishai, Ofer Shayevitz, Or Ordentlich, Young-Han Kim","submitted_at":"2019-08-20T14:08:17Z","abstract_excerpt":"The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding scheme. In contrast to other interactive capacity definitions in the literature, this definition makes no assumptions on the order of speakers (which can be adaptive) and does not allow any use of private / public randomness; hence, the essential interactive capacity is a function of the channel model only. It is shown that the essential interactive capacity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07367","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07367/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtCEHhEGcBEAd0tCsYO5EZ6Z6LQ0w/IeqoDKD721Lmyo7FUf7ewk8baGcTGZUEo0T8CcdRR8lNTJAdWZICKODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:25:54.605483Z"},"content_sha256":"2196328907b4aed87f8afcbf91645ecf13a935b14f425c4a46a6e912a71d037b","schema_version":"1.0","event_id":"sha256:2196328907b4aed87f8afcbf91645ecf13a935b14f425c4a46a6e912a71d037b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/bundle.json","state_url":"https://pith.science/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/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-08-16T10:25:54Z","links":{"resolver":"https://pith.science/pith/7KT4BFURWMSCF2VB45RKCCWDZ3","bundle":"https://pith.science/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/bundle.json","state":"https://pith.science/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KT4BFURWMSCF2VB45RKCCWDZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7KT4BFURWMSCF2VB45RKCCWDZ3","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":"ecaf66cb0692b4765048852cfa028101097b35bfa9fb728b3c0e9b1f7734d6c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-20T14:08:17Z","title_canon_sha256":"92d23bece9274110316b1d1e2ea39e3b489205368a088d575b333c747724d763"},"schema_version":"1.0","source":{"id":"1908.07367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07367","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07367v2","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07367","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"7KT4BFURWMSC","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"7KT4BFURWMSCF2VB","created_at":"2026-07-05T03:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"7KT4BFUR","created_at":"2026-07-05T03:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:2196328907b4aed87f8afcbf91645ecf13a935b14f425c4a46a6e912a71d037b","target":"graph","created_at":"2026-07-05T03:05:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding scheme. In contrast to other interactive capacity definitions in the literature, this definition makes no assumptions on the order of speakers (which can be adaptive) and does not allow any use of private / public randomness; hence, the essential interactive capacity is a function of the channel model only. It is shown that the essential interactive capacity o","authors_text":"Assaf Ben-Yishai, Ofer Shayevitz, Or Ordentlich, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07367","kind":"arxiv","version":2},"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:734b97bf9d79d6c4626b82fd2c1b08e96367a21d99977079d3727e57642fe63d","target":"record","created_at":"2026-07-05T03:05:09Z","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":"ecaf66cb0692b4765048852cfa028101097b35bfa9fb728b3c0e9b1f7734d6c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-20T14:08:17Z","title_canon_sha256":"92d23bece9274110316b1d1e2ea39e3b489205368a088d575b333c747724d763"},"schema_version":"1.0","source":{"id":"1908.07367","kind":"arxiv","version":2}},"canonical_sha256":"faa7c09691b32422eaa1e762a10ac3ced7eef718f0a02a9ef90b0ddaf2b34151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa7c09691b32422eaa1e762a10ac3ced7eef718f0a02a9ef90b0ddaf2b34151","first_computed_at":"2026-07-05T03:05:09.495500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:09.495500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uKJwm0KlV+RJk1QaUankeYlrusKF4xhGU72FzK254jl1BD7TcTiGTvtt+89S/7QX70rwCIabHoJpJ4oNbkbVDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:09.495869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:734b97bf9d79d6c4626b82fd2c1b08e96367a21d99977079d3727e57642fe63d","sha256:2196328907b4aed87f8afcbf91645ecf13a935b14f425c4a46a6e912a71d037b"],"state_sha256":"54be6b81c30f5e55848381a1682d52f6e9edec6c17fa3dee2ce04ee0e000c59e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfkSrb0l2TzemB57Rbj6fVsO6RW++dNQ3zL9Ysm2HLbcCKU1mJJ+7mWS6xG2YJNGsGsZtEnsn6ftQ2G18f1wAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:25:54.608936Z","bundle_sha256":"e8bb839f184eb88860a5dddebbc78054bcd596d3a8d72dd879036cfa023604c3"}}