{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XXBP3OPGTPQ6OI3EVFE5J73MBV","short_pith_number":"pith:XXBP3OPG","canonical_record":{"source":{"id":"1302.1010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-02-05T12:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"c9872fe63f785d945826440c5795e98d658e36d0cce02c19dab552b9c422b001","abstract_canon_sha256":"8c2513eb2651403996fa4f22b0ec1a7a300d277376e029132239476c0edfdd18"},"schema_version":"1.0"},"canonical_sha256":"bdc2fdb9e69be1e72364a949d4ff6c0d5a8237ec9a516d3f049a65a73c0bd0e1","source":{"kind":"arxiv","id":"1302.1010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1010","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1010v1","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1010","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"XXBP3OPGTPQ6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XXBP3OPGTPQ6OI3E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XXBP3OPG","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XXBP3OPGTPQ6OI3EVFE5J73MBV","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-02-05T12:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"c9872fe63f785d945826440c5795e98d658e36d0cce02c19dab552b9c422b001","abstract_canon_sha256":"8c2513eb2651403996fa4f22b0ec1a7a300d277376e029132239476c0edfdd18"},"schema_version":"1.0"},"canonical_sha256":"bdc2fdb9e69be1e72364a949d4ff6c0d5a8237ec9a516d3f049a65a73c0bd0e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:26.461476Z","signature_b64":"8SgERU09eG2rkDsiiV8gE2PLbEJ8cLz4OyE0DnjOfvjyBBZESUF8+7mpZ8aL6FvISg8Y6IAkbO5dYcBKZP4EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdc2fdb9e69be1e72364a949d4ff6c0d5a8237ec9a516d3f049a65a73c0bd0e1","last_reissued_at":"2026-05-18T03:34:26.460920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:26.460920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1010","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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTLyUFqadBpgi9AYxtH45zB+iEV+nSSLN4s0w96N7z/9e9YfbR+azK2bvPqMha4+yKU2oGv/DUqdDBoICe/MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:37.765684Z"},"content_sha256":"2aaf0aac4d9be620170b7063816464ec13c078b7022e39ba1746d12e0ab1b8ba","schema_version":"1.0","event_id":"sha256:2aaf0aac4d9be620170b7063816464ec13c078b7022e39ba1746d12e0ab1b8ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XXBP3OPGTPQ6OI3EVFE5J73MBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Mixed-Criticality System Consistency and Behavior on Multiprocessor Platforms by Means of Multi-Moded Approaches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Fran\\c{c}ois Santy, Geoffrey Nelissen, Jo\\\"el Goossens","submitted_at":"2013-02-05T12:34:18Z","abstract_excerpt":"Recent research in the domain of real-time scheduling theory has tackled the problem of scheduling mixed-criticality systems upon uniprocessor or multiprocessor platforms, with the main objective being to respect the timeliness of the most critical tasks, at the expense of the requirements of the less critical ones. In particular, the less critical tasks are carelessly discarded when the computation demand of (some of) the high critical tasks increases. This might nevertheless result in system failure, as these less critical tasks could be accessing data, the consistency of which should be pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1010","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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xD+PoFYXo2HAiSz+YEpulVxZhlLZHDLJhvIFvQGy6cMg91F2apD5twxJnE+fBtdKKm5izJm8grk8e2GQv0rfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:36:37.766030Z"},"content_sha256":"6bcd3b8f9ca2b5597971c03cf1286e50612e392d3f3a6c4e810498cb5bd420eb","schema_version":"1.0","event_id":"sha256:6bcd3b8f9ca2b5597971c03cf1286e50612e392d3f3a6c4e810498cb5bd420eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/bundle.json","state_url":"https://pith.science/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/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-05-31T03:36:37Z","links":{"resolver":"https://pith.science/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV","bundle":"https://pith.science/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/bundle.json","state":"https://pith.science/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXBP3OPGTPQ6OI3EVFE5J73MBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XXBP3OPGTPQ6OI3EVFE5J73MBV","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":"8c2513eb2651403996fa4f22b0ec1a7a300d277376e029132239476c0edfdd18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-02-05T12:34:18Z","title_canon_sha256":"c9872fe63f785d945826440c5795e98d658e36d0cce02c19dab552b9c422b001"},"schema_version":"1.0","source":{"id":"1302.1010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1010","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1010v1","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1010","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"XXBP3OPGTPQ6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XXBP3OPGTPQ6OI3E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XXBP3OPG","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:6bcd3b8f9ca2b5597971c03cf1286e50612e392d3f3a6c4e810498cb5bd420eb","target":"graph","created_at":"2026-05-18T03:34:26Z","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":"Recent research in the domain of real-time scheduling theory has tackled the problem of scheduling mixed-criticality systems upon uniprocessor or multiprocessor platforms, with the main objective being to respect the timeliness of the most critical tasks, at the expense of the requirements of the less critical ones. In particular, the less critical tasks are carelessly discarded when the computation demand of (some of) the high critical tasks increases. This might nevertheless result in system failure, as these less critical tasks could be accessing data, the consistency of which should be pre","authors_text":"Fran\\c{c}ois Santy, Geoffrey Nelissen, Jo\\\"el Goossens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-02-05T12:34:18Z","title":"Improving Mixed-Criticality System Consistency and Behavior on Multiprocessor Platforms by Means of Multi-Moded Approaches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1010","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:2aaf0aac4d9be620170b7063816464ec13c078b7022e39ba1746d12e0ab1b8ba","target":"record","created_at":"2026-05-18T03:34:26Z","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":"8c2513eb2651403996fa4f22b0ec1a7a300d277376e029132239476c0edfdd18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2013-02-05T12:34:18Z","title_canon_sha256":"c9872fe63f785d945826440c5795e98d658e36d0cce02c19dab552b9c422b001"},"schema_version":"1.0","source":{"id":"1302.1010","kind":"arxiv","version":1}},"canonical_sha256":"bdc2fdb9e69be1e72364a949d4ff6c0d5a8237ec9a516d3f049a65a73c0bd0e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdc2fdb9e69be1e72364a949d4ff6c0d5a8237ec9a516d3f049a65a73c0bd0e1","first_computed_at":"2026-05-18T03:34:26.460920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:26.460920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8SgERU09eG2rkDsiiV8gE2PLbEJ8cLz4OyE0DnjOfvjyBBZESUF8+7mpZ8aL6FvISg8Y6IAkbO5dYcBKZP4EAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:26.461476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aaf0aac4d9be620170b7063816464ec13c078b7022e39ba1746d12e0ab1b8ba","sha256:6bcd3b8f9ca2b5597971c03cf1286e50612e392d3f3a6c4e810498cb5bd420eb"],"state_sha256":"f3d74b02cf610a8da5a978aca65f7bdc96db5c640db93d8836b8d69a4a5578fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rts5Gp+O8UsCBHXMZH8/55sKd/nHZ3liQ+7pvulaclDMBGS9iIjD+Fc/JOfNejbjbqNjuGHDt/xAP+ul9fXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:36:37.767971Z","bundle_sha256":"43a154be5de6b761b56cb86c58959c2df0c10973d850d7b7c2b474385b9c8dcf"}}