{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P64HX4GCKTR3FN3SUJQ75IIX5S","short_pith_number":"pith:P64HX4GC","canonical_record":{"source":{"id":"1711.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61c49fa6d9eb46782578ab9dcd73c31cb9a370f449631a9e616bdc5a27a1bd36","abstract_canon_sha256":"5ea3419103875ee7f7e130c935edf84994f040a8a99b32c8efc7c940a0b0ee38"},"schema_version":"1.0"},"canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","source":{"kind":"arxiv","id":"1711.07912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07912","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07912v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07912","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"P64HX4GCKTR3","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P64HX4GCKTR3FN3S","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P64HX4GC","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P64HX4GCKTR3FN3SUJQ75IIX5S","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61c49fa6d9eb46782578ab9dcd73c31cb9a370f449631a9e616bdc5a27a1bd36","abstract_canon_sha256":"5ea3419103875ee7f7e130c935edf84994f040a8a99b32c8efc7c940a0b0ee38"},"schema_version":"1.0"},"canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.189175Z","signature_b64":"q8Ab6FFSn+6/tqT1rnRTOwFrFAYiqrhDCnzjgFq8pK3exxhqCkSB5LnhzdHvM+8+mN7dQOS72k9q+TyYHIaWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","last_reissued_at":"2026-05-18T00:29:56.188629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.188629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07912","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-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGT4bW6+XOsZprvMHGFR+LfNAUU6HuFtFtk4wokNkEP3k9kQkDzd8DxCAieLkVkgAnMyI/Ux4dfxq+KZDKJ3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:22:00.155649Z"},"content_sha256":"9e7492d3d88f08b88ac5e569e704147a4afa59e927a9c9f99fb1c15931885563","schema_version":"1.0","event_id":"sha256:9e7492d3d88f08b88ac5e569e704147a4afa59e927a9c9f99fb1c15931885563"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P64HX4GCKTR3FN3SUJQ75IIX5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Sleeping Mechanism for Multiple Servers with MMPP-Based Bursty Traffic Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","submitted_at":"2017-11-21T17:02:44Z","abstract_excerpt":"An important fundamental problem in green communications and networking is the operation of servers (routers or base stations) with sleeping mechanism to optimize energy-delay tradeoffs. This problem is very challenging when considering realistic bursty, non-Poisson traffic. We prove for the first time the optimal structure of such a sleep mechanism for multiple servers when the arrival of jobs is modeled by a bursty Markov-modulated Poisson process (MMPP). It is shown that the optimal operation, which determines the number of active (or sleeping) servers dynamically, is hysteretic and monoton"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07912","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-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BK+2nUiL9WQWEYp+Nwx1ODhUvhSwolAA0Uo2wmrfv5PkKuXjbBgrnWTu0sOnrfTBJ1SIqS1HalQyWqqf7+wAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:22:00.156085Z"},"content_sha256":"4d0ceff3291362aa45deb7a738868695c35e92ba53b7e647f00a2266e45605af","schema_version":"1.0","event_id":"sha256:4d0ceff3291362aa45deb7a738868695c35e92ba53b7e647f00a2266e45605af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/bundle.json","state_url":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/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-27T03:22:00Z","links":{"resolver":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S","bundle":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/bundle.json","state":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P64HX4GCKTR3FN3SUJQ75IIX5S","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":"5ea3419103875ee7f7e130c935edf84994f040a8a99b32c8efc7c940a0b0ee38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","title_canon_sha256":"61c49fa6d9eb46782578ab9dcd73c31cb9a370f449631a9e616bdc5a27a1bd36"},"schema_version":"1.0","source":{"id":"1711.07912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07912","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07912v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07912","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"P64HX4GCKTR3","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P64HX4GCKTR3FN3S","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P64HX4GC","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:4d0ceff3291362aa45deb7a738868695c35e92ba53b7e647f00a2266e45605af","target":"graph","created_at":"2026-05-18T00:29:56Z","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":"An important fundamental problem in green communications and networking is the operation of servers (routers or base stations) with sleeping mechanism to optimize energy-delay tradeoffs. This problem is very challenging when considering realistic bursty, non-Poisson traffic. We prove for the first time the optimal structure of such a sleep mechanism for multiple servers when the arrival of jobs is modeled by a bursty Markov-modulated Poisson process (MMPP). It is shown that the optimal operation, which determines the number of active (or sleeping) servers dynamically, is hysteretic and monoton","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","title":"Optimal Sleeping Mechanism for Multiple Servers with MMPP-Based Bursty Traffic Arrival"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07912","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:9e7492d3d88f08b88ac5e569e704147a4afa59e927a9c9f99fb1c15931885563","target":"record","created_at":"2026-05-18T00:29:56Z","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":"5ea3419103875ee7f7e130c935edf84994f040a8a99b32c8efc7c940a0b0ee38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","title_canon_sha256":"61c49fa6d9eb46782578ab9dcd73c31cb9a370f449631a9e616bdc5a27a1bd36"},"schema_version":"1.0","source":{"id":"1711.07912","kind":"arxiv","version":1}},"canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","first_computed_at":"2026-05-18T00:29:56.188629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.188629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8Ab6FFSn+6/tqT1rnRTOwFrFAYiqrhDCnzjgFq8pK3exxhqCkSB5LnhzdHvM+8+mN7dQOS72k9q+TyYHIaWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.189175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e7492d3d88f08b88ac5e569e704147a4afa59e927a9c9f99fb1c15931885563","sha256:4d0ceff3291362aa45deb7a738868695c35e92ba53b7e647f00a2266e45605af"],"state_sha256":"954db467c3b43a0711e07eab3324e89cad35bbbaf50a808f3b4d0f0a0ea1f49d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9xDesXdfFFH6g3nJJzTX97KRhDUOKSH53Ks0XmC+7SGR8KBblnYMztZlILFxBFnkI+iZa+WZjGmFtJ44lgeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:22:00.159050Z","bundle_sha256":"9c9432b810e5fd6aa7d516eb8030c4c9ede6f372b86e9da5e2ff2fe86790e2f0"}}