{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NGH2EYNMB3W6STUAP62AEYK7PZ","short_pith_number":"pith:NGH2EYNM","schema_version":"1.0","canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","source":{"kind":"arxiv","id":"1403.0298","version":2},"attestation_state":"computed","paper":{"title":"A 4-approximation for scheduling on a single machine with general cost function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Juli\\'an Mestre","submitted_at":"2014-03-03T03:18:08Z","abstract_excerpt":"We consider a single machine scheduling problem that seeks to minimize a generalized cost function: given a subset of jobs we must order them so as to minimize $\\sum f_j(C_j)$, where $C_j$ is the completion time of job $j$ and $f_j$ is a job-dependent cost function. This problem has received a considerably amount of attention lately, partly because it generalizes a large number of sequencing problems while still allowing constant approximation guarantees.\n  In a recent paper, Cheung and Shmoys provided a primal-dual algorithm for the problem and claimed that is a 2-approximation. In this paper"},"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":"1403.0298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-03T03:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"085fefb9ffb0e1980e0a4caa0d6101d0c5e86836d54eacca4ca163908e26ec9c","abstract_canon_sha256":"59851d37e0146b74136faeb44e174297068fedc65c5e5bcd1fd7b2e045e77988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:17.897311Z","signature_b64":"JDEUDWgd1wNhROd8OGKOKW+qKXyBF7sjd9hdGSWFtkh/BhYLqpo5igOMw3WvJNMdfvfatZ3ANp4whaj6zUQ3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","last_reissued_at":"2026-05-18T00:55:17.896719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:17.896719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 4-approximation for scheduling on a single machine with general cost function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Juli\\'an Mestre","submitted_at":"2014-03-03T03:18:08Z","abstract_excerpt":"We consider a single machine scheduling problem that seeks to minimize a generalized cost function: given a subset of jobs we must order them so as to minimize $\\sum f_j(C_j)$, where $C_j$ is the completion time of job $j$ and $f_j$ is a job-dependent cost function. This problem has received a considerably amount of attention lately, partly because it generalizes a large number of sequencing problems while still allowing constant approximation guarantees.\n  In a recent paper, Cheung and Shmoys provided a primal-dual algorithm for the problem and claimed that is a 2-approximation. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0298","kind":"arxiv","version":2},"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":"1403.0298","created_at":"2026-05-18T00:55:17.896815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0298v2","created_at":"2026-05-18T00:55:17.896815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0298","created_at":"2026-05-18T00:55:17.896815+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGH2EYNMB3W6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGH2EYNMB3W6STUA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGH2EYNM","created_at":"2026-05-18T12:28:41.024544+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/NGH2EYNMB3W6STUAP62AEYK7PZ","json":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ.json","graph_json":"https://pith.science/api/pith-number/NGH2EYNMB3W6STUAP62AEYK7PZ/graph.json","events_json":"https://pith.science/api/pith-number/NGH2EYNMB3W6STUAP62AEYK7PZ/events.json","paper":"https://pith.science/paper/NGH2EYNM"},"agent_actions":{"view_html":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ","download_json":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ.json","view_paper":"https://pith.science/paper/NGH2EYNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0298&json=true","fetch_graph":"https://pith.science/api/pith-number/NGH2EYNMB3W6STUAP62AEYK7PZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NGH2EYNMB3W6STUAP62AEYK7PZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/action/storage_attestation","attest_author":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/action/author_attestation","sign_citation":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/action/citation_signature","submit_replication":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/action/replication_record"}},"created_at":"2026-05-18T00:55:17.896815+00:00","updated_at":"2026-05-18T00:55:17.896815+00:00"}