{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XPBHGICHBM5XRC3JOMDSKHAIHD","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":"47abe5b13d877065fb8b82849b0ffea60d97b84965e4b028bf00849a0fc0e4f4","cross_cats_sorted":["cs.ET","cs.LO","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T00:41:19Z","title_canon_sha256":"b8ac57f44c67272281c8442f85462b676afebb13d0162c046b35596e3f892077"},"schema_version":"1.0","source":{"id":"1903.03709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03709","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03709v1","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03709","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"XPBHGICHBM5X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XPBHGICHBM5XRC3J","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XPBHGICH","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:24b43982dde2c0b500633a6be93712e505efbd3f5d975f17555a1c1e276cced4","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"In this paper, we propose a new polar coding scheme with molecular programming, which is capable of highly parallel implementation at a nano-scale without a need of electrical power sources. We designed chemical reaction networks (CRN) to employ either successive cancellation (SC) or maximum-likelihood (ML) decoding schemes for short polar codes. From ordinary differential equation (ODE) analysis of the proposed CRNs, we demonstrate that SC and ML decoding achieve accurate computations across fully-parallel chemical reactions. We also make a comparison in terms of the number of required chemic","authors_text":"Toshiaki Koike-Akino, Toshiki Matsumine, Ye Wang","cross_cats":["cs.ET","cs.LO","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T00:41:19Z","title":"Polar Coding with Chemical Reaction Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03709","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:81dd7fc6ac16816aac3e0f724c58183cc03c9dc6e0a788f1f5a4a061d36a9a7f","target":"record","created_at":"2026-05-17T23:51:41Z","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":"47abe5b13d877065fb8b82849b0ffea60d97b84965e4b028bf00849a0fc0e4f4","cross_cats_sorted":["cs.ET","cs.LO","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T00:41:19Z","title_canon_sha256":"b8ac57f44c67272281c8442f85462b676afebb13d0162c046b35596e3f892077"},"schema_version":"1.0","source":{"id":"1903.03709","kind":"arxiv","version":1}},"canonical_sha256":"bbc27320470b3b788b697307251c0838e728aee2832db95381eb685b05d8a9f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbc27320470b3b788b697307251c0838e728aee2832db95381eb685b05d8a9f0","first_computed_at":"2026-05-17T23:51:41.192839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.192839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rG27cNGji6HIJa1GjfXIqE3q6nre3aEVv0M774AkFPZY2c9FW1Bhx87s0TmXMHpBNZL/qc9VuGx7u32PmCVFAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.193463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81dd7fc6ac16816aac3e0f724c58183cc03c9dc6e0a788f1f5a4a061d36a9a7f","sha256:24b43982dde2c0b500633a6be93712e505efbd3f5d975f17555a1c1e276cced4"],"state_sha256":"2d59f579504d989a3fe2123ffbe123579fcb8b1fad8154bd465824325df2fbb4"}