{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:FYDDMLYTM7GVWSX5RLK4B5P4VY","short_pith_number":"pith:FYDDMLYT","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"},"canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","source":{"kind":"arxiv","id":"0808.0745","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0745","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0745v5","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0745","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"FYDDMLYTM7GV","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"FYDDMLYTM7GVWSX5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"FYDDMLYT","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:FYDDMLYTM7GVWSX5RLK4B5P4VY","target":"record","payload":{"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"},"canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","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"},"source_kind":"arxiv","source_id":"0808.0745","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xF8gU3EClbEkq3i7fndiBHwXXNNYuyrMSSREOBFRlM3Sdm4WDDujwXlqn9fmJ58pzm3uiSJspoWaG0ReE+uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:55.118538Z"},"content_sha256":"876d54d9ee04185ab5ee2d8f42be79054ddaeffa5ab06e7d2086737402f424d9","schema_version":"1.0","event_id":"sha256:876d54d9ee04185ab5ee2d8f42be79054ddaeffa5ab06e7d2086737402f424d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:FYDDMLYTM7GVWSX5RLK4B5P4VY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bi+d7kzRS2N3ZiS6PPbMnW9NChv2B5TES+XgN7XZ+ItYPI9F89awD822Ylb3Bl2rcaJBqGXMDe8m979Cwdi4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:55.119080Z"},"content_sha256":"23bce37f9ac45db0ebd5491313bb5dff33ecf5c648e33e385d3964157840c7df","schema_version":"1.0","event_id":"sha256:23bce37f9ac45db0ebd5491313bb5dff33ecf5c648e33e385d3964157840c7df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/bundle.json","state_url":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T01:24:55Z","links":{"resolver":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY","bundle":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/bundle.json","state":"https://pith.science/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYDDMLYTM7GVWSX5RLK4B5P4VY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:FYDDMLYTM7GVWSX5RLK4B5P4VY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"980aa1175356c0ba502a2202ca7c48574e95df4e2410ab9e9d3b67ce8a31b9b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-05T23:53:26Z","title_canon_sha256":"f5c4b2aaf0feeaca603e94e7680b04195dad6a4c96c98e0522cc41697b646196"},"schema_version":"1.0","source":{"id":"0808.0745","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0745","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0745v5","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0745","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"FYDDMLYTM7GV","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"FYDDMLYTM7GVWSX5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"FYDDMLYT","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:23bce37f9ac45db0ebd5491313bb5dff33ecf5c648e33e385d3964157840c7df","target":"graph","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Caleb K. Lo, John J. Hasenbein, Robert W. Heath Jr, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-05T23:53:26Z","title":"Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0745","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:876d54d9ee04185ab5ee2d8f42be79054ddaeffa5ab06e7d2086737402f424d9","target":"record","created_at":"2026-05-18T00:58:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"980aa1175356c0ba502a2202ca7c48574e95df4e2410ab9e9d3b67ce8a31b9b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-05T23:53:26Z","title_canon_sha256":"f5c4b2aaf0feeaca603e94e7680b04195dad6a4c96c98e0522cc41697b646196"},"schema_version":"1.0","source":{"id":"0808.0745","kind":"arxiv","version":5}},"canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e06362f1367cd5b4afd8ad5c0f5fcae20e3aaffe137b6ef0de8daf040967ad1","first_computed_at":"2026-05-18T00:58:25.478232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.478232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cr1s+4nFAgwiWzkPqXa5lp34iFrovc5YGR0UbyNpLx5idUZDHi6zoqwfvLx5e/WWUgyHL/jLgPL6UMDyjGX6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.478923Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.0745","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876d54d9ee04185ab5ee2d8f42be79054ddaeffa5ab06e7d2086737402f424d9","sha256:23bce37f9ac45db0ebd5491313bb5dff33ecf5c648e33e385d3964157840c7df"],"state_sha256":"1b8f481f152e32df7a47adb1130b983d98d2245a4eb3937edf9a9cc916673fa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RZLSCr7Dcry2I80CJ2gR6fx6Zbx/m4uJMPWvwq4izFFbdQ0CbPyY0xsQHxzILKsZwnBz/hO+yQheUmRnbRmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:24:55.121770Z","bundle_sha256":"05f1b38a23e531aa9618b16cf5929aeed334ccb96864090e87bcb53c69c441f3"}}