{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CFUEPX25C3IU722AZAPBCO2GQA","short_pith_number":"pith:CFUEPX25","canonical_record":{"source":{"id":"1705.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T12:52:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39c1c631dfd61dd5f77c1d534d8265915c5e3abbbc00bc821f5b2d96cfd5e254","abstract_canon_sha256":"7603acb0689c8010dfc1b437358ef738b647e6aee6bde48f040ea01e6d755b4f"},"schema_version":"1.0"},"canonical_sha256":"116847df5d16d14feb40c81e113b46802267fbf8992d03f5d4ca3488567950f1","source":{"kind":"arxiv","id":"1705.06558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06558","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06558v1","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06558","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"CFUEPX25C3IU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFUEPX25C3IU722A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFUEPX25","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CFUEPX25C3IU722AZAPBCO2GQA","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T12:52:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39c1c631dfd61dd5f77c1d534d8265915c5e3abbbc00bc821f5b2d96cfd5e254","abstract_canon_sha256":"7603acb0689c8010dfc1b437358ef738b647e6aee6bde48f040ea01e6d755b4f"},"schema_version":"1.0"},"canonical_sha256":"116847df5d16d14feb40c81e113b46802267fbf8992d03f5d4ca3488567950f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:14.429953Z","signature_b64":"0zy5Gzvc38IEBEyevf8RT0WAng3kg6qNpEbZ9dctTwcZQSbUBzTC0ov6TO1D/U43cvNYQXI9YeuNDAp/PQ4wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116847df5d16d14feb40c81e113b46802267fbf8992d03f5d4ca3488567950f1","last_reissued_at":"2026-05-18T00:44:14.429476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:14.429476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06558","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:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HH+NRrOvx+OUR9Fd7k76TWcvSRgZfo/co5zLaSkGFfperDLTjhGufePaCMw/0Kd91EIxXhj8gn5EK8kMwNOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:27:32.383258Z"},"content_sha256":"34c1cdf67da232929749a224256492d787f5987613f5e3bd4f7287788dd74bd4","schema_version":"1.0","event_id":"sha256:34c1cdf67da232929749a224256492d787f5987613f5e3bd4f7287788dd74bd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CFUEPX25C3IU722AZAPBCO2GQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Chance-Constrained Optimization for Power-Efficient and Secure SWIPT Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Huan X. Nguyen, Quoc-Tuan Vien, Robert Schober, Tuan Anh Le","submitted_at":"2017-05-18T12:52:04Z","abstract_excerpt":"In this paper, we propose beamforming schemes to simultaneously transmit data securely to multiple information receivers (IRs) while transferring power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the imperfection of the instantaneous channel state information (CSI), we introduce a chance-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, data transmission security, and power transfer reliability. As the proposed optimization problem is non-convex due to the chance constraints, we propose two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06558","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:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXMlPT3gnlC8MNoLIBc0jVfv71nkNJuZJim+9MBaKFRbQZCGGX40DCAb+hocgQZvVDVOgOFIZlLbKyivmtnxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:27:32.383631Z"},"content_sha256":"4f8fb41587c3134351bd457282ee83fb27df078026e5b3147288812b5d288bb9","schema_version":"1.0","event_id":"sha256:4f8fb41587c3134351bd457282ee83fb27df078026e5b3147288812b5d288bb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFUEPX25C3IU722AZAPBCO2GQA/bundle.json","state_url":"https://pith.science/pith/CFUEPX25C3IU722AZAPBCO2GQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFUEPX25C3IU722AZAPBCO2GQA/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-28T12:27:32Z","links":{"resolver":"https://pith.science/pith/CFUEPX25C3IU722AZAPBCO2GQA","bundle":"https://pith.science/pith/CFUEPX25C3IU722AZAPBCO2GQA/bundle.json","state":"https://pith.science/pith/CFUEPX25C3IU722AZAPBCO2GQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFUEPX25C3IU722AZAPBCO2GQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CFUEPX25C3IU722AZAPBCO2GQA","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":"7603acb0689c8010dfc1b437358ef738b647e6aee6bde48f040ea01e6d755b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T12:52:04Z","title_canon_sha256":"39c1c631dfd61dd5f77c1d534d8265915c5e3abbbc00bc821f5b2d96cfd5e254"},"schema_version":"1.0","source":{"id":"1705.06558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06558","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06558v1","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06558","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"CFUEPX25C3IU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFUEPX25C3IU722A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFUEPX25","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4f8fb41587c3134351bd457282ee83fb27df078026e5b3147288812b5d288bb9","target":"graph","created_at":"2026-05-18T00:44:14Z","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":"In this paper, we propose beamforming schemes to simultaneously transmit data securely to multiple information receivers (IRs) while transferring power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the imperfection of the instantaneous channel state information (CSI), we introduce a chance-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, data transmission security, and power transfer reliability. As the proposed optimization problem is non-convex due to the chance constraints, we propose two ","authors_text":"Derrick Wing Kwan Ng, Huan X. Nguyen, Quoc-Tuan Vien, Robert Schober, Tuan Anh Le","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T12:52:04Z","title":"Robust Chance-Constrained Optimization for Power-Efficient and Secure SWIPT Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06558","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:34c1cdf67da232929749a224256492d787f5987613f5e3bd4f7287788dd74bd4","target":"record","created_at":"2026-05-18T00:44:14Z","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":"7603acb0689c8010dfc1b437358ef738b647e6aee6bde48f040ea01e6d755b4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-18T12:52:04Z","title_canon_sha256":"39c1c631dfd61dd5f77c1d534d8265915c5e3abbbc00bc821f5b2d96cfd5e254"},"schema_version":"1.0","source":{"id":"1705.06558","kind":"arxiv","version":1}},"canonical_sha256":"116847df5d16d14feb40c81e113b46802267fbf8992d03f5d4ca3488567950f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"116847df5d16d14feb40c81e113b46802267fbf8992d03f5d4ca3488567950f1","first_computed_at":"2026-05-18T00:44:14.429476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:14.429476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0zy5Gzvc38IEBEyevf8RT0WAng3kg6qNpEbZ9dctTwcZQSbUBzTC0ov6TO1D/U43cvNYQXI9YeuNDAp/PQ4wDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:14.429953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c1cdf67da232929749a224256492d787f5987613f5e3bd4f7287788dd74bd4","sha256:4f8fb41587c3134351bd457282ee83fb27df078026e5b3147288812b5d288bb9"],"state_sha256":"9adf61a45e3fce6db25e868fac1539e5aa1a48a259483307505983ddc00f3efd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiWjeYPZEP7Nl9s1qxZKtkwxw6mi/wST+qZdcdQlMkI+D6pGdqwG4MjCi4KMLhJ3m3U7t6ipCGB8sG7kB7iFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:27:32.385587Z","bundle_sha256":"c4e27c8bd812e0f8dad3068ee86c22e2016bd0f0fb10f79fb9918a993919fbbd"}}