{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DACORXM7EZPS7WQE7C5DOB3I2W","short_pith_number":"pith:DACORXM7","schema_version":"1.0","canonical_sha256":"1804e8dd9f265f2fda04f8ba370768d5848debf0599fc42627baa3f4334c13bd","source":{"kind":"arxiv","id":"1808.00017","version":1},"attestation_state":"computed","paper":{"title":"New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Cong Liu, Zheng Dong","submitted_at":"2018-07-31T18:30:09Z","abstract_excerpt":"The scheduling and schedulability analysis of real-time directed acyclic graph (DAG) task systems have received much recent attention. The DAG model can accurately represent intra-task parallelim and precedence constraints existing in many application domains. Existing techniques show that analyzing the DAG model is fundamentally more challenging compared to the ordinary sporadic task model, due to the complex intra-DAG precedence constraints which may cause rather pessimistic schedulability loss. However,such increased loss is counter-intuitive because the DAG structure shall better exploit t"},"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":"1808.00017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-07-31T18:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"590912893bcf8ab263b933c4467df8d15fc64638fd193962408e0a087a3116a9","abstract_canon_sha256":"e6d76c4fa1601635cccacf663a8dfce0342b62e888818bd73de03e572f5ebb66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:08.980942Z","signature_b64":"EYnyo98O9QftGgSZpuuAnkBGlBsohg5K/d/fzSb69GAeiFfbQFYD7w1eOXO3G1eWFGvk58SDYisAuTXM5/KBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1804e8dd9f265f2fda04f8ba370768d5848debf0599fc42627baa3f4334c13bd","last_reissued_at":"2026-05-18T00:09:08.980435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:08.980435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Cong Liu, Zheng Dong","submitted_at":"2018-07-31T18:30:09Z","abstract_excerpt":"The scheduling and schedulability analysis of real-time directed acyclic graph (DAG) task systems have received much recent attention. The DAG model can accurately represent intra-task parallelim and precedence constraints existing in many application domains. Existing techniques show that analyzing the DAG model is fundamentally more challenging compared to the ordinary sporadic task model, due to the complex intra-DAG precedence constraints which may cause rather pessimistic schedulability loss. However,such increased loss is counter-intuitive because the DAG structure shall better exploit t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00017","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.00017","created_at":"2026-05-18T00:09:08.980515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00017v1","created_at":"2026-05-18T00:09:08.980515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00017","created_at":"2026-05-18T00:09:08.980515+00:00"},{"alias_kind":"pith_short_12","alias_value":"DACORXM7EZPS","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DACORXM7EZPS7WQE","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DACORXM7","created_at":"2026-05-18T12:32:19.392346+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/DACORXM7EZPS7WQE7C5DOB3I2W","json":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W.json","graph_json":"https://pith.science/api/pith-number/DACORXM7EZPS7WQE7C5DOB3I2W/graph.json","events_json":"https://pith.science/api/pith-number/DACORXM7EZPS7WQE7C5DOB3I2W/events.json","paper":"https://pith.science/paper/DACORXM7"},"agent_actions":{"view_html":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W","download_json":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W.json","view_paper":"https://pith.science/paper/DACORXM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00017&json=true","fetch_graph":"https://pith.science/api/pith-number/DACORXM7EZPS7WQE7C5DOB3I2W/graph.json","fetch_events":"https://pith.science/api/pith-number/DACORXM7EZPS7WQE7C5DOB3I2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W/action/storage_attestation","attest_author":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W/action/author_attestation","sign_citation":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W/action/citation_signature","submit_replication":"https://pith.science/pith/DACORXM7EZPS7WQE7C5DOB3I2W/action/replication_record"}},"created_at":"2026-05-18T00:09:08.980515+00:00","updated_at":"2026-05-18T00:09:08.980515+00:00"}