{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M66SHBV6D74M4LIBQHDQHAVDPV","short_pith_number":"pith:M66SHBV6","schema_version":"1.0","canonical_sha256":"67bd2386be1ff8ce2d0181c70382a37d5bf050ec837a9d8d517bc46b51c634f5","source":{"kind":"arxiv","id":"1704.00999","version":1},"attestation_state":"computed","paper":{"title":"A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.GT","authors_text":"Gilles Geeraerts, Jo\\\"el Goossens, Thi-Van-Anh Nguyen","submitted_at":"2017-04-04T13:26:31Z","abstract_excerpt":"The online feasibility problem (for a set of sporadic tasks) asks whether there is a scheduler that always prevents deadline misses (if any), whatever the sequence of job releases, which is a priori} unknown to the scheduler. In the multiprocessor setting, this problem is notoriously difficult. The only exact test for this problem has been proposed by Bonifaci and Marchetti-Spaccamela: it consists in modelling all the possible behaviours of the scheduler and of the tasks as a graph; and to interpret this graph as a game between the tasks and the scheduler, which are seen as antagonistic player"},"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":"1704.00999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-04T13:26:31Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"42825f94a61a6a265598c2271c1fd0b56a0f5568bdb722244637dbdbede48277","abstract_canon_sha256":"3f3292304937c7836997b0bb7707f9f8d76b8206c632145ddf4a1949656d581b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:16.495761Z","signature_b64":"KrHsj/5Ilb8/AvAdigyhy7RpNQlmiGheBIOSgOnPpqPBIT9Bq67cvOyJIWoXnHpl6OIJQ9eUm0MbqsrlOQjgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67bd2386be1ff8ce2d0181c70382a37d5bf050ec837a9d8d517bc46b51c634f5","last_reissued_at":"2026-05-18T00:47:16.495194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:16.495194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.GT","authors_text":"Gilles Geeraerts, Jo\\\"el Goossens, Thi-Van-Anh Nguyen","submitted_at":"2017-04-04T13:26:31Z","abstract_excerpt":"The online feasibility problem (for a set of sporadic tasks) asks whether there is a scheduler that always prevents deadline misses (if any), whatever the sequence of job releases, which is a priori} unknown to the scheduler. In the multiprocessor setting, this problem is notoriously difficult. The only exact test for this problem has been proposed by Bonifaci and Marchetti-Spaccamela: it consists in modelling all the possible behaviours of the scheduler and of the tasks as a graph; and to interpret this graph as a game between the tasks and the scheduler, which are seen as antagonistic player"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00999","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00999","created_at":"2026-05-18T00:47:16.495288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00999v1","created_at":"2026-05-18T00:47:16.495288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00999","created_at":"2026-05-18T00:47:16.495288+00:00"},{"alias_kind":"pith_short_12","alias_value":"M66SHBV6D74M","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M66SHBV6D74M4LIB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M66SHBV6","created_at":"2026-05-18T12:31:28.150371+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/M66SHBV6D74M4LIBQHDQHAVDPV","json":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV.json","graph_json":"https://pith.science/api/pith-number/M66SHBV6D74M4LIBQHDQHAVDPV/graph.json","events_json":"https://pith.science/api/pith-number/M66SHBV6D74M4LIBQHDQHAVDPV/events.json","paper":"https://pith.science/paper/M66SHBV6"},"agent_actions":{"view_html":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV","download_json":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV.json","view_paper":"https://pith.science/paper/M66SHBV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00999&json=true","fetch_graph":"https://pith.science/api/pith-number/M66SHBV6D74M4LIBQHDQHAVDPV/graph.json","fetch_events":"https://pith.science/api/pith-number/M66SHBV6D74M4LIBQHDQHAVDPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV/action/storage_attestation","attest_author":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV/action/author_attestation","sign_citation":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV/action/citation_signature","submit_replication":"https://pith.science/pith/M66SHBV6D74M4LIBQHDQHAVDPV/action/replication_record"}},"created_at":"2026-05-18T00:47:16.495288+00:00","updated_at":"2026-05-18T00:47:16.495288+00:00"}