{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BNM7DB6GHPPDEP72674N56ZFFE","short_pith_number":"pith:BNM7DB6G","canonical_record":{"source":{"id":"1710.03210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T17:45:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2699d656a2289cfdf91d753441d87759c357e048dde762b410a105cd7e68a9d","abstract_canon_sha256":"cf25fa7e31f84874abbd121a81a549feb947cf135f798448eae0320133d9974e"},"schema_version":"1.0"},"canonical_sha256":"0b59f187c63bde323ffaf7f8defb2529293cb581232776abb106ce8a6f640a47","source":{"kind":"arxiv","id":"1710.03210","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BNM7DB6GHPPDEP72674N56ZFFE","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T17:45:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2699d656a2289cfdf91d753441d87759c357e048dde762b410a105cd7e68a9d","abstract_canon_sha256":"cf25fa7e31f84874abbd121a81a549feb947cf135f798448eae0320133d9974e"},"schema_version":"1.0"},"canonical_sha256":"0b59f187c63bde323ffaf7f8defb2529293cb581232776abb106ce8a6f640a47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:03.299964Z","signature_b64":"51Ck6/q2/5uusi1nE1qpG6hZTwfX2L4+cmNskjPjCIghbrbo5M/1503hlZ8JfsC3kOOAO+4o9sBF1gVSV8D3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b59f187c63bde323ffaf7f8defb2529293cb581232776abb106ce8a6f640a47","last_reissued_at":"2026-05-18T00:08:03.299194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:03.299194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03210","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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuvJ2ZVUteGLAdHWBIBmc7iUqoyPwBifbWOBun6iRQ8eNOAukwCTQPMF+tfJHhRCLmRpJnD++6cFFlsn3tvlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:10:20.516830Z"},"content_sha256":"e659defb94fccfa4ef6d67af00692525280ae5a09aa80367ca9c8f07f012a19d","schema_version":"1.0","event_id":"sha256:e659defb94fccfa4ef6d67af00692525280ae5a09aa80367ca9c8f07f012a19d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BNM7DB6GHPPDEP72674N56ZFFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes","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-10-09T17:45:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03210","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:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPBND5Qkwm966fp3FFQSU2pGNIX+1Hk4AszIKmeJeTk9VufsYPK5grHUW1KTLV+pnVXnyQXO+xUX/b5Pl1QJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:10:20.517496Z"},"content_sha256":"4b131b9d064bc860e3cba7887e1bef8d6872aa1d0d1eb82acca1b2f92f36cc1b","schema_version":"1.0","event_id":"sha256:4b131b9d064bc860e3cba7887e1bef8d6872aa1d0d1eb82acca1b2f92f36cc1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNM7DB6GHPPDEP72674N56ZFFE/bundle.json","state_url":"https://pith.science/pith/BNM7DB6GHPPDEP72674N56ZFFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNM7DB6GHPPDEP72674N56ZFFE/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-07T06:10:20Z","links":{"resolver":"https://pith.science/pith/BNM7DB6GHPPDEP72674N56ZFFE","bundle":"https://pith.science/pith/BNM7DB6GHPPDEP72674N56ZFFE/bundle.json","state":"https://pith.science/pith/BNM7DB6GHPPDEP72674N56ZFFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNM7DB6GHPPDEP72674N56ZFFE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTd3cwvHBx1H7H1HpDEVALUqgyeiOFtDCU7OWqLC0yA0gY72rfRP0LmLGqXHURp81mwvRqrrGHLC81WoxVY/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:10:20.521399Z","bundle_sha256":"7750857f337179023bb3b2c7625a0a895438233049f1924976e588cf0228886b"}}