{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TDHZ3EEDXED5SUCWIRNFPGCDO5","short_pith_number":"pith:TDHZ3EED","canonical_record":{"source":{"id":"1902.07064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-19T14:13:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98ed33c26866b26e3f797ed020edf67789327d2094235f8e173004c2de2bbc71","abstract_canon_sha256":"dfbbedd76372c28a4c86d70ac2ceb816fb2c82970b80282d058f377b1e4219cc"},"schema_version":"1.0"},"canonical_sha256":"98cf9d9083b907d95056445a5798437771c3b69c812814e1d7cb4172f2b48e3a","source":{"kind":"arxiv","id":"1902.07064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07064","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07064v1","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07064","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"TDHZ3EEDXED5","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_16","alias_value":"TDHZ3EEDXED5SUCW","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_8","alias_value":"TDHZ3EED","created_at":"2026-07-05T00:50:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TDHZ3EEDXED5SUCWIRNFPGCDO5","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-19T14:13:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98ed33c26866b26e3f797ed020edf67789327d2094235f8e173004c2de2bbc71","abstract_canon_sha256":"dfbbedd76372c28a4c86d70ac2ceb816fb2c82970b80282d058f377b1e4219cc"},"schema_version":"1.0"},"canonical_sha256":"98cf9d9083b907d95056445a5798437771c3b69c812814e1d7cb4172f2b48e3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:24.463879Z","signature_b64":"uQu3+ruSpFkH+wNUMwLKp9GFeuKqeSGbsk4DSM9BtxXjpxYo6PtDSRte+dAQ/aBsHalDxfKRvFOHssaykVkCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98cf9d9083b907d95056445a5798437771c3b69c812814e1d7cb4172f2b48e3a","last_reissued_at":"2026-07-05T00:50:24.463417Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:24.463417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07064","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-07-05T00:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVc9riwN+Rn5sx2HI8zWEbIVXzFlgaurT1M/wfP8VCUIlxxktNUxl1zDDcVPvnVD647M9XiKpZwwup72qjBuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:14:47.590967Z"},"content_sha256":"9d3e4a9204a684c21f853ca4e9e9748208f3dae5e9cae38a72be8f790c3bfd97","schema_version":"1.0","event_id":"sha256:9d3e4a9204a684c21f853ca4e9e9748208f3dae5e9cae38a72be8f790c3bfd97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TDHZ3EEDXED5SUCWIRNFPGCDO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Capacity and Power Allocation for Machine-Type Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hirley Alves, Matti Latva-aho, Mohammad Shehab","submitted_at":"2019-02-19T14:13:53Z","abstract_excerpt":"Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. First, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the power-delay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07064","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.07064/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6otKpVBkKPH06WN5F7HflUfWe873QA9BrdR3xh8iR+srwB9AOmviZCaK9QPqqijyri3q2bSpSVHrpC6Ic9i8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:14:47.591346Z"},"content_sha256":"350cfc1484a6d04320d8bb6203222a8e3f83fce52b6a7cb19cdbc05d8b0076ff","schema_version":"1.0","event_id":"sha256:350cfc1484a6d04320d8bb6203222a8e3f83fce52b6a7cb19cdbc05d8b0076ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/bundle.json","state_url":"https://pith.science/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/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-07-07T04:14:47Z","links":{"resolver":"https://pith.science/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5","bundle":"https://pith.science/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/bundle.json","state":"https://pith.science/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDHZ3EEDXED5SUCWIRNFPGCDO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TDHZ3EEDXED5SUCWIRNFPGCDO5","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":"dfbbedd76372c28a4c86d70ac2ceb816fb2c82970b80282d058f377b1e4219cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-19T14:13:53Z","title_canon_sha256":"98ed33c26866b26e3f797ed020edf67789327d2094235f8e173004c2de2bbc71"},"schema_version":"1.0","source":{"id":"1902.07064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07064","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07064v1","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07064","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"TDHZ3EEDXED5","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_16","alias_value":"TDHZ3EEDXED5SUCW","created_at":"2026-07-05T00:50:24Z"},{"alias_kind":"pith_short_8","alias_value":"TDHZ3EED","created_at":"2026-07-05T00:50:24Z"}],"graph_snapshots":[{"event_id":"sha256:350cfc1484a6d04320d8bb6203222a8e3f83fce52b6a7cb19cdbc05d8b0076ff","target":"graph","created_at":"2026-07-05T00:50:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.07064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. First, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the power-delay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of E","authors_text":"Hirley Alves, Matti Latva-aho, Mohammad Shehab","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-19T14:13:53Z","title":"Effective Capacity and Power Allocation for Machine-Type Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07064","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:9d3e4a9204a684c21f853ca4e9e9748208f3dae5e9cae38a72be8f790c3bfd97","target":"record","created_at":"2026-07-05T00:50:24Z","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":"dfbbedd76372c28a4c86d70ac2ceb816fb2c82970b80282d058f377b1e4219cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-19T14:13:53Z","title_canon_sha256":"98ed33c26866b26e3f797ed020edf67789327d2094235f8e173004c2de2bbc71"},"schema_version":"1.0","source":{"id":"1902.07064","kind":"arxiv","version":1}},"canonical_sha256":"98cf9d9083b907d95056445a5798437771c3b69c812814e1d7cb4172f2b48e3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98cf9d9083b907d95056445a5798437771c3b69c812814e1d7cb4172f2b48e3a","first_computed_at":"2026-07-05T00:50:24.463417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:24.463417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uQu3+ruSpFkH+wNUMwLKp9GFeuKqeSGbsk4DSM9BtxXjpxYo6PtDSRte+dAQ/aBsHalDxfKRvFOHssaykVkCAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:24.463879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d3e4a9204a684c21f853ca4e9e9748208f3dae5e9cae38a72be8f790c3bfd97","sha256:350cfc1484a6d04320d8bb6203222a8e3f83fce52b6a7cb19cdbc05d8b0076ff"],"state_sha256":"21937fe2728be9366b7d7fb18856157fdb82b56e52d35f11a3ca2227c5e9727f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSFWibDjSJu24jtvsvLF3WN6BUFKWCNS7U8v5wg9m2qoj0cN1AXjtuce3q+mj67bv2zbpkRFPja3abUH9EMFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:14:47.593245Z","bundle_sha256":"05b5a5df70e3ca99fc3746c41b0c51a0375ef1fbef0fcd2c45f73596d71230cc"}}