{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WRWRTJJAIOAL2BPL6FK4NJUO6M","short_pith_number":"pith:WRWRTJJA","schema_version":"1.0","canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","source":{"kind":"arxiv","id":"1712.10273","version":3},"attestation_state":"computed","paper":{"title":"Improved Online Algorithm for Weighted Flow Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noam Touitou, Yossi Azar","submitted_at":"2017-12-29T16:35:59Z","abstract_excerpt":"We discuss one of the most fundamental scheduling problem of processing jobs on a single machine to minimize the weighted flow time (weighted response time). Our main result is a $O(\\log P)$-competitive algorithm, where $P$ is the maximum-to-minimum processing time ratio, improving upon the $O(\\log^{2}P)$-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We also design a $O(\\log D)$-competitive algorithm, where $D$ is the maximum-to-minimum density ratio of jobs. Finally, we show how to combine these results with the result of Bansal and Dhamdhere (SODA 2003) to achieve a $O(\\log(\\"},"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":"1712.10273","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T16:35:59Z","cross_cats_sorted":[],"title_canon_sha256":"33499fcc5d3523e2408200ba7291ae8d1f1da37e1ffe74b6974300ce290b5631","abstract_canon_sha256":"4b8311ac254f5f92c97c893e378651265c7d3f667b25440faf0dc9e30faf7ce6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:00.667775Z","signature_b64":"jtOya2/Y90AOutG8YBtBGfstR/JRzrJ4Kn47pe1lkp2UetmqBGlf7nn/Z6mNZuMnDRkvgL9izU6bvGqTfKyQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","last_reissued_at":"2026-05-18T00:08:00.667292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:00.667292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Online Algorithm for Weighted Flow Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noam Touitou, Yossi Azar","submitted_at":"2017-12-29T16:35:59Z","abstract_excerpt":"We discuss one of the most fundamental scheduling problem of processing jobs on a single machine to minimize the weighted flow time (weighted response time). Our main result is a $O(\\log P)$-competitive algorithm, where $P$ is the maximum-to-minimum processing time ratio, improving upon the $O(\\log^{2}P)$-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We also design a $O(\\log D)$-competitive algorithm, where $D$ is the maximum-to-minimum density ratio of jobs. Finally, we show how to combine these results with the result of Bansal and Dhamdhere (SODA 2003) to achieve a $O(\\log(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10273","kind":"arxiv","version":3},"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":"1712.10273","created_at":"2026-05-18T00:08:00.667375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.10273v3","created_at":"2026-05-18T00:08:00.667375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10273","created_at":"2026-05-18T00:08:00.667375+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRWRTJJAIOAL","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRWRTJJAIOAL2BPL","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRWRTJJA","created_at":"2026-05-18T12:31:53.515858+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/WRWRTJJAIOAL2BPL6FK4NJUO6M","json":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M.json","graph_json":"https://pith.science/api/pith-number/WRWRTJJAIOAL2BPL6FK4NJUO6M/graph.json","events_json":"https://pith.science/api/pith-number/WRWRTJJAIOAL2BPL6FK4NJUO6M/events.json","paper":"https://pith.science/paper/WRWRTJJA"},"agent_actions":{"view_html":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M","download_json":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M.json","view_paper":"https://pith.science/paper/WRWRTJJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.10273&json=true","fetch_graph":"https://pith.science/api/pith-number/WRWRTJJAIOAL2BPL6FK4NJUO6M/graph.json","fetch_events":"https://pith.science/api/pith-number/WRWRTJJAIOAL2BPL6FK4NJUO6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/action/storage_attestation","attest_author":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/action/author_attestation","sign_citation":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/action/citation_signature","submit_replication":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/action/replication_record"}},"created_at":"2026-05-18T00:08:00.667375+00:00","updated_at":"2026-05-18T00:08:00.667375+00:00"}