{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4UNXJZNPS5ASICROZPF5STJRDD","short_pith_number":"pith:4UNXJZNP","schema_version":"1.0","canonical_sha256":"e51b74e5af9741240a2ecbcbd94d3118c02ea7eed38fc2998e9978b17f9bcf6a","source":{"kind":"arxiv","id":"1201.0081","version":1},"attestation_state":"computed","paper":{"title":"Resource Allocation with Subcarrier Pairing in OFDMA Two-Way Relay Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Zhang, Meixia Tao, Yuan Liu","submitted_at":"2011-12-30T08:49:17Z","abstract_excerpt":"This study considers an orthogonal frequency-division multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with a common base station (BS) via multiple relay stations (RSs). We study the joint optimization problem of subcarrier-pairing based relay-power allocation, relay selection, and subcarrier assignment. The problem is formulated as a mixed integer programming problem. By using the dual method, we propose an efficient algorithm to solve the problem in an asymptotically optimal manner. Simulation results show that the proposed metho"},"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":"1201.0081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-12-30T08:49:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe119529220ef900949392db41e2286c9b135144e0ddae6cefb2ae61e2299a50","abstract_canon_sha256":"b408a6d5b2e648b9c2598dae126dcdb2504abcee9b0d9887e525c56f10cbe28f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:26.296238Z","signature_b64":"S4e+JRHe3Ht0EGQwqRVjg9zrjzPyAJn+GOSnGG+tk22X2tzOP81eS3SnUP4TPqillw3qxCdd2VJ8SvYrtXezBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e51b74e5af9741240a2ecbcbd94d3118c02ea7eed38fc2998e9978b17f9bcf6a","last_reissued_at":"2026-05-18T04:05:26.295644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:26.295644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation with Subcarrier Pairing in OFDMA Two-Way Relay Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Zhang, Meixia Tao, Yuan Liu","submitted_at":"2011-12-30T08:49:17Z","abstract_excerpt":"This study considers an orthogonal frequency-division multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with a common base station (BS) via multiple relay stations (RSs). We study the joint optimization problem of subcarrier-pairing based relay-power allocation, relay selection, and subcarrier assignment. The problem is formulated as a mixed integer programming problem. By using the dual method, we propose an efficient algorithm to solve the problem in an asymptotically optimal manner. Simulation results show that the proposed metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0081","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.0081","created_at":"2026-05-18T04:05:26.295743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0081v1","created_at":"2026-05-18T04:05:26.295743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0081","created_at":"2026-05-18T04:05:26.295743+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UNXJZNPS5AS","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UNXJZNPS5ASICRO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UNXJZNP","created_at":"2026-05-18T12:26:20.644004+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/4UNXJZNPS5ASICROZPF5STJRDD","json":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD.json","graph_json":"https://pith.science/api/pith-number/4UNXJZNPS5ASICROZPF5STJRDD/graph.json","events_json":"https://pith.science/api/pith-number/4UNXJZNPS5ASICROZPF5STJRDD/events.json","paper":"https://pith.science/paper/4UNXJZNP"},"agent_actions":{"view_html":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD","download_json":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD.json","view_paper":"https://pith.science/paper/4UNXJZNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0081&json=true","fetch_graph":"https://pith.science/api/pith-number/4UNXJZNPS5ASICROZPF5STJRDD/graph.json","fetch_events":"https://pith.science/api/pith-number/4UNXJZNPS5ASICROZPF5STJRDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD/action/storage_attestation","attest_author":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD/action/author_attestation","sign_citation":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD/action/citation_signature","submit_replication":"https://pith.science/pith/4UNXJZNPS5ASICROZPF5STJRDD/action/replication_record"}},"created_at":"2026-05-18T04:05:26.295743+00:00","updated_at":"2026-05-18T04:05:26.295743+00:00"}