{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GAMVK5R52MYQNDJFDFS42E7LTX","short_pith_number":"pith:GAMVK5R5","canonical_record":{"source":{"id":"1301.7134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"27964d990cd422594b4785c3cb5223cc5b3481f037ec8bcd2989ae761c7a6407","abstract_canon_sha256":"2044aff831d9fe33ab2653386096cd06325829f36637b83d9439ae518474214b"},"schema_version":"1.0"},"canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","source":{"kind":"arxiv","id":"1301.7134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7134","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7134v2","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7134","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"GAMVK5R52MYQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAMVK5R52MYQNDJF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAMVK5R5","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GAMVK5R52MYQNDJFDFS42E7LTX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"27964d990cd422594b4785c3cb5223cc5b3481f037ec8bcd2989ae761c7a6407","abstract_canon_sha256":"2044aff831d9fe33ab2653386096cd06325829f36637b83d9439ae518474214b"},"schema_version":"1.0"},"canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.826035Z","signature_b64":"VQaWlVcirLc0+JxZ0NupuEBAl2hAIa0CmWAqTp5C+6Qgl41IxQ9xjrixSeK3yAoFiAAO7AUtEGaGrG+x/fIwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","last_reissued_at":"2026-05-18T03:15:55.825179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.825179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7134","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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1p655MgwNTZ8dwRlTFtEyZgIpj7hYh5Mo8rN5rb5tfMrS/oVijho/vaGx5dHL6dysIop2Xdb+spbNtVAtQfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:52.634617Z"},"content_sha256":"d0523035aae70a1052e4e86f76d90482c01e2a57d83d81f4452229a8a8839eb8","schema_version":"1.0","event_id":"sha256:d0523035aae70a1052e4e86f76d90482c01e2a57d83d81f4452229a8a8839eb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GAMVK5R52MYQNDJFDFS42E7LTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Peng Guo, Wenming Chen, Yi Wang","submitted_at":"2013-01-30T03:12:50Z","abstract_excerpt":"In this article, we study a single-machine scheduling problem of minimizing the total tardiness for a set of independent jobs. The processing time of a job is modeled as a step function of its starting time and a specific deteriorating date. A mixed integer programming model was applied to the problem and validated. Since the problem is known to be NP-hard, we proposed a heuristic named simple weighted search procedure (SWSP) and a general variable neighborhood search algorithm (GVNS).\n  A perturbation procedure with 3-opt is embedded within the GVNS process in order to explore broader spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7134","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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYJ2OPHNyqEl2zhH4Bnip028iD3PVlre+/qneGwms/JTlUfrTaM0R6MhscBMAPsXrolHeLQ6/s8JCDFeYTqRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:52.635297Z"},"content_sha256":"6701031cb55a1cc3781366382a2138c13e4b8f51285cf85bd9cc2693aa7b1dc1","schema_version":"1.0","event_id":"sha256:6701031cb55a1cc3781366382a2138c13e4b8f51285cf85bd9cc2693aa7b1dc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/bundle.json","state_url":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAMVK5R52MYQNDJFDFS42E7LTX/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-05T04:51:52Z","links":{"resolver":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX","bundle":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/bundle.json","state":"https://pith.science/pith/GAMVK5R52MYQNDJFDFS42E7LTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAMVK5R52MYQNDJFDFS42E7LTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GAMVK5R52MYQNDJFDFS42E7LTX","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":"2044aff831d9fe33ab2653386096cd06325829f36637b83d9439ae518474214b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","title_canon_sha256":"27964d990cd422594b4785c3cb5223cc5b3481f037ec8bcd2989ae761c7a6407"},"schema_version":"1.0","source":{"id":"1301.7134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7134","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7134v2","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7134","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"GAMVK5R52MYQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAMVK5R52MYQNDJF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAMVK5R5","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:6701031cb55a1cc3781366382a2138c13e4b8f51285cf85bd9cc2693aa7b1dc1","target":"graph","created_at":"2026-05-18T03:15:55Z","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 this article, we study a single-machine scheduling problem of minimizing the total tardiness for a set of independent jobs. The processing time of a job is modeled as a step function of its starting time and a specific deteriorating date. A mixed integer programming model was applied to the problem and validated. Since the problem is known to be NP-hard, we proposed a heuristic named simple weighted search procedure (SWSP) and a general variable neighborhood search algorithm (GVNS).\n  A perturbation procedure with 3-opt is embedded within the GVNS process in order to explore broader spaces.","authors_text":"Peng Guo, Wenming Chen, Yi Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","title":"A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7134","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:d0523035aae70a1052e4e86f76d90482c01e2a57d83d81f4452229a8a8839eb8","target":"record","created_at":"2026-05-18T03:15:55Z","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":"2044aff831d9fe33ab2653386096cd06325829f36637b83d9439ae518474214b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-30T03:12:50Z","title_canon_sha256":"27964d990cd422594b4785c3cb5223cc5b3481f037ec8bcd2989ae761c7a6407"},"schema_version":"1.0","source":{"id":"1301.7134","kind":"arxiv","version":2}},"canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"301955763dd331068d251965cd13eb9dddeeb52a89e64b3a16f9f728b4125a4f","first_computed_at":"2026-05-18T03:15:55.825179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:55.825179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQaWlVcirLc0+JxZ0NupuEBAl2hAIa0CmWAqTp5C+6Qgl41IxQ9xjrixSeK3yAoFiAAO7AUtEGaGrG+x/fIwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:55.826035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0523035aae70a1052e4e86f76d90482c01e2a57d83d81f4452229a8a8839eb8","sha256:6701031cb55a1cc3781366382a2138c13e4b8f51285cf85bd9cc2693aa7b1dc1"],"state_sha256":"1ccf8b81a7f8b28e00f6811f3d735c6bdcc029e2940b45d9319da25a7e466872"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02qWVEByrK6MrZ1H7aTwfFdV5Ge8A8d5A56ERz58yrFAZSpZzYta4q6USsr9FjxYzv+RQyrONizSLhfPzOOJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:51:52.638887Z","bundle_sha256":"cc97a5bca41123defa3a42ac67c35cb09a5eecbdcf16d3a9f10b9e37437bc854"}}