{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4M3N3EKCHJWNUVAZGFEG2GWUZB","short_pith_number":"pith:4M3N3EKC","canonical_record":{"source":{"id":"1101.1718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"e0081e54ae58ebeb61a933c5719fe19496265951ba6b3130e248f4330cf3cdbb","abstract_canon_sha256":"cf7a9dca99eea13323bdc2e7ca7760bd302087ee3aca58b8e5eb1dff0c626026"},"schema_version":"1.0"},"canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","source":{"kind":"arxiv","id":"1101.1718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1718","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1718v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1718","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4M3N3EKCHJWN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4M3N3EKCHJWNUVAZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4M3N3EKC","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4M3N3EKCHJWNUVAZGFEG2GWUZB","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"e0081e54ae58ebeb61a933c5719fe19496265951ba6b3130e248f4330cf3cdbb","abstract_canon_sha256":"cf7a9dca99eea13323bdc2e7ca7760bd302087ee3aca58b8e5eb1dff0c626026"},"schema_version":"1.0"},"canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:51.845289Z","signature_b64":"TeXm3SY97WS4hewldtU1idXR0ltAhD+HOoAbOU/dVpNTFB4vagfSH53tzEx+Y6xyuzO+ZIaz9jz6wHc9BXLJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","last_reissued_at":"2026-05-18T04:31:51.844859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:51.844859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1718","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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWyLOSIeTODUh9hIjqoUWQbBzHNzHwHzX6Fzhc3Zn8EhTjbf1EgEqfGXUiicavsu7PaRF6OMJhVMAfU08uQ+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:15:22.448286Z"},"content_sha256":"ae05d7daa9e960a828faca8b7ffb57f16a5127ea263c6fea6fbe27c64334754f","schema_version":"1.0","event_id":"sha256:ae05d7daa9e960a828faca8b7ffb57f16a5127ea263c6fea6fbe27c64334754f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4M3N3EKCHJWNUVAZGFEG2GWUZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jagbeer Singh","submitted_at":"2011-01-10T08:31:45Z","abstract_excerpt":"In Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Many real-time scheduling algorithms have been developed recently to reduce affinity in the portable devices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1718","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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8eN3L+KVLUJ0vLNT23bPEj5duK01rJxWmFFPHinMnDbwgvsyeiLirLCXU0v+uQlDDHJApx0LftHh2W/+uRkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:15:22.448748Z"},"content_sha256":"cdb9b1c489b9e0f1843a14c80f979884d23b9070e4aedfa1e191dafdb9f58f4e","schema_version":"1.0","event_id":"sha256:cdb9b1c489b9e0f1843a14c80f979884d23b9070e4aedfa1e191dafdb9f58f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/bundle.json","state_url":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/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-08-05T00:15:22Z","links":{"resolver":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB","bundle":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/bundle.json","state":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4M3N3EKCHJWNUVAZGFEG2GWUZB","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":"cf7a9dca99eea13323bdc2e7ca7760bd302087ee3aca58b8e5eb1dff0c626026","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","title_canon_sha256":"e0081e54ae58ebeb61a933c5719fe19496265951ba6b3130e248f4330cf3cdbb"},"schema_version":"1.0","source":{"id":"1101.1718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1718","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1718v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1718","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4M3N3EKCHJWN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4M3N3EKCHJWNUVAZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4M3N3EKC","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:cdb9b1c489b9e0f1843a14c80f979884d23b9070e4aedfa1e191dafdb9f58f4e","target":"graph","created_at":"2026-05-18T04:31:51Z","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 Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Many real-time scheduling algorithms have been developed recently to reduce affinity in the portable devices","authors_text":"Jagbeer Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","title":"Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1718","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:ae05d7daa9e960a828faca8b7ffb57f16a5127ea263c6fea6fbe27c64334754f","target":"record","created_at":"2026-05-18T04:31:51Z","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":"cf7a9dca99eea13323bdc2e7ca7760bd302087ee3aca58b8e5eb1dff0c626026","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","title_canon_sha256":"e0081e54ae58ebeb61a933c5719fe19496265951ba6b3130e248f4330cf3cdbb"},"schema_version":"1.0","source":{"id":"1101.1718","kind":"arxiv","version":1}},"canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","first_computed_at":"2026-05-18T04:31:51.844859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:51.844859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TeXm3SY97WS4hewldtU1idXR0ltAhD+HOoAbOU/dVpNTFB4vagfSH53tzEx+Y6xyuzO+ZIaz9jz6wHc9BXLJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:51.845289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae05d7daa9e960a828faca8b7ffb57f16a5127ea263c6fea6fbe27c64334754f","sha256:cdb9b1c489b9e0f1843a14c80f979884d23b9070e4aedfa1e191dafdb9f58f4e"],"state_sha256":"a3b3680a798f27e132147245407b6b9c505ffb6b5df74aba9099259d9c834d64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4GOiSyohU+nqB2+kT/qM3wPYLgRrfD2/WLIO5+jSaGXRKptoZoojsbDlHgc25yIMrVWvxgo5yZpMS2U1q5UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:15:22.453175Z","bundle_sha256":"9f8ed0378b965f2381fad8b99405cf04351a2fef79e00b2231df963d649efdfc"}}