{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OZSUGBG2S6NYFU7BHB2M5KDBKX","short_pith_number":"pith:OZSUGBG2","schema_version":"1.0","canonical_sha256":"76654304da979b82d3e13874cea86155c78edf33b004e83358b491d07bd3c1ed","source":{"kind":"arxiv","id":"1307.2800","version":1},"attestation_state":"computed","paper":{"title":"A Hybrid ARQ Scheme Based on Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiaru Lin, Kai Chen, Kai Niu","submitted_at":"2013-07-10T14:11:33Z","abstract_excerpt":"A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes. Simulation results over binary-input additive white Gaussian noise channels (BAWGNCs) show that, using a low-complexity successive cancellation (SC) decoder, the proposed HARQ scheme performs as well as the existing schemes based on turbo codes and low-density parity-check (LDPC) codes. The proposed transmission scheme is only about 1.0-1.5dB away from the channel c"},"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":"1307.2800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-10T14:11:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7b63b13d94a9888e6319b2f56b4ff216bb8eb3f144732aa01a045a9c2c87de7","abstract_canon_sha256":"edca5af2ce676c84e4c7a3f7af07e1f5420f65e979fead7f77727805965242f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.188483Z","signature_b64":"DXS48S8dRexSl3HaHpYmn/J188JqRh8Xg1P2BvSWn2s0BQ+3zs+7gzL8hFTEIztZrxxduXsBbobeI9VO9TomBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76654304da979b82d3e13874cea86155c78edf33b004e83358b491d07bd3c1ed","last_reissued_at":"2026-05-18T00:58:42.187855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.187855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid ARQ Scheme Based on Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiaru Lin, Kai Chen, Kai Niu","submitted_at":"2013-07-10T14:11:33Z","abstract_excerpt":"A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes. Simulation results over binary-input additive white Gaussian noise channels (BAWGNCs) show that, using a low-complexity successive cancellation (SC) decoder, the proposed HARQ scheme performs as well as the existing schemes based on turbo codes and low-density parity-check (LDPC) codes. The proposed transmission scheme is only about 1.0-1.5dB away from the channel c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2800","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":"1307.2800","created_at":"2026-05-18T00:58:42.187962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2800v1","created_at":"2026-05-18T00:58:42.187962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2800","created_at":"2026-05-18T00:58:42.187962+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZSUGBG2S6NY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZSUGBG2S6NYFU7B","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZSUGBG2","created_at":"2026-05-18T12:27:54.935989+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/OZSUGBG2S6NYFU7BHB2M5KDBKX","json":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX.json","graph_json":"https://pith.science/api/pith-number/OZSUGBG2S6NYFU7BHB2M5KDBKX/graph.json","events_json":"https://pith.science/api/pith-number/OZSUGBG2S6NYFU7BHB2M5KDBKX/events.json","paper":"https://pith.science/paper/OZSUGBG2"},"agent_actions":{"view_html":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX","download_json":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX.json","view_paper":"https://pith.science/paper/OZSUGBG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2800&json=true","fetch_graph":"https://pith.science/api/pith-number/OZSUGBG2S6NYFU7BHB2M5KDBKX/graph.json","fetch_events":"https://pith.science/api/pith-number/OZSUGBG2S6NYFU7BHB2M5KDBKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX/action/storage_attestation","attest_author":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX/action/author_attestation","sign_citation":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX/action/citation_signature","submit_replication":"https://pith.science/pith/OZSUGBG2S6NYFU7BHB2M5KDBKX/action/replication_record"}},"created_at":"2026-05-18T00:58:42.187962+00:00","updated_at":"2026-05-18T00:58:42.187962+00:00"}