{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ZGGNZ4O2XCPPAHX63QDKFWPVY","short_pith_number":"pith:5ZGGNZ4O","canonical_record":{"source":{"id":"1907.04498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T03:42:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"2835ab3f25aa75de36d0b437261be0478498d91368c45e3cab866c240be4be61","abstract_canon_sha256":"3febc61164a513d58bd0ebdd201c27e8a4998b7535d2463877b1d372cb39761a"},"schema_version":"1.0"},"canonical_sha256":"ee4c66e78ed5c4f780f7f6e03516cfae0495555491721ae4550a23d2d1ffa958","source":{"kind":"arxiv","id":"1907.04498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04498","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04498v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04498","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"5ZGGNZ4O2XCP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ZGGNZ4O2XCPPAHX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ZGGNZ4O","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ZGGNZ4O2XCPPAHX63QDKFWPVY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T03:42:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"2835ab3f25aa75de36d0b437261be0478498d91368c45e3cab866c240be4be61","abstract_canon_sha256":"3febc61164a513d58bd0ebdd201c27e8a4998b7535d2463877b1d372cb39761a"},"schema_version":"1.0"},"canonical_sha256":"ee4c66e78ed5c4f780f7f6e03516cfae0495555491721ae4550a23d2d1ffa958","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.075471Z","signature_b64":"zwmOj2VKrW8GP31ZB16MQim2SMcW0gW4wXdFsosTYBiibpzLw83JNs4r4uLMGUAyU0h7K2cAOq91ZM6PebMiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4c66e78ed5c4f780f7f6e03516cfae0495555491721ae4550a23d2d1ffa958","last_reissued_at":"2026-05-17T23:41:00.074739Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.074739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04498","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpdrJKoSTz0vbhY9oxRzSxttVh8xTTx+1dmF/E8ZovEgVRLLU9gNRvKsRNsiNo5BEncwGT658nu4J5ZAXJatBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:27.668997Z"},"content_sha256":"ca8684ba86832bb84997c144ebb282e43689dd7338d1d97f63e848b80a5eaf58","schema_version":"1.0","event_id":"sha256:ca8684ba86832bb84997c144ebb282e43689dd7338d1d97f63e848b80a5eaf58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ZGGNZ4O2XCPPAHX63QDKFWPVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speed Scaling with Tandem Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Jayakrishnan Nair, Rahul Vaze","submitted_at":"2019-07-10T03:42:25Z","abstract_excerpt":"Speed scaling for a tandem server setting is considered, where there is a series of servers, and each job has to be processed by each of the servers in sequence. Servers have a variable speed, their power consumption being a convex increasing function of the speed. We consider the worst case setting as well as the stochastic setting. In the worst case setting, the jobs are assumed to be of unit size with arbitrary (possibly adversarially determined) arrival instants. For this problem, we devise an online speed scaling algorithm that is constant competitive with respect to the optimal offline a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04498","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X98qZVqVxF6Cx8s5q+ig/qT8qd+1oB5e1rTRcXGHnP8qYaA4jfW86EVq9EYGSlCY3DvGCYCyzpOaJc5Fc+GvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:27.669726Z"},"content_sha256":"3be036a6dbb2359224c51e01c5e184a9c409d6b4b3bf5c5da2af32b9bc7cc5d4","schema_version":"1.0","event_id":"sha256:3be036a6dbb2359224c51e01c5e184a9c409d6b4b3bf5c5da2af32b9bc7cc5d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/bundle.json","state_url":"https://pith.science/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/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-25T17:55:27Z","links":{"resolver":"https://pith.science/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY","bundle":"https://pith.science/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/bundle.json","state":"https://pith.science/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZGGNZ4O2XCPPAHX63QDKFWPVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ZGGNZ4O2XCPPAHX63QDKFWPVY","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":"3febc61164a513d58bd0ebdd201c27e8a4998b7535d2463877b1d372cb39761a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T03:42:25Z","title_canon_sha256":"2835ab3f25aa75de36d0b437261be0478498d91368c45e3cab866c240be4be61"},"schema_version":"1.0","source":{"id":"1907.04498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04498","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04498v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04498","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"5ZGGNZ4O2XCP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ZGGNZ4O2XCPPAHX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ZGGNZ4O","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3be036a6dbb2359224c51e01c5e184a9c409d6b4b3bf5c5da2af32b9bc7cc5d4","target":"graph","created_at":"2026-05-17T23:41:00Z","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":"Speed scaling for a tandem server setting is considered, where there is a series of servers, and each job has to be processed by each of the servers in sequence. Servers have a variable speed, their power consumption being a convex increasing function of the speed. We consider the worst case setting as well as the stochastic setting. In the worst case setting, the jobs are assumed to be of unit size with arbitrary (possibly adversarially determined) arrival instants. For this problem, we devise an online speed scaling algorithm that is constant competitive with respect to the optimal offline a","authors_text":"Jayakrishnan Nair, Rahul Vaze","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T03:42:25Z","title":"Speed Scaling with Tandem Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04498","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:ca8684ba86832bb84997c144ebb282e43689dd7338d1d97f63e848b80a5eaf58","target":"record","created_at":"2026-05-17T23:41:00Z","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":"3febc61164a513d58bd0ebdd201c27e8a4998b7535d2463877b1d372cb39761a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T03:42:25Z","title_canon_sha256":"2835ab3f25aa75de36d0b437261be0478498d91368c45e3cab866c240be4be61"},"schema_version":"1.0","source":{"id":"1907.04498","kind":"arxiv","version":1}},"canonical_sha256":"ee4c66e78ed5c4f780f7f6e03516cfae0495555491721ae4550a23d2d1ffa958","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4c66e78ed5c4f780f7f6e03516cfae0495555491721ae4550a23d2d1ffa958","first_computed_at":"2026-05-17T23:41:00.074739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.074739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwmOj2VKrW8GP31ZB16MQim2SMcW0gW4wXdFsosTYBiibpzLw83JNs4r4uLMGUAyU0h7K2cAOq91ZM6PebMiAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.075471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca8684ba86832bb84997c144ebb282e43689dd7338d1d97f63e848b80a5eaf58","sha256:3be036a6dbb2359224c51e01c5e184a9c409d6b4b3bf5c5da2af32b9bc7cc5d4"],"state_sha256":"7dcd7398015c41997dd888696bfe7d3846137101790d103339bdd9781898de49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9ynyRfET1Mtt7oCQoPIykew6S4J+COzKrjXKHWqGa4JpWm9WA6wTw8syAC1ITNIPhM2oL037Tnrzjk7KZe4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:55:27.676293Z","bundle_sha256":"0f6b4aaf0c0f78dd119d33ad99b782bb6edc98a66ff400594936ec38f8a0477b"}}