{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6R3XIUII4IJLHQ7M5PJCD2QVIK","short_pith_number":"pith:6R3XIUII","schema_version":"1.0","canonical_sha256":"f477745108e212b3c3ecebd221ea15428e907ea064806e9593323dc6c6a93d64","source":{"kind":"arxiv","id":"1207.2807","version":2},"attestation_state":"computed","paper":{"title":"Practical Power Allocation and Greedy Partner Selection for Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Hadi Goudarzi, Mohammad Reza Pakravan","submitted_at":"2012-07-11T22:46:13Z","abstract_excerpt":"In this paper, we present a novel algorithm for power allocation in the Amplify-and-Forward cooperative communication that minimizes the outage probability with a given value of total power. We present the problem with new formulation and solve the optimal power allocation for a fixed set of partners. The proposed solution provides a direct power allocation scheme with a simple formula that can be also be represented by a simple lookup table which makes it easy for practical implementation. We present simulation results to demonstrate that the performances of the proposed algorithms are very c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.2807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-11T22:46:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"06ebaeaf0c6a4743c16446ddd5c3bb1e2758a03f25d0cde4d8ed684de5b3de4c","abstract_canon_sha256":"b3e589d6a9ea800227a38b85ffa86348a5da83974515ef0f645f892e1a7d782d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.224498Z","signature_b64":"3rQVOxE9fa9VNv4FnnwFPszJdMR1KPkKoaM9EyMHjFttpwd/FgcaQnhs5A3UQzBf15uoqeCWGxz2Pgh/IUecBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f477745108e212b3c3ecebd221ea15428e907ea064806e9593323dc6c6a93d64","last_reissued_at":"2026-05-18T03:50:35.223796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.223796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Power Allocation and Greedy Partner Selection for Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Hadi Goudarzi, Mohammad Reza Pakravan","submitted_at":"2012-07-11T22:46:13Z","abstract_excerpt":"In this paper, we present a novel algorithm for power allocation in the Amplify-and-Forward cooperative communication that minimizes the outage probability with a given value of total power. We present the problem with new formulation and solve the optimal power allocation for a fixed set of partners. The proposed solution provides a direct power allocation scheme with a simple formula that can be also be represented by a simple lookup table which makes it easy for practical implementation. We present simulation results to demonstrate that the performances of the proposed algorithms are very c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2807","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.2807","created_at":"2026-05-18T03:50:35.223907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2807v2","created_at":"2026-05-18T03:50:35.223907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2807","created_at":"2026-05-18T03:50:35.223907+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R3XIUII4IJL","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R3XIUII4IJLHQ7M","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R3XIUII","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK","json":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK.json","graph_json":"https://pith.science/api/pith-number/6R3XIUII4IJLHQ7M5PJCD2QVIK/graph.json","events_json":"https://pith.science/api/pith-number/6R3XIUII4IJLHQ7M5PJCD2QVIK/events.json","paper":"https://pith.science/paper/6R3XIUII"},"agent_actions":{"view_html":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK","download_json":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK.json","view_paper":"https://pith.science/paper/6R3XIUII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2807&json=true","fetch_graph":"https://pith.science/api/pith-number/6R3XIUII4IJLHQ7M5PJCD2QVIK/graph.json","fetch_events":"https://pith.science/api/pith-number/6R3XIUII4IJLHQ7M5PJCD2QVIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK/action/storage_attestation","attest_author":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK/action/author_attestation","sign_citation":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK/action/citation_signature","submit_replication":"https://pith.science/pith/6R3XIUII4IJLHQ7M5PJCD2QVIK/action/replication_record"}},"created_at":"2026-05-18T03:50:35.223907+00:00","updated_at":"2026-05-18T03:50:35.223907+00:00"}