{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LR5HO4IIM2Y6P6P54DB6S52MCZ","short_pith_number":"pith:LR5HO4II","canonical_record":{"source":{"id":"1001.3727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-21T06:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"7e2c0a6fe1df69547c32346cb9f1f7319586473470dacc21ae47ef1b9d97eaf3","abstract_canon_sha256":"e4481f22023f6297e433291e42c6b71102fd592d94f38e33a9c19437dd4fcf83"},"schema_version":"1.0"},"canonical_sha256":"5c7a77710866b1e7f9fde0c3e9774c16458bc15794ed9ce19adccde3c8faa5a4","source":{"kind":"arxiv","id":"1001.3727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3727","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3727v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3727","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"LR5HO4IIM2Y6","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LR5HO4IIM2Y6P6P5","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LR5HO4II","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LR5HO4IIM2Y6P6P54DB6S52MCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-21T06:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"7e2c0a6fe1df69547c32346cb9f1f7319586473470dacc21ae47ef1b9d97eaf3","abstract_canon_sha256":"e4481f22023f6297e433291e42c6b71102fd592d94f38e33a9c19437dd4fcf83"},"schema_version":"1.0"},"canonical_sha256":"5c7a77710866b1e7f9fde0c3e9774c16458bc15794ed9ce19adccde3c8faa5a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.963446Z","signature_b64":"wBh1iCgX90ubiRF+UbBYwF9BQyagX9WwqqvIRvbKsX0R/iE95QvV1ZNEfzGOgPdUKlS9q+Z/Sn1rEFuxgM8TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7a77710866b1e7f9fde0c3e9774c16458bc15794ed9ce19adccde3c8faa5a4","last_reissued_at":"2026-05-18T01:04:58.962788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.962788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3727","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEpJeaj7H+KAkt7caMXrAsOGjDUhmPJLQA77x4SP/Nem4JJshMoCtT1KQJtDsf/XgBkQISYzo920ctcfL33hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:49:05.966090Z"},"content_sha256":"2649787f8fbeb55cdf8535bd9bce474379252f28fb35c9daf8c3f6097acaa6cb","schema_version":"1.0","event_id":"sha256:2649787f8fbeb55cdf8535bd9bce474379252f28fb35c9daf8c3f6097acaa6cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LR5HO4IIM2Y6P6P54DB6S52MCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault Tolerance in Real Time Multiprocessors - Embedded Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"A. Christy Persya, T.R. GopalaKrishnan nair","submitted_at":"2010-01-21T06:02:41Z","abstract_excerpt":"All real time tasks which are termed as critical tasks by nature have to complete its execution before its deadline, even in presence of faults. The most popularly used real time task assignment algorithms are First Fit (FF), Best Fit (BF), Bin Packing (BP).The common task scheduling algorithms are Rate Monotonic (RM), Earliest Deadline First (EDF) etc.All the current approaches deal with either fault tolerance or criticality in real time. In this paper we have proposed an integrated approach with a new algorithm, called SASA (Sorting And Sequential Assignment) which maps the real time task as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3727","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6TACUibyzTGvLTbILHQ0Xt/rCx4ZKti/F+SBDifpyoUlIujyjAoxQYDbj5zS3xJkAeIJHhfBeZvmRZgh/ssBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:49:05.966627Z"},"content_sha256":"142e8963d5e4bc507f826ce47ecef5c1670208b4044e7098539996d2f91cfb24","schema_version":"1.0","event_id":"sha256:142e8963d5e4bc507f826ce47ecef5c1670208b4044e7098539996d2f91cfb24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/bundle.json","state_url":"https://pith.science/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/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-23T18:49:05Z","links":{"resolver":"https://pith.science/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ","bundle":"https://pith.science/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/bundle.json","state":"https://pith.science/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR5HO4IIM2Y6P6P54DB6S52MCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LR5HO4IIM2Y6P6P54DB6S52MCZ","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":"e4481f22023f6297e433291e42c6b71102fd592d94f38e33a9c19437dd4fcf83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-21T06:02:41Z","title_canon_sha256":"7e2c0a6fe1df69547c32346cb9f1f7319586473470dacc21ae47ef1b9d97eaf3"},"schema_version":"1.0","source":{"id":"1001.3727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3727","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3727v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3727","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"LR5HO4IIM2Y6","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LR5HO4IIM2Y6P6P5","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LR5HO4II","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:142e8963d5e4bc507f826ce47ecef5c1670208b4044e7098539996d2f91cfb24","target":"graph","created_at":"2026-05-18T01:04:58Z","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":"All real time tasks which are termed as critical tasks by nature have to complete its execution before its deadline, even in presence of faults. The most popularly used real time task assignment algorithms are First Fit (FF), Best Fit (BF), Bin Packing (BP).The common task scheduling algorithms are Rate Monotonic (RM), Earliest Deadline First (EDF) etc.All the current approaches deal with either fault tolerance or criticality in real time. In this paper we have proposed an integrated approach with a new algorithm, called SASA (Sorting And Sequential Assignment) which maps the real time task as","authors_text":"A. Christy Persya, T.R. GopalaKrishnan nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-21T06:02:41Z","title":"Fault Tolerance in Real Time Multiprocessors - Embedded Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3727","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:2649787f8fbeb55cdf8535bd9bce474379252f28fb35c9daf8c3f6097acaa6cb","target":"record","created_at":"2026-05-18T01:04:58Z","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":"e4481f22023f6297e433291e42c6b71102fd592d94f38e33a9c19437dd4fcf83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-21T06:02:41Z","title_canon_sha256":"7e2c0a6fe1df69547c32346cb9f1f7319586473470dacc21ae47ef1b9d97eaf3"},"schema_version":"1.0","source":{"id":"1001.3727","kind":"arxiv","version":1}},"canonical_sha256":"5c7a77710866b1e7f9fde0c3e9774c16458bc15794ed9ce19adccde3c8faa5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7a77710866b1e7f9fde0c3e9774c16458bc15794ed9ce19adccde3c8faa5a4","first_computed_at":"2026-05-18T01:04:58.962788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:58.962788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wBh1iCgX90ubiRF+UbBYwF9BQyagX9WwqqvIRvbKsX0R/iE95QvV1ZNEfzGOgPdUKlS9q+Z/Sn1rEFuxgM8TDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:58.963446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2649787f8fbeb55cdf8535bd9bce474379252f28fb35c9daf8c3f6097acaa6cb","sha256:142e8963d5e4bc507f826ce47ecef5c1670208b4044e7098539996d2f91cfb24"],"state_sha256":"a53b841d0adc5989f12c436c2df37ae24205042548d8ea3389d319d70f4851d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJ9Yr5aJPgCOr+4bRRbdocpIWM2hEWXbO7P89iIonDzg737tRGtTk95nAPYr3LWteVrdI3QGTd6/gpaGGUjyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:49:05.969627Z","bundle_sha256":"e05f95c1e45b98e1d538f64be2bcf88493b4ea6dca2334824a5e6c82405493e4"}}