{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TC64GQ3DUOQEPS54ANHULLLHYO","short_pith_number":"pith:TC64GQ3D","canonical_record":{"source":{"id":"1709.09123","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T16:41:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"050c977181410dfd06fadeefcca9fb99b4a4103e5bdb1b531612f6acab3cd24b","abstract_canon_sha256":"6b93e3b50e76c6457d79072a113347b97f733bf782344632cd61db8f277fa1b7"},"schema_version":"1.0"},"canonical_sha256":"98bdc34363a3a047cbbc034f45ad67c3b7eda03fde5c86d3a5c26c7275031279","source":{"kind":"arxiv","id":"1709.09123","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09123","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09123v3","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09123","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"TC64GQ3DUOQE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TC64GQ3DUOQEPS54","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TC64GQ3D","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TC64GQ3DUOQEPS54ANHULLLHYO","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09123","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T16:41:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"050c977181410dfd06fadeefcca9fb99b4a4103e5bdb1b531612f6acab3cd24b","abstract_canon_sha256":"6b93e3b50e76c6457d79072a113347b97f733bf782344632cd61db8f277fa1b7"},"schema_version":"1.0"},"canonical_sha256":"98bdc34363a3a047cbbc034f45ad67c3b7eda03fde5c86d3a5c26c7275031279","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:44.842563Z","signature_b64":"8hZ+AqiekyYSHJTcPhYihuvbpKhT3Gt7slvYMdvKsqQW+XbQhTwzuEECAsY1JoDm0Mv4klGkyjdhWvJlIot5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98bdc34363a3a047cbbc034f45ad67c3b7eda03fde5c86d3a5c26c7275031279","last_reissued_at":"2026-05-18T00:31:44.842077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:44.842077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09123","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-18T00:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9RSsCvdaUXfC7p2Gqo7EgngarnW2kin4DeVMRC4Em5T987EUcK53NB5l8oeX35fVWogKwefeQddOnOVu/lKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:27:44.279023Z"},"content_sha256":"32b8039209b69ceac3ee7874a25bb630d440f47f957aa7856f4506a43a779af9","schema_version":"1.0","event_id":"sha256:32b8039209b69ceac3ee7874a25bb630d440f47f957aa7856f4506a43a779af9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TC64GQ3DUOQEPS54ANHULLLHYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive Coding for Markovian Protocols","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, Young-Han Kim","submitted_at":"2017-09-26T16:41:04Z","abstract_excerpt":"We address the problem of simulating an arbitrary Markovian interactive protocol over binary symmetric channels with crossover probability $\\varepsilon$. We are interested in the achievable rates of reliable simulation, i.e., in characterizing the smallest possible blowup in communications such that a vanishing error probability (in the protocol length) can be attained. Whereas for general interactive protocols the output of each party may depend on all previous outputs of its counterpart, in a (first order) Markovian protocol this dependence is limited to the last observed output only. In the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09123","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-18T00:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEA6WGbIJoD50qbJqjgFU0k8yq9vivOY4+4MIb3dn0qyn6/m3pIDiNukoSHIbSZNsKtPv1NYkwqARzq1PrJDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:27:44.279378Z"},"content_sha256":"4f2a817438507fc4faf25a14ec497a87075b48a2a06a002b99901fe0b5b3e8c1","schema_version":"1.0","event_id":"sha256:4f2a817438507fc4faf25a14ec497a87075b48a2a06a002b99901fe0b5b3e8c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TC64GQ3DUOQEPS54ANHULLLHYO/bundle.json","state_url":"https://pith.science/pith/TC64GQ3DUOQEPS54ANHULLLHYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TC64GQ3DUOQEPS54ANHULLLHYO/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-03T09:27:44Z","links":{"resolver":"https://pith.science/pith/TC64GQ3DUOQEPS54ANHULLLHYO","bundle":"https://pith.science/pith/TC64GQ3DUOQEPS54ANHULLLHYO/bundle.json","state":"https://pith.science/pith/TC64GQ3DUOQEPS54ANHULLLHYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TC64GQ3DUOQEPS54ANHULLLHYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TC64GQ3DUOQEPS54ANHULLLHYO","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":"6b93e3b50e76c6457d79072a113347b97f733bf782344632cd61db8f277fa1b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T16:41:04Z","title_canon_sha256":"050c977181410dfd06fadeefcca9fb99b4a4103e5bdb1b531612f6acab3cd24b"},"schema_version":"1.0","source":{"id":"1709.09123","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09123","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09123v3","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09123","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"TC64GQ3DUOQE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TC64GQ3DUOQEPS54","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TC64GQ3D","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:4f2a817438507fc4faf25a14ec497a87075b48a2a06a002b99901fe0b5b3e8c1","target":"graph","created_at":"2026-05-18T00:31:44Z","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 address the problem of simulating an arbitrary Markovian interactive protocol over binary symmetric channels with crossover probability $\\varepsilon$. We are interested in the achievable rates of reliable simulation, i.e., in characterizing the smallest possible blowup in communications such that a vanishing error probability (in the protocol length) can be attained. Whereas for general interactive protocols the output of each party may depend on all previous outputs of its counterpart, in a (first order) Markovian protocol this dependence is limited to the last observed output only. In the","authors_text":"Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T16:41:04Z","title":"Interactive Coding for Markovian Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09123","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:32b8039209b69ceac3ee7874a25bb630d440f47f957aa7856f4506a43a779af9","target":"record","created_at":"2026-05-18T00:31:44Z","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":"6b93e3b50e76c6457d79072a113347b97f733bf782344632cd61db8f277fa1b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T16:41:04Z","title_canon_sha256":"050c977181410dfd06fadeefcca9fb99b4a4103e5bdb1b531612f6acab3cd24b"},"schema_version":"1.0","source":{"id":"1709.09123","kind":"arxiv","version":3}},"canonical_sha256":"98bdc34363a3a047cbbc034f45ad67c3b7eda03fde5c86d3a5c26c7275031279","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98bdc34363a3a047cbbc034f45ad67c3b7eda03fde5c86d3a5c26c7275031279","first_computed_at":"2026-05-18T00:31:44.842077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:44.842077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8hZ+AqiekyYSHJTcPhYihuvbpKhT3Gt7slvYMdvKsqQW+XbQhTwzuEECAsY1JoDm0Mv4klGkyjdhWvJlIot5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:44.842563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09123","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b8039209b69ceac3ee7874a25bb630d440f47f957aa7856f4506a43a779af9","sha256:4f2a817438507fc4faf25a14ec497a87075b48a2a06a002b99901fe0b5b3e8c1"],"state_sha256":"7812aab33cb93c44a4a01ebe2d92c4f6e75a56fdd23b8ae91bd07802559fb73a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlcHvwoOAUAQms4ha8X8G6o/EBgFDdSKHokt7fEho2AOLJ8CPdd9AMUAdFIo6WlAn/z/WxUA7+5r7utend+nDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:27:44.281284Z","bundle_sha256":"96d5b24ea094f76f7c30afb830f1df2e672efc74b2798c6d69bf90ebd7624420"}}