{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HXR3CIV7RL6VH7P5LMRMPAYIFH","short_pith_number":"pith:HXR3CIV7","schema_version":"1.0","canonical_sha256":"3de3b122bf8afd53fdfd5b22c7830829d079cf0850a7c0c1d40bdb2d3bca1d3c","source":{"kind":"arxiv","id":"2208.11830","version":1},"attestation_state":"computed","paper":{"title":"Parallel Path Progression DAG Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Mario G\\\"unzel, Niklas Ueter","submitted_at":"2022-08-25T02:32:20Z","abstract_excerpt":"To satisfy the increasing performance needs of modern cyber-physical systems, multiprocessor architectures are increasingly utilized. To efficiently exploit their potential parallelism in hard real-time systems, appropriate task models and scheduling algorithms that allow providing timing guarantees are required. Such scheduling algorithms and the corresponding worst-case response time analyses usually suffer from resource over-provisioning due to pessimistic analyses based on worst-case assumptions. Hence, scheduling algorithms and analysis with high resource efficiency are required. A promin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2208.11830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-25T02:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"849652e7a33e95b90d2a75fae2c141c43c2841f05b66fa5579e0c855aa6b31ab","abstract_canon_sha256":"81e53e6cd31433585e18dcd9ac1dfbf5350205a6b5df8e1010ca5fb4510eca71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:26.431881Z","signature_b64":"KwhsZUTeDlYtE3JPAWz3A1zGsdFnO/K/yc97ffv4lLLlClNdrYL7dEoYbDSOfMAXKp8FW+btrJUQtrqHVfBNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de3b122bf8afd53fdfd5b22c7830829d079cf0850a7c0c1d40bdb2d3bca1d3c","last_reissued_at":"2026-07-05T04:51:26.431510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:26.431510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Path Progression DAG Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Mario G\\\"unzel, Niklas Ueter","submitted_at":"2022-08-25T02:32:20Z","abstract_excerpt":"To satisfy the increasing performance needs of modern cyber-physical systems, multiprocessor architectures are increasingly utilized. To efficiently exploit their potential parallelism in hard real-time systems, appropriate task models and scheduling algorithms that allow providing timing guarantees are required. Such scheduling algorithms and the corresponding worst-case response time analyses usually suffer from resource over-provisioning due to pessimistic analyses based on worst-case assumptions. Hence, scheduling algorithms and analysis with high resource efficiency are required. A promin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11830","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/2208.11830/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.11830","created_at":"2026-07-05T04:51:26.431571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.11830v1","created_at":"2026-07-05T04:51:26.431571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11830","created_at":"2026-07-05T04:51:26.431571+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXR3CIV7RL6V","created_at":"2026-07-05T04:51:26.431571+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXR3CIV7RL6VH7P5","created_at":"2026-07-05T04:51:26.431571+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXR3CIV7","created_at":"2026-07-05T04:51:26.431571+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH","json":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH.json","graph_json":"https://pith.science/api/pith-number/HXR3CIV7RL6VH7P5LMRMPAYIFH/graph.json","events_json":"https://pith.science/api/pith-number/HXR3CIV7RL6VH7P5LMRMPAYIFH/events.json","paper":"https://pith.science/paper/HXR3CIV7"},"agent_actions":{"view_html":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH","download_json":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH.json","view_paper":"https://pith.science/paper/HXR3CIV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.11830&json=true","fetch_graph":"https://pith.science/api/pith-number/HXR3CIV7RL6VH7P5LMRMPAYIFH/graph.json","fetch_events":"https://pith.science/api/pith-number/HXR3CIV7RL6VH7P5LMRMPAYIFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH/action/storage_attestation","attest_author":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH/action/author_attestation","sign_citation":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH/action/citation_signature","submit_replication":"https://pith.science/pith/HXR3CIV7RL6VH7P5LMRMPAYIFH/action/replication_record"}},"created_at":"2026-07-05T04:51:26.431571+00:00","updated_at":"2026-07-05T04:51:26.431571+00:00"}