{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OVTDZUWWTNEKJYPHI6BSIUOGT7","short_pith_number":"pith:OVTDZUWW","schema_version":"1.0","canonical_sha256":"75663cd2d69b48a4e1e747832451c69ff9df3dd53f786f033c2fdbc840d8d6ec","source":{"kind":"arxiv","id":"1809.10934","version":1},"attestation_state":"computed","paper":{"title":"Strong Coordination over Noisy Channels with Strictly Causal Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giulia Cervia, Laura Luzzi, Ma\\\"el Le Treust, Matthieu R. Bloch","submitted_at":"2018-09-28T09:43:43Z","abstract_excerpt":"We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes."},"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":"1809.10934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-28T09:43:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06bd9236ff199a04934b42d9c3f15d7d79214d43c8b8010cedaefb6351e49cee","abstract_canon_sha256":"2ba3e9e5c5d1c856c3a88e9a78abd041dafec3928a92e932338fc7b8563f9d23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:31.562766Z","signature_b64":"3PrqkiIs2HvX+UNqKu5SS1cmsjLpqmltkUyC5VXiZHuchGmYTujA7qxUFr4xsGpmNmUIcy5rulH3RQkjtwgpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75663cd2d69b48a4e1e747832451c69ff9df3dd53f786f033c2fdbc840d8d6ec","last_reissued_at":"2026-05-18T00:03:31.562139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:31.562139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Coordination over Noisy Channels with Strictly Causal Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giulia Cervia, Laura Luzzi, Ma\\\"el Le Treust, Matthieu R. Bloch","submitted_at":"2018-09-28T09:43:43Z","abstract_excerpt":"We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10934","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":"1809.10934","created_at":"2026-05-18T00:03:31.562234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10934v1","created_at":"2026-05-18T00:03:31.562234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10934","created_at":"2026-05-18T00:03:31.562234+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVTDZUWWTNEK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVTDZUWWTNEKJYPH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVTDZUWW","created_at":"2026-05-18T12:32:43.782077+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/OVTDZUWWTNEKJYPHI6BSIUOGT7","json":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7.json","graph_json":"https://pith.science/api/pith-number/OVTDZUWWTNEKJYPHI6BSIUOGT7/graph.json","events_json":"https://pith.science/api/pith-number/OVTDZUWWTNEKJYPHI6BSIUOGT7/events.json","paper":"https://pith.science/paper/OVTDZUWW"},"agent_actions":{"view_html":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7","download_json":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7.json","view_paper":"https://pith.science/paper/OVTDZUWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10934&json=true","fetch_graph":"https://pith.science/api/pith-number/OVTDZUWWTNEKJYPHI6BSIUOGT7/graph.json","fetch_events":"https://pith.science/api/pith-number/OVTDZUWWTNEKJYPHI6BSIUOGT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7/action/storage_attestation","attest_author":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7/action/author_attestation","sign_citation":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7/action/citation_signature","submit_replication":"https://pith.science/pith/OVTDZUWWTNEKJYPHI6BSIUOGT7/action/replication_record"}},"created_at":"2026-05-18T00:03:31.562234+00:00","updated_at":"2026-05-18T00:03:31.562234+00:00"}