{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SDZLXAXXUOWTN7X7W7OUZ7WZNO","short_pith_number":"pith:SDZLXAXX","canonical_record":{"source":{"id":"1802.10309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T08:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"229b7dbb28d392f42174a3ac2326064383b832cefba3d6903b7935f5731485d9","abstract_canon_sha256":"9fcd432045ddbe574b0e52a88b24a0778652a0557607aebff430733aee4fc5a1"},"schema_version":"1.0"},"canonical_sha256":"90f2bb82f7a3ad36feffb7dd4cfed96baa6b02e5a157b756a1a2602a67c4e3ad","source":{"kind":"arxiv","id":"1802.10309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10309","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10309v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10309","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"SDZLXAXXUOWT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SDZLXAXXUOWTN7X7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SDZLXAXX","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SDZLXAXXUOWTN7X7W7OUZ7WZNO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T08:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"229b7dbb28d392f42174a3ac2326064383b832cefba3d6903b7935f5731485d9","abstract_canon_sha256":"9fcd432045ddbe574b0e52a88b24a0778652a0557607aebff430733aee4fc5a1"},"schema_version":"1.0"},"canonical_sha256":"90f2bb82f7a3ad36feffb7dd4cfed96baa6b02e5a157b756a1a2602a67c4e3ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.529162Z","signature_b64":"mwn55sTTlnFsCIFtdtkcweCSmidzpeNBSmTDTL7SZmqyHLUDhAmsSapH40vq8PIRbCib7uo0bxuzyTjPYK9WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f2bb82f7a3ad36feffb7dd4cfed96baa6b02e5a157b756a1a2602a67c4e3ad","last_reissued_at":"2026-05-18T00:22:17.528506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.528506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10309","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ksgnr2kQrq7xVy9QQQAgU/rNHjMLfrGH1qgXOFIz74ZZG0OTvg7m8oCh16mFaG6nZYfWGu7MuygvI3NUHhK7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:24:01.412250Z"},"content_sha256":"86fc0f6c8d86c1464663643a501f01cf8f32d81cd5937796179304ec0a0f4222","schema_version":"1.0","event_id":"sha256:86fc0f6c8d86c1464663643a501f01cf8f32d81cd5937796179304ec0a0f4222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SDZLXAXXUOWTN7X7W7OUZ7WZNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Non-preemptive Scheduling on Unrelated Machines with Rejections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhinav Srivastav, Benjamin Moseley, Denis Trystram, Giorgio Lucarelli, Nguyen Kim Thang","submitted_at":"2018-02-28T08:40:04Z","abstract_excerpt":"When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving the memory's state and loading data into and out of memory. It is desirable to schedule jobs non-preemptively to avoid the costs of preemption. There is a need for non-preemptive system schedulers on desktops, servers and data centers. Despite this need, there is a gap between theory and practice. Indeed, few non-preemptive \\emph{online} schedulers are known to have strong foundational guarantees. This gap is likely du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10309","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOBvs4mOannjVjLQU2AfzdUv3pFCQz2+ri5vrMoO9qBRLsZbYSMxLSCBaSNY6TZCBxJCBFiEn3tHQWz3UzO9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:24:01.412998Z"},"content_sha256":"55738549b49b7244336c48eb4be698bf1e4756a17db1225caf86e6c33119b413","schema_version":"1.0","event_id":"sha256:55738549b49b7244336c48eb4be698bf1e4756a17db1225caf86e6c33119b413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/bundle.json","state_url":"https://pith.science/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/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-08T17:24:01Z","links":{"resolver":"https://pith.science/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO","bundle":"https://pith.science/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/bundle.json","state":"https://pith.science/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDZLXAXXUOWTN7X7W7OUZ7WZNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SDZLXAXXUOWTN7X7W7OUZ7WZNO","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":"9fcd432045ddbe574b0e52a88b24a0778652a0557607aebff430733aee4fc5a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T08:40:04Z","title_canon_sha256":"229b7dbb28d392f42174a3ac2326064383b832cefba3d6903b7935f5731485d9"},"schema_version":"1.0","source":{"id":"1802.10309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10309","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10309v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10309","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"SDZLXAXXUOWT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SDZLXAXXUOWTN7X7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SDZLXAXX","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:55738549b49b7244336c48eb4be698bf1e4756a17db1225caf86e6c33119b413","target":"graph","created_at":"2026-05-18T00:22:17Z","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":"When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving the memory's state and loading data into and out of memory. It is desirable to schedule jobs non-preemptively to avoid the costs of preemption. There is a need for non-preemptive system schedulers on desktops, servers and data centers. Despite this need, there is a gap between theory and practice. Indeed, few non-preemptive \\emph{online} schedulers are known to have strong foundational guarantees. This gap is likely du","authors_text":"Abhinav Srivastav, Benjamin Moseley, Denis Trystram, Giorgio Lucarelli, Nguyen Kim Thang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T08:40:04Z","title":"Online Non-preemptive Scheduling on Unrelated Machines with Rejections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10309","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:86fc0f6c8d86c1464663643a501f01cf8f32d81cd5937796179304ec0a0f4222","target":"record","created_at":"2026-05-18T00:22:17Z","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":"9fcd432045ddbe574b0e52a88b24a0778652a0557607aebff430733aee4fc5a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T08:40:04Z","title_canon_sha256":"229b7dbb28d392f42174a3ac2326064383b832cefba3d6903b7935f5731485d9"},"schema_version":"1.0","source":{"id":"1802.10309","kind":"arxiv","version":1}},"canonical_sha256":"90f2bb82f7a3ad36feffb7dd4cfed96baa6b02e5a157b756a1a2602a67c4e3ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90f2bb82f7a3ad36feffb7dd4cfed96baa6b02e5a157b756a1a2602a67c4e3ad","first_computed_at":"2026-05-18T00:22:17.528506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:17.528506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mwn55sTTlnFsCIFtdtkcweCSmidzpeNBSmTDTL7SZmqyHLUDhAmsSapH40vq8PIRbCib7uo0bxuzyTjPYK9WAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:17.529162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86fc0f6c8d86c1464663643a501f01cf8f32d81cd5937796179304ec0a0f4222","sha256:55738549b49b7244336c48eb4be698bf1e4756a17db1225caf86e6c33119b413"],"state_sha256":"0684a301e466a0ea03374650d6930991c96661b7222f3db05db85ded5eb45013"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IhVsQP0pIFrwGje6FA9Ics/8ZOX3DewjULsKUzIxDWqYhiR6decXLw5TSX69n8cSDpoHnJwy9UWGVfYs63CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:24:01.417151Z","bundle_sha256":"2f0f0dca59aa161a63cac47279babb7b4232e6c8a7b09f53c2c333e72d32da2d"}}