{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TUSOJTNDJ2YN4GO5LHZXOR7ZBN","short_pith_number":"pith:TUSOJTND","canonical_record":{"source":{"id":"1101.0056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc4a23514bae90f141f895660c0a42a1f7ef6e6851968503b5990434510e65ef","abstract_canon_sha256":"e58a675ac77e0b3acff195706661e14db559fb49baf9a2589ba93f6d1f3b30d9"},"schema_version":"1.0"},"canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","source":{"kind":"arxiv","id":"1101.0056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0056","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0056v1","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0056","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"TUSOJTNDJ2YN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TUSOJTNDJ2YN4GO5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TUSOJTND","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TUSOJTNDJ2YN4GO5LHZXOR7ZBN","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc4a23514bae90f141f895660c0a42a1f7ef6e6851968503b5990434510e65ef","abstract_canon_sha256":"e58a675ac77e0b3acff195706661e14db559fb49baf9a2589ba93f6d1f3b30d9"},"schema_version":"1.0"},"canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.127372Z","signature_b64":"4n79DX0P5JYk0jrztgGOD0Mo0pl/ElTz+cSAaAiqUV0NWDqCjzxlStV6+zcT/jdEAv1QryGvyNGh60PMr6OnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","last_reissued_at":"2026-05-18T04:32:11.126703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.126703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0056","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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dM6x/FAaCVj0Dy+jBH5c3iGmWTzgLL7RxShCTttznJ2qzul4uuh7D+lnDlmiVbpBwEFknuVE3z6jBGFA4EwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T18:03:44.042743Z"},"content_sha256":"0536af2fd234950a1cb7198f77159c2aa38c02c5ccf2aa2881f528335aabf3ec","schema_version":"1.0","event_id":"sha256:0536af2fd234950a1cb7198f77159c2aa38c02c5ccf2aa2881f528335aabf3ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TUSOJTNDJ2YN4GO5LHZXOR7ZBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jagbeer Singh","submitted_at":"2010-12-30T08:50:49Z","abstract_excerpt":"In this paper I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for Earliest Deadline First (EDF) are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. I have applied some modification to the global Earliest Deadline First (EDF) algorithms to decrease the number of task migration and also to add pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0056","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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Paem0rnJ9sjgM6LGRZJr4WkM4exhPZWssx1ddf8I0MtMmUA00/S78QsweW8TXgG9kr/oCUvrgRsYHfBKThFtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T18:03:44.043091Z"},"content_sha256":"19abbb5688c7ea9f55b1cc03477dcaf6dfaa7ddcfcd883790f17bc3d5991490b","schema_version":"1.0","event_id":"sha256:19abbb5688c7ea9f55b1cc03477dcaf6dfaa7ddcfcd883790f17bc3d5991490b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/bundle.json","state_url":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/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-17T18:03:44Z","links":{"resolver":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN","bundle":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/bundle.json","state":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TUSOJTNDJ2YN4GO5LHZXOR7ZBN","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":"e58a675ac77e0b3acff195706661e14db559fb49baf9a2589ba93f6d1f3b30d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","title_canon_sha256":"bc4a23514bae90f141f895660c0a42a1f7ef6e6851968503b5990434510e65ef"},"schema_version":"1.0","source":{"id":"1101.0056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0056","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0056v1","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0056","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"TUSOJTNDJ2YN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TUSOJTNDJ2YN4GO5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TUSOJTND","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:19abbb5688c7ea9f55b1cc03477dcaf6dfaa7ddcfcd883790f17bc3d5991490b","target":"graph","created_at":"2026-05-18T04:32:11Z","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 I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for Earliest Deadline First (EDF) are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. I have applied some modification to the global Earliest Deadline First (EDF) algorithms to decrease the number of task migration and also to add pr","authors_text":"Jagbeer Singh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","title":"An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0056","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:0536af2fd234950a1cb7198f77159c2aa38c02c5ccf2aa2881f528335aabf3ec","target":"record","created_at":"2026-05-18T04:32:11Z","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":"e58a675ac77e0b3acff195706661e14db559fb49baf9a2589ba93f6d1f3b30d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","title_canon_sha256":"bc4a23514bae90f141f895660c0a42a1f7ef6e6851968503b5990434510e65ef"},"schema_version":"1.0","source":{"id":"1101.0056","kind":"arxiv","version":1}},"canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","first_computed_at":"2026-05-18T04:32:11.126703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:11.126703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4n79DX0P5JYk0jrztgGOD0Mo0pl/ElTz+cSAaAiqUV0NWDqCjzxlStV6+zcT/jdEAv1QryGvyNGh60PMr6OnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:11.127372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0536af2fd234950a1cb7198f77159c2aa38c02c5ccf2aa2881f528335aabf3ec","sha256:19abbb5688c7ea9f55b1cc03477dcaf6dfaa7ddcfcd883790f17bc3d5991490b"],"state_sha256":"17d1bc662b50e6b955dece805395eeabbc43e492c73c79baebde549c70381274"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0vPgghricpkImXa4/cp9gkss47YGdBHEa1Yd6g+6xFm4zE/llxFQFpoyaRo3ZUysufHgaPjS2ryebu5zhkYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T18:03:44.045228Z","bundle_sha256":"e24462cac91d27c96daa257cce98ee658039bea27c8b3fde4a6cc0d92ddbb061"}}