{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LDDTWXAFG4XCKBFTV4YWVUWWBA","short_pith_number":"pith:LDDTWXAF","schema_version":"1.0","canonical_sha256":"58c73b5c05372e2504b3af316ad2d6081427956a80f21fbe3896f6abf131f96a","source":{"kind":"arxiv","id":"2506.15836","version":1},"attestation_state":"computed","paper":{"title":"Code Rate Optimization via Neural Polar Decoders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Bashar Huleihel, Haim H Permuter, Henry D Pfister, Ziv Aharoni","submitted_at":"2025-06-18T19:22:26Z","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, "},"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":"2506.15836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T19:22:26Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"a92f6accb66c57c3f6d5d1046d6ad137382c53a378997653afbd75e7ca89b191","abstract_canon_sha256":"2f7fbdd7de6f0de2e8800a847d8243f5f081ae48b456fe9163b58acff23cdd8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:53.213095Z","signature_b64":"TefwDm0dU9DU7Msyen4XPYAIDSYh9g7zGu7DvqqfYe4rO4rJDVNkFHvZlmUPNLyNviDgNN367MXoc3zoAarYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c73b5c05372e2504b3af316ad2d6081427956a80f21fbe3896f6abf131f96a","last_reissued_at":"2026-07-05T11:23:53.212653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:53.212653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code Rate Optimization via Neural Polar Decoders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Bashar Huleihel, Haim H Permuter, Henry D Pfister, Ziv Aharoni","submitted_at":"2025-06-18T19:22:26Z","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, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15836","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.15836/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.15836","created_at":"2026-07-05T11:23:53.212707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15836v1","created_at":"2026-07-05T11:23:53.212707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15836","created_at":"2026-07-05T11:23:53.212707+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDDTWXAFG4XC","created_at":"2026-07-05T11:23:53.212707+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDDTWXAFG4XCKBFT","created_at":"2026-07-05T11:23:53.212707+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDDTWXAF","created_at":"2026-07-05T11:23:53.212707+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/LDDTWXAFG4XCKBFTV4YWVUWWBA","json":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA.json","graph_json":"https://pith.science/api/pith-number/LDDTWXAFG4XCKBFTV4YWVUWWBA/graph.json","events_json":"https://pith.science/api/pith-number/LDDTWXAFG4XCKBFTV4YWVUWWBA/events.json","paper":"https://pith.science/paper/LDDTWXAF"},"agent_actions":{"view_html":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA","download_json":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA.json","view_paper":"https://pith.science/paper/LDDTWXAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15836&json=true","fetch_graph":"https://pith.science/api/pith-number/LDDTWXAFG4XCKBFTV4YWVUWWBA/graph.json","fetch_events":"https://pith.science/api/pith-number/LDDTWXAFG4XCKBFTV4YWVUWWBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA/action/storage_attestation","attest_author":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA/action/author_attestation","sign_citation":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA/action/citation_signature","submit_replication":"https://pith.science/pith/LDDTWXAFG4XCKBFTV4YWVUWWBA/action/replication_record"}},"created_at":"2026-07-05T11:23:53.212707+00:00","updated_at":"2026-07-05T11:23:53.212707+00:00"}