{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NGH2EYNMB3W6STUAP62AEYK7PZ","short_pith_number":"pith:NGH2EYNM","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"},"canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","source":{"kind":"arxiv","id":"1403.0298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0298","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0298v2","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0298","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"NGH2EYNMB3W6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NGH2EYNMB3W6STUA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NGH2EYNM","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NGH2EYNMB3W6STUAP62AEYK7PZ","target":"record","payload":{"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"},"canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","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"},"source_kind":"arxiv","source_id":"1403.0298","source_version":2,"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:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMXGo7rwlTmRvdKKkr3gMShqXYHgOwbU0+MazRc2jAliic325Vtkw+UhdqPZ1h63a8m/9F9HMCcas478R7b0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:45:43.348090Z"},"content_sha256":"270d30399b3844e64d68502482340c9c8e57815e381d9dbed4272345238e4dd5","schema_version":"1.0","event_id":"sha256:270d30399b3844e64d68502482340c9c8e57815e381d9dbed4272345238e4dd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NGH2EYNMB3W6STUAP62AEYK7PZ","target":"graph","payload":{"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"},"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:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDk0HZl6zpWKkJJX0LcAuwkT4MSUOgAPo3SWVOX0zN2376ZcCetr1JLkebugomLyklcvlMsZXH86VxNQjWLxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:45:43.348457Z"},"content_sha256":"176b874584f4657d9cf17f8884d2a678d59c47b205ab737fe9b0ed1459d942ab","schema_version":"1.0","event_id":"sha256:176b874584f4657d9cf17f8884d2a678d59c47b205ab737fe9b0ed1459d942ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/bundle.json","state_url":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/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-03T06:45:43Z","links":{"resolver":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ","bundle":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/bundle.json","state":"https://pith.science/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGH2EYNMB3W6STUAP62AEYK7PZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NGH2EYNMB3W6STUAP62AEYK7PZ","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":"59851d37e0146b74136faeb44e174297068fedc65c5e5bcd1fd7b2e045e77988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-03T03:18:08Z","title_canon_sha256":"085fefb9ffb0e1980e0a4caa0d6101d0c5e86836d54eacca4ca163908e26ec9c"},"schema_version":"1.0","source":{"id":"1403.0298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0298","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0298v2","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0298","created_at":"2026-05-18T00:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"NGH2EYNMB3W6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NGH2EYNMB3W6STUA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NGH2EYNM","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:176b874584f4657d9cf17f8884d2a678d59c47b205ab737fe9b0ed1459d942ab","target":"graph","created_at":"2026-05-18T00:55:17Z","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 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","authors_text":"Jos\\'e Verschae, Juli\\'an Mestre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-03T03:18:08Z","title":"A 4-approximation for scheduling on a single machine with general cost function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0298","kind":"arxiv","version":2},"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:270d30399b3844e64d68502482340c9c8e57815e381d9dbed4272345238e4dd5","target":"record","created_at":"2026-05-18T00:55:17Z","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":"59851d37e0146b74136faeb44e174297068fedc65c5e5bcd1fd7b2e045e77988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-03T03:18:08Z","title_canon_sha256":"085fefb9ffb0e1980e0a4caa0d6101d0c5e86836d54eacca4ca163908e26ec9c"},"schema_version":"1.0","source":{"id":"1403.0298","kind":"arxiv","version":2}},"canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"698fa261ac0eede94e807fb402615f7e5c4c67891b8748946a9cebc72c9d28a4","first_computed_at":"2026-05-18T00:55:17.896719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:17.896719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDEUDWgd1wNhROd8OGKOKW+qKXyBF7sjd9hdGSWFtkh/BhYLqpo5igOMw3WvJNMdfvfatZ3ANp4whaj6zUQ3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:17.897311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:270d30399b3844e64d68502482340c9c8e57815e381d9dbed4272345238e4dd5","sha256:176b874584f4657d9cf17f8884d2a678d59c47b205ab737fe9b0ed1459d942ab"],"state_sha256":"f1930d56a5d8b75e9a05863b06b3e76e52cf3c20c2183f40b929e126370f8eb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhUHZLZRb04IwYusiXcHYSVdJ2mmllTtgoUIz+n5275Th8h2NS4KP1J5IC7R5Rt7UGhdf+hjUv7yAUlq78c7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:45:43.350403Z","bundle_sha256":"11417edd9d975bdd89f9d0e8d43e4b025b34e93aff1481199061efcdfd21d58c"}}