{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LDDTWXAFG4XCKBFTV4YWVUWWBA","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":"2f7fbdd7de6f0de2e8800a847d8243f5f081ae48b456fe9163b58acff23cdd8f","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T19:22:26Z","title_canon_sha256":"a92f6accb66c57c3f6d5d1046d6ad137382c53a378997653afbd75e7ca89b191"},"schema_version":"1.0","source":{"id":"2506.15836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.15836","created_at":"2026-07-05T11:23:53Z"},{"alias_kind":"arxiv_version","alias_value":"2506.15836v1","created_at":"2026-07-05T11:23:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15836","created_at":"2026-07-05T11:23:53Z"},{"alias_kind":"pith_short_12","alias_value":"LDDTWXAFG4XC","created_at":"2026-07-05T11:23:53Z"},{"alias_kind":"pith_short_16","alias_value":"LDDTWXAFG4XCKBFT","created_at":"2026-07-05T11:23:53Z"},{"alias_kind":"pith_short_8","alias_value":"LDDTWXAF","created_at":"2026-07-05T11:23:53Z"}],"graph_snapshots":[{"event_id":"sha256:67e07a8afcedb5973df13f8d33a5a6ed4d2423113135844112402a212e76e251","target":"graph","created_at":"2026-07-05T11:23:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.15836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes a method to optimize communication code rates via the application of neural polar decoders (NPDs). Employing this approach enables simultaneous optimization of code rates over input distributions while providing a practical coding scheme within the framework of polar codes. The proposed approach is designed for scenarios where the channel model is unknown, treating the channel as a black box that produces output samples from input samples. We employ polar codes to achieve our objectives, using NPDs to estimate mutual information (MI) between the channel inputs and outputs, ","authors_text":"Bashar Huleihel, Haim H Permuter, Henry D Pfister, Ziv Aharoni","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T19:22:26Z","title":"Code Rate Optimization via Neural Polar Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15836","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:0d7ab4d357e19d8a6b5772cff50e7bc2425e1083f8892e308b5012b41d89663e","target":"record","created_at":"2026-07-05T11:23:53Z","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":"2f7fbdd7de6f0de2e8800a847d8243f5f081ae48b456fe9163b58acff23cdd8f","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T19:22:26Z","title_canon_sha256":"a92f6accb66c57c3f6d5d1046d6ad137382c53a378997653afbd75e7ca89b191"},"schema_version":"1.0","source":{"id":"2506.15836","kind":"arxiv","version":1}},"canonical_sha256":"58c73b5c05372e2504b3af316ad2d6081427956a80f21fbe3896f6abf131f96a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c73b5c05372e2504b3af316ad2d6081427956a80f21fbe3896f6abf131f96a","first_computed_at":"2026-07-05T11:23:53.212653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:53.212653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TefwDm0dU9DU7Msyen4XPYAIDSYh9g7zGu7DvqqfYe4rO4rJDVNkFHvZlmUPNLyNviDgNN367MXoc3zoAarYAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:53.213095Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.15836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d7ab4d357e19d8a6b5772cff50e7bc2425e1083f8892e308b5012b41d89663e","sha256:67e07a8afcedb5973df13f8d33a5a6ed4d2423113135844112402a212e76e251"],"state_sha256":"bee8ea6276be9c7431b261736933fd65b9b17e2b3813dfebd53a47ee2e3fc3b8"}