{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4E42EBX3T5KVFWX2JAPMNYMQPE","short_pith_number":"pith:4E42EBX3","canonical_record":{"source":{"id":"1101.2478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-13T03:11:05Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b6081ece1968ceddc7ce1202f0002081c5ea9f2c06aebd5f7f8890831db3c89e","abstract_canon_sha256":"bf48a421eadb93056093743385594b70149255238b1291937eca45a75a19e5bb"},"schema_version":"1.0"},"canonical_sha256":"e139a206fb9f5552dafa481ec6e1907908a13abdea0628fcf5ec2cb4a45c3fd8","source":{"kind":"arxiv","id":"1101.2478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2478","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2478v2","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2478","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"4E42EBX3T5KV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4E42EBX3T5KVFWX2","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4E42EBX3","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4E42EBX3T5KVFWX2JAPMNYMQPE","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-13T03:11:05Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b6081ece1968ceddc7ce1202f0002081c5ea9f2c06aebd5f7f8890831db3c89e","abstract_canon_sha256":"bf48a421eadb93056093743385594b70149255238b1291937eca45a75a19e5bb"},"schema_version":"1.0"},"canonical_sha256":"e139a206fb9f5552dafa481ec6e1907908a13abdea0628fcf5ec2cb4a45c3fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:31.942083Z","signature_b64":"YFDtwKW+LoDXdFr0Q4Cl2lwwzAMxC29jo1qPfCx0GHI4AP4kbCH/6GI2td09Zp+tJbfL8bXztA9FsMhVSC22Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e139a206fb9f5552dafa481ec6e1907908a13abdea0628fcf5ec2cb4a45c3fd8","last_reissued_at":"2026-05-18T04:31:31.941555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:31.941555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2478","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-18T04:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7uMOQr4cuaZyru+n01Y+ldn/Oq8CfXy4imEMsukL72ZKPkc/SHLTW2VtMfw3hTq9iuHUch+T7HDWBtm9ykObCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:43:20.608889Z"},"content_sha256":"e617630fb68ec4ac2bb4182b3913a193a4ee7be4ae2432e08efccdecf236258f","schema_version":"1.0","event_id":"sha256:e617630fb68ec4ac2bb4182b3913a193a4ee7be4ae2432e08efccdecf236258f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4E42EBX3T5KVFWX2JAPMNYMQPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay and Power-Optimal Control in Multi-Class Queueing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Chih-ping Li, Michael J. Neely","submitted_at":"2011-01-13T03:11:05Z","abstract_excerpt":"We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class average delay constraints; (2) minimizing a separable convex function of average delays subject to per-class delay constraints; (3) minimizing average power consumption subject to per-class delay constraints; (4) minimizing a separable convex function of average delays subject to an average power constraint. Combining an achievable region approach in queuein"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2478","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-18T04:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEdYqFlUepRpxuV3mKQoe4aPG80ojrE0ojGgYlPZYdk2hAA9xVh4N7HBNXlddOkszprb4Zm4GdKxoV7j3LDyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:43:20.609528Z"},"content_sha256":"0655f1660556513d8c787ccfcd30a6d047eaf717d736b4a42545981693828f35","schema_version":"1.0","event_id":"sha256:0655f1660556513d8c787ccfcd30a6d047eaf717d736b4a42545981693828f35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/bundle.json","state_url":"https://pith.science/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/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-20T15:43:20Z","links":{"resolver":"https://pith.science/pith/4E42EBX3T5KVFWX2JAPMNYMQPE","bundle":"https://pith.science/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/bundle.json","state":"https://pith.science/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4E42EBX3T5KVFWX2JAPMNYMQPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4E42EBX3T5KVFWX2JAPMNYMQPE","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":"bf48a421eadb93056093743385594b70149255238b1291937eca45a75a19e5bb","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-13T03:11:05Z","title_canon_sha256":"b6081ece1968ceddc7ce1202f0002081c5ea9f2c06aebd5f7f8890831db3c89e"},"schema_version":"1.0","source":{"id":"1101.2478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2478","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2478v2","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2478","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"4E42EBX3T5KV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4E42EBX3T5KVFWX2","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4E42EBX3","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:0655f1660556513d8c787ccfcd30a6d047eaf717d736b4a42545981693828f35","target":"graph","created_at":"2026-05-18T04:31:31Z","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 consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class average delay constraints; (2) minimizing a separable convex function of average delays subject to per-class delay constraints; (3) minimizing average power consumption subject to per-class delay constraints; (4) minimizing a separable convex function of average delays subject to an average power constraint. Combining an achievable region approach in queuein","authors_text":"Chih-ping Li, Michael J. Neely","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-13T03:11:05Z","title":"Delay and Power-Optimal Control in Multi-Class Queueing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2478","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:e617630fb68ec4ac2bb4182b3913a193a4ee7be4ae2432e08efccdecf236258f","target":"record","created_at":"2026-05-18T04:31:31Z","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":"bf48a421eadb93056093743385594b70149255238b1291937eca45a75a19e5bb","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-13T03:11:05Z","title_canon_sha256":"b6081ece1968ceddc7ce1202f0002081c5ea9f2c06aebd5f7f8890831db3c89e"},"schema_version":"1.0","source":{"id":"1101.2478","kind":"arxiv","version":2}},"canonical_sha256":"e139a206fb9f5552dafa481ec6e1907908a13abdea0628fcf5ec2cb4a45c3fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e139a206fb9f5552dafa481ec6e1907908a13abdea0628fcf5ec2cb4a45c3fd8","first_computed_at":"2026-05-18T04:31:31.941555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:31.941555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YFDtwKW+LoDXdFr0Q4Cl2lwwzAMxC29jo1qPfCx0GHI4AP4kbCH/6GI2td09Zp+tJbfL8bXztA9FsMhVSC22Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:31.942083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e617630fb68ec4ac2bb4182b3913a193a4ee7be4ae2432e08efccdecf236258f","sha256:0655f1660556513d8c787ccfcd30a6d047eaf717d736b4a42545981693828f35"],"state_sha256":"7fd68548046c4475b86ae2e8662a0281520d1bd0b34a947ef506df7784f30b76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUuJYbJCwUBPzl9j/fts7g7fsV2GDsquMVnq0zrki/XFoFRdYTdvtXFkzNfImK8Yy30oZfRXHcDJx+rAVQIhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:43:20.611387Z","bundle_sha256":"18373ab7b44e5a1a3b9790982a301e49e143bc4d37b37dfe4577f720d0edc78b"}}