{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XDMPJMWLDNINLPTKGE55Q7IEDZ","short_pith_number":"pith:XDMPJMWL","canonical_record":{"source":{"id":"1205.0124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-05-01T09:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"a998409d11cccca8e6f44b7d5eebc4dcf663789b698c5fdbf5404f7cabbed1f0","abstract_canon_sha256":"402509a6634b37de327e7263e86e3f1b40665f1dacabf942329180f39a490c1f"},"schema_version":"1.0"},"canonical_sha256":"b8d8f4b2cb1b50d5be6a313bd87d041e75cdaf9812b79ccda60084e697f46622","source":{"kind":"arxiv","id":"1205.0124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0124","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0124v1","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0124","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"XDMPJMWLDNIN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDMPJMWLDNINLPTK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDMPJMWL","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XDMPJMWLDNINLPTKGE55Q7IEDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-05-01T09:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"a998409d11cccca8e6f44b7d5eebc4dcf663789b698c5fdbf5404f7cabbed1f0","abstract_canon_sha256":"402509a6634b37de327e7263e86e3f1b40665f1dacabf942329180f39a490c1f"},"schema_version":"1.0"},"canonical_sha256":"b8d8f4b2cb1b50d5be6a313bd87d041e75cdaf9812b79ccda60084e697f46622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.824256Z","signature_b64":"qqRfYuyeC1lZYLLFt8ZZsJIIyTyYAGy7ji+LCBkTcg3w+gm/Z0uW/etWI4Xcp6wcMm0lRe3xxUXrT1IKyui4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d8f4b2cb1b50d5be6a313bd87d041e75cdaf9812b79ccda60084e697f46622","last_reissued_at":"2026-05-18T03:56:35.823725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.823725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0124","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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXFQvOsko9ohJKb5TNcQgzbqZSzITgdwzf/sGOSQgpkAo+89IQx+2sjrZ1yIPaxp6ZhYNucxzh41xgsv6GjdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T20:49:18.641148Z"},"content_sha256":"ceb612b5cf3687587c998a22849424649c3151cd62a77c796208c8e562aae9d9","schema_version":"1.0","event_id":"sha256:ceb612b5cf3687587c998a22849424649c3151cd62a77c796208c8e562aae9d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XDMPJMWLDNINLPTKGE55Q7IEDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Jagbeer Singh, Satyendra Prasad Singh","submitted_at":"2012-05-01T09:17:43Z","abstract_excerpt":"This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors): on M processors, all known EDF variants have utilization-based schedulability bounds of approximately M/2, while RMA algorithms can fully utilize all processors. This is unfortunate bec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0124","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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8x35z4v0qw47/P9Buoh30DUsMUTbgVcNMBligHn53n8W5MgSa9BNIdPkdUCA1diRXE4vz0vraMqCTfYYIcB2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T20:49:18.641505Z"},"content_sha256":"352de2a8c87c4affad5554848d861618a505fa24604f4842e3a61365dc57adf7","schema_version":"1.0","event_id":"sha256:352de2a8c87c4affad5554848d861618a505fa24604f4842e3a61365dc57adf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/bundle.json","state_url":"https://pith.science/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/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-19T20:49:18Z","links":{"resolver":"https://pith.science/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ","bundle":"https://pith.science/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/bundle.json","state":"https://pith.science/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDMPJMWLDNINLPTKGE55Q7IEDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XDMPJMWLDNINLPTKGE55Q7IEDZ","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":"402509a6634b37de327e7263e86e3f1b40665f1dacabf942329180f39a490c1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-05-01T09:17:43Z","title_canon_sha256":"a998409d11cccca8e6f44b7d5eebc4dcf663789b698c5fdbf5404f7cabbed1f0"},"schema_version":"1.0","source":{"id":"1205.0124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0124","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0124v1","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0124","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"XDMPJMWLDNIN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDMPJMWLDNINLPTK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDMPJMWL","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:352de2a8c87c4affad5554848d861618a505fa24604f4842e3a61365dc57adf7","target":"graph","created_at":"2026-05-18T03:56: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":"This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors): on M processors, all known EDF variants have utilization-based schedulability bounds of approximately M/2, while RMA algorithms can fully utilize all processors. This is unfortunate bec","authors_text":"Jagbeer Singh, Satyendra Prasad Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-05-01T09:17:43Z","title":"Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0124","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:ceb612b5cf3687587c998a22849424649c3151cd62a77c796208c8e562aae9d9","target":"record","created_at":"2026-05-18T03:56: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":"402509a6634b37de327e7263e86e3f1b40665f1dacabf942329180f39a490c1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-05-01T09:17:43Z","title_canon_sha256":"a998409d11cccca8e6f44b7d5eebc4dcf663789b698c5fdbf5404f7cabbed1f0"},"schema_version":"1.0","source":{"id":"1205.0124","kind":"arxiv","version":1}},"canonical_sha256":"b8d8f4b2cb1b50d5be6a313bd87d041e75cdaf9812b79ccda60084e697f46622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8d8f4b2cb1b50d5be6a313bd87d041e75cdaf9812b79ccda60084e697f46622","first_computed_at":"2026-05-18T03:56:35.823725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:35.823725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qqRfYuyeC1lZYLLFt8ZZsJIIyTyYAGy7ji+LCBkTcg3w+gm/Z0uW/etWI4Xcp6wcMm0lRe3xxUXrT1IKyui4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:35.824256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceb612b5cf3687587c998a22849424649c3151cd62a77c796208c8e562aae9d9","sha256:352de2a8c87c4affad5554848d861618a505fa24604f4842e3a61365dc57adf7"],"state_sha256":"b2ae59e5a114fd30b251fda7218fe5529ec4b9d75c54268bcc56f1c8cbf41fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/vBER6qTNfDTGjmHG22qXhwpzN4nZWToFIJIgf/mnLqIV/p9Cx6vcUuAdor4iPXnqOSt1Z189MWjKt/5cvSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T20:49:18.644196Z","bundle_sha256":"7612c36376d3d46e0327a851b8567ab13a5f6131ae99d96e8eaf8c7c1f491983"}}