{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WRWRTJJAIOAL2BPL6FK4NJUO6M","short_pith_number":"pith:WRWRTJJA","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"},"canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","source":{"kind":"arxiv","id":"1712.10273","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10273","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10273v3","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10273","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"WRWRTJJAIOAL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRWRTJJAIOAL2BPL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRWRTJJA","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WRWRTJJAIOAL2BPL6FK4NJUO6M","target":"record","payload":{"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"},"canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","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"},"source_kind":"arxiv","source_id":"1712.10273","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qitsnWlTzyB6mBX5jES6sEWngxJKrlZz31db4o1VGwXhxH5PMp8Bc2Fs0pxNU9lwI1VLi6Po/qx4n79KSG3ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:56.648565Z"},"content_sha256":"70fae413572aff79970a8ee26bce0e96a0d1068c1893ec9d07ae588378557a2d","schema_version":"1.0","event_id":"sha256:70fae413572aff79970a8ee26bce0e96a0d1068c1893ec9d07ae588378557a2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WRWRTJJAIOAL2BPL6FK4NJUO6M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDqV9LHSzZHuujN4Q76ZiN61zlow3IgofVvmIn9LrjDgSi2oWyfvutbwAs4LO1xntVvp5eEENphnreQ0B1YwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:56.649188Z"},"content_sha256":"a34d3a529cdb51fa560afb68444ee6a4735f406a459fa3b71f06e21f4006b77c","schema_version":"1.0","event_id":"sha256:a34d3a529cdb51fa560afb68444ee6a4735f406a459fa3b71f06e21f4006b77c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/bundle.json","state_url":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T23:15:56Z","links":{"resolver":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M","bundle":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/bundle.json","state":"https://pith.science/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRWRTJJAIOAL2BPL6FK4NJUO6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WRWRTJJAIOAL2BPL6FK4NJUO6M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b8311ac254f5f92c97c893e378651265c7d3f667b25440faf0dc9e30faf7ce6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T16:35:59Z","title_canon_sha256":"33499fcc5d3523e2408200ba7291ae8d1f1da37e1ffe74b6974300ce290b5631"},"schema_version":"1.0","source":{"id":"1712.10273","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10273","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10273v3","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10273","created_at":"2026-05-18T00:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"WRWRTJJAIOAL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRWRTJJAIOAL2BPL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRWRTJJA","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:a34d3a529cdb51fa560afb68444ee6a4735f406a459fa3b71f06e21f4006b77c","target":"graph","created_at":"2026-05-18T00:08:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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(\\","authors_text":"Noam Touitou, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T16:35:59Z","title":"Improved Online Algorithm for Weighted Flow Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10273","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70fae413572aff79970a8ee26bce0e96a0d1068c1893ec9d07ae588378557a2d","target":"record","created_at":"2026-05-18T00:08:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b8311ac254f5f92c97c893e378651265c7d3f667b25440faf0dc9e30faf7ce6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T16:35:59Z","title_canon_sha256":"33499fcc5d3523e2408200ba7291ae8d1f1da37e1ffe74b6974300ce290b5631"},"schema_version":"1.0","source":{"id":"1712.10273","kind":"arxiv","version":3}},"canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b46d19a5204380bd05ebf155c6a68ef33e56d3145a760b92a01b78a2e27bf8dc","first_computed_at":"2026-05-18T00:08:00.667292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:00.667292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jtOya2/Y90AOutG8YBtBGfstR/JRzrJ4Kn47pe1lkp2UetmqBGlf7nn/Z6mNZuMnDRkvgL9izU6bvGqTfKyQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:00.667775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10273","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fae413572aff79970a8ee26bce0e96a0d1068c1893ec9d07ae588378557a2d","sha256:a34d3a529cdb51fa560afb68444ee6a4735f406a459fa3b71f06e21f4006b77c"],"state_sha256":"29a00b1ebae084ac784be85b5893dd6fd1822e53ad16567f7ca76cc47691f68e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xe3v9Gxyxibnl0bxQ3/IbKpJ4sOoT9atSrJl5z+NOQTVJ4/61hfbnKy9nBXpJdDCzJrr+G266TFTa7sZ15AFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:15:56.652629Z","bundle_sha256":"7f0326b3fe25e3a6b84203cf9fe50c305fca02bdd904da37f8f1740d04a2062f"}}