{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:26PZZCAHL5EPKNQR5A2USHPZWQ","short_pith_number":"pith:26PZZCAH","schema_version":"1.0","canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","source":{"kind":"arxiv","id":"1104.5553","version":3},"attestation_state":"computed","paper":{"title":"Resource Allocation for Selection-Based Cooperative OFDM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kianoush Hosseini, Raviraj S. Adve","submitted_at":"2011-04-29T06:11:47Z","abstract_excerpt":"This paper considers resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of transmission strategy selection, relay assignment, and power allocation is a combinatorial problem with exponential complexity. To develop effective solutions to these questions, we approach these problems in two stages. The first set of problems assume ideal source-relay channels; this simplification helps illustrate our general methodology and also why our solutio"},"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":"1104.5553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7f8d2c5a092e2d9cf693c8375cb4fb6a865c2e5ac90bbadb2dd1655801f6a98","abstract_canon_sha256":"3d60e4778d7cd33edf9c20bfe66d1d1c66085a59af0f8995ecd246971b896372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:33.203457Z","signature_b64":"LM+UHmt76lQ6D58BHNVjq5kADcLPUnTmSWBube5Ct4M6TlLbROVDrt89S7lPLd3Q2zpiy+h2f0QzAnnSSb3YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","last_reissued_at":"2026-05-18T04:06:33.202676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:33.202676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation for Selection-Based Cooperative OFDM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kianoush Hosseini, Raviraj S. Adve","submitted_at":"2011-04-29T06:11:47Z","abstract_excerpt":"This paper considers resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of transmission strategy selection, relay assignment, and power allocation is a combinatorial problem with exponential complexity. To develop effective solutions to these questions, we approach these problems in two stages. The first set of problems assume ideal source-relay channels; this simplification helps illustrate our general methodology and also why our solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5553","kind":"arxiv","version":3},"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":"1104.5553","created_at":"2026-05-18T04:06:33.202810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5553v3","created_at":"2026-05-18T04:06:33.202810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5553","created_at":"2026-05-18T04:06:33.202810+00:00"},{"alias_kind":"pith_short_12","alias_value":"26PZZCAHL5EP","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"26PZZCAHL5EPKNQR","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"26PZZCAH","created_at":"2026-05-18T12:26:18.847500+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/26PZZCAHL5EPKNQR5A2USHPZWQ","json":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ.json","graph_json":"https://pith.science/api/pith-number/26PZZCAHL5EPKNQR5A2USHPZWQ/graph.json","events_json":"https://pith.science/api/pith-number/26PZZCAHL5EPKNQR5A2USHPZWQ/events.json","paper":"https://pith.science/paper/26PZZCAH"},"agent_actions":{"view_html":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ","download_json":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ.json","view_paper":"https://pith.science/paper/26PZZCAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5553&json=true","fetch_graph":"https://pith.science/api/pith-number/26PZZCAHL5EPKNQR5A2USHPZWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/26PZZCAHL5EPKNQR5A2USHPZWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/action/storage_attestation","attest_author":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/action/author_attestation","sign_citation":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/action/citation_signature","submit_replication":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/action/replication_record"}},"created_at":"2026-05-18T04:06:33.202810+00:00","updated_at":"2026-05-18T04:06:33.202810+00:00"}