{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DNP47QJOK7UZILJYGGFEVKMUWB","short_pith_number":"pith:DNP47QJO","schema_version":"1.0","canonical_sha256":"1b5fcfc12e57e9942d38318a4aa994b052545ac1d11cb4009b79a457af1f2a3f","source":{"kind":"arxiv","id":"1407.5483","version":1},"attestation_state":"computed","paper":{"title":"A RM-Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen","submitted_at":"2014-07-21T13:15:43Z","abstract_excerpt":"In this letter we propose a new hybrid code called \"RM-Polar\" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes, therefore it has much better error performance than Polar codes."},"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":"1407.5483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T13:15:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"40f975757c089cc8590589a5bbd30ba2a4d717ded47fcc0a9948de59c628c733","abstract_canon_sha256":"e1f48ab0a6600cf5aed26794d7cbe62eaf0eb7e01049501a748802827f4dad0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:13.932957Z","signature_b64":"f4RwvC2IylKoOBIt6643hQeOXFXwGma84io0upfkzqAG5RummTQRzJItLq0oiNvkHKKazG1nlQjhSbVTQ874BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5fcfc12e57e9942d38318a4aa994b052545ac1d11cb4009b79a457af1f2a3f","last_reissued_at":"2026-05-18T02:47:13.932417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:13.932417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A RM-Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, David Tse, Hui Shen","submitted_at":"2014-07-21T13:15:43Z","abstract_excerpt":"In this letter we propose a new hybrid code called \"RM-Polar\" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes, therefore it has much better error performance than Polar codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5483","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":"1407.5483","created_at":"2026-05-18T02:47:13.932470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5483v1","created_at":"2026-05-18T02:47:13.932470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5483","created_at":"2026-05-18T02:47:13.932470+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNP47QJOK7UZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNP47QJOK7UZILJY","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNP47QJO","created_at":"2026-05-18T12:28:25.294606+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/DNP47QJOK7UZILJYGGFEVKMUWB","json":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB.json","graph_json":"https://pith.science/api/pith-number/DNP47QJOK7UZILJYGGFEVKMUWB/graph.json","events_json":"https://pith.science/api/pith-number/DNP47QJOK7UZILJYGGFEVKMUWB/events.json","paper":"https://pith.science/paper/DNP47QJO"},"agent_actions":{"view_html":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB","download_json":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB.json","view_paper":"https://pith.science/paper/DNP47QJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5483&json=true","fetch_graph":"https://pith.science/api/pith-number/DNP47QJOK7UZILJYGGFEVKMUWB/graph.json","fetch_events":"https://pith.science/api/pith-number/DNP47QJOK7UZILJYGGFEVKMUWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB/action/storage_attestation","attest_author":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB/action/author_attestation","sign_citation":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB/action/citation_signature","submit_replication":"https://pith.science/pith/DNP47QJOK7UZILJYGGFEVKMUWB/action/replication_record"}},"created_at":"2026-05-18T02:47:13.932470+00:00","updated_at":"2026-05-18T02:47:13.932470+00:00"}