{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G522XWPG2QO3KJ6J5O77APD2PU","short_pith_number":"pith:G522XWPG","schema_version":"1.0","canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","source":{"kind":"arxiv","id":"1804.08317","version":1},"attestation_state":"computed","paper":{"title":"Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhinav Srivastav, Benjamin Moseley, Denis Trystram, Giorgio Lucarelli, Nguyen Kim Thang","submitted_at":"2018-04-23T10:04:05Z","abstract_excerpt":"In this paper, we consider the online problem of scheduling independent jobs \\emph{non-preemptively} so as to minimize the weighted flow-time on a set of unrelated machines. There has been a considerable amount of work on this problem in the preemptive setting where several competitive algorithms are known in the classical competitive model. %Using the speed augmentation model, Anand et al. showed that the greedy algorithm is $O\\left(\\frac{1}{\\epsilon}\\right)$-competitive in the preemptive setting. In the non-preemptive setting, Lucarelli et al. showed that there exists a strong lower bound fo"},"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":"1804.08317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T10:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"d2cdfacadf045635a6f154e60f74ebf60ee7d001b4c03b63d3577dca54aeadf3","abstract_canon_sha256":"5de1320dfe56965a37caaf315aaff926581034af95ccd15285c00113135c6c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:48.790701Z","signature_b64":"qUmwJ17EdIzsX0P7qvivBVFIcDWrW72sUX5lh+8yUo2Cc5rgqC6lcz86P4SkwQmYUcicD4XNHqEvGJKoVbQ1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","last_reissued_at":"2026-05-18T00:17:48.789896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:48.789896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhinav Srivastav, Benjamin Moseley, Denis Trystram, Giorgio Lucarelli, Nguyen Kim Thang","submitted_at":"2018-04-23T10:04:05Z","abstract_excerpt":"In this paper, we consider the online problem of scheduling independent jobs \\emph{non-preemptively} so as to minimize the weighted flow-time on a set of unrelated machines. There has been a considerable amount of work on this problem in the preemptive setting where several competitive algorithms are known in the classical competitive model. %Using the speed augmentation model, Anand et al. showed that the greedy algorithm is $O\\left(\\frac{1}{\\epsilon}\\right)$-competitive in the preemptive setting. In the non-preemptive setting, Lucarelli et al. showed that there exists a strong lower bound fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08317","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":"1804.08317","created_at":"2026-05-18T00:17:48.790043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08317v1","created_at":"2026-05-18T00:17:48.790043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08317","created_at":"2026-05-18T00:17:48.790043+00:00"},{"alias_kind":"pith_short_12","alias_value":"G522XWPG2QO3","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G522XWPG2QO3KJ6J","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G522XWPG","created_at":"2026-05-18T12:32:25.280505+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/G522XWPG2QO3KJ6J5O77APD2PU","json":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU.json","graph_json":"https://pith.science/api/pith-number/G522XWPG2QO3KJ6J5O77APD2PU/graph.json","events_json":"https://pith.science/api/pith-number/G522XWPG2QO3KJ6J5O77APD2PU/events.json","paper":"https://pith.science/paper/G522XWPG"},"agent_actions":{"view_html":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU","download_json":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU.json","view_paper":"https://pith.science/paper/G522XWPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08317&json=true","fetch_graph":"https://pith.science/api/pith-number/G522XWPG2QO3KJ6J5O77APD2PU/graph.json","fetch_events":"https://pith.science/api/pith-number/G522XWPG2QO3KJ6J5O77APD2PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/action/storage_attestation","attest_author":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/action/author_attestation","sign_citation":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/action/citation_signature","submit_replication":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/action/replication_record"}},"created_at":"2026-05-18T00:17:48.790043+00:00","updated_at":"2026-05-18T00:17:48.790043+00:00"}