{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RWLNGFBGUXX3NXI72VNMF65NIX","short_pith_number":"pith:RWLNGFBG","canonical_record":{"source":{"id":"1701.08617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T14:34:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f129870e6e304abb48f518a6d3ac9921289586e521373b9fcf3657b8ac81608","abstract_canon_sha256":"f6ef03f69ac6e7f4f992eef1d4fdd0e5bfe4003e01237b11e1b9418a306e8e7b"},"schema_version":"1.0"},"canonical_sha256":"8d96d31426a5efb6dd1fd55ac2fbad45f6b7f19ac8c827fcdede54d3e73f99c8","source":{"kind":"arxiv","id":"1701.08617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08617","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08617v1","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08617","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"RWLNGFBGUXX3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RWLNGFBGUXX3NXI7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RWLNGFBG","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RWLNGFBGUXX3NXI72VNMF65NIX","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T14:34:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f129870e6e304abb48f518a6d3ac9921289586e521373b9fcf3657b8ac81608","abstract_canon_sha256":"f6ef03f69ac6e7f4f992eef1d4fdd0e5bfe4003e01237b11e1b9418a306e8e7b"},"schema_version":"1.0"},"canonical_sha256":"8d96d31426a5efb6dd1fd55ac2fbad45f6b7f19ac8c827fcdede54d3e73f99c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:53.498574Z","signature_b64":"EVbKFrOYekgcEYv8Dkhsk+cYXFF0o2GEegQJw3msJz0OyaMBPPHuAeFXBbhY2fuEsCH6p/eHcvvT9aanNjfJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d96d31426a5efb6dd1fd55ac2fbad45f6b7f19ac8c827fcdede54d3e73f99c8","last_reissued_at":"2026-05-18T00:51:53.497825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:53.497825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08617","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-18T00:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMAJW/YgkIXwBmG38eA/PkP+S408Mxr5iNyuHABkyTwERgKUPxIcyhaPIxDb6L1GcIHcJIpp0OOE85EDatuvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:54:22.133125Z"},"content_sha256":"856c3fe5ffb999e47a001d3aa1623069f240bcd420fb80f6034fad244b3a2854","schema_version":"1.0","event_id":"sha256:856c3fe5ffb999e47a001d3aa1623069f240bcd420fb80f6034fad244b3a2854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RWLNGFBGUXX3NXI72VNMF65NIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultra Reliable Communication via Optimum Power Allocation for Type-I ARQ in Finite Block-Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Endrit Dosti, Hirley Alves, Matti Latva-aho, Uditha Lakmal Wijewardhana","submitted_at":"2017-01-30T14:34:26Z","abstract_excerpt":"We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08617","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-18T00:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MM67Mr+3wzwpIULi/2VGdp2JBoMCznaEX18RZi6s6KA6srR0aes51AyRBViOh7ZvLn23e7en0VFDdFvU6eEXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:54:22.133564Z"},"content_sha256":"8eeb9a31c8a5752b12978ae564a9a2a260eb36328fd1ec3ef62dc539a830ab7b","schema_version":"1.0","event_id":"sha256:8eeb9a31c8a5752b12978ae564a9a2a260eb36328fd1ec3ef62dc539a830ab7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWLNGFBGUXX3NXI72VNMF65NIX/bundle.json","state_url":"https://pith.science/pith/RWLNGFBGUXX3NXI72VNMF65NIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWLNGFBGUXX3NXI72VNMF65NIX/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-08-06T09:54:22Z","links":{"resolver":"https://pith.science/pith/RWLNGFBGUXX3NXI72VNMF65NIX","bundle":"https://pith.science/pith/RWLNGFBGUXX3NXI72VNMF65NIX/bundle.json","state":"https://pith.science/pith/RWLNGFBGUXX3NXI72VNMF65NIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWLNGFBGUXX3NXI72VNMF65NIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RWLNGFBGUXX3NXI72VNMF65NIX","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":"f6ef03f69ac6e7f4f992eef1d4fdd0e5bfe4003e01237b11e1b9418a306e8e7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T14:34:26Z","title_canon_sha256":"8f129870e6e304abb48f518a6d3ac9921289586e521373b9fcf3657b8ac81608"},"schema_version":"1.0","source":{"id":"1701.08617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08617","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08617v1","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08617","created_at":"2026-05-18T00:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"RWLNGFBGUXX3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RWLNGFBGUXX3NXI7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RWLNGFBG","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8eeb9a31c8a5752b12978ae564a9a2a260eb36328fd1ec3ef62dc539a830ab7b","target":"graph","created_at":"2026-05-18T00:51:53Z","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 analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average","authors_text":"Endrit Dosti, Hirley Alves, Matti Latva-aho, Uditha Lakmal Wijewardhana","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T14:34:26Z","title":"Ultra Reliable Communication via Optimum Power Allocation for Type-I ARQ in Finite Block-Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08617","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:856c3fe5ffb999e47a001d3aa1623069f240bcd420fb80f6034fad244b3a2854","target":"record","created_at":"2026-05-18T00:51:53Z","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":"f6ef03f69ac6e7f4f992eef1d4fdd0e5bfe4003e01237b11e1b9418a306e8e7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T14:34:26Z","title_canon_sha256":"8f129870e6e304abb48f518a6d3ac9921289586e521373b9fcf3657b8ac81608"},"schema_version":"1.0","source":{"id":"1701.08617","kind":"arxiv","version":1}},"canonical_sha256":"8d96d31426a5efb6dd1fd55ac2fbad45f6b7f19ac8c827fcdede54d3e73f99c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d96d31426a5efb6dd1fd55ac2fbad45f6b7f19ac8c827fcdede54d3e73f99c8","first_computed_at":"2026-05-18T00:51:53.497825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:53.497825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EVbKFrOYekgcEYv8Dkhsk+cYXFF0o2GEegQJw3msJz0OyaMBPPHuAeFXBbhY2fuEsCH6p/eHcvvT9aanNjfJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:53.498574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:856c3fe5ffb999e47a001d3aa1623069f240bcd420fb80f6034fad244b3a2854","sha256:8eeb9a31c8a5752b12978ae564a9a2a260eb36328fd1ec3ef62dc539a830ab7b"],"state_sha256":"34482308d5706253de013e7e5b1454f5bf234f48967822b77918e83e5b2e75df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vi1yLsmZnIaJQ9db2OBEFQOzEqcpvu0jQVBOUcyEgdcaFKQKOJ12AhJCjqZunrjy0edd/c/rQodwLIwxxtqsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:54:22.136876Z","bundle_sha256":"684db0ed45ef7e28c9cca1cccf4e2bf2b324c8a50580e311304e7e565acf0114"}}