{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FUXD6AOO6X772SEXPPRCYFJMQC","short_pith_number":"pith:FUXD6AOO","canonical_record":{"source":{"id":"1002.3312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T17:22:31Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"9e3cfa505c6a25775a013056b8754eca644a271252f83d3bb3bb814afeb508a3","abstract_canon_sha256":"cc3f171a390702fa0f93feb5012532e51c713947aafb2e60e2ae2586911b3e17"},"schema_version":"1.0"},"canonical_sha256":"2d2e3f01cef5fffd48977be22c152c80a5ae0eb8a738b9456385bff2c702c14a","source":{"kind":"arxiv","id":"1002.3312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3312","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3312v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3312","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"FUXD6AOO6X77","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FUXD6AOO6X772SEX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FUXD6AOO","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FUXD6AOO6X772SEXPPRCYFJMQC","target":"record","payload":{"canonical_record":{"source":{"id":"1002.3312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T17:22:31Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"9e3cfa505c6a25775a013056b8754eca644a271252f83d3bb3bb814afeb508a3","abstract_canon_sha256":"cc3f171a390702fa0f93feb5012532e51c713947aafb2e60e2ae2586911b3e17"},"schema_version":"1.0"},"canonical_sha256":"2d2e3f01cef5fffd48977be22c152c80a5ae0eb8a738b9456385bff2c702c14a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.038505Z","signature_b64":"sZUHOnFuWqGzXepzS0Senp8mKIfNTHpgg+3LsMUIRUKMrcO3J4crPvqb9m4NYArY/+ksfMj8iiFMOjeDe+cgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2e3f01cef5fffd48977be22c152c80a5ae0eb8a738b9456385bff2c702c14a","last_reissued_at":"2026-05-18T00:59:11.037813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.037813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.3312","source_version":2,"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uOc6lNjKRZraw+qE44r27zjqmWTpYuLVjC7/F1WevAMhQ3rd2NhYBjOZmKYy+vis5DRwBzGYXKXJe2Ta6+SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:09:22.011959Z"},"content_sha256":"8a803628b55ece9f75d744952418733eb3fef9cf7a38554989ba8a32fc48a8e0","schema_version":"1.0","event_id":"sha256:8a803628b55ece9f75d744952418733eb3fef9cf7a38554989ba8a32fc48a8e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FUXD6AOO6X772SEXPPRCYFJMQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiuser Scheduling in a Markov-modeled Downlink using Randomly Delayed ARQ Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ness B. Shroff, Philip Schniter, Sugumar Murugesan","submitted_at":"2010-02-17T17:22:31Z","abstract_excerpt":"We focus on the downlink of a cellular system, which corresponds to the bulk of the data transfer in such wireless systems. We address the problem of opportunistic multiuser scheduling under imperfect channel state information, by exploiting the memory inherent in the channel. In our setting, the channel between the base station and each user is modeled by a two-state Markov chain and the scheduled user sends back an ARQ feedback signal that arrives at the scheduler with a random delay that is i.i.d across users and time. The scheduler indirectly estimates the channel via accumulated delayed-A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3312","kind":"arxiv","version":2},"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oPxQ0FwRiDJ9FYKsBv6IF6t7P8Qchb65hjNWXTKrgY19VLzFGsD7TX5oQ90JJ/jteAeGOGgcjpg9t/5zwolBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:09:22.012346Z"},"content_sha256":"41a5942579261914ada8dd785db9fbd350d1bca8f397565d37076d697098dbc2","schema_version":"1.0","event_id":"sha256:41a5942579261914ada8dd785db9fbd350d1bca8f397565d37076d697098dbc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUXD6AOO6X772SEXPPRCYFJMQC/bundle.json","state_url":"https://pith.science/pith/FUXD6AOO6X772SEXPPRCYFJMQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUXD6AOO6X772SEXPPRCYFJMQC/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-01T04:09:22Z","links":{"resolver":"https://pith.science/pith/FUXD6AOO6X772SEXPPRCYFJMQC","bundle":"https://pith.science/pith/FUXD6AOO6X772SEXPPRCYFJMQC/bundle.json","state":"https://pith.science/pith/FUXD6AOO6X772SEXPPRCYFJMQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUXD6AOO6X772SEXPPRCYFJMQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FUXD6AOO6X772SEXPPRCYFJMQC","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":"cc3f171a390702fa0f93feb5012532e51c713947aafb2e60e2ae2586911b3e17","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T17:22:31Z","title_canon_sha256":"9e3cfa505c6a25775a013056b8754eca644a271252f83d3bb3bb814afeb508a3"},"schema_version":"1.0","source":{"id":"1002.3312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3312","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3312v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3312","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"FUXD6AOO6X77","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FUXD6AOO6X772SEX","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FUXD6AOO","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:41a5942579261914ada8dd785db9fbd350d1bca8f397565d37076d697098dbc2","target":"graph","created_at":"2026-05-18T00:59:11Z","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 focus on the downlink of a cellular system, which corresponds to the bulk of the data transfer in such wireless systems. We address the problem of opportunistic multiuser scheduling under imperfect channel state information, by exploiting the memory inherent in the channel. In our setting, the channel between the base station and each user is modeled by a two-state Markov chain and the scheduled user sends back an ARQ feedback signal that arrives at the scheduler with a random delay that is i.i.d across users and time. The scheduler indirectly estimates the channel via accumulated delayed-A","authors_text":"Ness B. Shroff, Philip Schniter, Sugumar Murugesan","cross_cats":["cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T17:22:31Z","title":"Multiuser Scheduling in a Markov-modeled Downlink using Randomly Delayed ARQ Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3312","kind":"arxiv","version":2},"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:8a803628b55ece9f75d744952418733eb3fef9cf7a38554989ba8a32fc48a8e0","target":"record","created_at":"2026-05-18T00:59:11Z","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":"cc3f171a390702fa0f93feb5012532e51c713947aafb2e60e2ae2586911b3e17","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T17:22:31Z","title_canon_sha256":"9e3cfa505c6a25775a013056b8754eca644a271252f83d3bb3bb814afeb508a3"},"schema_version":"1.0","source":{"id":"1002.3312","kind":"arxiv","version":2}},"canonical_sha256":"2d2e3f01cef5fffd48977be22c152c80a5ae0eb8a738b9456385bff2c702c14a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d2e3f01cef5fffd48977be22c152c80a5ae0eb8a738b9456385bff2c702c14a","first_computed_at":"2026-05-18T00:59:11.037813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.037813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZUHOnFuWqGzXepzS0Senp8mKIfNTHpgg+3LsMUIRUKMrcO3J4crPvqb9m4NYArY/+ksfMj8iiFMOjeDe+cgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.038505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.3312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a803628b55ece9f75d744952418733eb3fef9cf7a38554989ba8a32fc48a8e0","sha256:41a5942579261914ada8dd785db9fbd350d1bca8f397565d37076d697098dbc2"],"state_sha256":"b65a13390919af24f65707e047b1ae3d1ad815f249341c2209d99f372595f8fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JphBz5d69hcID2WuJBPzlV+Vt8GH5D299fsznoxykRMfRooiMLMhC735eNs1YTYsdAysnQiykkIQTyq6lfusCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:09:22.014760Z","bundle_sha256":"d8b334007846a61eee6e92729d2cf342f6f4b39ef5277b66a28ef3e016f2a174"}}