{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IBYC7QWPCSFQKRB6M7OODEYVSG","short_pith_number":"pith:IBYC7QWP","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"},"canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","source":{"kind":"arxiv","id":"1605.00124","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00124","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00124v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00124","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"IBYC7QWPCSFQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IBYC7QWPCSFQKRB6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IBYC7QWP","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IBYC7QWPCSFQKRB6M7OODEYVSG","target":"record","payload":{"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"},"canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","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"},"source_kind":"arxiv","source_id":"1605.00124","source_version":2,"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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLWEPff7oD7+6rmKXqvsvhltd58DRCvbwBoUgFGIFkbOV0fgnoC605LYHzymEqiAr5xsX10mlaDUPHclACK3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:24.759490Z"},"content_sha256":"4361ae34e81a18cd31e51a7d67de98c1c51b1e7eb77085da6eec96616eb91385","schema_version":"1.0","event_id":"sha256:4361ae34e81a18cd31e51a7d67de98c1c51b1e7eb77085da6eec96616eb91385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IBYC7QWPCSFQKRB6M7OODEYVSG","target":"graph","payload":{"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"},"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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hldiov/tKxmqsBl6nUu2vVROqPaInmyW48TdSTb7SOzU8Sef7cVvCjMGHll04SMmqUtF9qXjKb/GotTemFeJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:24.759833Z"},"content_sha256":"c564bd49fa76d982dedd0f848231fb5e0a8314aa09e2198d45b31b7bb787ab5d","schema_version":"1.0","event_id":"sha256:c564bd49fa76d982dedd0f848231fb5e0a8314aa09e2198d45b31b7bb787ab5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/bundle.json","state_url":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/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:27:24Z","links":{"resolver":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG","bundle":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/bundle.json","state":"https://pith.science/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBYC7QWPCSFQKRB6M7OODEYVSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IBYC7QWPCSFQKRB6M7OODEYVSG","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":"1bf1422021cfb3c7b4dde99c9a29b66e29a8622782e313736cd9dcc21ecc10c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T15:37:00Z","title_canon_sha256":"8e8aa04022e73d0a62c289785e482df29c97ea80a8a730faa155e7df745b60ce"},"schema_version":"1.0","source":{"id":"1605.00124","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00124","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00124v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00124","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"IBYC7QWPCSFQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IBYC7QWPCSFQKRB6","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IBYC7QWP","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c564bd49fa76d982dedd0f848231fb5e0a8314aa09e2198d45b31b7bb787ab5d","target":"graph","created_at":"2026-05-18T01:12:54Z","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":"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","authors_text":"Jian-Jia Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T15:37:00Z","title":"A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00124","kind":"arxiv","version":2},"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:4361ae34e81a18cd31e51a7d67de98c1c51b1e7eb77085da6eec96616eb91385","target":"record","created_at":"2026-05-18T01:12:54Z","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":"1bf1422021cfb3c7b4dde99c9a29b66e29a8622782e313736cd9dcc21ecc10c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-30T15:37:00Z","title_canon_sha256":"8e8aa04022e73d0a62c289785e482df29c97ea80a8a730faa155e7df745b60ce"},"schema_version":"1.0","source":{"id":"1605.00124","kind":"arxiv","version":2}},"canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40702fc2cf148b05443e67dce1931591a58b6136afa04c967845b4ca26ad40b5","first_computed_at":"2026-05-18T01:12:54.720942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.720942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOUncGaC4Vqzc2/0Lb7mB98dYny6UU5/ZNqDG8+Ifnf1hKlckn1gujuIoa54rzWCztCHnhW34SAVHHRLumXZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.721275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00124","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4361ae34e81a18cd31e51a7d67de98c1c51b1e7eb77085da6eec96616eb91385","sha256:c564bd49fa76d982dedd0f848231fb5e0a8314aa09e2198d45b31b7bb787ab5d"],"state_sha256":"7e1651a16ccad1ac2359c5efc9006aed0af57bb9200ef62e73033c224534f118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ns2+lZMdbSl6GOLD4rtO6IGVElcR2MUA4qCRCfMCsAx2bNDoBHK7PCovB9x6biEdj1m5gDJRKCk8+r4oLhQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:27:24.761793Z","bundle_sha256":"2138335249f9b188378240c2fcd9562eef75491c256d5f216c1ecb70ae89d374"}}