{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ERXFUYAOFOGWFNMHLJNK2TWAFL","short_pith_number":"pith:ERXFUYAO","schema_version":"1.0","canonical_sha256":"246e5a600e2b8d62b5875a5aad4ec02af24da05bcb394c3da7b746bc7e846da3","source":{"kind":"arxiv","id":"1805.09602","version":1},"attestation_state":"computed","paper":{"title":"Non-Preemptive Flow-Time Minimization via Rejections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Jason Li","submitted_at":"2018-05-24T11:04:09Z","abstract_excerpt":"We consider the online problem of minimizing weighted flow-time on unrelated machines. Although much is known about this problem in the resource-augmentation setting, these results assume that jobs can be preempted. We give the first constant-competitive algorithm for the non-preemptive setting in the rejection model. In this rejection model, we are allowed to reject an $\\varepsilon$-fraction of the total weight of jobs, and compare the resulting flow-time to that of the offline optimum which is required to schedule all jobs. This is arguably the weakest assumption in which such a result is kn"},"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":"1805.09602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T11:04:09Z","cross_cats_sorted":[],"title_canon_sha256":"e1e2e4ef41ba9bb0a97a2cd01edbb592c92aa57fc9616863d09366a93efd6f2f","abstract_canon_sha256":"1a0c88d539d0914caed55a2d75bd9890df27dbd0161c60236054d2e941206104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.441868Z","signature_b64":"awsv/GZYeQIjw4AN+0iDA+dFyzztYsgGO+vO14k+4TtcccTi9CHYVv215GomYMOqQStlspMuw96bsnYIEdjLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"246e5a600e2b8d62b5875a5aad4ec02af24da05bcb394c3da7b746bc7e846da3","last_reissued_at":"2026-05-18T00:15:03.441341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.441341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Preemptive Flow-Time Minimization via Rejections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Jason Li","submitted_at":"2018-05-24T11:04:09Z","abstract_excerpt":"We consider the online problem of minimizing weighted flow-time on unrelated machines. Although much is known about this problem in the resource-augmentation setting, these results assume that jobs can be preempted. We give the first constant-competitive algorithm for the non-preemptive setting in the rejection model. In this rejection model, we are allowed to reject an $\\varepsilon$-fraction of the total weight of jobs, and compare the resulting flow-time to that of the offline optimum which is required to schedule all jobs. This is arguably the weakest assumption in which such a result is kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09602","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":"1805.09602","created_at":"2026-05-18T00:15:03.441438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09602v1","created_at":"2026-05-18T00:15:03.441438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09602","created_at":"2026-05-18T00:15:03.441438+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERXFUYAOFOGW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERXFUYAOFOGWFNMH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERXFUYAO","created_at":"2026-05-18T12:32:22.470017+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/ERXFUYAOFOGWFNMHLJNK2TWAFL","json":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL.json","graph_json":"https://pith.science/api/pith-number/ERXFUYAOFOGWFNMHLJNK2TWAFL/graph.json","events_json":"https://pith.science/api/pith-number/ERXFUYAOFOGWFNMHLJNK2TWAFL/events.json","paper":"https://pith.science/paper/ERXFUYAO"},"agent_actions":{"view_html":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL","download_json":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL.json","view_paper":"https://pith.science/paper/ERXFUYAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09602&json=true","fetch_graph":"https://pith.science/api/pith-number/ERXFUYAOFOGWFNMHLJNK2TWAFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ERXFUYAOFOGWFNMHLJNK2TWAFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL/action/storage_attestation","attest_author":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL/action/author_attestation","sign_citation":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL/action/citation_signature","submit_replication":"https://pith.science/pith/ERXFUYAOFOGWFNMHLJNK2TWAFL/action/replication_record"}},"created_at":"2026-05-18T00:15:03.441438+00:00","updated_at":"2026-05-18T00:15:03.441438+00:00"}