{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EZNRMDKHEAV4VXJYTMTNNV5EK5","short_pith_number":"pith:EZNRMDKH","canonical_record":{"source":{"id":"1010.0287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-02T03:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"f823aeb8e9463a18d2d3a6bf0fd595e20cfd56c961e9c4b500b161b3bc856f46","abstract_canon_sha256":"e359871520ce4042d6f09c6cb821c98e6190d076e08c93e16cef05e09dd61662"},"schema_version":"1.0"},"canonical_sha256":"265b160d47202bcadd389b26d6d7a45774d4e57d66663e403628458bf2cee88d","source":{"kind":"arxiv","id":"1010.0287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0287","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0287v1","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0287","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"EZNRMDKHEAV4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZNRMDKHEAV4VXJY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZNRMDKH","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EZNRMDKHEAV4VXJYTMTNNV5EK5","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-02T03:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"f823aeb8e9463a18d2d3a6bf0fd595e20cfd56c961e9c4b500b161b3bc856f46","abstract_canon_sha256":"e359871520ce4042d6f09c6cb821c98e6190d076e08c93e16cef05e09dd61662"},"schema_version":"1.0"},"canonical_sha256":"265b160d47202bcadd389b26d6d7a45774d4e57d66663e403628458bf2cee88d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:12.427231Z","signature_b64":"VN7KOV1XsF52iniAcPtRWK223x2s6B6zZku0XE/KzBzLTh+1pkB0eDmIDMU2W7Jo0s6Zt8W/3oqemyWKLb10Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265b160d47202bcadd389b26d6d7a45774d4e57d66663e403628458bf2cee88d","last_reissued_at":"2026-05-18T02:05:12.426446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:12.426446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0287","source_version":1,"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-18T02:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhKt5ynyr+rItCHIirfdjdzC/C+826TVLx7T9yueRb94zDqXgKH0X1hyrAO4V5v8AfXpXJpP/PqzdpTR/c4zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:15:57.932330Z"},"content_sha256":"c9e8b232ca9033e6fc42002482ed6b98d4b1e5d305030a479177861d98e008cb","schema_version":"1.0","event_id":"sha256:c9e8b232ca9033e6fc42002482ed6b98d4b1e5d305030a479177861d98e008cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EZNRMDKHEAV4VXJYTMTNNV5EK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rui Wang, Vincent K. N. Lau, Ying Cui","submitted_at":"2010-10-02T03:57:46Z","abstract_excerpt":"In this paper, we consider a queue-aware distributive resource control algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay buffering is an effective way to reduce the intrinsic half-duplex penalty in cooperative systems. The complex interactions of the queues at the source node and the relays are modeled as an average-cost infinite horizon Markov Decision Process (MDP). The traditional approach solving this MDP problem involves centralized control with huge complexity. To obtain a distributive and low complexity solution, we introduce a linear structure which approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0287","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"},"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-18T02:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0/wv3IzCWiQcmczJ5Mdh6IykA7RjgE952EOEs8gHK3NcJJf+24/1KNElNnsPydGgOzxpXoVV2bUsouUjxVABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:15:57.932998Z"},"content_sha256":"285e5ba9cff61fa005eccc6be464f69913eb2ceb698bc8380c842065ca72acda","schema_version":"1.0","event_id":"sha256:285e5ba9cff61fa005eccc6be464f69913eb2ceb698bc8380c842065ca72acda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/bundle.json","state_url":"https://pith.science/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/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-05T18:15:57Z","links":{"resolver":"https://pith.science/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5","bundle":"https://pith.science/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/bundle.json","state":"https://pith.science/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZNRMDKHEAV4VXJYTMTNNV5EK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EZNRMDKHEAV4VXJYTMTNNV5EK5","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":"e359871520ce4042d6f09c6cb821c98e6190d076e08c93e16cef05e09dd61662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-02T03:57:46Z","title_canon_sha256":"f823aeb8e9463a18d2d3a6bf0fd595e20cfd56c961e9c4b500b161b3bc856f46"},"schema_version":"1.0","source":{"id":"1010.0287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0287","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0287v1","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0287","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"EZNRMDKHEAV4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZNRMDKHEAV4VXJY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZNRMDKH","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:285e5ba9cff61fa005eccc6be464f69913eb2ceb698bc8380c842065ca72acda","target":"graph","created_at":"2026-05-18T02:05:12Z","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":"In this paper, we consider a queue-aware distributive resource control algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay buffering is an effective way to reduce the intrinsic half-duplex penalty in cooperative systems. The complex interactions of the queues at the source node and the relays are modeled as an average-cost infinite horizon Markov Decision Process (MDP). The traditional approach solving this MDP problem involves centralized control with huge complexity. To obtain a distributive and low complexity solution, we introduce a linear structure which approxi","authors_text":"Rui Wang, Vincent K. N. Lau, Ying Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-02T03:57:46Z","title":"Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0287","kind":"arxiv","version":1},"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:c9e8b232ca9033e6fc42002482ed6b98d4b1e5d305030a479177861d98e008cb","target":"record","created_at":"2026-05-18T02:05:12Z","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":"e359871520ce4042d6f09c6cb821c98e6190d076e08c93e16cef05e09dd61662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-02T03:57:46Z","title_canon_sha256":"f823aeb8e9463a18d2d3a6bf0fd595e20cfd56c961e9c4b500b161b3bc856f46"},"schema_version":"1.0","source":{"id":"1010.0287","kind":"arxiv","version":1}},"canonical_sha256":"265b160d47202bcadd389b26d6d7a45774d4e57d66663e403628458bf2cee88d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"265b160d47202bcadd389b26d6d7a45774d4e57d66663e403628458bf2cee88d","first_computed_at":"2026-05-18T02:05:12.426446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:12.426446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VN7KOV1XsF52iniAcPtRWK223x2s6B6zZku0XE/KzBzLTh+1pkB0eDmIDMU2W7Jo0s6Zt8W/3oqemyWKLb10Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:12.427231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e8b232ca9033e6fc42002482ed6b98d4b1e5d305030a479177861d98e008cb","sha256:285e5ba9cff61fa005eccc6be464f69913eb2ceb698bc8380c842065ca72acda"],"state_sha256":"938459474e05a75441996be4753b68026bbcd1a91f2e92c07585e2cb2c067a61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVofa8dL/kuK/9HISYGDAXMXaiNB/+78TX+/mRJU882SNWXO0Fdp6EOFdqnxmYKLLpbewcMgle18L1/hNuFrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:15:57.936963Z","bundle_sha256":"3176c1c665b14c82aa6340368bd073ec6c2b5de757c2fadae147f0a2cb97232b"}}