{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IPNBIWNHC22ZYGQILYZEXQGA3B","short_pith_number":"pith:IPNBIWNH","canonical_record":{"source":{"id":"1711.00100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-29T18:01:38Z","cross_cats_sorted":[],"title_canon_sha256":"b46fa08d00f0debc0d4ea9a350a1400786e4e45e6ec500d8c964ff5e07d1ce4f","abstract_canon_sha256":"1072d659e9d23b9812ab8e658440320aa51435e48315e8b96cd1cfd3d45c3018"},"schema_version":"1.0"},"canonical_sha256":"43da1459a716b59c1a085e324bc0c0d86bd75820ac6be27dfba9c3be0db22628","source":{"kind":"arxiv","id":"1711.00100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00100","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00100v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00100","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"IPNBIWNHC22Z","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPNBIWNHC22ZYGQI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPNBIWNH","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IPNBIWNHC22ZYGQILYZEXQGA3B","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-29T18:01:38Z","cross_cats_sorted":[],"title_canon_sha256":"b46fa08d00f0debc0d4ea9a350a1400786e4e45e6ec500d8c964ff5e07d1ce4f","abstract_canon_sha256":"1072d659e9d23b9812ab8e658440320aa51435e48315e8b96cd1cfd3d45c3018"},"schema_version":"1.0"},"canonical_sha256":"43da1459a716b59c1a085e324bc0c0d86bd75820ac6be27dfba9c3be0db22628","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.193499Z","signature_b64":"aZrvs+AJmPGeBzMULfzO1wJ1Y3PWGho5UD/fCyLAYyZvrPGANNAGXR6mB+nEBs85k0ymObiXuj7jYpA1YPajAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43da1459a716b59c1a085e324bc0c0d86bd75820ac6be27dfba9c3be0db22628","last_reissued_at":"2026-05-18T00:31:35.192914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.192914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00100","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sovP8pWG8MmQ+W0Uj8NTvJjPUrrM1Xf+4vqFg71GBWD3Y7+oKjrE+ZOzBXr16/39C5oNP33KB/dHtq2aqFGHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:25:52.498247Z"},"content_sha256":"b824b35fd7ce57c5c0b457a3fbf5df9071ab8f4ffcd9344cd0d8c226f7a0eb05","schema_version":"1.0","event_id":"sha256:b824b35fd7ce57c5c0b457a3fbf5df9071ab8f4ffcd9344cd0d8c226f7a0eb05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IPNBIWNHC22ZYGQILYZEXQGA3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Di Liu, Gang Chen, Kai Huang, Nan Guan, Qingqiang He, Todor Stefanov, Wang Yi","submitted_at":"2017-09-29T18:01:38Z","abstract_excerpt":"Mixed-criticality models are an emerging paradigm for the design of real-time systems because of their significantly improved resource efficiency. However, formal mixed-criticality models have traditionally been characterized by two impractical assumptions: once \\textit{any} high-criticality task overruns, \\textit{all} low-criticality tasks are suspended and \\textit{all other} high-criticality tasks are assumed to exhibit high-criticality behaviors at the same time. In this paper, we propose a more realistic mixed-criticality model, called the flexible mixed-criticality (FMC) model, in which t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00100","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvsNzA7O9LUo0dgcmk9W2ljLUW3jSP/5ejGdRv1UYLwbmr5GL9n7Aa+gMFe39OvT6TjEjD1Lk0W/pHquj44wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:25:52.498603Z"},"content_sha256":"b6f8c16050dafff10a32ae0f0e9d4c9d11d736b17071b0cace45ba0c08e8d372","schema_version":"1.0","event_id":"sha256:b6f8c16050dafff10a32ae0f0e9d4c9d11d736b17071b0cace45ba0c08e8d372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/bundle.json","state_url":"https://pith.science/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/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-01T14:25:52Z","links":{"resolver":"https://pith.science/pith/IPNBIWNHC22ZYGQILYZEXQGA3B","bundle":"https://pith.science/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/bundle.json","state":"https://pith.science/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPNBIWNHC22ZYGQILYZEXQGA3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IPNBIWNHC22ZYGQILYZEXQGA3B","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":"1072d659e9d23b9812ab8e658440320aa51435e48315e8b96cd1cfd3d45c3018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-29T18:01:38Z","title_canon_sha256":"b46fa08d00f0debc0d4ea9a350a1400786e4e45e6ec500d8c964ff5e07d1ce4f"},"schema_version":"1.0","source":{"id":"1711.00100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00100","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00100v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00100","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"IPNBIWNHC22Z","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IPNBIWNHC22ZYGQI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IPNBIWNH","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:b6f8c16050dafff10a32ae0f0e9d4c9d11d736b17071b0cace45ba0c08e8d372","target":"graph","created_at":"2026-05-18T00:31: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":"Mixed-criticality models are an emerging paradigm for the design of real-time systems because of their significantly improved resource efficiency. However, formal mixed-criticality models have traditionally been characterized by two impractical assumptions: once \\textit{any} high-criticality task overruns, \\textit{all} low-criticality tasks are suspended and \\textit{all other} high-criticality tasks are assumed to exhibit high-criticality behaviors at the same time. In this paper, we propose a more realistic mixed-criticality model, called the flexible mixed-criticality (FMC) model, in which t","authors_text":"Di Liu, Gang Chen, Kai Huang, Nan Guan, Qingqiang He, Todor Stefanov, Wang Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-29T18:01:38Z","title":"Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00100","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:b824b35fd7ce57c5c0b457a3fbf5df9071ab8f4ffcd9344cd0d8c226f7a0eb05","target":"record","created_at":"2026-05-18T00:31: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":"1072d659e9d23b9812ab8e658440320aa51435e48315e8b96cd1cfd3d45c3018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-29T18:01:38Z","title_canon_sha256":"b46fa08d00f0debc0d4ea9a350a1400786e4e45e6ec500d8c964ff5e07d1ce4f"},"schema_version":"1.0","source":{"id":"1711.00100","kind":"arxiv","version":1}},"canonical_sha256":"43da1459a716b59c1a085e324bc0c0d86bd75820ac6be27dfba9c3be0db22628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43da1459a716b59c1a085e324bc0c0d86bd75820ac6be27dfba9c3be0db22628","first_computed_at":"2026-05-18T00:31:35.192914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.192914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aZrvs+AJmPGeBzMULfzO1wJ1Y3PWGho5UD/fCyLAYyZvrPGANNAGXR6mB+nEBs85k0ymObiXuj7jYpA1YPajAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.193499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b824b35fd7ce57c5c0b457a3fbf5df9071ab8f4ffcd9344cd0d8c226f7a0eb05","sha256:b6f8c16050dafff10a32ae0f0e9d4c9d11d736b17071b0cace45ba0c08e8d372"],"state_sha256":"4e9e9e8fadc90601a6e0bdfc299c0e56b9c7974f4608a1c12609c699001a6f8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3WOrCni6RI4+i+77SeWyxNzbqhFT6gfVqMC4EgUSBVSJGldgjggPEOFIp/cypNf8NJQPTPUXhkPL7LDJmcqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:25:52.500459Z","bundle_sha256":"adedbc877d142d0c8c42e64d07ff6e8e885257751854c2722c618afc6a6a21ae"}}