{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BNM7DB6GHPPDEP72674N56ZFFE","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":"cf25fa7e31f84874abbd121a81a549feb947cf135f798448eae0320133d9974e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T17:45:41Z","title_canon_sha256":"a2699d656a2289cfdf91d753441d87759c357e048dde762b410a105cd7e68a9d"},"schema_version":"1.0","source":{"id":"1710.03210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03210","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03210v1","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03210","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"BNM7DB6GHPPD","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BNM7DB6GHPPDEP72","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BNM7DB6G","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:4b131b9d064bc860e3cba7887e1bef8d6872aa1d0d1eb82acca1b2f92f36cc1b","target":"graph","created_at":"2026-05-18T00:08:03Z","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 construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents $\\mathsf X$ and $\\mathsf Y$, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions follows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DM","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-10-09T17:45:41Z","title":"Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03210","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:e659defb94fccfa4ef6d67af00692525280ae5a09aa80367ca9c8f07f012a19d","target":"record","created_at":"2026-05-18T00:08:03Z","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":"cf25fa7e31f84874abbd121a81a549feb947cf135f798448eae0320133d9974e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T17:45:41Z","title_canon_sha256":"a2699d656a2289cfdf91d753441d87759c357e048dde762b410a105cd7e68a9d"},"schema_version":"1.0","source":{"id":"1710.03210","kind":"arxiv","version":1}},"canonical_sha256":"0b59f187c63bde323ffaf7f8defb2529293cb581232776abb106ce8a6f640a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b59f187c63bde323ffaf7f8defb2529293cb581232776abb106ce8a6f640a47","first_computed_at":"2026-05-18T00:08:03.299194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:03.299194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51Ck6/q2/5uusi1nE1qpG6hZTwfX2L4+cmNskjPjCIghbrbo5M/1503hlZ8JfsC3kOOAO+4o9sBF1gVSV8D3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:03.299964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e659defb94fccfa4ef6d67af00692525280ae5a09aa80367ca9c8f07f012a19d","sha256:4b131b9d064bc860e3cba7887e1bef8d6872aa1d0d1eb82acca1b2f92f36cc1b"],"state_sha256":"8aeb4378f4f9291f7891a2739413e7986116335ca78732c7c3d923086c9bf645"}