{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JSF4KEXGCVEEQSQEIAWV4PMFSF","short_pith_number":"pith:JSF4KEXG","schema_version":"1.0","canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","source":{"kind":"arxiv","id":"1602.05072","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2016-02-16T16:14:11Z","abstract_excerpt":"This paper presents a general approach for optimizing the number of symbols in increments (packets of incremental redundancy) in a feedback communication system with a limited number of increments. This approach is based on a tight normal approximation on the rate for successful decoding. Applying this approach to a variety of feedback systems using non-binary (NB) low-density parity-check (LDPC) codes shows that greater than 90% of capacity can be achieved with average blocklengths fewer than 500 transmitted bits. One result is that the performance with ten increments closely approaches the p"},"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":"1602.05072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-16T16:14:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f24b4fa67341170fce78edd4b97f8e9d487c1255450a066b007cba99f1aea4bf","abstract_canon_sha256":"e02139775e01f742be5c6a7e2b16e88706304c4b2a2f6a79d5aa6673744e9f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:37.586782Z","signature_b64":"V9sR3h7jiUdZx4qK2oJ0v4F/03IkUoHsEIV0s/l0LtoHtdPBSePRg7osWam1GRohOERaGouvtwZ0k/4+xK93Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","last_reissued_at":"2026-05-18T01:20:37.586341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:37.586341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2016-02-16T16:14:11Z","abstract_excerpt":"This paper presents a general approach for optimizing the number of symbols in increments (packets of incremental redundancy) in a feedback communication system with a limited number of increments. This approach is based on a tight normal approximation on the rate for successful decoding. Applying this approach to a variety of feedback systems using non-binary (NB) low-density parity-check (LDPC) codes shows that greater than 90% of capacity can be achieved with average blocklengths fewer than 500 transmitted bits. One result is that the performance with ten increments closely approaches the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05072","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":"1602.05072","created_at":"2026-05-18T01:20:37.586408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05072v1","created_at":"2026-05-18T01:20:37.586408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05072","created_at":"2026-05-18T01:20:37.586408+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSF4KEXGCVEE","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSF4KEXGCVEEQSQE","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSF4KEXG","created_at":"2026-05-18T12:30:25.849896+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/JSF4KEXGCVEEQSQEIAWV4PMFSF","json":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF.json","graph_json":"https://pith.science/api/pith-number/JSF4KEXGCVEEQSQEIAWV4PMFSF/graph.json","events_json":"https://pith.science/api/pith-number/JSF4KEXGCVEEQSQEIAWV4PMFSF/events.json","paper":"https://pith.science/paper/JSF4KEXG"},"agent_actions":{"view_html":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF","download_json":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF.json","view_paper":"https://pith.science/paper/JSF4KEXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05072&json=true","fetch_graph":"https://pith.science/api/pith-number/JSF4KEXGCVEEQSQEIAWV4PMFSF/graph.json","fetch_events":"https://pith.science/api/pith-number/JSF4KEXGCVEEQSQEIAWV4PMFSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/action/storage_attestation","attest_author":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/action/author_attestation","sign_citation":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/action/citation_signature","submit_replication":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/action/replication_record"}},"created_at":"2026-05-18T01:20:37.586408+00:00","updated_at":"2026-05-18T01:20:37.586408+00:00"}