{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LXE742Z4WFA4MIRCTYWSLNI5UX","short_pith_number":"pith:LXE742Z4","schema_version":"1.0","canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","source":{"kind":"arxiv","id":"1205.4674","version":1},"attestation_state":"computed","paper":{"title":"Capacity and coding for the Ising Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim Permuter, Ohad Elishco","submitted_at":"2012-05-21T18:16:26Z","abstract_excerpt":"The Ising channel, which was introduced in 1990, is a channel with memory that models Inter-Symbol interference. In this paper we consider the Ising channel with feedback and find the capacity of the channel together with a capacity-achieving coding scheme. To calculate the channel capacity, an equivalent dynamic programming (DP) problem is formulated and solved. Using the DP solution, we establish that the feedback capacity is the expression $C=(\\frac{2H_b(a)}{3+a})\\approx 0.575522$ where $a$ is a particular root of a fourth-degree polynomial and $H_b(x)$ denotes the binary entropy function. "},"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":"1205.4674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-21T18:16:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9308ffa2f562b045d2fd757f0de0d38d3c1f9247cf56b2f1a457a16366758995","abstract_canon_sha256":"7ad469cf66cfccf34619b7d646966e186dfb1493b6d451c4f507ad4b32a97ff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.162124Z","signature_b64":"W5Hewtt7CpcQskUmpoDsmW5axYmgyy3s9nl3scm6IG5K0l31mgfIYxhS6knfOe7wk2RRX9nh2uMZwBoRNM2FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","last_reissued_at":"2026-05-18T02:21:10.161669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.161669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity and coding for the Ising Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim Permuter, Ohad Elishco","submitted_at":"2012-05-21T18:16:26Z","abstract_excerpt":"The Ising channel, which was introduced in 1990, is a channel with memory that models Inter-Symbol interference. In this paper we consider the Ising channel with feedback and find the capacity of the channel together with a capacity-achieving coding scheme. To calculate the channel capacity, an equivalent dynamic programming (DP) problem is formulated and solved. Using the DP solution, we establish that the feedback capacity is the expression $C=(\\frac{2H_b(a)}{3+a})\\approx 0.575522$ where $a$ is a particular root of a fourth-degree polynomial and $H_b(x)$ denotes the binary entropy function. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4674","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":"1205.4674","created_at":"2026-05-18T02:21:10.161741+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4674v1","created_at":"2026-05-18T02:21:10.161741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4674","created_at":"2026-05-18T02:21:10.161741+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXE742Z4WFA4","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXE742Z4WFA4MIRC","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXE742Z4","created_at":"2026-05-18T12:27:14.488303+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/LXE742Z4WFA4MIRCTYWSLNI5UX","json":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX.json","graph_json":"https://pith.science/api/pith-number/LXE742Z4WFA4MIRCTYWSLNI5UX/graph.json","events_json":"https://pith.science/api/pith-number/LXE742Z4WFA4MIRCTYWSLNI5UX/events.json","paper":"https://pith.science/paper/LXE742Z4"},"agent_actions":{"view_html":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX","download_json":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX.json","view_paper":"https://pith.science/paper/LXE742Z4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4674&json=true","fetch_graph":"https://pith.science/api/pith-number/LXE742Z4WFA4MIRCTYWSLNI5UX/graph.json","fetch_events":"https://pith.science/api/pith-number/LXE742Z4WFA4MIRCTYWSLNI5UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/action/storage_attestation","attest_author":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/action/author_attestation","sign_citation":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/action/citation_signature","submit_replication":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/action/replication_record"}},"created_at":"2026-05-18T02:21:10.161741+00:00","updated_at":"2026-05-18T02:21:10.161741+00:00"}