{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TB2AE44TC73QXPEKIWJTB2KKCB","short_pith_number":"pith:TB2AE44T","canonical_record":{"source":{"id":"1601.06376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T12:54:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"929c9cb581ff57869fe79d94f94442417bd86c2b10531fac3c0cd1b3bbfbcf1f","abstract_canon_sha256":"5c06c41bdbaeccd45763983f5b387061d33d4f1f87304f2ac0336b9ed4dad1ff"},"schema_version":"1.0"},"canonical_sha256":"987402739317f70bbc8a459330e94a107e7bfac6a319ae56de113dc97209546d","source":{"kind":"arxiv","id":"1601.06376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06376","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06376v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06376","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"TB2AE44TC73Q","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TB2AE44TC73QXPEK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TB2AE44T","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TB2AE44TC73QXPEKIWJTB2KKCB","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T12:54:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"929c9cb581ff57869fe79d94f94442417bd86c2b10531fac3c0cd1b3bbfbcf1f","abstract_canon_sha256":"5c06c41bdbaeccd45763983f5b387061d33d4f1f87304f2ac0336b9ed4dad1ff"},"schema_version":"1.0"},"canonical_sha256":"987402739317f70bbc8a459330e94a107e7bfac6a319ae56de113dc97209546d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:04.593046Z","signature_b64":"ZrM+zM2BE6XLHkFh/e0Di0ay32wfHDP6mIYaPUWl6SX7gOOgWZtwkdcivlmkl/ympG8NZu4IYbmvt6F8sUY5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"987402739317f70bbc8a459330e94a107e7bfac6a319ae56de113dc97209546d","last_reissued_at":"2026-05-18T01:22:04.592602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:04.592602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06376","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-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75lNrrJx0nKO7YFIhK+raWADVDZ20yYIlwNO9xylVYUOcyNx9WbgdoYdNUqL36l+8U3XTiOSLcTKfXjVQoWnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:11:22.381079Z"},"content_sha256":"179918f19c8e554a650b5e759d199525daac35fa13c43c572fd3ade9f3880ba7","schema_version":"1.0","event_id":"sha256:179918f19c8e554a650b5e759d199525daac35fa13c43c572fd3ade9f3880ba7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TB2AE44TC73QXPEKIWJTB2KKCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization for Mobile Relaying Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rui Zhang, Teng Joon Lim, Yong Zeng","submitted_at":"2016-01-24T12:54:16Z","abstract_excerpt":"This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we study the throughput maximization problem in a mobile relaying system via dynamic rate and power allocations at the source and relay. An optimization problem is formulated for a finite time horizon, subject to an information-causality constraint, which results from the data buffering employed at the relay. It is found that the optimal power allocations across th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06376","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-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGdnC9qscK0o3p1Y0UnqgteYfDFHg2hqN+AECWa3+9hTdNdxzHgUMB8u7l8yaVDn+hr5R1TTkVV8ciwSMzB7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:11:22.381834Z"},"content_sha256":"eeac2c4e3fdb15e55095a600bbad7ac0c5325ce9eefc5d9dfd7fce06c6acca5d","schema_version":"1.0","event_id":"sha256:eeac2c4e3fdb15e55095a600bbad7ac0c5325ce9eefc5d9dfd7fce06c6acca5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TB2AE44TC73QXPEKIWJTB2KKCB/bundle.json","state_url":"https://pith.science/pith/TB2AE44TC73QXPEKIWJTB2KKCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TB2AE44TC73QXPEKIWJTB2KKCB/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-06-09T19:11:22Z","links":{"resolver":"https://pith.science/pith/TB2AE44TC73QXPEKIWJTB2KKCB","bundle":"https://pith.science/pith/TB2AE44TC73QXPEKIWJTB2KKCB/bundle.json","state":"https://pith.science/pith/TB2AE44TC73QXPEKIWJTB2KKCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TB2AE44TC73QXPEKIWJTB2KKCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TB2AE44TC73QXPEKIWJTB2KKCB","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":"5c06c41bdbaeccd45763983f5b387061d33d4f1f87304f2ac0336b9ed4dad1ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T12:54:16Z","title_canon_sha256":"929c9cb581ff57869fe79d94f94442417bd86c2b10531fac3c0cd1b3bbfbcf1f"},"schema_version":"1.0","source":{"id":"1601.06376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06376","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06376v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06376","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"TB2AE44TC73Q","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TB2AE44TC73QXPEK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TB2AE44T","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:eeac2c4e3fdb15e55095a600bbad7ac0c5325ce9eefc5d9dfd7fce06c6acca5d","target":"graph","created_at":"2026-05-18T01:22:04Z","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 studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we study the throughput maximization problem in a mobile relaying system via dynamic rate and power allocations at the source and relay. An optimization problem is formulated for a finite time horizon, subject to an information-causality constraint, which results from the data buffering employed at the relay. It is found that the optimal power allocations across th","authors_text":"Rui Zhang, Teng Joon Lim, Yong Zeng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T12:54:16Z","title":"Throughput Maximization for Mobile Relaying Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06376","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:179918f19c8e554a650b5e759d199525daac35fa13c43c572fd3ade9f3880ba7","target":"record","created_at":"2026-05-18T01:22:04Z","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":"5c06c41bdbaeccd45763983f5b387061d33d4f1f87304f2ac0336b9ed4dad1ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T12:54:16Z","title_canon_sha256":"929c9cb581ff57869fe79d94f94442417bd86c2b10531fac3c0cd1b3bbfbcf1f"},"schema_version":"1.0","source":{"id":"1601.06376","kind":"arxiv","version":1}},"canonical_sha256":"987402739317f70bbc8a459330e94a107e7bfac6a319ae56de113dc97209546d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"987402739317f70bbc8a459330e94a107e7bfac6a319ae56de113dc97209546d","first_computed_at":"2026-05-18T01:22:04.592602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:04.592602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZrM+zM2BE6XLHkFh/e0Di0ay32wfHDP6mIYaPUWl6SX7gOOgWZtwkdcivlmkl/ympG8NZu4IYbmvt6F8sUY5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:04.593046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:179918f19c8e554a650b5e759d199525daac35fa13c43c572fd3ade9f3880ba7","sha256:eeac2c4e3fdb15e55095a600bbad7ac0c5325ce9eefc5d9dfd7fce06c6acca5d"],"state_sha256":"f7d6df1b06363b0fe378fd20fe919f6f14417f21375676224dcf9c429631e7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TCPX2Rm6z4XcdQbN7cnN8YATsn00pkOqm2fbWibImhjevcP9edfF+fsSf8jHWvwrP+XWrUGtXN7Wm/IoWE2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:11:22.386032Z","bundle_sha256":"9e5497e2c4fcd710e5285b0f153ee568fa19b2a3d3257c3361e0c234b8ed595a"}}