{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HP4JGCBNAMDD6MNZPZ5TNSLTNL","short_pith_number":"pith:HP4JGCBN","schema_version":"1.0","canonical_sha256":"3bf893082d03063f31b97e7b36c9736adb76e796b0c2585fce9142bd05896622","source":{"kind":"arxiv","id":"1201.0320","version":2},"attestation_state":"computed","paper":{"title":"Optimal Distributed Resource Allocation for Decode-and-Forward Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ness B. Shroff, Shidong Zhou, Xiaofeng Zhong, Yin Sun, Yuanzhang Xiao, Zhoujia Mao","submitted_at":"2012-01-01T03:08:30Z","abstract_excerpt":"This paper presents a distributed resource allocation algorithm to jointly optimize the power allocation, channel allocation and relay selection for decode-and-forward (DF) relay networks with a large number of sources, relays, and destinations. The well-known dual decomposition technique cannot directly be applied to resolve this problem, because the achievable data rate of DF relaying is not strictly concave, and thus the local resource allocation subproblem may have non-unique solutions. We resolve this non-strict concavity problem by using the idea of the proximal point method, which adds "},"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.0320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-01T03:08:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e60214a0b1a8ad3fed39a493ede7d34caed3a17c6e2dbf574c031a08979f3ba","abstract_canon_sha256":"4555defbd3dee65a5578dd94a18e9df3f443bfb1f4c7bb9f2900c914519ba8c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.804078Z","signature_b64":"xtLUoYsbC65WsEahhX747eOhPiGL5tIf7pSzX3xE5eJHapktg8FLv8LBrynJDRGmyR9vuFZSiK5O+A/tgQN5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf893082d03063f31b97e7b36c9736adb76e796b0c2585fce9142bd05896622","last_reissued_at":"2026-05-18T02:21:26.803400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.803400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Distributed Resource Allocation for Decode-and-Forward Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ness B. Shroff, Shidong Zhou, Xiaofeng Zhong, Yin Sun, Yuanzhang Xiao, Zhoujia Mao","submitted_at":"2012-01-01T03:08:30Z","abstract_excerpt":"This paper presents a distributed resource allocation algorithm to jointly optimize the power allocation, channel allocation and relay selection for decode-and-forward (DF) relay networks with a large number of sources, relays, and destinations. The well-known dual decomposition technique cannot directly be applied to resolve this problem, because the achievable data rate of DF relaying is not strictly concave, and thus the local resource allocation subproblem may have non-unique solutions. We resolve this non-strict concavity problem by using the idea of the proximal point method, which adds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0320","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":"1201.0320","created_at":"2026-05-18T02:21:26.803520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0320v2","created_at":"2026-05-18T02:21:26.803520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0320","created_at":"2026-05-18T02:21:26.803520+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP4JGCBNAMDD","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP4JGCBNAMDD6MNZ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP4JGCBN","created_at":"2026-05-18T12:27:09.501522+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/HP4JGCBNAMDD6MNZPZ5TNSLTNL","json":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL.json","graph_json":"https://pith.science/api/pith-number/HP4JGCBNAMDD6MNZPZ5TNSLTNL/graph.json","events_json":"https://pith.science/api/pith-number/HP4JGCBNAMDD6MNZPZ5TNSLTNL/events.json","paper":"https://pith.science/paper/HP4JGCBN"},"agent_actions":{"view_html":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL","download_json":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL.json","view_paper":"https://pith.science/paper/HP4JGCBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0320&json=true","fetch_graph":"https://pith.science/api/pith-number/HP4JGCBNAMDD6MNZPZ5TNSLTNL/graph.json","fetch_events":"https://pith.science/api/pith-number/HP4JGCBNAMDD6MNZPZ5TNSLTNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL/action/storage_attestation","attest_author":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL/action/author_attestation","sign_citation":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL/action/citation_signature","submit_replication":"https://pith.science/pith/HP4JGCBNAMDD6MNZPZ5TNSLTNL/action/replication_record"}},"created_at":"2026-05-18T02:21:26.803520+00:00","updated_at":"2026-05-18T02:21:26.803520+00:00"}