{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JSF4KEXGCVEEQSQEIAWV4PMFSF","short_pith_number":"pith:JSF4KEXG","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"},"canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","source":{"kind":"arxiv","id":"1602.05072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05072","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05072v1","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05072","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"JSF4KEXGCVEE","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JSF4KEXGCVEEQSQE","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JSF4KEXG","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JSF4KEXGCVEEQSQEIAWV4PMFSF","target":"record","payload":{"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"},"canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","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"},"source_kind":"arxiv","source_id":"1602.05072","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHOabGptG+EI+v1ua9xy0hEz5UhcXkZnJ0Cv3G++kRsuWNxyw51dixiLq0w0oTJxYzhZCRHN8zEUrBh2ZJAzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:08:34.613196Z"},"content_sha256":"334bc82dc0ef0946d4311f9cbdd10890612ec38b09c875491e522a8de24b7792","schema_version":"1.0","event_id":"sha256:334bc82dc0ef0946d4311f9cbdd10890612ec38b09c875491e522a8de24b7792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JSF4KEXGCVEEQSQEIAWV4PMFSF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXSuUaDJ4dEw10HM4ncomeKX47K9JbRecmbkhBzv+x0Vsj6ScJqJegvvnYtDxNSFnHI3M3y1ACetnlbQdP3/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:08:34.613900Z"},"content_sha256":"3d799e32f56bdc583da7470a6b859007c589fb787ab39d8fe947eb7abf44880a","schema_version":"1.0","event_id":"sha256:3d799e32f56bdc583da7470a6b859007c589fb787ab39d8fe947eb7abf44880a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/bundle.json","state_url":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:08:34Z","links":{"resolver":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF","bundle":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/bundle.json","state":"https://pith.science/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSF4KEXGCVEEQSQEIAWV4PMFSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JSF4KEXGCVEEQSQEIAWV4PMFSF","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":"e02139775e01f742be5c6a7e2b16e88706304c4b2a2f6a79d5aa6673744e9f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-16T16:14:11Z","title_canon_sha256":"f24b4fa67341170fce78edd4b97f8e9d487c1255450a066b007cba99f1aea4bf"},"schema_version":"1.0","source":{"id":"1602.05072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05072","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05072v1","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05072","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"JSF4KEXGCVEE","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JSF4KEXGCVEEQSQE","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JSF4KEXG","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:3d799e32f56bdc583da7470a6b859007c589fb787ab39d8fe947eb7abf44880a","target":"graph","created_at":"2026-05-18T01:20:37Z","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"},"paper":{"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","authors_text":"Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel, Sudarsan V. S. Ranganathan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-16T16:14:11Z","title":"Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05072","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:334bc82dc0ef0946d4311f9cbdd10890612ec38b09c875491e522a8de24b7792","target":"record","created_at":"2026-05-18T01:20:37Z","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":"e02139775e01f742be5c6a7e2b16e88706304c4b2a2f6a79d5aa6673744e9f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-16T16:14:11Z","title_canon_sha256":"f24b4fa67341170fce78edd4b97f8e9d487c1255450a066b007cba99f1aea4bf"},"schema_version":"1.0","source":{"id":"1602.05072","kind":"arxiv","version":1}},"canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c8bc512e61548484a04402d5e3d85917ed0ef61aeabd68e697936b71c1f5883","first_computed_at":"2026-05-18T01:20:37.586341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:37.586341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V9sR3h7jiUdZx4qK2oJ0v4F/03IkUoHsEIV0s/l0LtoHtdPBSePRg7osWam1GRohOERaGouvtwZ0k/4+xK93Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:37.586782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:334bc82dc0ef0946d4311f9cbdd10890612ec38b09c875491e522a8de24b7792","sha256:3d799e32f56bdc583da7470a6b859007c589fb787ab39d8fe947eb7abf44880a"],"state_sha256":"d60e3d516fe7549bb4428f6308d411e20ec93ed16eb4e7e488aaffd2327cff6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKvpUiVqsjSpVa2aqiyk2gNC36nVpQ3OMC3VGc+PdszSIQ5fjLJGbit862M+bPkfis4PcmreRSSlXxhZwQ7vBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:08:34.617446Z","bundle_sha256":"19db02d1ef26bc8d19d4ca9ddf698ae353a856025e14161c98acde67478de16d"}}