{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZBPV2DEBDGFCAQUU4UI6IKAVL6","short_pith_number":"pith:ZBPV2DEB","canonical_record":{"source":{"id":"1707.09735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T06:53:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb083864f9dc231794f0116ee63e1e4de9dd0b2d8adcc28e4e25e7fdbf4fadd7","abstract_canon_sha256":"4d639cb58a0b0cdb2cd2967dc98543701d7e7cda9ebc75cdf2560a04e850f6fd"},"schema_version":"1.0"},"canonical_sha256":"c85f5d0c81198a204294e511e428155fa0ad82c21167f393be6ec9c1b95da80b","source":{"kind":"arxiv","id":"1707.09735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09735","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09735v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09735","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZBPV2DEBDGFC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBPV2DEBDGFCAQUU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBPV2DEB","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZBPV2DEBDGFCAQUU4UI6IKAVL6","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T06:53:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb083864f9dc231794f0116ee63e1e4de9dd0b2d8adcc28e4e25e7fdbf4fadd7","abstract_canon_sha256":"4d639cb58a0b0cdb2cd2967dc98543701d7e7cda9ebc75cdf2560a04e850f6fd"},"schema_version":"1.0"},"canonical_sha256":"c85f5d0c81198a204294e511e428155fa0ad82c21167f393be6ec9c1b95da80b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.922471Z","signature_b64":"qDcsII60MnxC1RBWzumgiA3hEPETmBKPNDa0iPMy3PxGAJY0ytOqsyOFrv7RPEKaYvGmTrPWVzbwYTUCBjOjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85f5d0c81198a204294e511e428155fa0ad82c21167f393be6ec9c1b95da80b","last_reissued_at":"2026-05-18T00:25:28.921815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.921815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09735","source_version":2,"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-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gY5RcEtewKp9EfYxzLWBOlkbzuG2rwbBgmee+BxQTVRktZNN8ZXtvWhz9FKgRAjsMz2I0FJLPGHSCjKiI6vjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:22.653554Z"},"content_sha256":"9a11e297fc39d9d28cfc96b20aae3727ca58daf1e879988ad49d96c0ab11223b","schema_version":"1.0","event_id":"sha256:9a11e297fc39d9d28cfc96b20aae3727ca58daf1e879988ad49d96c0ab11223b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZBPV2DEBDGFCAQUU4UI6IKAVL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Mahdi Haghifam, Masoumeh Nasiri-Kenari, Mohammad Robat Mili, Tommy Svensson","submitted_at":"2017-07-31T06:53:40Z","abstract_excerpt":"We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. Moreover, we develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the network sum rate and minimize the maximum users' error probability and to evaluate the effect of the codewords length on the system performance. The results show that, in delay-constrained scenarios,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09735","kind":"arxiv","version":2},"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-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5SDbHnJbkEbbjyZIe5OIha6gXIx/2QbNwbnJdX9xTcIiwxbPXDQdeuxS7CWTkprIOOcjsuNPyt4Ty3Mh8vQ3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:03:22.653896Z"},"content_sha256":"570b05b14f35397ef5cec201ee1823bfcbc170a2ecb5fe0ec50db1235d933543","schema_version":"1.0","event_id":"sha256:570b05b14f35397ef5cec201ee1823bfcbc170a2ecb5fe0ec50db1235d933543"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/bundle.json","state_url":"https://pith.science/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/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-03T21:03:22Z","links":{"resolver":"https://pith.science/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6","bundle":"https://pith.science/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/bundle.json","state":"https://pith.science/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBPV2DEBDGFCAQUU4UI6IKAVL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZBPV2DEBDGFCAQUU4UI6IKAVL6","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":"4d639cb58a0b0cdb2cd2967dc98543701d7e7cda9ebc75cdf2560a04e850f6fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T06:53:40Z","title_canon_sha256":"bb083864f9dc231794f0116ee63e1e4de9dd0b2d8adcc28e4e25e7fdbf4fadd7"},"schema_version":"1.0","source":{"id":"1707.09735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09735","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09735v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09735","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZBPV2DEBDGFC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBPV2DEBDGFCAQUU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBPV2DEB","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:570b05b14f35397ef5cec201ee1823bfcbc170a2ecb5fe0ec50db1235d933543","target":"graph","created_at":"2026-05-18T00:25:28Z","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":"We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. Moreover, we develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the network sum rate and minimize the maximum users' error probability and to evaluate the effect of the codewords length on the system performance. The results show that, in delay-constrained scenarios,","authors_text":"Behrooz Makki, Mahdi Haghifam, Masoumeh Nasiri-Kenari, Mohammad Robat Mili, Tommy Svensson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T06:53:40Z","title":"Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09735","kind":"arxiv","version":2},"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:9a11e297fc39d9d28cfc96b20aae3727ca58daf1e879988ad49d96c0ab11223b","target":"record","created_at":"2026-05-18T00:25:28Z","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":"4d639cb58a0b0cdb2cd2967dc98543701d7e7cda9ebc75cdf2560a04e850f6fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T06:53:40Z","title_canon_sha256":"bb083864f9dc231794f0116ee63e1e4de9dd0b2d8adcc28e4e25e7fdbf4fadd7"},"schema_version":"1.0","source":{"id":"1707.09735","kind":"arxiv","version":2}},"canonical_sha256":"c85f5d0c81198a204294e511e428155fa0ad82c21167f393be6ec9c1b95da80b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85f5d0c81198a204294e511e428155fa0ad82c21167f393be6ec9c1b95da80b","first_computed_at":"2026-05-18T00:25:28.921815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:28.921815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDcsII60MnxC1RBWzumgiA3hEPETmBKPNDa0iPMy3PxGAJY0ytOqsyOFrv7RPEKaYvGmTrPWVzbwYTUCBjOjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:28.922471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a11e297fc39d9d28cfc96b20aae3727ca58daf1e879988ad49d96c0ab11223b","sha256:570b05b14f35397ef5cec201ee1823bfcbc170a2ecb5fe0ec50db1235d933543"],"state_sha256":"3a6a52ec0936f7317b1aa213669bb9832fdc3de51981b7f7cecd0ef6d25f2ee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3jcwuOJEsqvBJxY10+M/dXz7OH9jLr/JPXOTABF3kPEoPXfllYig8cz5YdvmwKK+AYyAx/hs661yyLwhlhlPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:03:22.655860Z","bundle_sha256":"a6601129f5efdb626a13f6a7020b289b3845eb81c6c81cd34e06a3e2c48d0f0f"}}