{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R4TH7IKPJXVCGCZ5673D74X766","short_pith_number":"pith:R4TH7IKP","schema_version":"1.0","canonical_sha256":"8f267fa14f4dea230b3df7f63ff2fff7840473f146ccded709a6b6b710c8f8d8","source":{"kind":"arxiv","id":"1802.10376","version":1},"attestation_state":"computed","paper":{"title":"Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.OS","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Niklas Ueter","submitted_at":"2018-02-28T11:51:26Z","abstract_excerpt":"The sporadic task model is often used to analyze recurrent execution of identical tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also called jobs, that arrive under the minimum inter-arrival time constraint. To ensure the system safety, timeliness has to be guaranteed in addition to functional correctness, i.e., all jobs of all tasks have to be finished before the job deadlines. We focus on analyzing arbitrary-deadline task sets on a homogeneous (identical) multiprocessor system under any given global fixed-priority scheduling approach and provide a"},"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":"1802.10376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-02-28T11:51:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ea9184062c0a594e7d5b620c4cb750393bcdd581c8ca964463dc6cfc86d22dfb","abstract_canon_sha256":"f5cc6871aaeecb5bfe7cef7ab31a0389e7734eae55fe981c9b411e1a531c6c2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.312269Z","signature_b64":"hQrbmnTNBnBl6UX9lbJFh5bvDpOiCuGp8Y40ZzmJCC6usbehVo/OgWmdPxeKyew6gQgyA30axiiflnKZu8uLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f267fa14f4dea230b3df7f63ff2fff7840473f146ccded709a6b6b710c8f8d8","last_reissued_at":"2026-05-18T00:22:17.311593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.311593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.OS","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Niklas Ueter","submitted_at":"2018-02-28T11:51:26Z","abstract_excerpt":"The sporadic task model is often used to analyze recurrent execution of identical tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also called jobs, that arrive under the minimum inter-arrival time constraint. To ensure the system safety, timeliness has to be guaranteed in addition to functional correctness, i.e., all jobs of all tasks have to be finished before the job deadlines. We focus on analyzing arbitrary-deadline task sets on a homogeneous (identical) multiprocessor system under any given global fixed-priority scheduling approach and provide a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10376","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":"1802.10376","created_at":"2026-05-18T00:22:17.311707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10376v1","created_at":"2026-05-18T00:22:17.311707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10376","created_at":"2026-05-18T00:22:17.311707+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4TH7IKPJXVC","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4TH7IKPJXVCGCZ5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4TH7IKP","created_at":"2026-05-18T12:32:50.500415+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/R4TH7IKPJXVCGCZ5673D74X766","json":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766.json","graph_json":"https://pith.science/api/pith-number/R4TH7IKPJXVCGCZ5673D74X766/graph.json","events_json":"https://pith.science/api/pith-number/R4TH7IKPJXVCGCZ5673D74X766/events.json","paper":"https://pith.science/paper/R4TH7IKP"},"agent_actions":{"view_html":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766","download_json":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766.json","view_paper":"https://pith.science/paper/R4TH7IKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10376&json=true","fetch_graph":"https://pith.science/api/pith-number/R4TH7IKPJXVCGCZ5673D74X766/graph.json","fetch_events":"https://pith.science/api/pith-number/R4TH7IKPJXVCGCZ5673D74X766/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766/action/storage_attestation","attest_author":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766/action/author_attestation","sign_citation":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766/action/citation_signature","submit_replication":"https://pith.science/pith/R4TH7IKPJXVCGCZ5673D74X766/action/replication_record"}},"created_at":"2026-05-18T00:22:17.311707+00:00","updated_at":"2026-05-18T00:22:17.311707+00:00"}