{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QDGPMFEQ22RTHP7MGP34FSR77Z","short_pith_number":"pith:QDGPMFEQ","canonical_record":{"source":{"id":"1309.0707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-03T14:45:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c038eae68c0d7220027efc50df366511c0fcbc7bd64115cd768b308c3b5772e","abstract_canon_sha256":"42b95146c11bd4261e050b7e4eef19f8b0b4b70ab3481bfec5025bbb5c3f87ea"},"schema_version":"1.0"},"canonical_sha256":"80ccf61490d6a333bfec33f7c2ca3ffe43371f3196a1a6f9fe30fb7a2de06fef","source":{"kind":"arxiv","id":"1309.0707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0707","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0707v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0707","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"QDGPMFEQ22RT","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QDGPMFEQ22RTHP7M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QDGPMFEQ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QDGPMFEQ22RTHP7MGP34FSR77Z","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-03T14:45:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c038eae68c0d7220027efc50df366511c0fcbc7bd64115cd768b308c3b5772e","abstract_canon_sha256":"42b95146c11bd4261e050b7e4eef19f8b0b4b70ab3481bfec5025bbb5c3f87ea"},"schema_version":"1.0"},"canonical_sha256":"80ccf61490d6a333bfec33f7c2ca3ffe43371f3196a1a6f9fe30fb7a2de06fef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:18.277048Z","signature_b64":"M2e9syKXWa/4Mli6uKmXTY/Yhg4fsZFE6pu4qmO1/E+0wbaaqS5oSLPtU7zsVzzp2gbQ8TmD16UwfrVDcmtECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80ccf61490d6a333bfec33f7c2ca3ffe43371f3196a1a6f9fe30fb7a2de06fef","last_reissued_at":"2026-05-18T03:14:18.276458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:18.276458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0707","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbWN5uAOFn7MF8KAy5SbutnVufQk+tWu0C0MqlKMI2TRtPv/cTWpXYJgtWtA+edAbxu3pUJb+ZQPwGuc2GZCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:57:03.210558Z"},"content_sha256":"3c42ccdb4fdfaf15f5c300d69dc8e35fd659959c4dea3de491f4687373ea6bb5","schema_version":"1.0","event_id":"sha256:3c42ccdb4fdfaf15f5c300d69dc8e35fd659959c4dea3de491f4687373ea6bb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QDGPMFEQ22RTHP7MGP34FSR77Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feedback Communication Systems with Limitations on Incremental Redundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam R. Williamson, Nambi Seshadri, Richard D. Wesel, Tsung-Yi Chen","submitted_at":"2013-09-03T14:45:13Z","abstract_excerpt":"This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes.\n  The information-theoretic analysis shows that values of $N$ relatively close to the expected latency yield the same ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0707","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SalAU+tIjjYN0VwzjwlPIm+hv4ROqdPjChYtbAq4Z8t06+iEK15lzGcKWtwFkvTs99GLACJq847ru3jt6VWICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:57:03.210988Z"},"content_sha256":"bcfe0c77d18928c9d48e8c6ba038ed3d60426cca9f17c046eadaa712d17999f5","schema_version":"1.0","event_id":"sha256:bcfe0c77d18928c9d48e8c6ba038ed3d60426cca9f17c046eadaa712d17999f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/bundle.json","state_url":"https://pith.science/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/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-26T12:57:03Z","links":{"resolver":"https://pith.science/pith/QDGPMFEQ22RTHP7MGP34FSR77Z","bundle":"https://pith.science/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/bundle.json","state":"https://pith.science/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDGPMFEQ22RTHP7MGP34FSR77Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QDGPMFEQ22RTHP7MGP34FSR77Z","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":"42b95146c11bd4261e050b7e4eef19f8b0b4b70ab3481bfec5025bbb5c3f87ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-03T14:45:13Z","title_canon_sha256":"0c038eae68c0d7220027efc50df366511c0fcbc7bd64115cd768b308c3b5772e"},"schema_version":"1.0","source":{"id":"1309.0707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0707","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0707v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0707","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"QDGPMFEQ22RT","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QDGPMFEQ22RTHP7M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QDGPMFEQ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:bcfe0c77d18928c9d48e8c6ba038ed3d60426cca9f17c046eadaa712d17999f5","target":"graph","created_at":"2026-05-18T03:14:18Z","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 explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes.\n  The information-theoretic analysis shows that values of $N$ relatively close to the expected latency yield the same ra","authors_text":"Adam R. Williamson, Nambi Seshadri, Richard D. Wesel, Tsung-Yi Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-03T14:45:13Z","title":"Feedback Communication Systems with Limitations on Incremental Redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0707","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:3c42ccdb4fdfaf15f5c300d69dc8e35fd659959c4dea3de491f4687373ea6bb5","target":"record","created_at":"2026-05-18T03:14:18Z","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":"42b95146c11bd4261e050b7e4eef19f8b0b4b70ab3481bfec5025bbb5c3f87ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-03T14:45:13Z","title_canon_sha256":"0c038eae68c0d7220027efc50df366511c0fcbc7bd64115cd768b308c3b5772e"},"schema_version":"1.0","source":{"id":"1309.0707","kind":"arxiv","version":1}},"canonical_sha256":"80ccf61490d6a333bfec33f7c2ca3ffe43371f3196a1a6f9fe30fb7a2de06fef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80ccf61490d6a333bfec33f7c2ca3ffe43371f3196a1a6f9fe30fb7a2de06fef","first_computed_at":"2026-05-18T03:14:18.276458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:18.276458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2e9syKXWa/4Mli6uKmXTY/Yhg4fsZFE6pu4qmO1/E+0wbaaqS5oSLPtU7zsVzzp2gbQ8TmD16UwfrVDcmtECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:18.277048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c42ccdb4fdfaf15f5c300d69dc8e35fd659959c4dea3de491f4687373ea6bb5","sha256:bcfe0c77d18928c9d48e8c6ba038ed3d60426cca9f17c046eadaa712d17999f5"],"state_sha256":"c32575b9ad340e1987c4d5ab6aafec739216bbb76669422802673e9d46d6d23e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quAOBEgfdLJfZyuENEu+IAHRi7MulEIyBuF7jPC2QRsOLJEJ3qS4kVo84qagyuF88vWE+LJjYDqhRUjERmQODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:57:03.214172Z","bundle_sha256":"d59e2b7d73191e51510ca72ee32c8b14459438a2bc07f7c23889ab5af1bdfe75"}}