{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O3E5BFJVLE5VKOVWM5W6PYBKRF","short_pith_number":"pith:O3E5BFJV","canonical_record":{"source":{"id":"1009.3959","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-20T21:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"0bec5da470911d2a5a17e514a27d027d9698fc18bb1deb10d37bee9358acc592","abstract_canon_sha256":"7251d03b79ac18baeec7e76c2b9b95247d237474f6acf7fed67476a995abbd0f"},"schema_version":"1.0"},"canonical_sha256":"76c9d09535593b553ab6676de7e02a894130c14c5419feca8e1c40db1f615cf3","source":{"kind":"arxiv","id":"1009.3959","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3959","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3959v6","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3959","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"O3E5BFJVLE5V","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3E5BFJVLE5VKOVW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3E5BFJV","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O3E5BFJVLE5VKOVWM5W6PYBKRF","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3959","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-20T21:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"0bec5da470911d2a5a17e514a27d027d9698fc18bb1deb10d37bee9358acc592","abstract_canon_sha256":"7251d03b79ac18baeec7e76c2b9b95247d237474f6acf7fed67476a995abbd0f"},"schema_version":"1.0"},"canonical_sha256":"76c9d09535593b553ab6676de7e02a894130c14c5419feca8e1c40db1f615cf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:55.154276Z","signature_b64":"PmiLtrTm18Sr44jrrVSuvXGtx71QaAAarvuOAoxwBdkzzzGHGYUypt98NH2gIje2OwM45LimrW0UOwjfAY49CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c9d09535593b553ab6676de7e02a894130c14c5419feca8e1c40db1f615cf3","last_reissued_at":"2026-05-18T04:06:55.153537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:55.153537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3959","source_version":6,"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-18T04:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hatr+AJiyZbYqKeJcXFtDdzTdIq5c1tfaOOOPaUSL4wI9r1HALQcFH/062MhhJGCB2ByN58K7wV34xtjagIUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:47.232668Z"},"content_sha256":"69da7977ac71b7e95be32e8cf72cb7740ae8caecac3804fec275843ac84042f8","schema_version":"1.0","event_id":"sha256:69da7977ac71b7e95be32e8cf72cb7740ae8caecac3804fec275843ac84042f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O3E5BFJVLE5VKOVWM5W6PYBKRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Channel Memory for Joint Estimation and Scheduling in Downlink Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Atilla Eryilmaz, Ness B. Shroff, Sugumar Murugesan, Wenzhuo Ouyang","submitted_at":"2010-09-20T21:45:39Z","abstract_excerpt":"We address the problem of opportunistic multiuser scheduling in downlink networks with Markov-modeled outage channels. We consider the scenario in which the scheduler does not have full knowledge of the channel state information, but instead estimates the channel state information by exploiting the memory inherent in the Markov channels along with ARQ-styled feedback from the scheduled users. Opportunistic scheduling is optimized in two stages: (1) Channel estimation and rate adaptation to maximize the expected immediate rate of the scheduled user; (2) User scheduling, based on the optimized i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3959","kind":"arxiv","version":6},"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-18T04:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yfHXmTHxrsIWPp8qlEm1e+rJARYofa5ZqnBMnMUKC6n0SyB8VFc0R48TPtQ+HoXRPq0b5hZ3XiqC9rl4d/TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:47.233025Z"},"content_sha256":"b7d3744c336da325662e2bb898729a7bf4044789c61c187363d87b3d0fb8e16c","schema_version":"1.0","event_id":"sha256:b7d3744c336da325662e2bb898729a7bf4044789c61c187363d87b3d0fb8e16c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/bundle.json","state_url":"https://pith.science/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/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-05-30T08:53:47Z","links":{"resolver":"https://pith.science/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF","bundle":"https://pith.science/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/bundle.json","state":"https://pith.science/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3E5BFJVLE5VKOVWM5W6PYBKRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O3E5BFJVLE5VKOVWM5W6PYBKRF","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":"7251d03b79ac18baeec7e76c2b9b95247d237474f6acf7fed67476a995abbd0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-20T21:45:39Z","title_canon_sha256":"0bec5da470911d2a5a17e514a27d027d9698fc18bb1deb10d37bee9358acc592"},"schema_version":"1.0","source":{"id":"1009.3959","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3959","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3959v6","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3959","created_at":"2026-05-18T04:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"O3E5BFJVLE5V","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3E5BFJVLE5VKOVW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3E5BFJV","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:b7d3744c336da325662e2bb898729a7bf4044789c61c187363d87b3d0fb8e16c","target":"graph","created_at":"2026-05-18T04:06:55Z","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":"We address the problem of opportunistic multiuser scheduling in downlink networks with Markov-modeled outage channels. We consider the scenario in which the scheduler does not have full knowledge of the channel state information, but instead estimates the channel state information by exploiting the memory inherent in the Markov channels along with ARQ-styled feedback from the scheduled users. Opportunistic scheduling is optimized in two stages: (1) Channel estimation and rate adaptation to maximize the expected immediate rate of the scheduled user; (2) User scheduling, based on the optimized i","authors_text":"Atilla Eryilmaz, Ness B. Shroff, Sugumar Murugesan, Wenzhuo Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-20T21:45:39Z","title":"Exploiting Channel Memory for Joint Estimation and Scheduling in Downlink Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3959","kind":"arxiv","version":6},"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:69da7977ac71b7e95be32e8cf72cb7740ae8caecac3804fec275843ac84042f8","target":"record","created_at":"2026-05-18T04:06:55Z","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":"7251d03b79ac18baeec7e76c2b9b95247d237474f6acf7fed67476a995abbd0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-20T21:45:39Z","title_canon_sha256":"0bec5da470911d2a5a17e514a27d027d9698fc18bb1deb10d37bee9358acc592"},"schema_version":"1.0","source":{"id":"1009.3959","kind":"arxiv","version":6}},"canonical_sha256":"76c9d09535593b553ab6676de7e02a894130c14c5419feca8e1c40db1f615cf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76c9d09535593b553ab6676de7e02a894130c14c5419feca8e1c40db1f615cf3","first_computed_at":"2026-05-18T04:06:55.153537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:55.153537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PmiLtrTm18Sr44jrrVSuvXGtx71QaAAarvuOAoxwBdkzzzGHGYUypt98NH2gIje2OwM45LimrW0UOwjfAY49CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:55.154276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3959","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69da7977ac71b7e95be32e8cf72cb7740ae8caecac3804fec275843ac84042f8","sha256:b7d3744c336da325662e2bb898729a7bf4044789c61c187363d87b3d0fb8e16c"],"state_sha256":"5d496c2f18276b01ea9b0c6650746d5a89bf28c634bb7c1157a6d9b61cef4bef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yY5CCTTrgVKVaaNFwbcQ+GjyaQWOJI5tMzajPtc3dM7NPWD22h6n9CRWAsRzAkXDdOgCc3a/fKiv3Xus8wh6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:53:47.235201Z","bundle_sha256":"fa946e4ad8751e8d02de84896e27e9bf02a5bc7ac6d4e28f30fbd168a547cdb6"}}