{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:A4SRAMEAU6BOOJIYKWYRY2FGJ2","short_pith_number":"pith:A4SRAMEA","canonical_record":{"source":{"id":"1009.6205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T17:46:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"588e431265e43b3ba0de48bc94089535436eabe8429afee3e97baa8c06c99357","abstract_canon_sha256":"c3c924166bb436cc2eeb137f8809f0532773634aa28e6b7d7daaaa3e05a1afc8"},"schema_version":"1.0"},"canonical_sha256":"0725103080a782e7251855b11c68a64e93a15cb26465b01220767290abdda29a","source":{"kind":"arxiv","id":"1009.6205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6205","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6205v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6205","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"A4SRAMEAU6BO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4SRAMEAU6BOOJIY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4SRAMEA","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:A4SRAMEAU6BOOJIYKWYRY2FGJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1009.6205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T17:46:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"588e431265e43b3ba0de48bc94089535436eabe8429afee3e97baa8c06c99357","abstract_canon_sha256":"c3c924166bb436cc2eeb137f8809f0532773634aa28e6b7d7daaaa3e05a1afc8"},"schema_version":"1.0"},"canonical_sha256":"0725103080a782e7251855b11c68a64e93a15cb26465b01220767290abdda29a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.908991Z","signature_b64":"XuGM6w530jebsXMEJmtOMisqQnJJiSpziqBA2wiMcQY+9aj+fFK0PLaBO7ygfykxSDP9osdf6b4K7rDzX+PQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0725103080a782e7251855b11c68a64e93a15cb26465b01220767290abdda29a","last_reissued_at":"2026-05-18T04:40:00.908583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.908583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.6205","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BYPS0DciK+58v3BdwBhE3fOe7GuTfvYVYHMmTnRd5tVH299UZXrfabuy29Vlm0jJTKG8VrEiR7MDg43i9XjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:07:30.612031Z"},"content_sha256":"f7be94e20d6697b0ce9c7dd643e3c054994b81c704c6047ae699c86a54e4394d","schema_version":"1.0","event_id":"sha256:f7be94e20d6697b0ce9c7dd643e3c054994b81c704c6047ae699c86a54e4394d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:A4SRAMEAU6BOOJIYKWYRY2FGJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Channel Coding over Multiple Coherence Blocks with Queueing Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar","submitted_at":"2010-09-30T17:46:57Z","abstract_excerpt":"This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading model, in which fading stays constant in each coherence block and change independently between blocks, is considered. It is assumed that channel coding is performed over multiple coherence blocks. An approximate lower bound on the transmission rate is obtained from Feintein's Lemma. This lower bound is considered as the service rate and is incorporated into the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6205","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXjG2bxV4Sv/R5jE5uKeLb8GAvBeV3ZzrpJF0KHWtpLe9nVdFMTcrEqTZBKIe9Uy0l2c7PfdkEIcMUCIvjVtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:07:30.612402Z"},"content_sha256":"45f74c97fef1c22f1e970e035576c6091d88af58b6bc8e06d92ec993fc41a832","schema_version":"1.0","event_id":"sha256:45f74c97fef1c22f1e970e035576c6091d88af58b6bc8e06d92ec993fc41a832"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/bundle.json","state_url":"https://pith.science/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/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-06-02T15:07:30Z","links":{"resolver":"https://pith.science/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2","bundle":"https://pith.science/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/bundle.json","state":"https://pith.science/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4SRAMEAU6BOOJIYKWYRY2FGJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A4SRAMEAU6BOOJIYKWYRY2FGJ2","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":"c3c924166bb436cc2eeb137f8809f0532773634aa28e6b7d7daaaa3e05a1afc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T17:46:57Z","title_canon_sha256":"588e431265e43b3ba0de48bc94089535436eabe8429afee3e97baa8c06c99357"},"schema_version":"1.0","source":{"id":"1009.6205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6205","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6205v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6205","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"A4SRAMEAU6BO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A4SRAMEAU6BOOJIY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A4SRAMEA","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:45f74c97fef1c22f1e970e035576c6091d88af58b6bc8e06d92ec993fc41a832","target":"graph","created_at":"2026-05-18T04:40:00Z","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 investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading model, in which fading stays constant in each coherence block and change independently between blocks, is considered. It is assumed that channel coding is performed over multiple coherence blocks. An approximate lower bound on the transmission rate is obtained from Feintein's Lemma. This lower bound is considered as the service rate and is incorporated into the","authors_text":"Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T17:46:57Z","title":"Channel Coding over Multiple Coherence Blocks with Queueing Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6205","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:f7be94e20d6697b0ce9c7dd643e3c054994b81c704c6047ae699c86a54e4394d","target":"record","created_at":"2026-05-18T04:40:00Z","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":"c3c924166bb436cc2eeb137f8809f0532773634aa28e6b7d7daaaa3e05a1afc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-30T17:46:57Z","title_canon_sha256":"588e431265e43b3ba0de48bc94089535436eabe8429afee3e97baa8c06c99357"},"schema_version":"1.0","source":{"id":"1009.6205","kind":"arxiv","version":1}},"canonical_sha256":"0725103080a782e7251855b11c68a64e93a15cb26465b01220767290abdda29a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0725103080a782e7251855b11c68a64e93a15cb26465b01220767290abdda29a","first_computed_at":"2026-05-18T04:40:00.908583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:00.908583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XuGM6w530jebsXMEJmtOMisqQnJJiSpziqBA2wiMcQY+9aj+fFK0PLaBO7ygfykxSDP9osdf6b4K7rDzX+PQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:00.908991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7be94e20d6697b0ce9c7dd643e3c054994b81c704c6047ae699c86a54e4394d","sha256:45f74c97fef1c22f1e970e035576c6091d88af58b6bc8e06d92ec993fc41a832"],"state_sha256":"5f6fd7009421c2e6e80a153960f5e6287fcc1f7c7978e5b946fb6a7d79df670d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HjpbReIgyK/MFH8oxMWIvZULD5Zoo0oS9qKkPzl1OK5NroQbx6flwAoahQULktPRYJao8IHXQA0zata2y/ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:07:30.614409Z","bundle_sha256":"548d990a657a5685ef8fe8f63da0612534ac2417c748c13ad7995c6bd43efef7"}}