{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3QFIAXUIIRMSRJSKU6HMMIG43M","short_pith_number":"pith:3QFIAXUI","canonical_record":{"source":{"id":"1105.5055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-05-25T15:02:01Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1350890a388fc2afa92ca4368b18ed340337d8bfffbaeacf40485f47f081b05c","abstract_canon_sha256":"b1a239732ce52796f556b3a2edd6fef5104b7e3e305e9eeb37cf5a258a0e273a"},"schema_version":"1.0"},"canonical_sha256":"dc0a805e88445928a64aa78ec620dcdb2f57b59205449188c06eb104826ca421","source":{"kind":"arxiv","id":"1105.5055","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5055","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5055v2","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5055","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"3QFIAXUIIRMS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3QFIAXUIIRMSRJSK","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3QFIAXUI","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3QFIAXUIIRMSRJSKU6HMMIG43M","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-05-25T15:02:01Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1350890a388fc2afa92ca4368b18ed340337d8bfffbaeacf40485f47f081b05c","abstract_canon_sha256":"b1a239732ce52796f556b3a2edd6fef5104b7e3e305e9eeb37cf5a258a0e273a"},"schema_version":"1.0"},"canonical_sha256":"dc0a805e88445928a64aa78ec620dcdb2f57b59205449188c06eb104826ca421","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:56.328871Z","signature_b64":"pUnR2z5z3YrW8TB4M2Uoe0IHo8QExyA/QIFY3ZrAikqI5SZqlW3dzxIqLNl3ffy1OFBaM+esnpZVtj3B0leeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc0a805e88445928a64aa78ec620dcdb2f57b59205449188c06eb104826ca421","last_reissued_at":"2026-05-18T04:13:56.328253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:56.328253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5055","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-18T04:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUodLip7MLQ2Nm3LIafC7OyrfTZCWErpKKo23uXoPoFKjjmGxYhv7KKE8O86M+DvbN6GMQ0FZoRAw7sGv9zbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:17.872622Z"},"content_sha256":"3befcad59276564115a49c93a9b26be4a32105f20fe1d5de6a18a235312ae4c6","schema_version":"1.0","event_id":"sha256:3befcad59276564115a49c93a9b26be4a32105f20fe1d5de6a18a235312ae4c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3QFIAXUIIRMSRJSKU6HMMIG43M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster exact multiprocessor schedulability test for sporadic tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.OS","authors_text":"Gilles Geeraerts, Jo\\\"el Goossens, Markus Lindstr\\\"om","submitted_at":"2011-05-25T15:02:01Z","abstract_excerpt":"Baker and Cirinei introduced an exact but naive algorithm, based on solving a state reachability problem in a finite automaton, to check whether sets of sporadic hard real-time tasks are schedulable on identical multiprocessor platforms. However, the algorithm suffered from poor performance due to the exponential size of the automaton relative to the size of the task set. In this paper, we successfully apply techniques developed by the formal verification community, specifically antichain algorithms, by defining and proving the correctness of a simulation relation on Baker and Cirinei's automa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5055","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-18T04:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qiwew6/td/pUpp3/Y8e+Z9Yz/vzmmvNVNip8Zd+SjRS3OVkvVZugM9eyHoZnhrQcSF2o+9fBSxHyXvKOm2/YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:17.873278Z"},"content_sha256":"be4f64e608c87da5c9e35c38b6caa3d12c017e94c2eb38177f0760ac85a290cd","schema_version":"1.0","event_id":"sha256:be4f64e608c87da5c9e35c38b6caa3d12c017e94c2eb38177f0760ac85a290cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/bundle.json","state_url":"https://pith.science/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/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-26T21:17:17Z","links":{"resolver":"https://pith.science/pith/3QFIAXUIIRMSRJSKU6HMMIG43M","bundle":"https://pith.science/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/bundle.json","state":"https://pith.science/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QFIAXUIIRMSRJSKU6HMMIG43M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3QFIAXUIIRMSRJSKU6HMMIG43M","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":"b1a239732ce52796f556b3a2edd6fef5104b7e3e305e9eeb37cf5a258a0e273a","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-05-25T15:02:01Z","title_canon_sha256":"1350890a388fc2afa92ca4368b18ed340337d8bfffbaeacf40485f47f081b05c"},"schema_version":"1.0","source":{"id":"1105.5055","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5055","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5055v2","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5055","created_at":"2026-05-18T04:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"3QFIAXUIIRMS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3QFIAXUIIRMSRJSK","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3QFIAXUI","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:be4f64e608c87da5c9e35c38b6caa3d12c017e94c2eb38177f0760ac85a290cd","target":"graph","created_at":"2026-05-18T04:13:56Z","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":"Baker and Cirinei introduced an exact but naive algorithm, based on solving a state reachability problem in a finite automaton, to check whether sets of sporadic hard real-time tasks are schedulable on identical multiprocessor platforms. However, the algorithm suffered from poor performance due to the exponential size of the automaton relative to the size of the task set. In this paper, we successfully apply techniques developed by the formal verification community, specifically antichain algorithms, by defining and proving the correctness of a simulation relation on Baker and Cirinei's automa","authors_text":"Gilles Geeraerts, Jo\\\"el Goossens, Markus Lindstr\\\"om","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-05-25T15:02:01Z","title":"A faster exact multiprocessor schedulability test for sporadic tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5055","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:3befcad59276564115a49c93a9b26be4a32105f20fe1d5de6a18a235312ae4c6","target":"record","created_at":"2026-05-18T04:13:56Z","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":"b1a239732ce52796f556b3a2edd6fef5104b7e3e305e9eeb37cf5a258a0e273a","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-05-25T15:02:01Z","title_canon_sha256":"1350890a388fc2afa92ca4368b18ed340337d8bfffbaeacf40485f47f081b05c"},"schema_version":"1.0","source":{"id":"1105.5055","kind":"arxiv","version":2}},"canonical_sha256":"dc0a805e88445928a64aa78ec620dcdb2f57b59205449188c06eb104826ca421","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc0a805e88445928a64aa78ec620dcdb2f57b59205449188c06eb104826ca421","first_computed_at":"2026-05-18T04:13:56.328253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:56.328253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pUnR2z5z3YrW8TB4M2Uoe0IHo8QExyA/QIFY3ZrAikqI5SZqlW3dzxIqLNl3ffy1OFBaM+esnpZVtj3B0leeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:56.328871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5055","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3befcad59276564115a49c93a9b26be4a32105f20fe1d5de6a18a235312ae4c6","sha256:be4f64e608c87da5c9e35c38b6caa3d12c017e94c2eb38177f0760ac85a290cd"],"state_sha256":"9a383efe0e52e96519a1856718040c1dcb03cf7d3a7870bdf88e6ad8114b8b13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bcit49dRv3+AH2ATiBYftXZFxHJfIOex6LnNrs0lmhrMj3x9s108NQGWz8Ai7MdfCzt3zdankkCI9bD5d+TDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:17:17.876696Z","bundle_sha256":"4ce7530dce7a1b160e5c3f6fa3dbe8a040b32c2e7b4fef785907f9df8c180739"}}