{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G522XWPG2QO3KJ6J5O77APD2PU","short_pith_number":"pith:G522XWPG","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"},"canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","source":{"kind":"arxiv","id":"1804.08317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08317","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08317v1","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08317","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"G522XWPG2QO3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G522XWPG2QO3KJ6J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G522XWPG","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G522XWPG2QO3KJ6J5O77APD2PU","target":"record","payload":{"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"},"canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","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"},"source_kind":"arxiv","source_id":"1804.08317","source_version":1,"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:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Nayho3zEQHUYIm7YKOkYHyJER3PgvFQXV6XmI59StkZMKKrwtK0dgURKAU8OKTkMsVK6514Oo7Vxg1Fq4+kBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:06:20.735508Z"},"content_sha256":"4efb30c23153988011a02c5b327b831a9662d0a918e6e99df77faebef6e81323","schema_version":"1.0","event_id":"sha256:4efb30c23153988011a02c5b327b831a9662d0a918e6e99df77faebef6e81323"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G522XWPG2QO3KJ6J5O77APD2PU","target":"graph","payload":{"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"},"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:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjkWU6lf4nlJ44CkKnLupzhvN9su5GjA7k/ZSwqbotD+WyadI7UOmlQW2Lwhcue+usxbnw4g4Yuiz85LtDeFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:06:20.736170Z"},"content_sha256":"efd52a1fd8389ab467b67c705067051d16888ed5d2cc81b8c6044334abb5ac24","schema_version":"1.0","event_id":"sha256:efd52a1fd8389ab467b67c705067051d16888ed5d2cc81b8c6044334abb5ac24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/bundle.json","state_url":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G522XWPG2QO3KJ6J5O77APD2PU/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-06-10T11:06:20Z","links":{"resolver":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU","bundle":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/bundle.json","state":"https://pith.science/pith/G522XWPG2QO3KJ6J5O77APD2PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G522XWPG2QO3KJ6J5O77APD2PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G522XWPG2QO3KJ6J5O77APD2PU","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":"5de1320dfe56965a37caaf315aaff926581034af95ccd15285c00113135c6c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T10:04:05Z","title_canon_sha256":"d2cdfacadf045635a6f154e60f74ebf60ee7d001b4c03b63d3577dca54aeadf3"},"schema_version":"1.0","source":{"id":"1804.08317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08317","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08317v1","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08317","created_at":"2026-05-18T00:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"G522XWPG2QO3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G522XWPG2QO3KJ6J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G522XWPG","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:efd52a1fd8389ab467b67c705067051d16888ed5d2cc81b8c6044334abb5ac24","target":"graph","created_at":"2026-05-18T00:17:48Z","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":"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","authors_text":"Abhinav Srivastav, Benjamin Moseley, Denis Trystram, Giorgio Lucarelli, Nguyen Kim Thang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T10:04:05Z","title":"Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08317","kind":"arxiv","version":1},"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:4efb30c23153988011a02c5b327b831a9662d0a918e6e99df77faebef6e81323","target":"record","created_at":"2026-05-18T00:17:48Z","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":"5de1320dfe56965a37caaf315aaff926581034af95ccd15285c00113135c6c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T10:04:05Z","title_canon_sha256":"d2cdfacadf045635a6f154e60f74ebf60ee7d001b4c03b63d3577dca54aeadf3"},"schema_version":"1.0","source":{"id":"1804.08317","kind":"arxiv","version":1}},"canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3775abd9e6d41db527c9ebbff03c7a7d109eb9624834d0316607b700b2a31300","first_computed_at":"2026-05-18T00:17:48.789896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:48.789896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qUmwJ17EdIzsX0P7qvivBVFIcDWrW72sUX5lh+8yUo2Cc5rgqC6lcz86P4SkwQmYUcicD4XNHqEvGJKoVbQ1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:48.790701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4efb30c23153988011a02c5b327b831a9662d0a918e6e99df77faebef6e81323","sha256:efd52a1fd8389ab467b67c705067051d16888ed5d2cc81b8c6044334abb5ac24"],"state_sha256":"bc4f0181ce0221e0d1b19dc7a0733471bff331ba3da56de11cd54196e6886196"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlqDIh5xmmEyC5H3aKXqrK4sjQ9hcDF+Z/o0Kyby2WHpazESD0lfpk+IjMX1KE3UUzsOvFQws5ElqNfsJxzrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:06:20.739896Z","bundle_sha256":"529136bd615080f0b81c10edcb67f99351a4e690d5914baa5ed1e917b455e7f5"}}