{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:FYDDMLYTM7GVWSX5RLK4B5P4VY","short_pith_number":"pith:FYDDMLYT","schema_version":"1.0","canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","source":{"kind":"arxiv","id":"0808.0745","version":5},"attestation_state":"computed","paper":{"title":"Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Caleb K. Lo, John J. Hasenbein, Robert W. Heath Jr, Sriram Vishwanath","submitted_at":"2008-08-05T23:53:26Z","abstract_excerpt":"This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with"},"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":"0808.0745","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-05T23:53:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5c4b2aaf0feeaca603e94e7680b04195dad6a4c96c98e0522cc41697b646196","abstract_canon_sha256":"980aa1175356c0ba502a2202ca7c48574e95df4e2410ab9e9d3b67ce8a31b9b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.478923Z","signature_b64":"Cr1s+4nFAgwiWzkPqXa5lp34iFrovc5YGR0UbyNpLx5idUZDHi6zoqwfvLx5e/WWUgyHL/jLgPL6UMDyjGX6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","last_reissued_at":"2026-05-18T00:58:25.478232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.478232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Caleb K. Lo, John J. Hasenbein, Robert W. Heath Jr, Sriram Vishwanath","submitted_at":"2008-08-05T23:53:26Z","abstract_excerpt":"This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0745","kind":"arxiv","version":5},"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":"0808.0745","created_at":"2026-05-18T00:58:25.478331+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.0745v5","created_at":"2026-05-18T00:58:25.478331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0745","created_at":"2026-05-18T00:58:25.478331+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYDDMLYTM7GV","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYDDMLYTM7GVWSX5","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYDDMLYT","created_at":"2026-05-18T12:25:57.157939+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/FYDDMLYTM7GVWSX5RLK4B5P4VY","json":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY.json","graph_json":"https://pith.science/api/pith-number/FYDDMLYTM7GVWSX5RLK4B5P4VY/graph.json","events_json":"https://pith.science/api/pith-number/FYDDMLYTM7GVWSX5RLK4B5P4VY/events.json","paper":"https://pith.science/paper/FYDDMLYT"},"agent_actions":{"view_html":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY","download_json":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY.json","view_paper":"https://pith.science/paper/FYDDMLYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.0745&json=true","fetch_graph":"https://pith.science/api/pith-number/FYDDMLYTM7GVWSX5RLK4B5P4VY/graph.json","fetch_events":"https://pith.science/api/pith-number/FYDDMLYTM7GVWSX5RLK4B5P4VY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/action/storage_attestation","attest_author":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/action/author_attestation","sign_citation":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/action/citation_signature","submit_replication":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/action/replication_record"}},"created_at":"2026-05-18T00:58:25.478331+00:00","updated_at":"2026-05-18T00:58:25.478331+00:00"}