{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5S7EXCHEHYR2FHJV42LNOF6URI","short_pith_number":"pith:5S7EXCHE","canonical_record":{"source":{"id":"1704.08771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-27T23:01:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c55680b2b03df26b68f453101c02b96941411d4b5bceb04b8dd55cedf9a90cd2","abstract_canon_sha256":"23836bdb58a174d9a47c9fec2795dca0c0deb20c1f01c196c1f851652bf14337"},"schema_version":"1.0"},"canonical_sha256":"ecbe4b88e43e23a29d35e696d717d48a3f9822b8fc7e590d07e88ede93089263","source":{"kind":"arxiv","id":"1704.08771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08771","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08771v1","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08771","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"5S7EXCHEHYR2","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5S7EXCHEHYR2FHJV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5S7EXCHE","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5S7EXCHEHYR2FHJV42LNOF6URI","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-27T23:01:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c55680b2b03df26b68f453101c02b96941411d4b5bceb04b8dd55cedf9a90cd2","abstract_canon_sha256":"23836bdb58a174d9a47c9fec2795dca0c0deb20c1f01c196c1f851652bf14337"},"schema_version":"1.0"},"canonical_sha256":"ecbe4b88e43e23a29d35e696d717d48a3f9822b8fc7e590d07e88ede93089263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:05.242330Z","signature_b64":"qBrF1xoH7EE/arY14PqZYeg67R+66MO5EMd8lQiGbjChng71Cxi9fspq1parZwXz7vlURoteGl0DGfF9KSggBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecbe4b88e43e23a29d35e696d717d48a3f9822b8fc7e590d07e88ede93089263","last_reissued_at":"2026-05-18T00:08:05.241856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:05.241856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08771","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-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oV8xfDCr3KGH5l+xCw3Nk8s3myt+H7XX8Nw/wRVYhkhiwFUC14R7QISDFSnRe4ESfdIp80GGREPuzahivEgpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:16:50.492322Z"},"content_sha256":"b9b941281ef4e57d37f508af8596ec8239557eddbd8ad233ca1905fc5a7327a7","schema_version":"1.0","event_id":"sha256:b9b941281ef4e57d37f508af8596ec8239557eddbd8ad233ca1905fc5a7327a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5S7EXCHEHYR2FHJV42LNOF6URI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Coordination over Noisy Channels: Is Separation Sufficient?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badri N. Vellambi, J\\\"org Kliewer, Sarah A. Obead","submitted_at":"2017-04-27T23:01:22Z","abstract_excerpt":"We study the problem of strong coordination of actions of two agents $X$ and $Y$ that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this noisy strong coordination problem, and derive inner bounds for the underlying strong coordination capacity region. The first scheme is a joint coordination-channel coding scheme that utilizes the randomness provided by the communication channel to reduce the local randomness required in generating the action sequence at agent $Y$. The second scheme exploits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08771","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-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJMHOp2WGRZ9q/O2yEg91QHH3asmcuxXQ17I7rDQ/7v5yJmE3ukdgka3LhuZsMxZ3ujGCBFBj/p7TwJR9eQmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:16:50.492912Z"},"content_sha256":"3fcfcafab662fd01db3c635b488a8ad9bfab47748d216fa6b27061bb9abb4b8a","schema_version":"1.0","event_id":"sha256:3fcfcafab662fd01db3c635b488a8ad9bfab47748d216fa6b27061bb9abb4b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5S7EXCHEHYR2FHJV42LNOF6URI/bundle.json","state_url":"https://pith.science/pith/5S7EXCHEHYR2FHJV42LNOF6URI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5S7EXCHEHYR2FHJV42LNOF6URI/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-07T10:16:50Z","links":{"resolver":"https://pith.science/pith/5S7EXCHEHYR2FHJV42LNOF6URI","bundle":"https://pith.science/pith/5S7EXCHEHYR2FHJV42LNOF6URI/bundle.json","state":"https://pith.science/pith/5S7EXCHEHYR2FHJV42LNOF6URI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5S7EXCHEHYR2FHJV42LNOF6URI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5S7EXCHEHYR2FHJV42LNOF6URI","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":"23836bdb58a174d9a47c9fec2795dca0c0deb20c1f01c196c1f851652bf14337","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-27T23:01:22Z","title_canon_sha256":"c55680b2b03df26b68f453101c02b96941411d4b5bceb04b8dd55cedf9a90cd2"},"schema_version":"1.0","source":{"id":"1704.08771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08771","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08771v1","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08771","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"5S7EXCHEHYR2","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5S7EXCHEHYR2FHJV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5S7EXCHE","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:3fcfcafab662fd01db3c635b488a8ad9bfab47748d216fa6b27061bb9abb4b8a","target":"graph","created_at":"2026-05-18T00:08:05Z","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 study the problem of strong coordination of actions of two agents $X$ and $Y$ that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this noisy strong coordination problem, and derive inner bounds for the underlying strong coordination capacity region. The first scheme is a joint coordination-channel coding scheme that utilizes the randomness provided by the communication channel to reduce the local randomness required in generating the action sequence at agent $Y$. The second scheme exploits ","authors_text":"Badri N. Vellambi, J\\\"org Kliewer, Sarah A. Obead","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-27T23:01:22Z","title":"Strong Coordination over Noisy Channels: Is Separation Sufficient?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08771","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:b9b941281ef4e57d37f508af8596ec8239557eddbd8ad233ca1905fc5a7327a7","target":"record","created_at":"2026-05-18T00:08:05Z","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":"23836bdb58a174d9a47c9fec2795dca0c0deb20c1f01c196c1f851652bf14337","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-27T23:01:22Z","title_canon_sha256":"c55680b2b03df26b68f453101c02b96941411d4b5bceb04b8dd55cedf9a90cd2"},"schema_version":"1.0","source":{"id":"1704.08771","kind":"arxiv","version":1}},"canonical_sha256":"ecbe4b88e43e23a29d35e696d717d48a3f9822b8fc7e590d07e88ede93089263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecbe4b88e43e23a29d35e696d717d48a3f9822b8fc7e590d07e88ede93089263","first_computed_at":"2026-05-18T00:08:05.241856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:05.241856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qBrF1xoH7EE/arY14PqZYeg67R+66MO5EMd8lQiGbjChng71Cxi9fspq1parZwXz7vlURoteGl0DGfF9KSggBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:05.242330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9b941281ef4e57d37f508af8596ec8239557eddbd8ad233ca1905fc5a7327a7","sha256:3fcfcafab662fd01db3c635b488a8ad9bfab47748d216fa6b27061bb9abb4b8a"],"state_sha256":"f9669aaee7969d6120f3258abad0c7b5cbac36d96cda9cc40e204bbbe6ff7b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3U1vHAYTqz1QuW0LkRRa+g1/egy1R7FgV5w0NWayAjCvP+qxv2cxEy4KAnBdWB7Xf5sAOhdk6xpE0gBdcyQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:16:50.497265Z","bundle_sha256":"e3b21d2984730e1d89bb92a823123e9801795a49fa506142e126bf0510087b91"}}