{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:THSSLFFIJBVSKS3UHXVGPZEUNC","short_pith_number":"pith:THSSLFFI","canonical_record":{"source":{"id":"1806.02412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T12:49:21Z","cross_cats_sorted":["eess.SP","math.IT","math.OC"],"title_canon_sha256":"ef565cecce01027cf0e34ee78c53f2cb40c923887a9a51015741ef21a512574e","abstract_canon_sha256":"d6af2fd867d8306972be134f90af17f7baecc22b1c7fdd0b235e38ac97587111"},"schema_version":"1.0"},"canonical_sha256":"99e52594a8486b254b743dea67e49468a16d78902876d1609bc1b385cb97d350","source":{"kind":"arxiv","id":"1806.02412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02412","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02412v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02412","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"THSSLFFIJBVS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THSSLFFIJBVSKS3U","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THSSLFFI","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:THSSLFFIJBVSKS3UHXVGPZEUNC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T12:49:21Z","cross_cats_sorted":["eess.SP","math.IT","math.OC"],"title_canon_sha256":"ef565cecce01027cf0e34ee78c53f2cb40c923887a9a51015741ef21a512574e","abstract_canon_sha256":"d6af2fd867d8306972be134f90af17f7baecc22b1c7fdd0b235e38ac97587111"},"schema_version":"1.0"},"canonical_sha256":"99e52594a8486b254b743dea67e49468a16d78902876d1609bc1b385cb97d350","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:56.938979Z","signature_b64":"0c30RoKsVvWTMPPyMi/W6yFSx4y2O/nyVuRj07cXtu36//B1hNNs64m7ukoAb5+6f7asFWYvNi7k6HieLid/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e52594a8486b254b743dea67e49468a16d78902876d1609bc1b385cb97d350","last_reissued_at":"2026-05-18T00:13:56.938183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:56.938183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02412","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:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dL7rjhYfhZkvMxSCvTWTLWuC4W5HmNPpajC7L84tLwsirzTSz1XbDD+42MlxTTvrYx1DN56UBaENTih/G5pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:28.391885Z"},"content_sha256":"0d505e14add9d8bc60fc2264bbd0665d44ee1463d9a9dbe2ca1988f7b1a83c3a","schema_version":"1.0","event_id":"sha256:0d505e14add9d8bc60fc2264bbd0665d44ee1463d9a9dbe2ca1988f7b1a83c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:THSSLFFIJBVSKS3UHXVGPZEUNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D2D Communications Underlaying Wireless Powered Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Guoru Ding, Haichao Wang, Jinlong Wang, Zhu Han","submitted_at":"2018-05-29T12:49:21Z","abstract_excerpt":"In this paper, we investigate the resource allocation problem for D2D communications underlaying wireless powered communication networks, where multiple D2D pairs harvest energy from a power station equipped with multiple antennas and then transmit information signals simultaneously over the same spectrum resource. The aim is to maximize the sum throughput via joint time scheduling and power control, while satisfying the energy causality constraints. The formulated non-convex problem is first transformed into a nonlinear fractional programming problem with a tactful reformulation. Then, by lev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02412","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:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqPSAXzaAYUpYu7fYpByRCeOiQXTKWWTvI55W8dhljfifBzZJbHCVD/e1jx5+BtZToXf0godmOTWAgCXRVV5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:23:28.392570Z"},"content_sha256":"b45ed061ea75b6bc691002bdf86ac7b5e021d3ff23920644b511ca698b73adb1","schema_version":"1.0","event_id":"sha256:b45ed061ea75b6bc691002bdf86ac7b5e021d3ff23920644b511ca698b73adb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/bundle.json","state_url":"https://pith.science/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/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-29T16:23:28Z","links":{"resolver":"https://pith.science/pith/THSSLFFIJBVSKS3UHXVGPZEUNC","bundle":"https://pith.science/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/bundle.json","state":"https://pith.science/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THSSLFFIJBVSKS3UHXVGPZEUNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:THSSLFFIJBVSKS3UHXVGPZEUNC","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":"d6af2fd867d8306972be134f90af17f7baecc22b1c7fdd0b235e38ac97587111","cross_cats_sorted":["eess.SP","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T12:49:21Z","title_canon_sha256":"ef565cecce01027cf0e34ee78c53f2cb40c923887a9a51015741ef21a512574e"},"schema_version":"1.0","source":{"id":"1806.02412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02412","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02412v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02412","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"THSSLFFIJBVS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THSSLFFIJBVSKS3U","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THSSLFFI","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:b45ed061ea75b6bc691002bdf86ac7b5e021d3ff23920644b511ca698b73adb1","target":"graph","created_at":"2026-05-18T00:13:56Z","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 investigate the resource allocation problem for D2D communications underlaying wireless powered communication networks, where multiple D2D pairs harvest energy from a power station equipped with multiple antennas and then transmit information signals simultaneously over the same spectrum resource. The aim is to maximize the sum throughput via joint time scheduling and power control, while satisfying the energy causality constraints. The formulated non-convex problem is first transformed into a nonlinear fractional programming problem with a tactful reformulation. Then, by lev","authors_text":"Guoru Ding, Haichao Wang, Jinlong Wang, Zhu Han","cross_cats":["eess.SP","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T12:49:21Z","title":"D2D Communications Underlaying Wireless Powered Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02412","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:0d505e14add9d8bc60fc2264bbd0665d44ee1463d9a9dbe2ca1988f7b1a83c3a","target":"record","created_at":"2026-05-18T00:13:56Z","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":"d6af2fd867d8306972be134f90af17f7baecc22b1c7fdd0b235e38ac97587111","cross_cats_sorted":["eess.SP","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T12:49:21Z","title_canon_sha256":"ef565cecce01027cf0e34ee78c53f2cb40c923887a9a51015741ef21a512574e"},"schema_version":"1.0","source":{"id":"1806.02412","kind":"arxiv","version":1}},"canonical_sha256":"99e52594a8486b254b743dea67e49468a16d78902876d1609bc1b385cb97d350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e52594a8486b254b743dea67e49468a16d78902876d1609bc1b385cb97d350","first_computed_at":"2026-05-18T00:13:56.938183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:56.938183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0c30RoKsVvWTMPPyMi/W6yFSx4y2O/nyVuRj07cXtu36//B1hNNs64m7ukoAb5+6f7asFWYvNi7k6HieLid/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:56.938979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d505e14add9d8bc60fc2264bbd0665d44ee1463d9a9dbe2ca1988f7b1a83c3a","sha256:b45ed061ea75b6bc691002bdf86ac7b5e021d3ff23920644b511ca698b73adb1"],"state_sha256":"c1d3279002b5e4ff8891938f2ae137188ee9b3aad5830cb9e0c9bcf6c3b675a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uj+k5ahObZWxC813R/Kmis9PssADePVO5kSB2fhcOEKefnJl73guYZWvaMkJePoOwjxFif71VGMQX5r+SugeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:23:28.396410Z","bundle_sha256":"d953b0d3a4f34ce851141139e294b5e0b75a20eff50ecafef096877626553bf4"}}