{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:FV2P7S6KID5V4J2RAYMVCRQHKI","short_pith_number":"pith:FV2P7S6K","canonical_record":{"source":{"id":"0906.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-25T03:29:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47fa8acca3c1f1ec820e42691fe48453332ae9209b7268c64a0c8156088aaf25","abstract_canon_sha256":"40091596043367cb18c955dabce6157279f9a235b1e3d030521ce9de73e6437c"},"schema_version":"1.0"},"canonical_sha256":"2d74ffcbca40fb5e275106195146075219bab94adf641b8393ac003337bda964","source":{"kind":"arxiv","id":"0906.4597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4597","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4597v2","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4597","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"FV2P7S6KID5V","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FV2P7S6KID5V4J2R","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FV2P7S6K","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:FV2P7S6KID5V4J2RAYMVCRQHKI","target":"record","payload":{"canonical_record":{"source":{"id":"0906.4597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-25T03:29:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47fa8acca3c1f1ec820e42691fe48453332ae9209b7268c64a0c8156088aaf25","abstract_canon_sha256":"40091596043367cb18c955dabce6157279f9a235b1e3d030521ce9de73e6437c"},"schema_version":"1.0"},"canonical_sha256":"2d74ffcbca40fb5e275106195146075219bab94adf641b8393ac003337bda964","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:55.341585Z","signature_b64":"unBalBW0AYpBgHzv7yFrlCEufND/Q4FNx1c8WwSBtUJNxIXV7VrsZ/tfDHGtb34vpMs7Yn5bKL6HK7E3AQlODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d74ffcbca40fb5e275106195146075219bab94adf641b8393ac003337bda964","last_reissued_at":"2026-05-18T02:24:55.340828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:55.340828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.4597","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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+0nOXgh3Kr4j1hL0Z69iwxlLbJEALRqjyBRCFB/2bt8udlU6+fLO2QFLcCf+++W1Z9z/WkvwQerKmE4MFG0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:09:09.758278Z"},"content_sha256":"0b22228d62ffbf34520062dcd57054229187eebff6f24ea8ecff22e8122c3071","schema_version":"1.0","event_id":"sha256:0b22228d62ffbf34520062dcd57054229187eebff6f24ea8ecff22e8122c3071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:FV2P7S6KID5V4J2RAYMVCRQHKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bilal Sadiq, Gustavo de Veciana","submitted_at":"2009-06-25T03:29:28Z","abstract_excerpt":"A centralized wireless system  is considered that is serving a fixed set of users with time varying channel capacities. An opportunistic scheduling rule in this context selects a user (or users) to serve based on the current channel state and user queues. Unless the user traffic is symmetric and/or the underlying capacity region a polymatroid, little is known concerning how performance optimal schedulers should tradeoff \"maximizing current service rate\" (being opportunistic) versus \"balancing unequal queues\" (enhancing user-diversity to enable future high service rate opportunities). By contra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4597","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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xd7NQuAqtIKCpi3FDnwiGdd3a6/PhmviMCbtGxBn34kmDf3hPzhL3MBWyANfTIqS5TwfRAY+VCnf8U4wYb9NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:09:09.758770Z"},"content_sha256":"e45c9dc107a356a4a1fe5c19a1b9b9e90c37689d40cb22a95e196ebf34b8c86f","schema_version":"1.0","event_id":"sha256:e45c9dc107a356a4a1fe5c19a1b9b9e90c37689d40cb22a95e196ebf34b8c86f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/bundle.json","state_url":"https://pith.science/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/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-31T21:09:09Z","links":{"resolver":"https://pith.science/pith/FV2P7S6KID5V4J2RAYMVCRQHKI","bundle":"https://pith.science/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/bundle.json","state":"https://pith.science/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FV2P7S6KID5V4J2RAYMVCRQHKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FV2P7S6KID5V4J2RAYMVCRQHKI","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":"40091596043367cb18c955dabce6157279f9a235b1e3d030521ce9de73e6437c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-25T03:29:28Z","title_canon_sha256":"47fa8acca3c1f1ec820e42691fe48453332ae9209b7268c64a0c8156088aaf25"},"schema_version":"1.0","source":{"id":"0906.4597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4597","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4597v2","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4597","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"FV2P7S6KID5V","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FV2P7S6KID5V4J2R","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FV2P7S6K","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:e45c9dc107a356a4a1fe5c19a1b9b9e90c37689d40cb22a95e196ebf34b8c86f","target":"graph","created_at":"2026-05-18T02:24: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":"A centralized wireless system  is considered that is serving a fixed set of users with time varying channel capacities. An opportunistic scheduling rule in this context selects a user (or users) to serve based on the current channel state and user queues. Unless the user traffic is symmetric and/or the underlying capacity region a polymatroid, little is known concerning how performance optimal schedulers should tradeoff \"maximizing current service rate\" (being opportunistic) versus \"balancing unequal queues\" (enhancing user-diversity to enable future high service rate opportunities). By contra","authors_text":"Bilal Sadiq, Gustavo de Veciana","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-25T03:29:28Z","title":"Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4597","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:0b22228d62ffbf34520062dcd57054229187eebff6f24ea8ecff22e8122c3071","target":"record","created_at":"2026-05-18T02:24: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":"40091596043367cb18c955dabce6157279f9a235b1e3d030521ce9de73e6437c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-25T03:29:28Z","title_canon_sha256":"47fa8acca3c1f1ec820e42691fe48453332ae9209b7268c64a0c8156088aaf25"},"schema_version":"1.0","source":{"id":"0906.4597","kind":"arxiv","version":2}},"canonical_sha256":"2d74ffcbca40fb5e275106195146075219bab94adf641b8393ac003337bda964","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d74ffcbca40fb5e275106195146075219bab94adf641b8393ac003337bda964","first_computed_at":"2026-05-18T02:24:55.340828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:55.340828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unBalBW0AYpBgHzv7yFrlCEufND/Q4FNx1c8WwSBtUJNxIXV7VrsZ/tfDHGtb34vpMs7Yn5bKL6HK7E3AQlODg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:55.341585Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.4597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b22228d62ffbf34520062dcd57054229187eebff6f24ea8ecff22e8122c3071","sha256:e45c9dc107a356a4a1fe5c19a1b9b9e90c37689d40cb22a95e196ebf34b8c86f"],"state_sha256":"d16d9d3c0b1f8c27aecfd958df2b913ff5bf34c35be7d35b9d342f51f0a8dad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ni7mEvq60cO6+TesBNW3d1Fe6EWTYJOo9egf8FzKJOT4iz6GwIwxw8tUca45d4zCEjWWnGjsaMtX+EXvmLmPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:09:09.762169Z","bundle_sha256":"1950d6f8fb3e9edd46243e5adb3a83a6fef32cdccf4992f78fbb29f8d50c5f6c"}}