{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MP37BZ7NL57TBZLBC2IYH33Y3K","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":"8395890182b2b0ae678472b8567bafc6be05fd53caa7157eafd30da1625b1888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-21T06:36:26Z","title_canon_sha256":"963ac5b3e889057ebbe66d051e0601251a2341a1a46e255168c6a9930ee721c0"},"schema_version":"1.0","source":{"id":"1802.07439","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07439","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07439v3","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07439","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"MP37BZ7NL57T","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MP37BZ7NL57TBZLB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MP37BZ7N","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:509dc4cf3c5f6c00dd30d83f88a086aecf299a7cd83681410c1c2f0cca0a55e5","target":"graph","created_at":"2026-05-18T00:07:49Z","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 the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and weight w_j. The goal is to find a preemptive schedule which minimizes the sum of weighted flow-time of jobs, where the flow-time of a job is the difference between its completion time and its released date. We give the first pseudo-polynomial time constant approximation algorithm for this problem. The running time of our algorithm is polynomial in n, the number of jobs, and P, which is the ratio of the largest to the smallest processing requ","authors_text":"Amit Kumar, Jatin Batra, Naveen Garg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-21T06:36:26Z","title":"Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07439","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:9ac40dbf3d886501982db9501c3b79132e0a7753aca9ed57b37f4bc7c30cd466","target":"record","created_at":"2026-05-18T00:07:49Z","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":"8395890182b2b0ae678472b8567bafc6be05fd53caa7157eafd30da1625b1888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-21T06:36:26Z","title_canon_sha256":"963ac5b3e889057ebbe66d051e0601251a2341a1a46e255168c6a9930ee721c0"},"schema_version":"1.0","source":{"id":"1802.07439","kind":"arxiv","version":3}},"canonical_sha256":"63f7f0e7ed5f7f30e561169183ef78da9411b63e334a9753fccfbe742df525a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63f7f0e7ed5f7f30e561169183ef78da9411b63e334a9753fccfbe742df525a3","first_computed_at":"2026-05-18T00:07:49.954289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:49.954289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVwLNrDe3n7RPDNvY163UoNOb3V410RnvXJhwHYfQoOJZhA97JZvDQD0Ll8xExUklU+jWLwsrPpLq/XvupbOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:49.954970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07439","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ac40dbf3d886501982db9501c3b79132e0a7753aca9ed57b37f4bc7c30cd466","sha256:509dc4cf3c5f6c00dd30d83f88a086aecf299a7cd83681410c1c2f0cca0a55e5"],"state_sha256":"73c2de96f0552d60a6088cbd981c46656ed7a13ee42b429b74549eaca442b951"}