{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EZQGAACPAXMFPMLMHOUJDRPBJT","short_pith_number":"pith:EZQGAACP","schema_version":"1.0","canonical_sha256":"266060004f05d857b16c3ba891c5e14cfe30ff0fdc6fed5c75fed3ba6e925e77","source":{"kind":"arxiv","id":"1710.07380","version":4},"attestation_state":"computed","paper":{"title":"Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaros{\\l}aw Mirek, Marek Klonowski, Prudence W.H. Wong","submitted_at":"2017-10-20T00:30:04Z","abstract_excerpt":"We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone to crashes by an adversary. A machine can inform other machines when a job is completed via the channel without collision detection. Performance is measured by the total number of available machine steps during the whole execution. Our goal is to study the impact of preemption (i.e., interrupting the execution of a job and resuming later in the same or differ"},"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":"1710.07380","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T00:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"460926172e4509afaad727a5370fe5e3805e6e172af94903bf17fb0634f38a6f","abstract_canon_sha256":"54c5a9d1712888372b59ed1a507cd6ffc3250f0cf319bfb040e9df1923820667"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.901261Z","signature_b64":"TonPTMTK34lRTBunZAhjkCB41xiQyaBf5uZ5zN1OuaxidObA59QRGTLPbgwyFxyK5YAKsNVppGQBOXc5TXWTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"266060004f05d857b16c3ba891c5e14cfe30ff0fdc6fed5c75fed3ba6e925e77","last_reissued_at":"2026-05-18T00:09:52.900551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.900551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaros{\\l}aw Mirek, Marek Klonowski, Prudence W.H. Wong","submitted_at":"2017-10-20T00:30:04Z","abstract_excerpt":"We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone to crashes by an adversary. A machine can inform other machines when a job is completed via the channel without collision detection. Performance is measured by the total number of available machine steps during the whole execution. Our goal is to study the impact of preemption (i.e., interrupting the execution of a job and resuming later in the same or differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07380","kind":"arxiv","version":4},"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":"1710.07380","created_at":"2026-05-18T00:09:52.900672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07380v4","created_at":"2026-05-18T00:09:52.900672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07380","created_at":"2026-05-18T00:09:52.900672+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZQGAACPAXMF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZQGAACPAXMFPMLM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZQGAACP","created_at":"2026-05-18T12:31:12.930513+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/EZQGAACPAXMFPMLMHOUJDRPBJT","json":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT.json","graph_json":"https://pith.science/api/pith-number/EZQGAACPAXMFPMLMHOUJDRPBJT/graph.json","events_json":"https://pith.science/api/pith-number/EZQGAACPAXMFPMLMHOUJDRPBJT/events.json","paper":"https://pith.science/paper/EZQGAACP"},"agent_actions":{"view_html":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT","download_json":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT.json","view_paper":"https://pith.science/paper/EZQGAACP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07380&json=true","fetch_graph":"https://pith.science/api/pith-number/EZQGAACPAXMFPMLMHOUJDRPBJT/graph.json","fetch_events":"https://pith.science/api/pith-number/EZQGAACPAXMFPMLMHOUJDRPBJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT/action/storage_attestation","attest_author":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT/action/author_attestation","sign_citation":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT/action/citation_signature","submit_replication":"https://pith.science/pith/EZQGAACPAXMFPMLMHOUJDRPBJT/action/replication_record"}},"created_at":"2026-05-18T00:09:52.900672+00:00","updated_at":"2026-05-18T00:09:52.900672+00:00"}