{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4C4DQ5B4CAPVAQ4D7F5J2PIHVF","short_pith_number":"pith:4C4DQ5B4","schema_version":"1.0","canonical_sha256":"e0b838743c101f504383f97a9d3d07a94edcf787df1033156be7d1031307328b","source":{"kind":"arxiv","id":"1404.5424","version":1},"attestation_state":"computed","paper":{"title":"A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christoph D\\\"urr, Damien Prot, Marek Chrobak, Odile Bellenguez-Morineau","submitted_at":"2014-04-22T08:54:20Z","abstract_excerpt":"In the paper \"The complexity of mean flow time scheduling problems with release times\", by Baptiste, Brucker, Chrobak, D\\\"urr, Kravchenko and Sourd, the authors claimed to prove strong NP-hardness of the scheduling problem $P|pmtn,r_j|\\sum C_j$, namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a new proof of strong NP-hardness for this problem."},"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":"1404.5424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-22T08:54:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3f8286be1dca95054f6499b88d036652976c91f2159b7ed4bd21410fd5f47ca4","abstract_canon_sha256":"d967bef39e3962e485149a28b3eddb176bb04602d61dc4fb6aaca7440b75062f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.461005Z","signature_b64":"eCRphUfNtdunbAbj2Y+/ndbvd/mtB14lghzxIH34KIXgj3yupURLWYNkDA5cfv+yfPuTANS+SzDvp2BF3W7KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0b838743c101f504383f97a9d3d07a94edcf787df1033156be7d1031307328b","last_reissued_at":"2026-05-18T02:53:31.460211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.460211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christoph D\\\"urr, Damien Prot, Marek Chrobak, Odile Bellenguez-Morineau","submitted_at":"2014-04-22T08:54:20Z","abstract_excerpt":"In the paper \"The complexity of mean flow time scheduling problems with release times\", by Baptiste, Brucker, Chrobak, D\\\"urr, Kravchenko and Sourd, the authors claimed to prove strong NP-hardness of the scheduling problem $P|pmtn,r_j|\\sum C_j$, namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a new proof of strong NP-hardness for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5424","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":"1404.5424","created_at":"2026-05-18T02:53:31.460381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5424v1","created_at":"2026-05-18T02:53:31.460381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5424","created_at":"2026-05-18T02:53:31.460381+00:00"},{"alias_kind":"pith_short_12","alias_value":"4C4DQ5B4CAPV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4C4DQ5B4CAPVAQ4D","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4C4DQ5B4","created_at":"2026-05-18T12:28:14.216126+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/4C4DQ5B4CAPVAQ4D7F5J2PIHVF","json":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF.json","graph_json":"https://pith.science/api/pith-number/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/graph.json","events_json":"https://pith.science/api/pith-number/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/events.json","paper":"https://pith.science/paper/4C4DQ5B4"},"agent_actions":{"view_html":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF","download_json":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF.json","view_paper":"https://pith.science/paper/4C4DQ5B4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5424&json=true","fetch_graph":"https://pith.science/api/pith-number/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/graph.json","fetch_events":"https://pith.science/api/pith-number/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/action/storage_attestation","attest_author":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/action/author_attestation","sign_citation":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/action/citation_signature","submit_replication":"https://pith.science/pith/4C4DQ5B4CAPVAQ4D7F5J2PIHVF/action/replication_record"}},"created_at":"2026-05-18T02:53:31.460381+00:00","updated_at":"2026-05-18T02:53:31.460381+00:00"}