{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CWRWTHVMOOB6T5WJEVET3JBBBX","short_pith_number":"pith:CWRWTHVM","canonical_record":{"source":{"id":"2101.11053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-01-26T19:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"6a51858c410b5fe2a948816efaa648c6b74279136ab075880f0cd791cd3b68ef","abstract_canon_sha256":"6976bf5f6d6567a68eb1dbc195512664ef01cc1814747114d2edfb18b286e224"},"schema_version":"1.0"},"canonical_sha256":"15a3699eac7383e9f6c925493da4210dfdbf93c4f42a4761b804912aa5f22609","source":{"kind":"arxiv","id":"2101.11053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11053","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11053v1","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11053","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWRWTHVMOOB6","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_16","alias_value":"CWRWTHVMOOB6T5WJ","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_8","alias_value":"CWRWTHVM","created_at":"2026-07-05T02:10:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CWRWTHVMOOB6T5WJEVET3JBBBX","target":"record","payload":{"canonical_record":{"source":{"id":"2101.11053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-01-26T19:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"6a51858c410b5fe2a948816efaa648c6b74279136ab075880f0cd791cd3b68ef","abstract_canon_sha256":"6976bf5f6d6567a68eb1dbc195512664ef01cc1814747114d2edfb18b286e224"},"schema_version":"1.0"},"canonical_sha256":"15a3699eac7383e9f6c925493da4210dfdbf93c4f42a4761b804912aa5f22609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:08.434489Z","signature_b64":"tBjmNu0ldpRRNyGobnQ1MOpZIsTtFEyTpwRH//ubEs2ZxnocO/hKmMFkcUwEAjtD/c1bc3ryqw7c+Rw+mAxEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a3699eac7383e9f6c925493da4210dfdbf93c4f42a4761b804912aa5f22609","last_reissued_at":"2026-07-05T02:10:08.433986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:08.433986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.11053","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-07-05T02:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibbSqJJot5Qw6pmFC+uH47JyQOUBjvpsQ8EbaLEvX+Yd2J9qyRUvsitXg/mlehqzieFRKPR1AUMmAAmLwJYPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:20:14.459759Z"},"content_sha256":"4b04d8e58f752eaab6f1fc0ea62e29cae12490bc19a8f19f3f061d27cf871280","schema_version":"1.0","event_id":"sha256:4b04d8e58f752eaab6f1fc0ea62e29cae12490bc19a8f19f3f061d27cf871280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CWRWTHVMOOB6T5WJEVET3JBBBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jian-Jia Chen, Mario G\\\"unzel, Niklas Ueter","submitted_at":"2021-01-26T19:52:58Z","abstract_excerpt":"Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling algorithms and response-time analyses with respect to real-time constraints have to be provided. In this paper, we propose a reservation-based scheduling algorithm for sporadic constrained-deadline parallel conditional DAG tasks with probabilistic execution behaviour for applications that can tolerate bounded number of deadline misses and bounded tardiness. We de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.11053/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TRVtwm/2+ImR7X+0YeVepRWeDzAH0WoqpWPVjhFLhg3JbUVjft4/PQOAKAVZhRZ6ozoPVn9xukHO0SN/R93Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:20:14.460253Z"},"content_sha256":"1f106b60fab53fbdc26fb92e70dde85f9334bc2332348e785ea19fa3566bb704","schema_version":"1.0","event_id":"sha256:1f106b60fab53fbdc26fb92e70dde85f9334bc2332348e785ea19fa3566bb704"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/bundle.json","state_url":"https://pith.science/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/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-22T11:20:14Z","links":{"resolver":"https://pith.science/pith/CWRWTHVMOOB6T5WJEVET3JBBBX","bundle":"https://pith.science/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/bundle.json","state":"https://pith.science/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWRWTHVMOOB6T5WJEVET3JBBBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CWRWTHVMOOB6T5WJEVET3JBBBX","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":"6976bf5f6d6567a68eb1dbc195512664ef01cc1814747114d2edfb18b286e224","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-01-26T19:52:58Z","title_canon_sha256":"6a51858c410b5fe2a948816efaa648c6b74279136ab075880f0cd791cd3b68ef"},"schema_version":"1.0","source":{"id":"2101.11053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11053","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11053v1","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11053","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWRWTHVMOOB6","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_16","alias_value":"CWRWTHVMOOB6T5WJ","created_at":"2026-07-05T02:10:08Z"},{"alias_kind":"pith_short_8","alias_value":"CWRWTHVM","created_at":"2026-07-05T02:10:08Z"}],"graph_snapshots":[{"event_id":"sha256:1f106b60fab53fbdc26fb92e70dde85f9334bc2332348e785ea19fa3566bb704","target":"graph","created_at":"2026-07-05T02:10:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.11053/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling algorithms and response-time analyses with respect to real-time constraints have to be provided. In this paper, we propose a reservation-based scheduling algorithm for sporadic constrained-deadline parallel conditional DAG tasks with probabilistic execution behaviour for applications that can tolerate bounded number of deadline misses and bounded tardiness. We de","authors_text":"Jian-Jia Chen, Mario G\\\"unzel, Niklas Ueter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-01-26T19:52:58Z","title":"Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11053","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:4b04d8e58f752eaab6f1fc0ea62e29cae12490bc19a8f19f3f061d27cf871280","target":"record","created_at":"2026-07-05T02:10:08Z","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":"6976bf5f6d6567a68eb1dbc195512664ef01cc1814747114d2edfb18b286e224","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-01-26T19:52:58Z","title_canon_sha256":"6a51858c410b5fe2a948816efaa648c6b74279136ab075880f0cd791cd3b68ef"},"schema_version":"1.0","source":{"id":"2101.11053","kind":"arxiv","version":1}},"canonical_sha256":"15a3699eac7383e9f6c925493da4210dfdbf93c4f42a4761b804912aa5f22609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15a3699eac7383e9f6c925493da4210dfdbf93c4f42a4761b804912aa5f22609","first_computed_at":"2026-07-05T02:10:08.433986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:08.433986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tBjmNu0ldpRRNyGobnQ1MOpZIsTtFEyTpwRH//ubEs2ZxnocO/hKmMFkcUwEAjtD/c1bc3ryqw7c+Rw+mAxEBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:08.434489Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.11053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b04d8e58f752eaab6f1fc0ea62e29cae12490bc19a8f19f3f061d27cf871280","sha256:1f106b60fab53fbdc26fb92e70dde85f9334bc2332348e785ea19fa3566bb704"],"state_sha256":"f091093b9f1df004ecddb40188b708c9377fafad9fb804ed4153cd5223141f80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iQzv9oCMUYxebCpPcO7u1YETwG5FO/vX+dCu8qPEBSpcf6c/aTk8bCw90CeefNy5lTWfGGW/VSev4t/hKUxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T11:20:14.465085Z","bundle_sha256":"b867a86491e35a00322e4ae122cda9d54e64bbd8ea4926a27b06f00d37c34f4d"}}