{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HAC6QWQZMG4X54A2LZFWCII52S","short_pith_number":"pith:HAC6QWQZ","canonical_record":{"source":{"id":"1904.10589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-24T01:05:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8554acd5dc06576682fa83d83038bcea6d373202ba9312b48a348b82735fd568","abstract_canon_sha256":"f0e77d5ce1e1dedba9a85e10d38ba7bb3230d6461718181e9a4beb85657aced8"},"schema_version":"1.0"},"canonical_sha256":"3805e85a1961b97ef01a5e4b61211dd4bffa23ba13aae7c68090be3b191c83ba","source":{"kind":"arxiv","id":"1904.10589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10589","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10589v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10589","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"HAC6QWQZMG4X","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HAC6QWQZMG4X54A2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HAC6QWQZ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HAC6QWQZMG4X54A2LZFWCII52S","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-24T01:05:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8554acd5dc06576682fa83d83038bcea6d373202ba9312b48a348b82735fd568","abstract_canon_sha256":"f0e77d5ce1e1dedba9a85e10d38ba7bb3230d6461718181e9a4beb85657aced8"},"schema_version":"1.0"},"canonical_sha256":"3805e85a1961b97ef01a5e4b61211dd4bffa23ba13aae7c68090be3b191c83ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.313693Z","signature_b64":"Ivcfc8hGAqCe3y99OV+TwFeGXHX7BQwpHXnRtOGrNzhDQrZfHwE746GhuEH7+E/3XexKucExk5mzYMDWpqOYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3805e85a1961b97ef01a5e4b61211dd4bffa23ba13aae7c68090be3b191c83ba","last_reissued_at":"2026-05-17T23:47:53.313229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.313229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10589","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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdwTwSIAzNh9WUbkWc/pPjmqMQb24pgb83gEu+4cmL7P20tSUd1isENk0qbJviQQcm/wXD5r2I7nkQs6x7nKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:57:32.092167Z"},"content_sha256":"8721512492254a84c2ebda84dabec9d72c2b65b7c8df6bc279210e0af851f800","schema_version":"1.0","event_id":"sha256:8721512492254a84c2ebda84dabec9d72c2b65b7c8df6bc279210e0af851f800"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HAC6QWQZMG4X54A2LZFWCII52S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization in Two-hop DF Multiple-Relay Network with Simultaneous Wireless Information and Power Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gongpu Wang, Ning Zhang, Qi Gu, Rongfei Fan, Zhangdui Zhong","submitted_at":"2019-04-24T01:05:34Z","abstract_excerpt":"This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10589","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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZDlNc7Hc3cJy0AUqXDeIi1oX3R5TQePHOFYrTuQU9mKwrEBLwW5Op9Frv8nAqdq/93VthZQoW6RTIVTV1l9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:57:32.092833Z"},"content_sha256":"3b7feae0e75193b4855b9eea01b2b88b128ffa199ab52b6c519d9d745f099ca2","schema_version":"1.0","event_id":"sha256:3b7feae0e75193b4855b9eea01b2b88b128ffa199ab52b6c519d9d745f099ca2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAC6QWQZMG4X54A2LZFWCII52S/bundle.json","state_url":"https://pith.science/pith/HAC6QWQZMG4X54A2LZFWCII52S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAC6QWQZMG4X54A2LZFWCII52S/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-27T11:57:32Z","links":{"resolver":"https://pith.science/pith/HAC6QWQZMG4X54A2LZFWCII52S","bundle":"https://pith.science/pith/HAC6QWQZMG4X54A2LZFWCII52S/bundle.json","state":"https://pith.science/pith/HAC6QWQZMG4X54A2LZFWCII52S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAC6QWQZMG4X54A2LZFWCII52S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HAC6QWQZMG4X54A2LZFWCII52S","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":"f0e77d5ce1e1dedba9a85e10d38ba7bb3230d6461718181e9a4beb85657aced8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-24T01:05:34Z","title_canon_sha256":"8554acd5dc06576682fa83d83038bcea6d373202ba9312b48a348b82735fd568"},"schema_version":"1.0","source":{"id":"1904.10589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10589","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10589v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10589","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"HAC6QWQZMG4X","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HAC6QWQZMG4X54A2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HAC6QWQZ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:3b7feae0e75193b4855b9eea01b2b88b128ffa199ab52b6c519d9d745f099ca2","target":"graph","created_at":"2026-05-17T23:47:53Z","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 the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off m","authors_text":"Gongpu Wang, Ning Zhang, Qi Gu, Rongfei Fan, Zhangdui Zhong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-24T01:05:34Z","title":"Throughput Maximization in Two-hop DF Multiple-Relay Network with Simultaneous Wireless Information and Power Transfer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10589","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:8721512492254a84c2ebda84dabec9d72c2b65b7c8df6bc279210e0af851f800","target":"record","created_at":"2026-05-17T23:47:53Z","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":"f0e77d5ce1e1dedba9a85e10d38ba7bb3230d6461718181e9a4beb85657aced8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-24T01:05:34Z","title_canon_sha256":"8554acd5dc06576682fa83d83038bcea6d373202ba9312b48a348b82735fd568"},"schema_version":"1.0","source":{"id":"1904.10589","kind":"arxiv","version":1}},"canonical_sha256":"3805e85a1961b97ef01a5e4b61211dd4bffa23ba13aae7c68090be3b191c83ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3805e85a1961b97ef01a5e4b61211dd4bffa23ba13aae7c68090be3b191c83ba","first_computed_at":"2026-05-17T23:47:53.313229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.313229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ivcfc8hGAqCe3y99OV+TwFeGXHX7BQwpHXnRtOGrNzhDQrZfHwE746GhuEH7+E/3XexKucExk5mzYMDWpqOYBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.313693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8721512492254a84c2ebda84dabec9d72c2b65b7c8df6bc279210e0af851f800","sha256:3b7feae0e75193b4855b9eea01b2b88b128ffa199ab52b6c519d9d745f099ca2"],"state_sha256":"9f3135016fa6bf3d5dacd9675df66483233b9d224cd906ec72db917dbc5b15b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXYvoduwwCTqe5oojI+qCqzxKo0Tg+ISqhuCeWBBgnRt3CPWr9s8kHC07x/GQMpElTEZu620ltT2edIDAVp7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:57:32.097763Z","bundle_sha256":"e519cc5da95bbccf292381f730701c0139dc82df7e2a0d3522c17df744d49282"}}