{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BEI3CCDQJ36KSVOHKB6467NTVW","short_pith_number":"pith:BEI3CCDQ","canonical_record":{"source":{"id":"1006.5066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-25T20:42:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d88562af53267b848c054f0fa006ea3a766e98388080a6117691d65f3b5e56d9","abstract_canon_sha256":"c43f20632a9751d4ad805c6f7987e6abbc5ac552fb166245ebf675a71baabe68"},"schema_version":"1.0"},"canonical_sha256":"0911b108704efca955c7507dcf7db3adb8ef8f1a7f0eed6ef8d6026067b134b7","source":{"kind":"arxiv","id":"1006.5066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.5066","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1006.5066v1","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5066","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"BEI3CCDQJ36K","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BEI3CCDQJ36KSVOH","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BEI3CCDQ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BEI3CCDQJ36KSVOHKB6467NTVW","target":"record","payload":{"canonical_record":{"source":{"id":"1006.5066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-25T20:42:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d88562af53267b848c054f0fa006ea3a766e98388080a6117691d65f3b5e56d9","abstract_canon_sha256":"c43f20632a9751d4ad805c6f7987e6abbc5ac552fb166245ebf675a71baabe68"},"schema_version":"1.0"},"canonical_sha256":"0911b108704efca955c7507dcf7db3adb8ef8f1a7f0eed6ef8d6026067b134b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:14.437971Z","signature_b64":"OMVhv06yh3Z9rwy8bCxNv2EMy2fbucK0NniqpC5WSoNie6Rbs6416+rCUcAsCTr2Bx4Mb18i7VoRao+hqas6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0911b108704efca955c7507dcf7db3adb8ef8f1a7f0eed6ef8d6026067b134b7","last_reissued_at":"2026-05-18T03:33:14.437215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:14.437215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.5066","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-18T03:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbedH0fW5B2rWjjwlZ1GqwkNFRCU59zJ08lHEffG2LcU3XZmAbPdlsmMDofaxn1Bk7PrG9tZamvPEHV03XT5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:56:50.781888Z"},"content_sha256":"2ab1ae6a605b7b82a389a4c4f88a9b97ddff8b1d56e2b19e8f8bf7c614ddf413","schema_version":"1.0","event_id":"sha256:2ab1ae6a605b7b82a389a4c4f88a9b97ddff8b1d56e2b19e8f8bf7c614ddf413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BEI3CCDQJ36KSVOHKB6467NTVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masoud Ardakani, Sergiy A. Vorobyov, Youngwook Ko","submitted_at":"2010-06-25T20:42:06Z","abstract_excerpt":"We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed via N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity under individual power constraints at the source and/or the relay. Depending on the availability of the channel state information a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5066","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-18T03:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iyu/vvDfm/qY2Pa9GOb6yF+oVv8YZHaZOefTa1Ex5mlkHUNDob+HyCxAZHa3hUq7o+vG9E5alfCrmrLEhRw6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:56:50.782563Z"},"content_sha256":"37b8323f5b93ab6cdb94afa237556359b8eb63039ea50ad394d20df79d9fd8ed","schema_version":"1.0","event_id":"sha256:37b8323f5b93ab6cdb94afa237556359b8eb63039ea50ad394d20df79d9fd8ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEI3CCDQJ36KSVOHKB6467NTVW/bundle.json","state_url":"https://pith.science/pith/BEI3CCDQJ36KSVOHKB6467NTVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEI3CCDQJ36KSVOHKB6467NTVW/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-26T07:56:50Z","links":{"resolver":"https://pith.science/pith/BEI3CCDQJ36KSVOHKB6467NTVW","bundle":"https://pith.science/pith/BEI3CCDQJ36KSVOHKB6467NTVW/bundle.json","state":"https://pith.science/pith/BEI3CCDQJ36KSVOHKB6467NTVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEI3CCDQJ36KSVOHKB6467NTVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BEI3CCDQJ36KSVOHKB6467NTVW","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":"c43f20632a9751d4ad805c6f7987e6abbc5ac552fb166245ebf675a71baabe68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-25T20:42:06Z","title_canon_sha256":"d88562af53267b848c054f0fa006ea3a766e98388080a6117691d65f3b5e56d9"},"schema_version":"1.0","source":{"id":"1006.5066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.5066","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1006.5066v1","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5066","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"BEI3CCDQJ36K","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BEI3CCDQJ36KSVOH","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BEI3CCDQ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:37b8323f5b93ab6cdb94afa237556359b8eb63039ea50ad394d20df79d9fd8ed","target":"graph","created_at":"2026-05-18T03:33: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":"We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed via N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity under individual power constraints at the source and/or the relay. Depending on the availability of the channel state information a","authors_text":"Masoud Ardakani, Sergiy A. Vorobyov, Youngwook Ko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-25T20:42:06Z","title":"Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5066","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:2ab1ae6a605b7b82a389a4c4f88a9b97ddff8b1d56e2b19e8f8bf7c614ddf413","target":"record","created_at":"2026-05-18T03:33: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":"c43f20632a9751d4ad805c6f7987e6abbc5ac552fb166245ebf675a71baabe68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-25T20:42:06Z","title_canon_sha256":"d88562af53267b848c054f0fa006ea3a766e98388080a6117691d65f3b5e56d9"},"schema_version":"1.0","source":{"id":"1006.5066","kind":"arxiv","version":1}},"canonical_sha256":"0911b108704efca955c7507dcf7db3adb8ef8f1a7f0eed6ef8d6026067b134b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0911b108704efca955c7507dcf7db3adb8ef8f1a7f0eed6ef8d6026067b134b7","first_computed_at":"2026-05-18T03:33:14.437215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:14.437215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OMVhv06yh3Z9rwy8bCxNv2EMy2fbucK0NniqpC5WSoNie6Rbs6416+rCUcAsCTr2Bx4Mb18i7VoRao+hqas6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:14.437971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.5066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ab1ae6a605b7b82a389a4c4f88a9b97ddff8b1d56e2b19e8f8bf7c614ddf413","sha256:37b8323f5b93ab6cdb94afa237556359b8eb63039ea50ad394d20df79d9fd8ed"],"state_sha256":"044d3b9384b137b871d8eeaf7d95d787525f330739f5974416f2568bc0eb853d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ao0VBTJxWmdyMm7X+fZXTr+dmujj0rPtmXuDF7DcLo04JoKxWsA/lm+5ak/gR5Pa+fGG6smQSeoYrp9Pi4VfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:56:50.786642Z","bundle_sha256":"e34acab8ebb9ee44b2ac1feca82933ec0c9b20c8e9c8ee621a347aa161b45de8"}}