{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LXE742Z4WFA4MIRCTYWSLNI5UX","short_pith_number":"pith:LXE742Z4","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"},"canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","source":{"kind":"arxiv","id":"1205.4674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4674","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4674v1","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4674","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"LXE742Z4WFA4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LXE742Z4WFA4MIRC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LXE742Z4","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LXE742Z4WFA4MIRCTYWSLNI5UX","target":"record","payload":{"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"},"canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","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"},"source_kind":"arxiv","source_id":"1205.4674","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-18T02:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OA0MWipaUr8Xt0ndDXvJJOzEY6wOuIfHr5AuU14JWBjQV2py8ze8CsSeP8Gmalg0p7KfhXCm7hTpjMmdYkWBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:50.103386Z"},"content_sha256":"08760150c8a448c688f3991a4cd2ddf241d8873c7e3ec0568f0800fbb0487de5","schema_version":"1.0","event_id":"sha256:08760150c8a448c688f3991a4cd2ddf241d8873c7e3ec0568f0800fbb0487de5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LXE742Z4WFA4MIRCTYWSLNI5UX","target":"graph","payload":{"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"},"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-18T02:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQr08wHsfPC8Q3Emu8ISoq7gGXYHH2saqt8gMMOaJT/zKKMLhPtPCHGuBJHuFNgmfDskEXBSrKQ4Uh3Yj/tPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:50.104136Z"},"content_sha256":"f7a091cb0680f04571d63ada4537e031a1af5dfc045d3c0fc6ba5895b802924b","schema_version":"1.0","event_id":"sha256:f7a091cb0680f04571d63ada4537e031a1af5dfc045d3c0fc6ba5895b802924b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/bundle.json","state_url":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/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-05-31T18:22:50Z","links":{"resolver":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX","bundle":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/bundle.json","state":"https://pith.science/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXE742Z4WFA4MIRCTYWSLNI5UX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LXE742Z4WFA4MIRCTYWSLNI5UX","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":"7ad469cf66cfccf34619b7d646966e186dfb1493b6d451c4f507ad4b32a97ff1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-21T18:16:26Z","title_canon_sha256":"9308ffa2f562b045d2fd757f0de0d38d3c1f9247cf56b2f1a457a16366758995"},"schema_version":"1.0","source":{"id":"1205.4674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4674","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4674v1","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4674","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"LXE742Z4WFA4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LXE742Z4WFA4MIRC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LXE742Z4","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:f7a091cb0680f04571d63ada4537e031a1af5dfc045d3c0fc6ba5895b802924b","target":"graph","created_at":"2026-05-18T02:21:10Z","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":"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. ","authors_text":"Haim Permuter, Ohad Elishco","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-21T18:16:26Z","title":"Capacity and coding for the Ising Channel with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4674","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:08760150c8a448c688f3991a4cd2ddf241d8873c7e3ec0568f0800fbb0487de5","target":"record","created_at":"2026-05-18T02:21:10Z","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":"7ad469cf66cfccf34619b7d646966e186dfb1493b6d451c4f507ad4b32a97ff1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-21T18:16:26Z","title_canon_sha256":"9308ffa2f562b045d2fd757f0de0d38d3c1f9247cf56b2f1a457a16366758995"},"schema_version":"1.0","source":{"id":"1205.4674","kind":"arxiv","version":1}},"canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dc9fe6b3cb141c622229e2d25b51da5eeae59e6d32966b2ae0cbb3a2b5b4b16","first_computed_at":"2026-05-18T02:21:10.161669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:10.161669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W5Hewtt7CpcQskUmpoDsmW5axYmgyy3s9nl3scm6IG5K0l31mgfIYxhS6knfOe7wk2RRX9nh2uMZwBoRNM2FAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:10.162124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08760150c8a448c688f3991a4cd2ddf241d8873c7e3ec0568f0800fbb0487de5","sha256:f7a091cb0680f04571d63ada4537e031a1af5dfc045d3c0fc6ba5895b802924b"],"state_sha256":"d29495e4788fc915f0fb0d3b78f239d9226dfdb93387539944709a2544a0dc7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jE7Nih3xoxxI4R5zseIse0e34uvje6XrWLveSFvR6/Zy9TIbK0ELLY6YGtycm6XJUis6/n+OLUR0HTwual9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:22:50.108038Z","bundle_sha256":"e900538f172e19cd8082bf93a01b4670fd0cc0ae1aa24ba464a71f8323cb75d8"}}