{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4DVOX6CJHD33EYSVCPI27UMA4L","short_pith_number":"pith:4DVOX6CJ","canonical_record":{"source":{"id":"1807.08579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5083ef39d6673b79fe46b690cb20a2efcf2cf15345a4f15c189f7113ae86772d","abstract_canon_sha256":"005e3bcd044f647db2b561df903c9cc7d7a3058688d2219cfa2c2a9a0df4fc45"},"schema_version":"1.0"},"canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","source":{"kind":"arxiv","id":"1807.08579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08579","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08579v1","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08579","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"4DVOX6CJHD33","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DVOX6CJHD33EYSV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DVOX6CJ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4DVOX6CJHD33EYSVCPI27UMA4L","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5083ef39d6673b79fe46b690cb20a2efcf2cf15345a4f15c189f7113ae86772d","abstract_canon_sha256":"005e3bcd044f647db2b561df903c9cc7d7a3058688d2219cfa2c2a9a0df4fc45"},"schema_version":"1.0"},"canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:05.489915Z","signature_b64":"LrtZZJSRrSqHldJzT7/iXXZbx+ESEpEjUTPMkCFzOksNHxZn3GJf+Xa8IC1bmLyLf260bH3mi47Hrb+iyk2PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","last_reissued_at":"2026-05-18T00:10:05.489278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:05.489278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08579","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-05-18T00:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXHp0sWjXNldoyun+j4YxyhEgVGr5hx9uiDmvzxWZhaOfq/CSblkmzgypwTFe4orGgrWdtHiKM9SlDLzM3i8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:39:37.440469Z"},"content_sha256":"ce1e68740a8f25309952e90358a22e85d1d272991612f8194a9effba1ca84345","schema_version":"1.0","event_id":"sha256:ce1e68740a8f25309952e90358a22e85d1d272991612f8194a9effba1ca84345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4DVOX6CJHD33EYSVCPI27UMA4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Liang Zhao, Xingwu Liu, Xin Han, Zhishan Guo","submitted_at":"2018-07-20T07:46:32Z","abstract_excerpt":"Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from been determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always return succeeded on m processors with s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08579","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"},"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-18T00:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqvJB4nAyCz4xyONhScfMCMcBxXFKhUjzOqPgX3tz2K+z7oEuI0ihDmTvP4XctHvhQOaEE+kbvw5LmA9cMbIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:39:37.441067Z"},"content_sha256":"9a3c175e3f310d58e895cc2d0c6166633082c81d9d7c141c98f273d3a2f18148","schema_version":"1.0","event_id":"sha256:9a3c175e3f310d58e895cc2d0c6166633082c81d9d7c141c98f273d3a2f18148"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/bundle.json","state_url":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DVOX6CJHD33EYSVCPI27UMA4L/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-02T17:39:37Z","links":{"resolver":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L","bundle":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/bundle.json","state":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DVOX6CJHD33EYSVCPI27UMA4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4DVOX6CJHD33EYSVCPI27UMA4L","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":"005e3bcd044f647db2b561df903c9cc7d7a3058688d2219cfa2c2a9a0df4fc45","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","title_canon_sha256":"5083ef39d6673b79fe46b690cb20a2efcf2cf15345a4f15c189f7113ae86772d"},"schema_version":"1.0","source":{"id":"1807.08579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08579","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08579v1","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08579","created_at":"2026-05-18T00:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"4DVOX6CJHD33","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DVOX6CJHD33EYSV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DVOX6CJ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:9a3c175e3f310d58e895cc2d0c6166633082c81d9d7c141c98f273d3a2f18148","target":"graph","created_at":"2026-05-18T00:10:05Z","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":"Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from been determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always return succeeded on m processors with s","authors_text":"Liang Zhao, Xingwu Liu, Xin Han, Zhishan Guo","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","title":"An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08579","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:ce1e68740a8f25309952e90358a22e85d1d272991612f8194a9effba1ca84345","target":"record","created_at":"2026-05-18T00:10:05Z","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":"005e3bcd044f647db2b561df903c9cc7d7a3058688d2219cfa2c2a9a0df4fc45","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","title_canon_sha256":"5083ef39d6673b79fe46b690cb20a2efcf2cf15345a4f15c189f7113ae86772d"},"schema_version":"1.0","source":{"id":"1807.08579","kind":"arxiv","version":1}},"canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","first_computed_at":"2026-05-18T00:10:05.489278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:05.489278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LrtZZJSRrSqHldJzT7/iXXZbx+ESEpEjUTPMkCFzOksNHxZn3GJf+Xa8IC1bmLyLf260bH3mi47Hrb+iyk2PCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:05.489915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce1e68740a8f25309952e90358a22e85d1d272991612f8194a9effba1ca84345","sha256:9a3c175e3f310d58e895cc2d0c6166633082c81d9d7c141c98f273d3a2f18148"],"state_sha256":"03bfad370fa20263603c22a54749649d15197b308a21bf20f3e4a2d79a084ac8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Brtjw13nZsU5YYEc6ZG0mF96lzqahBKE8AtvsvyDJX8NcvZnvQ4MW1OdSx6JxHuy2q7likUwGDKkjb7IBuM1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:39:37.443939Z","bundle_sha256":"cafd3e584f76b5b5f9550b01eb1d7e5e079ce6f6d7be6a09ba849ba7f27ab5a8"}}