{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YQFKZFXUY2QEFPO42WS66YSHKU","short_pith_number":"pith:YQFKZFXU","canonical_record":{"source":{"id":"1405.6154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T18:12:26Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1703e7af91d307918fc031cd4b5a53e457924854ef818633970b0dc86797d942","abstract_canon_sha256":"2a89a6f6421073ac8e9c8d914109c6cc1b3c13ce36c92b2206759ac194b260ff"},"schema_version":"1.0"},"canonical_sha256":"c40aac96f4c6a042bddcd5a5ef624755034f757189f5bf90a46cecf5456a9224","source":{"kind":"arxiv","id":"1405.6154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6154","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6154v1","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6154","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"YQFKZFXUY2QE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YQFKZFXUY2QEFPO4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YQFKZFXU","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YQFKZFXUY2QEFPO42WS66YSHKU","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T18:12:26Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1703e7af91d307918fc031cd4b5a53e457924854ef818633970b0dc86797d942","abstract_canon_sha256":"2a89a6f6421073ac8e9c8d914109c6cc1b3c13ce36c92b2206759ac194b260ff"},"schema_version":"1.0"},"canonical_sha256":"c40aac96f4c6a042bddcd5a5ef624755034f757189f5bf90a46cecf5456a9224","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:13.959303Z","signature_b64":"OQJCaahms5M68wCANf380tEX8yz6kZ1eSIFc4iPGuPetjk8yiFk6XuD1+/Ygf2MkmUZrt8C7ZQL4QwTBaGsBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c40aac96f4c6a042bddcd5a5ef624755034f757189f5bf90a46cecf5456a9224","last_reissued_at":"2026-05-18T02:51:13.958869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:13.958869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6154","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:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Txtc7KkX6Q8QaKRjV6MrMYFugXMP7setrIdj9Q05Q4S8RikpfcCdwkjZH1cCj4f5AP6MMjgzdOnbRqCKKxdFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:45:34.054879Z"},"content_sha256":"949a31cf91a4d9cd89ce99e7d7934e47f91154173c107d12351d93f737d9d1d8","schema_version":"1.0","event_id":"sha256:949a31cf91a4d9cd89ce99e7d7934e47f91154173c107d12351d93f737d9d1d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YQFKZFXUY2QEFPO42WS66YSHKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Efficient Multiuser Scheduling: Statistical Guarantees on Bursty Packet Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amr Mohamed, Eduard A. Jorswieck, M. Majid Butt","submitted_at":"2014-05-23T18:12:26Z","abstract_excerpt":"In this paper, we consider energy efficient multiuser scheduling. Packet loss tolerance of the applications is exploited to minimize average system energy. There is a constraint on average packet drop rate and maximum number of packets dropped successively (bursty loss). A finite buffer size is assumed. We propose a scheme which schedules the users opportunistically according to the channel conditions, packet loss constraints and buffer size parameters. We assume imperfect channel state information at the transmitter side and analyze the scheme in large user limit using stochastic optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6154","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:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdSDpSF4b8S23reetUoFwv096qwdTJHQyKui6aDyzfbcEXd//5NwYz94NvMs9pULDCOtN4WXvgOr4KAUkEdYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:45:34.055511Z"},"content_sha256":"4d4e61bf0887f935ae80a65a294eabbd854206c7ed13135e6abb29dd69248591","schema_version":"1.0","event_id":"sha256:4d4e61bf0887f935ae80a65a294eabbd854206c7ed13135e6abb29dd69248591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQFKZFXUY2QEFPO42WS66YSHKU/bundle.json","state_url":"https://pith.science/pith/YQFKZFXUY2QEFPO42WS66YSHKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQFKZFXUY2QEFPO42WS66YSHKU/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-26T01:45:34Z","links":{"resolver":"https://pith.science/pith/YQFKZFXUY2QEFPO42WS66YSHKU","bundle":"https://pith.science/pith/YQFKZFXUY2QEFPO42WS66YSHKU/bundle.json","state":"https://pith.science/pith/YQFKZFXUY2QEFPO42WS66YSHKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQFKZFXUY2QEFPO42WS66YSHKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YQFKZFXUY2QEFPO42WS66YSHKU","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":"2a89a6f6421073ac8e9c8d914109c6cc1b3c13ce36c92b2206759ac194b260ff","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T18:12:26Z","title_canon_sha256":"1703e7af91d307918fc031cd4b5a53e457924854ef818633970b0dc86797d942"},"schema_version":"1.0","source":{"id":"1405.6154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6154","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6154v1","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6154","created_at":"2026-05-18T02:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"YQFKZFXUY2QE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YQFKZFXUY2QEFPO4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YQFKZFXU","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4d4e61bf0887f935ae80a65a294eabbd854206c7ed13135e6abb29dd69248591","target":"graph","created_at":"2026-05-18T02:51:13Z","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 energy efficient multiuser scheduling. Packet loss tolerance of the applications is exploited to minimize average system energy. There is a constraint on average packet drop rate and maximum number of packets dropped successively (bursty loss). A finite buffer size is assumed. We propose a scheme which schedules the users opportunistically according to the channel conditions, packet loss constraints and buffer size parameters. We assume imperfect channel state information at the transmitter side and analyze the scheme in large user limit using stochastic optimization","authors_text":"Amr Mohamed, Eduard A. Jorswieck, M. Majid Butt","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T18:12:26Z","title":"Energy Efficient Multiuser Scheduling: Statistical Guarantees on Bursty Packet Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6154","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:949a31cf91a4d9cd89ce99e7d7934e47f91154173c107d12351d93f737d9d1d8","target":"record","created_at":"2026-05-18T02:51:13Z","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":"2a89a6f6421073ac8e9c8d914109c6cc1b3c13ce36c92b2206759ac194b260ff","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-23T18:12:26Z","title_canon_sha256":"1703e7af91d307918fc031cd4b5a53e457924854ef818633970b0dc86797d942"},"schema_version":"1.0","source":{"id":"1405.6154","kind":"arxiv","version":1}},"canonical_sha256":"c40aac96f4c6a042bddcd5a5ef624755034f757189f5bf90a46cecf5456a9224","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c40aac96f4c6a042bddcd5a5ef624755034f757189f5bf90a46cecf5456a9224","first_computed_at":"2026-05-18T02:51:13.958869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:13.958869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQJCaahms5M68wCANf380tEX8yz6kZ1eSIFc4iPGuPetjk8yiFk6XuD1+/Ygf2MkmUZrt8C7ZQL4QwTBaGsBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:13.959303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:949a31cf91a4d9cd89ce99e7d7934e47f91154173c107d12351d93f737d9d1d8","sha256:4d4e61bf0887f935ae80a65a294eabbd854206c7ed13135e6abb29dd69248591"],"state_sha256":"054a5c20e42cb8f24f676253ad38edd2b204e79797e559e81c4bb999074d53e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OaEWt9Jhh4IWpWuBvbrNFuGjCnl3rhbttaO1qt5dYNFFlnP0fLnM3A43RGvfCvrd6N1MQ76NjKPGQVrHs/wmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:45:34.059076Z","bundle_sha256":"8289f4484816473c660f1322a0eb0cb618e10559ecbf8522d4b0926360016471"}}