{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MXPMXORO4OE3F675CKNB7BPEGA","short_pith_number":"pith:MXPMXORO","canonical_record":{"source":{"id":"1001.3756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-01-21T10:18:43Z","cross_cats_sorted":[],"title_canon_sha256":"1bd122d6b51d003c9f3a724880fbc96735725aad0f86c4ba3c081c3357b3d454","abstract_canon_sha256":"d93317053fd8494b61347de2ab58f1f813877eae8ad55a219df35a8b28f10fae"},"schema_version":"1.0"},"canonical_sha256":"65decbba2ee389b2fbfd129a1f85e43028876584d8ad8b6bbde6af89db411467","source":{"kind":"arxiv","id":"1001.3756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3756","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3756v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3756","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"MXPMXORO4OE3","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MXPMXORO4OE3F675","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MXPMXORO","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MXPMXORO4OE3F675CKNB7BPEGA","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-01-21T10:18:43Z","cross_cats_sorted":[],"title_canon_sha256":"1bd122d6b51d003c9f3a724880fbc96735725aad0f86c4ba3c081c3357b3d454","abstract_canon_sha256":"d93317053fd8494b61347de2ab58f1f813877eae8ad55a219df35a8b28f10fae"},"schema_version":"1.0"},"canonical_sha256":"65decbba2ee389b2fbfd129a1f85e43028876584d8ad8b6bbde6af89db411467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.903947Z","signature_b64":"+zAWbLglySz2F3lJRaIX5gfuA2AjxhOhn7gxzLjTtF0QqRXundJEflWFqHtlZ2BE0EeTQntzp4DhoLSKUAHFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65decbba2ee389b2fbfd129a1f85e43028876584d8ad8b6bbde6af89db411467","last_reissued_at":"2026-05-18T01:04:58.903371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.903371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3756","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":"WYw2UeEXJqbWPNRSX0M6lOzq7mgvl5p5/VNK9YT9K82pccVJr5FT95sb6caoOGC7mQuKmPKZU3XXOt4GDlDVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:04.628999Z"},"content_sha256":"419d4871efeba94b0a78a543543484758c5da03a4116da543f0c3bc7df3f3fbc","schema_version":"1.0","event_id":"sha256:419d4871efeba94b0a78a543543484758c5da03a4116da543f0c3bc7df3f3fbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MXPMXORO4OE3F675CKNB7BPEGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault Tolerant Real Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"A. Christy Persya, T.R.Gopalakrishnan Nair","submitted_at":"2010-01-21T10:18:43Z","abstract_excerpt":"Real time systems are systems in which there is a commitment for timely response by the computer to external stimuli. Real time applications have to function correctly even in presence of faults. Fault tolerance can be achieved by either hardware or software or time redundancy. Safety-critical applications have strict time and cost constraints, which means that not only faults have to be tolerated but also the constraints should be satisfied. Deadline scheduling means that the taskwith the earliest required response time is processed. The most common scheduling algorithms are :Rate Monotonic(R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3756","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":"xxlEOaG5YfT8t6370eSahtwAuo1AUDBmF+/u+f8H778YAUkm1q+WHkaqK4D2dlOOkdERTRRj5WUwROS+wkcrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:04.629356Z"},"content_sha256":"40c310ba17ec824b9f5d7cca8d096f35581ba912e5d79df7eb125eb0b6e9c51b","schema_version":"1.0","event_id":"sha256:40c310ba17ec824b9f5d7cca8d096f35581ba912e5d79df7eb125eb0b6e9c51b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXPMXORO4OE3F675CKNB7BPEGA/bundle.json","state_url":"https://pith.science/pith/MXPMXORO4OE3F675CKNB7BPEGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXPMXORO4OE3F675CKNB7BPEGA/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-02T22:20:04Z","links":{"resolver":"https://pith.science/pith/MXPMXORO4OE3F675CKNB7BPEGA","bundle":"https://pith.science/pith/MXPMXORO4OE3F675CKNB7BPEGA/bundle.json","state":"https://pith.science/pith/MXPMXORO4OE3F675CKNB7BPEGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXPMXORO4OE3F675CKNB7BPEGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MXPMXORO4OE3F675CKNB7BPEGA","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":"d93317053fd8494b61347de2ab58f1f813877eae8ad55a219df35a8b28f10fae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-01-21T10:18:43Z","title_canon_sha256":"1bd122d6b51d003c9f3a724880fbc96735725aad0f86c4ba3c081c3357b3d454"},"schema_version":"1.0","source":{"id":"1001.3756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3756","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3756v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3756","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"MXPMXORO4OE3","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MXPMXORO4OE3F675","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MXPMXORO","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:40c310ba17ec824b9f5d7cca8d096f35581ba912e5d79df7eb125eb0b6e9c51b","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":"Real time systems are systems in which there is a commitment for timely response by the computer to external stimuli. Real time applications have to function correctly even in presence of faults. Fault tolerance can be achieved by either hardware or software or time redundancy. Safety-critical applications have strict time and cost constraints, which means that not only faults have to be tolerated but also the constraints should be satisfied. Deadline scheduling means that the taskwith the earliest required response time is processed. The most common scheduling algorithms are :Rate Monotonic(R","authors_text":"A. Christy Persya, T.R.Gopalakrishnan Nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-01-21T10:18:43Z","title":"Fault Tolerant Real Time Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3756","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:419d4871efeba94b0a78a543543484758c5da03a4116da543f0c3bc7df3f3fbc","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":"d93317053fd8494b61347de2ab58f1f813877eae8ad55a219df35a8b28f10fae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-01-21T10:18:43Z","title_canon_sha256":"1bd122d6b51d003c9f3a724880fbc96735725aad0f86c4ba3c081c3357b3d454"},"schema_version":"1.0","source":{"id":"1001.3756","kind":"arxiv","version":1}},"canonical_sha256":"65decbba2ee389b2fbfd129a1f85e43028876584d8ad8b6bbde6af89db411467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65decbba2ee389b2fbfd129a1f85e43028876584d8ad8b6bbde6af89db411467","first_computed_at":"2026-05-18T01:04:58.903371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:58.903371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zAWbLglySz2F3lJRaIX5gfuA2AjxhOhn7gxzLjTtF0QqRXundJEflWFqHtlZ2BE0EeTQntzp4DhoLSKUAHFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:58.903947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419d4871efeba94b0a78a543543484758c5da03a4116da543f0c3bc7df3f3fbc","sha256:40c310ba17ec824b9f5d7cca8d096f35581ba912e5d79df7eb125eb0b6e9c51b"],"state_sha256":"696ac9bb3c6340439f80aeb6ef29517514dc345c3063680d9ba5cc1349f24154"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRAtOLiHl8eKBxdDiINKML/SDC5dPvJhcnX0AAPOKthRq+QbYVllGoR0gZJ9I9qrXd11vhECgCgF3ypbiCqnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:20:04.631397Z","bundle_sha256":"2889173264e4dd05c65997815b8cac14b1e6d4c8a7e85805f07e316ce7df817b"}}