{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RH524NDR6ILHZETJSQMCLPG43P","short_pith_number":"pith:RH524NDR","canonical_record":{"source":{"id":"1507.01981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T22:28:39Z","cross_cats_sorted":[],"title_canon_sha256":"59cee6dd5f8b5916b4d076aede8bb0a1b057f9aad4aa7f634b8f5f4f3660b3c5","abstract_canon_sha256":"09549cf3b0bec3e9bea77aa9b837084ad474fd54a3e58f69cc1c51c21289c0ff"},"schema_version":"1.0"},"canonical_sha256":"89fbae3471f2167c9269941825bcdcdbcd7491fad32a13854bca4c7c6b25cc46","source":{"kind":"arxiv","id":"1507.01981","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01981","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01981v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01981","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"RH524NDR6ILH","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RH524NDR6ILHZETJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RH524NDR","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RH524NDR6ILHZETJSQMCLPG43P","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T22:28:39Z","cross_cats_sorted":[],"title_canon_sha256":"59cee6dd5f8b5916b4d076aede8bb0a1b057f9aad4aa7f634b8f5f4f3660b3c5","abstract_canon_sha256":"09549cf3b0bec3e9bea77aa9b837084ad474fd54a3e58f69cc1c51c21289c0ff"},"schema_version":"1.0"},"canonical_sha256":"89fbae3471f2167c9269941825bcdcdbcd7491fad32a13854bca4c7c6b25cc46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.425853Z","signature_b64":"VwUqE9Ms4deDEAR/p5cC3iYMwuZJ8SLCnHaNb4nW/K6f5NXLNqgE9gNPB03p4WeuZXEWF8ho49sIYLuRnvcGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89fbae3471f2167c9269941825bcdcdbcd7491fad32a13854bca4c7c6b25cc46","last_reissued_at":"2026-05-18T01:20:50.425386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.425386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01981","source_version":2,"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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4kCOIsHw/yi8ygiD19GIKPD1N2HHtOSCWHPsGkQGP9IKl12QDG7so4bTMZznyP6/ht5NVH5Jyvo1DJsQ4uLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:48:11.269228Z"},"content_sha256":"60d8a04a024aba9cfa60af55e16db217134f831931f91c9fe8b172a8a3b9e5a2","schema_version":"1.0","event_id":"sha256:60d8a04a024aba9cfa60af55e16db217134f831931f91c9fe8b172a8a3b9e5a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RH524NDR6ILHZETJSQMCLPG43P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Reallocation Problems in Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seth Gilbert, Wei Quan Lim, Wei Zhong Lim","submitted_at":"2015-07-07T22:28:39Z","abstract_excerpt":"In this paper we look at the problem of scheduling tasks on a single-processor system, where each task requires unit time and must be scheduled within a certain time window, and each task can be added to or removed from the system at any time. On each operation, the system is allowed to reschedule any tasks, but the goal is to minimize the number of rescheduled tasks. Our main result is an allocator that maintains a valid schedule for all tasks in the system if their time windows have constant size and reschedules O(1/{\\epsilon}*log(1/{\\epsilon})) tasks on each insertion as {\\epsilon}->0, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01981","kind":"arxiv","version":2},"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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tHPveyzFGnAxXATiWne4RBTpXTBSHqfRKS8fWJaXMae1PylAQ0QbqBsdYpFLcMC9h1ws4vddMhfbAEjuB9xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:48:11.269600Z"},"content_sha256":"608d73275a3889f7688395d14b7b6a251e16831a7ab5bcade1aa723395f78830","schema_version":"1.0","event_id":"sha256:608d73275a3889f7688395d14b7b6a251e16831a7ab5bcade1aa723395f78830"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RH524NDR6ILHZETJSQMCLPG43P/bundle.json","state_url":"https://pith.science/pith/RH524NDR6ILHZETJSQMCLPG43P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RH524NDR6ILHZETJSQMCLPG43P/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-07-06T10:48:11Z","links":{"resolver":"https://pith.science/pith/RH524NDR6ILHZETJSQMCLPG43P","bundle":"https://pith.science/pith/RH524NDR6ILHZETJSQMCLPG43P/bundle.json","state":"https://pith.science/pith/RH524NDR6ILHZETJSQMCLPG43P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RH524NDR6ILHZETJSQMCLPG43P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RH524NDR6ILHZETJSQMCLPG43P","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":"09549cf3b0bec3e9bea77aa9b837084ad474fd54a3e58f69cc1c51c21289c0ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T22:28:39Z","title_canon_sha256":"59cee6dd5f8b5916b4d076aede8bb0a1b057f9aad4aa7f634b8f5f4f3660b3c5"},"schema_version":"1.0","source":{"id":"1507.01981","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01981","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01981v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01981","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"RH524NDR6ILH","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RH524NDR6ILHZETJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RH524NDR","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:608d73275a3889f7688395d14b7b6a251e16831a7ab5bcade1aa723395f78830","target":"graph","created_at":"2026-05-18T01:20:50Z","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":"In this paper we look at the problem of scheduling tasks on a single-processor system, where each task requires unit time and must be scheduled within a certain time window, and each task can be added to or removed from the system at any time. On each operation, the system is allowed to reschedule any tasks, but the goal is to minimize the number of rescheduled tasks. Our main result is an allocator that maintains a valid schedule for all tasks in the system if their time windows have constant size and reschedules O(1/{\\epsilon}*log(1/{\\epsilon})) tasks on each insertion as {\\epsilon}->0, wher","authors_text":"Seth Gilbert, Wei Quan Lim, Wei Zhong Lim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T22:28:39Z","title":"Dynamic Reallocation Problems in Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01981","kind":"arxiv","version":2},"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:60d8a04a024aba9cfa60af55e16db217134f831931f91c9fe8b172a8a3b9e5a2","target":"record","created_at":"2026-05-18T01:20:50Z","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":"09549cf3b0bec3e9bea77aa9b837084ad474fd54a3e58f69cc1c51c21289c0ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T22:28:39Z","title_canon_sha256":"59cee6dd5f8b5916b4d076aede8bb0a1b057f9aad4aa7f634b8f5f4f3660b3c5"},"schema_version":"1.0","source":{"id":"1507.01981","kind":"arxiv","version":2}},"canonical_sha256":"89fbae3471f2167c9269941825bcdcdbcd7491fad32a13854bca4c7c6b25cc46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89fbae3471f2167c9269941825bcdcdbcd7491fad32a13854bca4c7c6b25cc46","first_computed_at":"2026-05-18T01:20:50.425386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.425386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VwUqE9Ms4deDEAR/p5cC3iYMwuZJ8SLCnHaNb4nW/K6f5NXLNqgE9gNPB03p4WeuZXEWF8ho49sIYLuRnvcGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.425853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01981","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60d8a04a024aba9cfa60af55e16db217134f831931f91c9fe8b172a8a3b9e5a2","sha256:608d73275a3889f7688395d14b7b6a251e16831a7ab5bcade1aa723395f78830"],"state_sha256":"737beed3ce54e68c7701fee65c50de3c1062eeee2da742e0b68e5004c197935b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhJkLaD/9pyctMWWz44xJJTrHG9ZXTO8wRzyvxHLacH+QDf53NnJe41wdIA/IdA1yKQrA61gixwCKQNLsD+PAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:48:11.271457Z","bundle_sha256":"03e3604c34ea2653c5f0a788c4d7eeb76845b2654e4bc6834331a23d186ba4d6"}}