{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AIC2TLIC3PBDFDKJ33XJ2NBNVC","short_pith_number":"pith:AIC2TLIC","canonical_record":{"source":{"id":"1403.3665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-03-14T18:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecbe7c25b9ec8613a2c60d723a50d0ba8c31249764092dc70cdab3b804b515e2","abstract_canon_sha256":"fa02b8d4445182aa6d8d60d9e2a8e1994661321cba44ee6c9ebad09ee89615ca"},"schema_version":"1.0"},"canonical_sha256":"0205a9ad02dbc2328d49deee9d342da899472745608b34a392dc31186dccb958","source":{"kind":"arxiv","id":"1403.3665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3665","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3665v1","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3665","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"AIC2TLIC3PBD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AIC2TLIC3PBDFDKJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AIC2TLIC","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AIC2TLIC3PBDFDKJ33XJ2NBNVC","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-03-14T18:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecbe7c25b9ec8613a2c60d723a50d0ba8c31249764092dc70cdab3b804b515e2","abstract_canon_sha256":"fa02b8d4445182aa6d8d60d9e2a8e1994661321cba44ee6c9ebad09ee89615ca"},"schema_version":"1.0"},"canonical_sha256":"0205a9ad02dbc2328d49deee9d342da899472745608b34a392dc31186dccb958","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:19.734350Z","signature_b64":"lwKnCRHzzHfrOf+ZgZpjV1z3AvGGarJg0oQ8J5WlFHBiEPON9DALjf2Lmd0CYxKMtPme+1d7dvprSf9UBdD3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0205a9ad02dbc2328d49deee9d342da899472745608b34a392dc31186dccb958","last_reissued_at":"2026-05-18T02:56:19.733710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:19.733710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3665","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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mYOSkKmB58F55/W5CQvUzOtSF0gRF3voxn2BnUsm7XowJsuLNVj88pHCPhcp1Mhs4+2tRsfvNpZZnCiqS1PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:09:29.144928Z"},"content_sha256":"54b52a2651a66713606d86d7cde55325c36b9e9a8896a8819e0840caaab4341a","schema_version":"1.0","event_id":"sha256:54b52a2651a66713606d86d7cde55325c36b9e9a8896a8819e0840caaab4341a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AIC2TLIC3PBDFDKJ33XJ2NBNVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Algorithm for Throughput Maximization in Wireless Powered Communication Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Shen, Gang Zhu, Qian Sun, Xuan Li, Zhangdui Zhong","submitted_at":"2014-03-14T18:31:40Z","abstract_excerpt":"This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3665","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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsZH9KQEDrg+70EMRvjSwXkFKluqs64u8Xz7HLf9OrMIeK/EsQ30BQaHj4b5rqsjo9ADM+aPK7amfNHNv7qVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:09:29.145616Z"},"content_sha256":"efe1164e7f223f5425e4167ae37f73ebb21875208ae04ff4e942728efa45fde4","schema_version":"1.0","event_id":"sha256:efe1164e7f223f5425e4167ae37f73ebb21875208ae04ff4e942728efa45fde4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/bundle.json","state_url":"https://pith.science/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/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-27T20:09:29Z","links":{"resolver":"https://pith.science/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC","bundle":"https://pith.science/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/bundle.json","state":"https://pith.science/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIC2TLIC3PBDFDKJ33XJ2NBNVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AIC2TLIC3PBDFDKJ33XJ2NBNVC","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":"fa02b8d4445182aa6d8d60d9e2a8e1994661321cba44ee6c9ebad09ee89615ca","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-03-14T18:31:40Z","title_canon_sha256":"ecbe7c25b9ec8613a2c60d723a50d0ba8c31249764092dc70cdab3b804b515e2"},"schema_version":"1.0","source":{"id":"1403.3665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3665","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3665v1","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3665","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"AIC2TLIC3PBD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AIC2TLIC3PBDFDKJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AIC2TLIC","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:efe1164e7f223f5425e4167ae37f73ebb21875208ae04ff4e942728efa45fde4","target":"graph","created_at":"2026-05-18T02:56:19Z","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 a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which p","authors_text":"Chao Shen, Gang Zhu, Qian Sun, Xuan Li, Zhangdui Zhong","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-03-14T18:31:40Z","title":"A Low-Complexity Algorithm for Throughput Maximization in Wireless Powered Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3665","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:54b52a2651a66713606d86d7cde55325c36b9e9a8896a8819e0840caaab4341a","target":"record","created_at":"2026-05-18T02:56:19Z","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":"fa02b8d4445182aa6d8d60d9e2a8e1994661321cba44ee6c9ebad09ee89615ca","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-03-14T18:31:40Z","title_canon_sha256":"ecbe7c25b9ec8613a2c60d723a50d0ba8c31249764092dc70cdab3b804b515e2"},"schema_version":"1.0","source":{"id":"1403.3665","kind":"arxiv","version":1}},"canonical_sha256":"0205a9ad02dbc2328d49deee9d342da899472745608b34a392dc31186dccb958","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0205a9ad02dbc2328d49deee9d342da899472745608b34a392dc31186dccb958","first_computed_at":"2026-05-18T02:56:19.733710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:19.733710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwKnCRHzzHfrOf+ZgZpjV1z3AvGGarJg0oQ8J5WlFHBiEPON9DALjf2Lmd0CYxKMtPme+1d7dvprSf9UBdD3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:19.734350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54b52a2651a66713606d86d7cde55325c36b9e9a8896a8819e0840caaab4341a","sha256:efe1164e7f223f5425e4167ae37f73ebb21875208ae04ff4e942728efa45fde4"],"state_sha256":"7dc31af9f7ae286c0603d7f2c45b8f0fb6177e9e3f8e7702db331e80b990949b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsrELWk2kxYEPNFMjubbseXTj9MaI+L8pkqODxJnhPqzbS3T/SjqUBUk9KIQOplMgSKw1VkhMl41I7wwOUWcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:09:29.148867Z","bundle_sha256":"66b78e1fd00f7aa9db69dbcb3aed69ff85aa595a2c638da99bae45e05d146f01"}}