{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CHQOYEKBX4KGIPCAXC7RSX6ER2","short_pith_number":"pith:CHQOYEKB","canonical_record":{"source":{"id":"1004.2033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-12T19:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"50340b641ec414d8b039e53d9e3412d0e1fc2f5c7d714896e42ee60d3338cfec","abstract_canon_sha256":"ad024ea64bec661674e777769804ed0565cc2c7ef81d3a386b23961b6f1fd9ff"},"schema_version":"1.0"},"canonical_sha256":"11e0ec1141bf14643c40b8bf195fc48e8bed6059cf452ad0d676b7f3984115e2","source":{"kind":"arxiv","id":"1004.2033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2033","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2033v1","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2033","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"CHQOYEKBX4KG","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CHQOYEKBX4KGIPCA","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CHQOYEKB","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CHQOYEKBX4KGIPCAXC7RSX6ER2","target":"record","payload":{"canonical_record":{"source":{"id":"1004.2033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-12T19:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"50340b641ec414d8b039e53d9e3412d0e1fc2f5c7d714896e42ee60d3338cfec","abstract_canon_sha256":"ad024ea64bec661674e777769804ed0565cc2c7ef81d3a386b23961b6f1fd9ff"},"schema_version":"1.0"},"canonical_sha256":"11e0ec1141bf14643c40b8bf195fc48e8bed6059cf452ad0d676b7f3984115e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:36.547499Z","signature_b64":"UeHDeMmrkZIidjUt3WHDA0BZa1vGC691w66+Iz3tdXmaHNsc3DnGIxfIuQSlyHdaI/JeXqErh+e1Zrhhe4APDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11e0ec1141bf14643c40b8bf195fc48e8bed6059cf452ad0d676b7f3984115e2","last_reissued_at":"2026-05-18T03:44:36.546797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:36.546797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.2033","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-18T03:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmdJboZhUxpVTxNmi1HMaEwPjwdrvt5lhF8EQJ6OqfZU2qkbdAw/x8RKMwThsZvkRdt6ROLPi9B8M1VMnqvUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:02:08.086241Z"},"content_sha256":"df8bad974b7d386fd4ba073b4506d876284f33311db8eaee873aafefb5d0559c","schema_version":"1.0","event_id":"sha256:df8bad974b7d386fd4ba073b4506d876284f33311db8eaee873aafefb5d0559c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CHQOYEKBX4KGIPCAXC7RSX6ER2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Vincenzo Bonifaci","submitted_at":"2010-04-12T19:43:20Z","abstract_excerpt":"We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2033","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-18T03:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bimXJ6R+HJ7XEJp6Dfty/6UeZQCiKkGvsVMcDFyLIQVO3JoeqATq2NCF7roqSNQcnFzhpXP3TTsqMS/gQ17DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:02:08.086898Z"},"content_sha256":"0dd62455c70fa0d59c99f1f1394bc272caeaa1bc7892a8a9d87ff0ee9407891e","schema_version":"1.0","event_id":"sha256:0dd62455c70fa0d59c99f1f1394bc272caeaa1bc7892a8a9d87ff0ee9407891e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/bundle.json","state_url":"https://pith.science/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/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-05-22T08:02:08Z","links":{"resolver":"https://pith.science/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2","bundle":"https://pith.science/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/bundle.json","state":"https://pith.science/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHQOYEKBX4KGIPCAXC7RSX6ER2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CHQOYEKBX4KGIPCAXC7RSX6ER2","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":"ad024ea64bec661674e777769804ed0565cc2c7ef81d3a386b23961b6f1fd9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-12T19:43:20Z","title_canon_sha256":"50340b641ec414d8b039e53d9e3412d0e1fc2f5c7d714896e42ee60d3338cfec"},"schema_version":"1.0","source":{"id":"1004.2033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2033","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2033v1","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2033","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"CHQOYEKBX4KG","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CHQOYEKBX4KGIPCA","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CHQOYEKB","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:0dd62455c70fa0d59c99f1f1394bc272caeaa1bc7892a8a9d87ff0ee9407891e","target":"graph","created_at":"2026-05-18T03:44:36Z","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":"We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.","authors_text":"Alberto Marchetti-Spaccamela, Vincenzo Bonifaci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-12T19:43:20Z","title":"Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2033","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:df8bad974b7d386fd4ba073b4506d876284f33311db8eaee873aafefb5d0559c","target":"record","created_at":"2026-05-18T03:44:36Z","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":"ad024ea64bec661674e777769804ed0565cc2c7ef81d3a386b23961b6f1fd9ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-12T19:43:20Z","title_canon_sha256":"50340b641ec414d8b039e53d9e3412d0e1fc2f5c7d714896e42ee60d3338cfec"},"schema_version":"1.0","source":{"id":"1004.2033","kind":"arxiv","version":1}},"canonical_sha256":"11e0ec1141bf14643c40b8bf195fc48e8bed6059cf452ad0d676b7f3984115e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11e0ec1141bf14643c40b8bf195fc48e8bed6059cf452ad0d676b7f3984115e2","first_computed_at":"2026-05-18T03:44:36.546797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:36.546797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeHDeMmrkZIidjUt3WHDA0BZa1vGC691w66+Iz3tdXmaHNsc3DnGIxfIuQSlyHdaI/JeXqErh+e1Zrhhe4APDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:36.547499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8bad974b7d386fd4ba073b4506d876284f33311db8eaee873aafefb5d0559c","sha256:0dd62455c70fa0d59c99f1f1394bc272caeaa1bc7892a8a9d87ff0ee9407891e"],"state_sha256":"88ee5b15f61193134c5debc1894d2eb78c8ff9e7c78fe1e32e38dee6f2131119"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0bXjYWlkDzjP+EFuup8f98PdBNUzDDP+lri4miNDbM5ecBSttABAa/NU/wikIwDbB41nS6lkP8kQLIeXs5BDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:02:08.090803Z","bundle_sha256":"448a688584e17c9da13809cb949dc3c51c8d859f746a3bad93b1fe8badfcef16"}}