{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F4BX32AAYYAERT55OQRFAN4MPO","short_pith_number":"pith:F4BX32AA","canonical_record":{"source":{"id":"1712.04689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T10:21:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"555120647b03293c792f14ef1550c064d96b2668555e91a774da0e921df2ba87","abstract_canon_sha256":"0e7f975de314304c3a0b1b75d2dec1cc7b9214241056621efda1d96cef2353ec"},"schema_version":"1.0"},"canonical_sha256":"2f037de800c60048cfbd742250378c7bbd0b18744499ed4a22028d0d80b0175e","source":{"kind":"arxiv","id":"1712.04689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04689","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04689v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04689","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"F4BX32AAYYAE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4BX32AAYYAERT55","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4BX32AA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F4BX32AAYYAERT55OQRFAN4MPO","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T10:21:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"555120647b03293c792f14ef1550c064d96b2668555e91a774da0e921df2ba87","abstract_canon_sha256":"0e7f975de314304c3a0b1b75d2dec1cc7b9214241056621efda1d96cef2353ec"},"schema_version":"1.0"},"canonical_sha256":"2f037de800c60048cfbd742250378c7bbd0b18744499ed4a22028d0d80b0175e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.710736Z","signature_b64":"QCuKWGuiFmgDRq9xg96Nj0/0Ol1hVpxBALV31cassVZJFHGhxzmgfPIZsSO4ic549PmzgF+V3HRQ7aofrl+QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f037de800c60048cfbd742250378c7bbd0b18744499ed4a22028d0d80b0175e","last_reissued_at":"2026-05-18T00:28:03.710268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.710268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04689","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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOFeCXx/Yqb/emYwjNMQLT6laaDYUGHNb0HGbMOLV6ZWs0hwD1KNVZv4CdwouNjj1N7Doyo718Wntz3fr6deDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:27:51.301389Z"},"content_sha256":"65bba08fa16b9ce2a30a95e2134ac54c33aaf87e04854fd59920cc86ba557e45","schema_version":"1.0","event_id":"sha256:65bba08fa16b9ce2a30a95e2134ac54c33aaf87e04854fd59920cc86ba557e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F4BX32AAYYAERT55OQRFAN4MPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Non-Orthogonal Transmission under Reliability and Finite Blocklength Constraints","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":"2017-12-13T10:21:42Z","abstract_excerpt":"This paper investigates an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in traditional designs needs the assumption of infinite blocklength and thus is no longer appropriate. We adopt the newly finite blocklength coding capacity formula for explicitly specifying the trade-off between reliability and code blocklength. However, conventional successive interference cancellation (SIC) may become infeasible due to heterogeneous blocklengths. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04689","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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gi7Nk4SgICZRCR0pbC+0enLWCvOZnq46/K8m5Au+N+HuKyXuqHVA+P3/6kg7ImEb+r5vFnIjvG7G5G5A6FdkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:27:51.302047Z"},"content_sha256":"37e24e61b8397df52515cc414bc069ba74cb3ddcd93e26f91ee6d725b45e454d","schema_version":"1.0","event_id":"sha256:37e24e61b8397df52515cc414bc069ba74cb3ddcd93e26f91ee6d725b45e454d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4BX32AAYYAERT55OQRFAN4MPO/bundle.json","state_url":"https://pith.science/pith/F4BX32AAYYAERT55OQRFAN4MPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4BX32AAYYAERT55OQRFAN4MPO/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-05-27T02:27:51Z","links":{"resolver":"https://pith.science/pith/F4BX32AAYYAERT55OQRFAN4MPO","bundle":"https://pith.science/pith/F4BX32AAYYAERT55OQRFAN4MPO/bundle.json","state":"https://pith.science/pith/F4BX32AAYYAERT55OQRFAN4MPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4BX32AAYYAERT55OQRFAN4MPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F4BX32AAYYAERT55OQRFAN4MPO","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":"0e7f975de314304c3a0b1b75d2dec1cc7b9214241056621efda1d96cef2353ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T10:21:42Z","title_canon_sha256":"555120647b03293c792f14ef1550c064d96b2668555e91a774da0e921df2ba87"},"schema_version":"1.0","source":{"id":"1712.04689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04689","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04689v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04689","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"F4BX32AAYYAE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4BX32AAYYAERT55","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4BX32AA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:37e24e61b8397df52515cc414bc069ba74cb3ddcd93e26f91ee6d725b45e454d","target":"graph","created_at":"2026-05-18T00:28:03Z","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 an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in traditional designs needs the assumption of infinite blocklength and thus is no longer appropriate. We adopt the newly finite blocklength coding capacity formula for explicitly specifying the trade-off between reliability and code blocklength. However, conventional successive interference cancellation (SIC) may become infeasible due to heterogeneous blocklengths. W","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":"2017-12-13T10:21:42Z","title":"Energy-Efficient Non-Orthogonal Transmission under Reliability and Finite Blocklength Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04689","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:65bba08fa16b9ce2a30a95e2134ac54c33aaf87e04854fd59920cc86ba557e45","target":"record","created_at":"2026-05-18T00:28:03Z","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":"0e7f975de314304c3a0b1b75d2dec1cc7b9214241056621efda1d96cef2353ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T10:21:42Z","title_canon_sha256":"555120647b03293c792f14ef1550c064d96b2668555e91a774da0e921df2ba87"},"schema_version":"1.0","source":{"id":"1712.04689","kind":"arxiv","version":1}},"canonical_sha256":"2f037de800c60048cfbd742250378c7bbd0b18744499ed4a22028d0d80b0175e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f037de800c60048cfbd742250378c7bbd0b18744499ed4a22028d0d80b0175e","first_computed_at":"2026-05-18T00:28:03.710268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:03.710268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCuKWGuiFmgDRq9xg96Nj0/0Ol1hVpxBALV31cassVZJFHGhxzmgfPIZsSO4ic549PmzgF+V3HRQ7aofrl+QAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:03.710736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65bba08fa16b9ce2a30a95e2134ac54c33aaf87e04854fd59920cc86ba557e45","sha256:37e24e61b8397df52515cc414bc069ba74cb3ddcd93e26f91ee6d725b45e454d"],"state_sha256":"886124076919f142acf921d0eec817da8bc00308044129c98342b572ec5b19fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqag0CUbrIb6zm+5LqnhwGaTWqiqAW3lI63WQ24VGcM/s5X8kuDxt8CmOce/yZMR0eERVgOiRlpEISOMHBP2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:27:51.305718Z","bundle_sha256":"59ff66605022ecaedaebcddf6f1b926c210dbed99279255f3d2c0ef90525b201"}}