{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TYACQND6JNORT7SUM7DBFAMYRJ","short_pith_number":"pith:TYACQND6","canonical_record":{"source":{"id":"1608.07307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-25T20:40:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52bcf88c40a921629c94b9112a31285922b92c1f9432bd1801fc5d22a4c5dd01","abstract_canon_sha256":"c3248fba420f329572fe56c40d5d1b8c1d0935498e798bb0f6a19cadf833e89e"},"schema_version":"1.0"},"canonical_sha256":"9e0028347e4b5d19fe5467c61281988a49b21881ceddc79b002e30a8ac737548","source":{"kind":"arxiv","id":"1608.07307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07307","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07307v1","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07307","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"TYACQND6JNOR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYACQND6JNORT7SU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYACQND6","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TYACQND6JNORT7SUM7DBFAMYRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-25T20:40:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52bcf88c40a921629c94b9112a31285922b92c1f9432bd1801fc5d22a4c5dd01","abstract_canon_sha256":"c3248fba420f329572fe56c40d5d1b8c1d0935498e798bb0f6a19cadf833e89e"},"schema_version":"1.0"},"canonical_sha256":"9e0028347e4b5d19fe5467c61281988a49b21881ceddc79b002e30a8ac737548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.589929Z","signature_b64":"6tUcwncuVA7oFSQsVyuLuVAEhsykZT1KNwprqopEbE8lWZ25jDrv9E1H5b438KSbIXUBQ8gHZJhKnyO1IiEzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0028347e4b5d19fe5467c61281988a49b21881ceddc79b002e30a8ac737548","last_reissued_at":"2026-05-17T23:43:33.589496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.589496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07307","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgCGBjj2aN54HX1U7XV3ZJiLcgtujoFREIt38rWLAaUz7yIWx0RXpjiPJEcD+BjTYKtVkMHAPf22RGBusy0zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:54:32.643957Z"},"content_sha256":"ff5359cbbde08a24735dc65d25afc400679f60b1ebc4e84ec2c73d2bf919beac","schema_version":"1.0","event_id":"sha256:ff5359cbbde08a24735dc65d25afc400679f60b1ebc4e84ec2c73d2bf919beac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TYACQND6JNORT7SUM7DBFAMYRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Power Allocation Schemes in Regenerative Multi-user Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Chakrapani, Jinhong Yuan, Robert Malaney","submitted_at":"2016-08-25T20:40:46Z","abstract_excerpt":"In relay assisted wireless communications, the multi-source, single relay and single destination system (an $M$-1-1 system) is of growing importance, due to the increased demand for higher network throughput and connectivity. Previously, power allocation in $M$-1-1 systems have assumed availability of instantaneous channel state information (CSI), which is rather idealistic. In this paper we consider an $M$-1-1 Decode-and-Forward (DF), Full-Duplex, orthogonal frequencey division multiple access (OFDMA) based relay system with statistical-CSI and analyze the achievable rate $R$ of such a system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07307","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6UBxlFyFt1Ul12pHEB1GQNmY66/awo7LvpxnqF0nx7YPdcLWyOaAXJiDDG+owZ2g53k9Qs/fVCcyLWFMCpwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:54:32.644714Z"},"content_sha256":"85cfd1b4392e492b3dd343cfc8ccb3e75712490213f904b000e1c170e0cb858b","schema_version":"1.0","event_id":"sha256:85cfd1b4392e492b3dd343cfc8ccb3e75712490213f904b000e1c170e0cb858b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYACQND6JNORT7SUM7DBFAMYRJ/bundle.json","state_url":"https://pith.science/pith/TYACQND6JNORT7SUM7DBFAMYRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYACQND6JNORT7SUM7DBFAMYRJ/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-09T01:54:32Z","links":{"resolver":"https://pith.science/pith/TYACQND6JNORT7SUM7DBFAMYRJ","bundle":"https://pith.science/pith/TYACQND6JNORT7SUM7DBFAMYRJ/bundle.json","state":"https://pith.science/pith/TYACQND6JNORT7SUM7DBFAMYRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYACQND6JNORT7SUM7DBFAMYRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TYACQND6JNORT7SUM7DBFAMYRJ","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":"c3248fba420f329572fe56c40d5d1b8c1d0935498e798bb0f6a19cadf833e89e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-25T20:40:46Z","title_canon_sha256":"52bcf88c40a921629c94b9112a31285922b92c1f9432bd1801fc5d22a4c5dd01"},"schema_version":"1.0","source":{"id":"1608.07307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07307","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07307v1","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07307","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"TYACQND6JNOR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYACQND6JNORT7SU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYACQND6","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:85cfd1b4392e492b3dd343cfc8ccb3e75712490213f904b000e1c170e0cb858b","target":"graph","created_at":"2026-05-17T23:43:33Z","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 relay assisted wireless communications, the multi-source, single relay and single destination system (an $M$-1-1 system) is of growing importance, due to the increased demand for higher network throughput and connectivity. Previously, power allocation in $M$-1-1 systems have assumed availability of instantaneous channel state information (CSI), which is rather idealistic. In this paper we consider an $M$-1-1 Decode-and-Forward (DF), Full-Duplex, orthogonal frequencey division multiple access (OFDMA) based relay system with statistical-CSI and analyze the achievable rate $R$ of such a system","authors_text":"Arvind Chakrapani, Jinhong Yuan, Robert Malaney","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-25T20:40:46Z","title":"Low Complexity Power Allocation Schemes in Regenerative Multi-user Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07307","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:ff5359cbbde08a24735dc65d25afc400679f60b1ebc4e84ec2c73d2bf919beac","target":"record","created_at":"2026-05-17T23:43:33Z","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":"c3248fba420f329572fe56c40d5d1b8c1d0935498e798bb0f6a19cadf833e89e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-25T20:40:46Z","title_canon_sha256":"52bcf88c40a921629c94b9112a31285922b92c1f9432bd1801fc5d22a4c5dd01"},"schema_version":"1.0","source":{"id":"1608.07307","kind":"arxiv","version":1}},"canonical_sha256":"9e0028347e4b5d19fe5467c61281988a49b21881ceddc79b002e30a8ac737548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e0028347e4b5d19fe5467c61281988a49b21881ceddc79b002e30a8ac737548","first_computed_at":"2026-05-17T23:43:33.589496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.589496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6tUcwncuVA7oFSQsVyuLuVAEhsykZT1KNwprqopEbE8lWZ25jDrv9E1H5b438KSbIXUBQ8gHZJhKnyO1IiEzDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.589929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff5359cbbde08a24735dc65d25afc400679f60b1ebc4e84ec2c73d2bf919beac","sha256:85cfd1b4392e492b3dd343cfc8ccb3e75712490213f904b000e1c170e0cb858b"],"state_sha256":"ff86b07ae17086ee4cfc97f72f25aa29309d89e4edb6f858b7397073d64ba340"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kH3zkchhOqA1xj1/S3MDnzo8qYJE2QvwcLWaQhxZ6p9zCRz78mAGBt7MPGAxTn56nkS+AjplZw9rL9z9i3JgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:54:32.648945Z","bundle_sha256":"6081cd0428d1c8e5731b90ade7c55df607d4d876368fa434d980b743b7e96a94"}}