{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HORYSJQGHS3G344UJNVTUGMFZR","short_pith_number":"pith:HORYSJQG","canonical_record":{"source":{"id":"1507.00773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T21:41:12Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"db009521ef20449143bf60c526a34203dcf67e66d7556e4b65746018d44825fe","abstract_canon_sha256":"e205ad4d70c56550f471de08b3dee6a6cceac7b1c36d415c831d3c0563fa517e"},"schema_version":"1.0"},"canonical_sha256":"3ba38926063cb66df3944b6b3a1985cc6106b492dd4ea38fc0f9dcae80f2409d","source":{"kind":"arxiv","id":"1507.00773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00773","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00773v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00773","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"HORYSJQGHS3G","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HORYSJQGHS3G344U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HORYSJQG","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HORYSJQGHS3G344UJNVTUGMFZR","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T21:41:12Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"db009521ef20449143bf60c526a34203dcf67e66d7556e4b65746018d44825fe","abstract_canon_sha256":"e205ad4d70c56550f471de08b3dee6a6cceac7b1c36d415c831d3c0563fa517e"},"schema_version":"1.0"},"canonical_sha256":"3ba38926063cb66df3944b6b3a1985cc6106b492dd4ea38fc0f9dcae80f2409d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.751517Z","signature_b64":"5cUjV2oOIbEFQi4vDe8xjvRBvnKkDE8AN6FMWHXB4zLpFGOzPu3eOGdm9gVjqbjNpWzIgRMTdI/JOuYiGAGbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba38926063cb66df3944b6b3a1985cc6106b492dd4ea38fc0f9dcae80f2409d","last_reissued_at":"2026-05-18T01:37:22.750864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.750864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00773","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-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E11r6HZMtF6BAdZieLuU9aJdNar9LtyX7VJtIKjhPCT5cqDpVYvl6110U2w1MNsF+q0Lu+TehbFmkRYIor9fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:40:22.572454Z"},"content_sha256":"947c42f00e2785acd1c266569b2f9008304784670b7f6dbc1f711bd6a47f3e69","schema_version":"1.0","event_id":"sha256:947c42f00e2785acd1c266569b2f9008304784670b7f6dbc1f711bd6a47f3e69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HORYSJQGHS3G344UJNVTUGMFZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Truthful Online Scheduling with Commitments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Brendan Lucier, Inna Kalp-Shaltiel, Ishai Menache, Jonathan Yaniv, Joseph (Seffi) Naor, Yossi Azar","submitted_at":"2015-07-02T21:41:12Z","abstract_excerpt":"We study online mechanisms for preemptive scheduling with deadlines, with the goal of maximizing the total value of completed jobs. This problem is fundamental to deadline-aware cloud scheduling, but there are strong lower bounds even for the algorithmic problem without incentive constraints. However, these lower bounds can be circumvented under the natural assumption of deadline slackness, i.e., that there is a guaranteed lower bound $s > 1$ on the ratio between a job's size and the time window in which it can be executed.\n  In this paper, we construct a truthful scheduling mechanism with a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00773","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-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ANAadPI280AlBaCnmZAhCidC50Qmo2P9skRi96YarnhSppmo09pQNTIFsBjxuIEfB8TVr3EDzB9D7o6uf6+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:40:22.573143Z"},"content_sha256":"f1d136c35975558d24544b540404228b3a6b232f3228ca6b184c34cdceb6f9be","schema_version":"1.0","event_id":"sha256:f1d136c35975558d24544b540404228b3a6b232f3228ca6b184c34cdceb6f9be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HORYSJQGHS3G344UJNVTUGMFZR/bundle.json","state_url":"https://pith.science/pith/HORYSJQGHS3G344UJNVTUGMFZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HORYSJQGHS3G344UJNVTUGMFZR/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-27T17:40:22Z","links":{"resolver":"https://pith.science/pith/HORYSJQGHS3G344UJNVTUGMFZR","bundle":"https://pith.science/pith/HORYSJQGHS3G344UJNVTUGMFZR/bundle.json","state":"https://pith.science/pith/HORYSJQGHS3G344UJNVTUGMFZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HORYSJQGHS3G344UJNVTUGMFZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HORYSJQGHS3G344UJNVTUGMFZR","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":"e205ad4d70c56550f471de08b3dee6a6cceac7b1c36d415c831d3c0563fa517e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T21:41:12Z","title_canon_sha256":"db009521ef20449143bf60c526a34203dcf67e66d7556e4b65746018d44825fe"},"schema_version":"1.0","source":{"id":"1507.00773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00773","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00773v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00773","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"HORYSJQGHS3G","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HORYSJQGHS3G344U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HORYSJQG","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:f1d136c35975558d24544b540404228b3a6b232f3228ca6b184c34cdceb6f9be","target":"graph","created_at":"2026-05-18T01:37:22Z","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 study online mechanisms for preemptive scheduling with deadlines, with the goal of maximizing the total value of completed jobs. This problem is fundamental to deadline-aware cloud scheduling, but there are strong lower bounds even for the algorithmic problem without incentive constraints. However, these lower bounds can be circumvented under the natural assumption of deadline slackness, i.e., that there is a guaranteed lower bound $s > 1$ on the ratio between a job's size and the time window in which it can be executed.\n  In this paper, we construct a truthful scheduling mechanism with a c","authors_text":"Brendan Lucier, Inna Kalp-Shaltiel, Ishai Menache, Jonathan Yaniv, Joseph (Seffi) Naor, Yossi Azar","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T21:41:12Z","title":"Truthful Online Scheduling with Commitments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00773","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:947c42f00e2785acd1c266569b2f9008304784670b7f6dbc1f711bd6a47f3e69","target":"record","created_at":"2026-05-18T01:37:22Z","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":"e205ad4d70c56550f471de08b3dee6a6cceac7b1c36d415c831d3c0563fa517e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T21:41:12Z","title_canon_sha256":"db009521ef20449143bf60c526a34203dcf67e66d7556e4b65746018d44825fe"},"schema_version":"1.0","source":{"id":"1507.00773","kind":"arxiv","version":1}},"canonical_sha256":"3ba38926063cb66df3944b6b3a1985cc6106b492dd4ea38fc0f9dcae80f2409d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba38926063cb66df3944b6b3a1985cc6106b492dd4ea38fc0f9dcae80f2409d","first_computed_at":"2026-05-18T01:37:22.750864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:22.750864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5cUjV2oOIbEFQi4vDe8xjvRBvnKkDE8AN6FMWHXB4zLpFGOzPu3eOGdm9gVjqbjNpWzIgRMTdI/JOuYiGAGbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:22.751517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:947c42f00e2785acd1c266569b2f9008304784670b7f6dbc1f711bd6a47f3e69","sha256:f1d136c35975558d24544b540404228b3a6b232f3228ca6b184c34cdceb6f9be"],"state_sha256":"3d209af7fe07044c97ca5d0fb232c6191d1126796ee00f0d206507b231e5c0df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g62zUtP7vshSRPUtCccyV3MB+DqQGLOyzGxmxMU1iW5nwfKPc6r89o9u/3h+aIFWktcYi4sI3VeqtJpAei1VDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:40:22.576604Z","bundle_sha256":"c8410939d43c8ad65bf5e7e2f1ac18eb746919d65114a80eea72c8ef7ec3ac7e"}}