{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZQKZ2F4RT7A24LOVJXBY6ZM4UV","short_pith_number":"pith:ZQKZ2F4R","canonical_record":{"source":{"id":"1411.0309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-02T20:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"e7cd0a3e5c6fa987f0632a2957a407f846cbdbab82d63813faa2d9d2b066fb1e","abstract_canon_sha256":"afe202972e5105920c1c9c28f31d115d3a64222ef3b0868bfd6691b519495ca1"},"schema_version":"1.0"},"canonical_sha256":"cc159d17919fc1ae2dd54dc38f659ca5794b0278f6f588a798b938f76ca6eefa","source":{"kind":"arxiv","id":"1411.0309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0309","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0309v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0309","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZQKZ2F4RT7A2","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQKZ2F4RT7A24LOV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQKZ2F4R","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZQKZ2F4RT7A24LOVJXBY6ZM4UV","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-02T20:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"e7cd0a3e5c6fa987f0632a2957a407f846cbdbab82d63813faa2d9d2b066fb1e","abstract_canon_sha256":"afe202972e5105920c1c9c28f31d115d3a64222ef3b0868bfd6691b519495ca1"},"schema_version":"1.0"},"canonical_sha256":"cc159d17919fc1ae2dd54dc38f659ca5794b0278f6f588a798b938f76ca6eefa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.025600Z","signature_b64":"0ejyCYHkgLTJXEip5c4lKXnJZlkpnQkO/k6Di+S5HO3/AtrMjLx08NhokqwqxC/r1L+WBhoIfeondi63HyNBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc159d17919fc1ae2dd54dc38f659ca5794b0278f6f588a798b938f76ca6eefa","last_reissued_at":"2026-05-18T02:38:52.024954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.024954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0309","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yJ3jRHI3MNkWEawqQxn4ubFZVMcKeCk2XovL4koQzVsWYaUVQRaRprcC/ytKmh00lqEpiMHbHm4mVSUtHJQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:08:52.908212Z"},"content_sha256":"b9c6f4545c8126cf13172b2da58bef1a964abf03b8880b3b1dbe738f56641190","schema_version":"1.0","event_id":"sha256:b9c6f4545c8126cf13172b2da58bef1a964abf03b8880b3b1dbe738f56641190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZQKZ2F4RT7A24LOVJXBY6ZM4UV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling step-deteriorating jobs to minimize the total weighted tardiness on a single machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peng Guo, Wenming Cheng, Yi Wang","submitted_at":"2014-11-02T20:16:00Z","abstract_excerpt":"This paper addresses the scheduling problem of minimizing the total weighted tardiness on a single machine with step-deteriorating jobs. With the assumption of deterioration, the job processing times are modeled by step functions of job starting times and pre-specified job deteriorating dates. The introduction of step-deteriorating jobs makes a single machine total weighted tardiness problem more intractable. The computational complexity of this problem under consideration was not determined. In this study, it is firstly proved to be strongly NP-hard. Then a mixed integer programming model is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0309","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Rop9J2To9+H/UbgNwFAzXR1WJr538jdpx48eqbL2O36pUHjP3I2dct8J62pM9L/Fem1yekoCvGZ8jh11LZNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:08:52.908609Z"},"content_sha256":"782a11b86489cd9b5ec76cd69ef39173eb25e8f403c89c2031510939b4795561","schema_version":"1.0","event_id":"sha256:782a11b86489cd9b5ec76cd69ef39173eb25e8f403c89c2031510939b4795561"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/bundle.json","state_url":"https://pith.science/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/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-04T21:08:52Z","links":{"resolver":"https://pith.science/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV","bundle":"https://pith.science/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/bundle.json","state":"https://pith.science/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQKZ2F4RT7A24LOVJXBY6ZM4UV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZQKZ2F4RT7A24LOVJXBY6ZM4UV","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":"afe202972e5105920c1c9c28f31d115d3a64222ef3b0868bfd6691b519495ca1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-02T20:16:00Z","title_canon_sha256":"e7cd0a3e5c6fa987f0632a2957a407f846cbdbab82d63813faa2d9d2b066fb1e"},"schema_version":"1.0","source":{"id":"1411.0309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0309","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0309v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0309","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZQKZ2F4RT7A2","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQKZ2F4RT7A24LOV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQKZ2F4R","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:782a11b86489cd9b5ec76cd69ef39173eb25e8f403c89c2031510939b4795561","target":"graph","created_at":"2026-05-18T02:38:52Z","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":"This paper addresses the scheduling problem of minimizing the total weighted tardiness on a single machine with step-deteriorating jobs. With the assumption of deterioration, the job processing times are modeled by step functions of job starting times and pre-specified job deteriorating dates. The introduction of step-deteriorating jobs makes a single machine total weighted tardiness problem more intractable. The computational complexity of this problem under consideration was not determined. In this study, it is firstly proved to be strongly NP-hard. Then a mixed integer programming model is ","authors_text":"Peng Guo, Wenming Cheng, Yi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-02T20:16:00Z","title":"Scheduling step-deteriorating jobs to minimize the total weighted tardiness on a single machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0309","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:b9c6f4545c8126cf13172b2da58bef1a964abf03b8880b3b1dbe738f56641190","target":"record","created_at":"2026-05-18T02:38:52Z","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":"afe202972e5105920c1c9c28f31d115d3a64222ef3b0868bfd6691b519495ca1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-02T20:16:00Z","title_canon_sha256":"e7cd0a3e5c6fa987f0632a2957a407f846cbdbab82d63813faa2d9d2b066fb1e"},"schema_version":"1.0","source":{"id":"1411.0309","kind":"arxiv","version":1}},"canonical_sha256":"cc159d17919fc1ae2dd54dc38f659ca5794b0278f6f588a798b938f76ca6eefa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc159d17919fc1ae2dd54dc38f659ca5794b0278f6f588a798b938f76ca6eefa","first_computed_at":"2026-05-18T02:38:52.024954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.024954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ejyCYHkgLTJXEip5c4lKXnJZlkpnQkO/k6Di+S5HO3/AtrMjLx08NhokqwqxC/r1L+WBhoIfeondi63HyNBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.025600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9c6f4545c8126cf13172b2da58bef1a964abf03b8880b3b1dbe738f56641190","sha256:782a11b86489cd9b5ec76cd69ef39173eb25e8f403c89c2031510939b4795561"],"state_sha256":"1212620171a7fa69ed626d87a86083065736a363690d24397bb7aea44f414dce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDAkeWku1TdYzhOF0nBVNM46CIFagHz4zoUVM5KHlxj9DPPQKeHxSPHrVCadzHo9cjSGEbzo4L4b5N/SiPjICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:08:52.910742Z","bundle_sha256":"9180768c73c4013b785deca815f2812d0ac16dc7623d293cd400b4cc3b0ac6bb"}}