{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y2F5XIC4FZONQPQZZ3FAKGSHLH","short_pith_number":"pith:Y2F5XIC4","canonical_record":{"source":{"id":"1711.04978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-14T07:00:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a0ad897aab7c68794e02477be90864fec005353b0a2a4196d548853ba5decc57","abstract_canon_sha256":"ec4cb7281ee0708f37567371e2ddc13a2655eff734974e3137ecd70c478580af"},"schema_version":"1.0"},"canonical_sha256":"c68bdba05c2e5cd83e19ceca051a4759f30e7dffb080ac84afb07d05947ef14d","source":{"kind":"arxiv","id":"1711.04978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04978","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04978v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04978","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y2F5XIC4FZON","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2F5XIC4FZONQPQZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2F5XIC4","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y2F5XIC4FZONQPQZZ3FAKGSHLH","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-14T07:00:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a0ad897aab7c68794e02477be90864fec005353b0a2a4196d548853ba5decc57","abstract_canon_sha256":"ec4cb7281ee0708f37567371e2ddc13a2655eff734974e3137ecd70c478580af"},"schema_version":"1.0"},"canonical_sha256":"c68bdba05c2e5cd83e19ceca051a4759f30e7dffb080ac84afb07d05947ef14d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:35.255519Z","signature_b64":"QLkYFUsUlgHy2IOTA8hdHpgoSaxKfNTusWxt0Wl10nDdO7nMdiLBEmHQVqBQPCQYtH8xSyZu4BtuUOGlhYEvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c68bdba05c2e5cd83e19ceca051a4759f30e7dffb080ac84afb07d05947ef14d","last_reissued_at":"2026-05-18T00:30:35.254907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:35.254907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04978","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:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyup+WFM1rVW7ksrd4S3+T4xpIHLHMCe9vKX41Mde/i+Z0VFg6yJTlaSj4GjvZicPcd9lFoFsRXUQLm75j5/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:29.810520Z"},"content_sha256":"febef9d8e8fa8bd0820fa524c2ffebdc8fd1d0f4dd0f1e6be8a7bea2257bfe0e","schema_version":"1.0","event_id":"sha256:febef9d8e8fa8bd0820fa524c2ffebdc8fd1d0f4dd0f1e6be8a7bea2257bfe0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y2F5XIC4FZONQPQZZ3FAKGSHLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Online Speed Scaling With Deadline Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Goonwanth Reddy, Rahul Vaze","submitted_at":"2017-11-14T07:00:07Z","abstract_excerpt":"A speed scaling problem is considered, where time is divided into slots, and jobs with payoff $v$ arrive at the beginning of the slot with associated deadlines $d$. Each job takes one slot to be processed, and multiple jobs can be processed by the server in each slot with energy cost $g(k)$ for processing $k$ jobs in one slot. The payoff is accrued by the algorithm only if the job is processed by its deadline. We consider a robust version of this speed scaling problem, where a job on its arrival reveals its payoff $v$, however, the deadline is hidden to the online algorithm, which could potent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04978","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:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJc1A1BLna3G5e9mzGDv6kD4RO/67tk81QSLc82M1pWtsl96MnvUTmV5oix0rVpepbNoP2PWxwkAcveV896YAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:29.810877Z"},"content_sha256":"71c7003734376ed4e50264171e6467af974cade39f2964309193e67a97cab2de","schema_version":"1.0","event_id":"sha256:71c7003734376ed4e50264171e6467af974cade39f2964309193e67a97cab2de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/bundle.json","state_url":"https://pith.science/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/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-26T02:38:29Z","links":{"resolver":"https://pith.science/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH","bundle":"https://pith.science/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/bundle.json","state":"https://pith.science/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2F5XIC4FZONQPQZZ3FAKGSHLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y2F5XIC4FZONQPQZZ3FAKGSHLH","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":"ec4cb7281ee0708f37567371e2ddc13a2655eff734974e3137ecd70c478580af","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-14T07:00:07Z","title_canon_sha256":"a0ad897aab7c68794e02477be90864fec005353b0a2a4196d548853ba5decc57"},"schema_version":"1.0","source":{"id":"1711.04978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04978","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04978v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04978","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y2F5XIC4FZON","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2F5XIC4FZONQPQZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2F5XIC4","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:71c7003734376ed4e50264171e6467af974cade39f2964309193e67a97cab2de","target":"graph","created_at":"2026-05-18T00:30:35Z","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 speed scaling problem is considered, where time is divided into slots, and jobs with payoff $v$ arrive at the beginning of the slot with associated deadlines $d$. Each job takes one slot to be processed, and multiple jobs can be processed by the server in each slot with energy cost $g(k)$ for processing $k$ jobs in one slot. The payoff is accrued by the algorithm only if the job is processed by its deadline. We consider a robust version of this speed scaling problem, where a job on its arrival reveals its payoff $v$, however, the deadline is hidden to the online algorithm, which could potent","authors_text":"Goonwanth Reddy, Rahul Vaze","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-14T07:00:07Z","title":"Robust Online Speed Scaling With Deadline Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04978","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:febef9d8e8fa8bd0820fa524c2ffebdc8fd1d0f4dd0f1e6be8a7bea2257bfe0e","target":"record","created_at":"2026-05-18T00:30:35Z","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":"ec4cb7281ee0708f37567371e2ddc13a2655eff734974e3137ecd70c478580af","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-14T07:00:07Z","title_canon_sha256":"a0ad897aab7c68794e02477be90864fec005353b0a2a4196d548853ba5decc57"},"schema_version":"1.0","source":{"id":"1711.04978","kind":"arxiv","version":1}},"canonical_sha256":"c68bdba05c2e5cd83e19ceca051a4759f30e7dffb080ac84afb07d05947ef14d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c68bdba05c2e5cd83e19ceca051a4759f30e7dffb080ac84afb07d05947ef14d","first_computed_at":"2026-05-18T00:30:35.254907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:35.254907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QLkYFUsUlgHy2IOTA8hdHpgoSaxKfNTusWxt0Wl10nDdO7nMdiLBEmHQVqBQPCQYtH8xSyZu4BtuUOGlhYEvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:35.255519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:febef9d8e8fa8bd0820fa524c2ffebdc8fd1d0f4dd0f1e6be8a7bea2257bfe0e","sha256:71c7003734376ed4e50264171e6467af974cade39f2964309193e67a97cab2de"],"state_sha256":"5ab54f6042c92df307139093d3e7cc1f882f718694c15a904042837a7ae19192"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yswx36eSgcne4r6XiE4uk2sp9ZBhninB4tjRIFG5vFQFO1giPwVi71oYooTqSa9lKUuCIUhCASDqABr8hO0TDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:38:29.812896Z","bundle_sha256":"9142a7c435292c8b8440e0f669544a2305c5f7fed86d4a998f8a0d8dde4a00b1"}}