{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IBYC7QWPCSFQKRB6M7OODEYVSG","short_pith_number":"pith:IBYC7QWP","schema_version":"1.0","canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","source":{"kind":"arxiv","id":"1605.00124","version":2},"attestation_state":"computed","paper":{"title":"A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian-Jia Chen","submitted_at":"2016-04-30T15:37:00Z","abstract_excerpt":"This report considers a sporadic real-time task system with $n$ sporadic tasks on a uniprocessor platform, in which the lowest-priority task is a segmented self-suspension task and the other higher-priority tasks are ordinary sporadic real-time tasks. This report proves that the schedulability analysis for fixed-priority preemptive scheduling even with only one segmented self-suspending task as the lowest-priority task is $co{\\cal NP}$-hard in the strong sense. Under fixed-priority preemptive scheduling, Nelissen et al. in ECRTS 2015 provided a mixed-integer linear programming (MILP) formulati"},"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":"1605.00124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T15:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"8e8aa04022e73d0a62c289785e482df29c97ea80a8a730faa155e7df745b60ce","abstract_canon_sha256":"1bf1422021cfb3c7b4dde99c9a29b66e29a8622782e313736cd9dcc21ecc10c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.721275Z","signature_b64":"TOUncGaC4Vqzc2/0Lb7mB98dYny6UU5/ZNqDG8+Ifnf1hKlckn1gujuIoa54rzWCztCHnhW34SAVHHRLumXZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","last_reissued_at":"2026-05-18T01:12:54.720942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.720942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian-Jia Chen","submitted_at":"2016-04-30T15:37:00Z","abstract_excerpt":"This report considers a sporadic real-time task system with $n$ sporadic tasks on a uniprocessor platform, in which the lowest-priority task is a segmented self-suspension task and the other higher-priority tasks are ordinary sporadic real-time tasks. This report proves that the schedulability analysis for fixed-priority preemptive scheduling even with only one segmented self-suspending task as the lowest-priority task is $co{\\cal NP}$-hard in the strong sense. Under fixed-priority preemptive scheduling, Nelissen et al. in ECRTS 2015 provided a mixed-integer linear programming (MILP) formulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00124","kind":"arxiv","version":2},"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":"1605.00124","created_at":"2026-05-18T01:12:54.720996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00124v2","created_at":"2026-05-18T01:12:54.720996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00124","created_at":"2026-05-18T01:12:54.720996+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBYC7QWPCSFQ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBYC7QWPCSFQKRB6","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBYC7QWP","created_at":"2026-05-18T12:30:22.444734+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/IBYC7QWPCSFQKRB6M7OODEYVSG","json":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG.json","graph_json":"https://pith.science/api/pith-number/IBYC7QWPCSFQKRB6M7OODEYVSG/graph.json","events_json":"https://pith.science/api/pith-number/IBYC7QWPCSFQKRB6M7OODEYVSG/events.json","paper":"https://pith.science/paper/IBYC7QWP"},"agent_actions":{"view_html":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG","download_json":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG.json","view_paper":"https://pith.science/paper/IBYC7QWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00124&json=true","fetch_graph":"https://pith.science/api/pith-number/IBYC7QWPCSFQKRB6M7OODEYVSG/graph.json","fetch_events":"https://pith.science/api/pith-number/IBYC7QWPCSFQKRB6M7OODEYVSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/action/storage_attestation","attest_author":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/action/author_attestation","sign_citation":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/action/citation_signature","submit_replication":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/action/replication_record"}},"created_at":"2026-05-18T01:12:54.720996+00:00","updated_at":"2026-05-18T01:12:54.720996+00:00"}