{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V7444ZHH3FKLCBZWHYNJTRJV34","short_pith_number":"pith:V7444ZHH","schema_version":"1.0","canonical_sha256":"aff9ce64e7d954b107363e1a99c535df084223a3e838902b09f78e0555f00479","source":{"kind":"arxiv","id":"1210.2159","version":1},"attestation_state":"computed","paper":{"title":"Strong Coordination with Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Laura Luzzi, Matthieu R. Bloch","submitted_at":"2012-10-08T07:02:27Z","abstract_excerpt":"In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.2159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-08T07:02:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ad543028f549341bd9691a88308905c09c288bdda3a38422b4be5e27ffcefd9","abstract_canon_sha256":"4f2a7e1b79db26e4580b31379e0557dbf6d060bfec16d4b68dd8bdd660f2af81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:50.937503Z","signature_b64":"IWeqxo8pwRGiJX6JdOTPJj+nsm27VKEfODic3mf+CzakNQEIzGymbrkGv/L7ZH4HzPI59wvJWXUoa3eIWGfvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aff9ce64e7d954b107363e1a99c535df084223a3e838902b09f78e0555f00479","last_reissued_at":"2026-05-18T03:43:50.936892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:50.936892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Coordination with Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Laura Luzzi, Matthieu R. Bloch","submitted_at":"2012-10-08T07:02:27Z","abstract_excerpt":"In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2159","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.2159","created_at":"2026-05-18T03:43:50.936970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2159v1","created_at":"2026-05-18T03:43:50.936970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2159","created_at":"2026-05-18T03:43:50.936970+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7444ZHH3FKL","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7444ZHH3FKLCBZW","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7444ZHH","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34","json":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34.json","graph_json":"https://pith.science/api/pith-number/V7444ZHH3FKLCBZWHYNJTRJV34/graph.json","events_json":"https://pith.science/api/pith-number/V7444ZHH3FKLCBZWHYNJTRJV34/events.json","paper":"https://pith.science/paper/V7444ZHH"},"agent_actions":{"view_html":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34","download_json":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34.json","view_paper":"https://pith.science/paper/V7444ZHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2159&json=true","fetch_graph":"https://pith.science/api/pith-number/V7444ZHH3FKLCBZWHYNJTRJV34/graph.json","fetch_events":"https://pith.science/api/pith-number/V7444ZHH3FKLCBZWHYNJTRJV34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34/action/storage_attestation","attest_author":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34/action/author_attestation","sign_citation":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34/action/citation_signature","submit_replication":"https://pith.science/pith/V7444ZHH3FKLCBZWHYNJTRJV34/action/replication_record"}},"created_at":"2026-05-18T03:43:50.936970+00:00","updated_at":"2026-05-18T03:43:50.936970+00:00"}