{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M3LV76AWZY6NAYCLMAL6NCN235","short_pith_number":"pith:M3LV76AW","canonical_record":{"source":{"id":"1806.09144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T13:40:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"21e87b58aa966a49507ab69e239acb11f3184cf882c8df37953bd53fee1fe654","abstract_canon_sha256":"3f5692cc2e733804f3d2378a374cd9b174606103969fbf2d3dc03cdc44eb004c"},"schema_version":"1.0"},"canonical_sha256":"66d75ff816ce3cd0604b6017e689badf70655e9befdfb01c4f294fb40b76e19b","source":{"kind":"arxiv","id":"1806.09144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09144","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09144v2","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09144","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"M3LV76AWZY6N","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_16","alias_value":"M3LV76AWZY6NAYCL","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_8","alias_value":"M3LV76AW","created_at":"2026-07-05T00:26:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M3LV76AWZY6NAYCLMAL6NCN235","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T13:40:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"21e87b58aa966a49507ab69e239acb11f3184cf882c8df37953bd53fee1fe654","abstract_canon_sha256":"3f5692cc2e733804f3d2378a374cd9b174606103969fbf2d3dc03cdc44eb004c"},"schema_version":"1.0"},"canonical_sha256":"66d75ff816ce3cd0604b6017e689badf70655e9befdfb01c4f294fb40b76e19b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:55.986874Z","signature_b64":"63dyztbGEmIDtsO39OkxiuxOBT3cnimHY0x3YlxQLKYBGjhSrhzDRwscPsJw+5+JEY88Cdi3QYjog/r4Nn0iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d75ff816ce3cd0604b6017e689badf70655e9befdfb01c4f294fb40b76e19b","last_reissued_at":"2026-07-05T00:26:55.986436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:55.986436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09144","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-07-05T00:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OllY+ZTpLX/niNvMEotR5eAoKMsvs+qFxq84tJ7xQxqaBJAY4hynFVhOoN/hEbJ3tdiS1JHYWlxnoBLbWj3sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:49:19.323103Z"},"content_sha256":"f58727b7fd277fe46836f8afae023784dd8d5142cc05e445c372f95da4681bad","schema_version":"1.0","event_id":"sha256:f58727b7fd277fe46836f8afae023784dd8d5142cc05e445c372f95da4681bad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M3LV76AWZY6NAYCLMAL6NCN235","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transmission Energy Minimization for Heterogeneous Low-Latency NOMA Downlink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Shen, Gang Zhu, Shih-Chun Lin, Tsung-Hui Chang, Yajun Zhao, Yanqing Xu","submitted_at":"2018-06-24T13:40:16Z","abstract_excerpt":"This paper investigates the transmission energy minimization problem for the two-user downlink with strictly heterogeneous latency constraints. To cope with the latency constraints and to explicitly specify the trade-off between blocklength (latency) and reliability the normal approximation of the capacity of finite blocklength codes (FBCs) is adopted, in contrast to the classical Shannon capacity formula. We first consider the non-orthogonal multiple access (NOMA) based transmission scheme. However, due to heterogeneous latency constraints and channel conditions at receivers, the conventional"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1806.09144/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:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x70zQYaLYJVENl6XrXdgqJPjFDto+VpYfXcRbuSd3XNJ5FWGdEa0iCrRRtfdKzk7Jpwq86VkhWvXAMM61HLhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:49:19.324007Z"},"content_sha256":"035172503e0e58da8fea52679e950163ff208e6e3b449db2694844aa974f1143","schema_version":"1.0","event_id":"sha256:035172503e0e58da8fea52679e950163ff208e6e3b449db2694844aa974f1143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3LV76AWZY6NAYCLMAL6NCN235/bundle.json","state_url":"https://pith.science/pith/M3LV76AWZY6NAYCLMAL6NCN235/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3LV76AWZY6NAYCLMAL6NCN235/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-06T04:49:19Z","links":{"resolver":"https://pith.science/pith/M3LV76AWZY6NAYCLMAL6NCN235","bundle":"https://pith.science/pith/M3LV76AWZY6NAYCLMAL6NCN235/bundle.json","state":"https://pith.science/pith/M3LV76AWZY6NAYCLMAL6NCN235/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3LV76AWZY6NAYCLMAL6NCN235/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M3LV76AWZY6NAYCLMAL6NCN235","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":"3f5692cc2e733804f3d2378a374cd9b174606103969fbf2d3dc03cdc44eb004c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T13:40:16Z","title_canon_sha256":"21e87b58aa966a49507ab69e239acb11f3184cf882c8df37953bd53fee1fe654"},"schema_version":"1.0","source":{"id":"1806.09144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09144","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09144v2","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09144","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"M3LV76AWZY6N","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_16","alias_value":"M3LV76AWZY6NAYCL","created_at":"2026-07-05T00:26:55Z"},{"alias_kind":"pith_short_8","alias_value":"M3LV76AW","created_at":"2026-07-05T00:26:55Z"}],"graph_snapshots":[{"event_id":"sha256:035172503e0e58da8fea52679e950163ff208e6e3b449db2694844aa974f1143","target":"graph","created_at":"2026-07-05T00:26:55Z","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/1806.09144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the transmission energy minimization problem for the two-user downlink with strictly heterogeneous latency constraints. To cope with the latency constraints and to explicitly specify the trade-off between blocklength (latency) and reliability the normal approximation of the capacity of finite blocklength codes (FBCs) is adopted, in contrast to the classical Shannon capacity formula. We first consider the non-orthogonal multiple access (NOMA) based transmission scheme. However, due to heterogeneous latency constraints and channel conditions at receivers, the conventional","authors_text":"Chao Shen, Gang Zhu, Shih-Chun Lin, Tsung-Hui Chang, Yajun Zhao, Yanqing Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T13:40:16Z","title":"Transmission Energy Minimization for Heterogeneous Low-Latency NOMA Downlink"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09144","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:f58727b7fd277fe46836f8afae023784dd8d5142cc05e445c372f95da4681bad","target":"record","created_at":"2026-07-05T00:26:55Z","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":"3f5692cc2e733804f3d2378a374cd9b174606103969fbf2d3dc03cdc44eb004c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T13:40:16Z","title_canon_sha256":"21e87b58aa966a49507ab69e239acb11f3184cf882c8df37953bd53fee1fe654"},"schema_version":"1.0","source":{"id":"1806.09144","kind":"arxiv","version":2}},"canonical_sha256":"66d75ff816ce3cd0604b6017e689badf70655e9befdfb01c4f294fb40b76e19b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66d75ff816ce3cd0604b6017e689badf70655e9befdfb01c4f294fb40b76e19b","first_computed_at":"2026-07-05T00:26:55.986436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:55.986436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63dyztbGEmIDtsO39OkxiuxOBT3cnimHY0x3YlxQLKYBGjhSrhzDRwscPsJw+5+JEY88Cdi3QYjog/r4Nn0iBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:55.986874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58727b7fd277fe46836f8afae023784dd8d5142cc05e445c372f95da4681bad","sha256:035172503e0e58da8fea52679e950163ff208e6e3b449db2694844aa974f1143"],"state_sha256":"488501fc615f6b8c501dc71ad7c0f09103b8c54f758d5ced18b5b1570c541a07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnT3vb72fHvyFOf8oevc9+qxLyuY7/mLVZCqpmq4NFvnjJrD94nK9YUaePYDhd4K2T9TE79TC9TIEtp2mpFAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:49:19.329382Z","bundle_sha256":"2d21c52e0f9eb3a9464b453e3628db8f4dcd4ecba4a5be013bfd133f5c0d9843"}}