{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ISY2ZHDUGEPFCBZIEWQEE7AYVZ","short_pith_number":"pith:ISY2ZHDU","canonical_record":{"source":{"id":"1309.1453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-02T03:34:44Z","cross_cats_sorted":["cs.DS","cs.NE"],"title_canon_sha256":"e538391489b5084b97560290f9d817d771634af46ed92d1191eba3a2f7985d7a","abstract_canon_sha256":"55f662cf066f14f18b116fd5a18b99fce1f7e7219737c869b8f71cd54647e51e"},"schema_version":"1.0"},"canonical_sha256":"44b1ac9c74311e51072825a0427c18ae6d57f6b68322dfe5976555fd0435384f","source":{"kind":"arxiv","id":"1309.1453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1453","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1453v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1453","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"ISY2ZHDUGEPF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ISY2ZHDUGEPFCBZI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ISY2ZHDU","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ISY2ZHDUGEPFCBZIEWQEE7AYVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-02T03:34:44Z","cross_cats_sorted":["cs.DS","cs.NE"],"title_canon_sha256":"e538391489b5084b97560290f9d817d771634af46ed92d1191eba3a2f7985d7a","abstract_canon_sha256":"55f662cf066f14f18b116fd5a18b99fce1f7e7219737c869b8f71cd54647e51e"},"schema_version":"1.0"},"canonical_sha256":"44b1ac9c74311e51072825a0427c18ae6d57f6b68322dfe5976555fd0435384f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.274866Z","signature_b64":"L7LzoL0T0tKldtaFWiQWt5nLg081lo1ksDHqHTTVCj6FKlxlsU2b2rKgxywE79bg1JtLD+x8Y7URfC8VdNavBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b1ac9c74311e51072825a0427c18ae6d57f6b68322dfe5976555fd0435384f","last_reissued_at":"2026-05-18T03:14:07.274263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.274263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1453","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6ROdNU8g1hOsGTzZGVKrkmVUmyb/wJLce9qATSA+T8/bRqo8ljVs3PFp2+IEcrq4UpWoZEOic7a5UfmEZqJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:19:44.457737Z"},"content_sha256":"9481a986589f3ddcb2a61bbfc2a57fc6044db3574964eadf4c14e3ffcbc41882","schema_version":"1.0","event_id":"sha256:9481a986589f3ddcb2a61bbfc2a57fc6044db3574964eadf4c14e3ffcbc41882"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ISY2ZHDUGEPFCBZIEWQEE7AYVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel machine scheduling with step deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE"],"primary_cat":"math.OC","authors_text":"Peng Guo, Wenming Cheng, Yi Wang","submitted_at":"2013-09-02T03:34:44Z","abstract_excerpt":"This article considers the parallel machine scheduling problem with step-deteriorating jobs and sequence-dependent setup times. The objective is to minimize the total tardiness by determining the allocation and sequence of jobs on identical parallel machines. In this problem, the processing time of each job is a step function dependent upon its starting time. An individual extended time is penalized when the starting time of a job is later than a specific deterioration date. The possibility of deterioration of a job makes the parallel machine scheduling problem more challenging than ordinary o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1453","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-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7ESemAPrDa9FagH4/pYgmaxmFujBSTlSR8fTKH2pAz0BQEir9JIt/UghrFLo62MPmUkkACS/FT854b2QIMlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:19:44.458087Z"},"content_sha256":"561e7ac5fcf6854b282b2c519a314a16d89204a3892a901ec45110affb69ed63","schema_version":"1.0","event_id":"sha256:561e7ac5fcf6854b282b2c519a314a16d89204a3892a901ec45110affb69ed63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/bundle.json","state_url":"https://pith.science/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/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-04T20:19:44Z","links":{"resolver":"https://pith.science/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ","bundle":"https://pith.science/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/bundle.json","state":"https://pith.science/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISY2ZHDUGEPFCBZIEWQEE7AYVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ISY2ZHDUGEPFCBZIEWQEE7AYVZ","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":"55f662cf066f14f18b116fd5a18b99fce1f7e7219737c869b8f71cd54647e51e","cross_cats_sorted":["cs.DS","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-02T03:34:44Z","title_canon_sha256":"e538391489b5084b97560290f9d817d771634af46ed92d1191eba3a2f7985d7a"},"schema_version":"1.0","source":{"id":"1309.1453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1453","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1453v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1453","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"ISY2ZHDUGEPF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ISY2ZHDUGEPFCBZI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ISY2ZHDU","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:561e7ac5fcf6854b282b2c519a314a16d89204a3892a901ec45110affb69ed63","target":"graph","created_at":"2026-05-18T03:14:07Z","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 article considers the parallel machine scheduling problem with step-deteriorating jobs and sequence-dependent setup times. The objective is to minimize the total tardiness by determining the allocation and sequence of jobs on identical parallel machines. In this problem, the processing time of each job is a step function dependent upon its starting time. An individual extended time is penalized when the starting time of a job is later than a specific deterioration date. The possibility of deterioration of a job makes the parallel machine scheduling problem more challenging than ordinary o","authors_text":"Peng Guo, Wenming Cheng, Yi Wang","cross_cats":["cs.DS","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-02T03:34:44Z","title":"Parallel machine scheduling with step deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1453","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:9481a986589f3ddcb2a61bbfc2a57fc6044db3574964eadf4c14e3ffcbc41882","target":"record","created_at":"2026-05-18T03:14:07Z","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":"55f662cf066f14f18b116fd5a18b99fce1f7e7219737c869b8f71cd54647e51e","cross_cats_sorted":["cs.DS","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-02T03:34:44Z","title_canon_sha256":"e538391489b5084b97560290f9d817d771634af46ed92d1191eba3a2f7985d7a"},"schema_version":"1.0","source":{"id":"1309.1453","kind":"arxiv","version":1}},"canonical_sha256":"44b1ac9c74311e51072825a0427c18ae6d57f6b68322dfe5976555fd0435384f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b1ac9c74311e51072825a0427c18ae6d57f6b68322dfe5976555fd0435384f","first_computed_at":"2026-05-18T03:14:07.274263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.274263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L7LzoL0T0tKldtaFWiQWt5nLg081lo1ksDHqHTTVCj6FKlxlsU2b2rKgxywE79bg1JtLD+x8Y7URfC8VdNavBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.274866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9481a986589f3ddcb2a61bbfc2a57fc6044db3574964eadf4c14e3ffcbc41882","sha256:561e7ac5fcf6854b282b2c519a314a16d89204a3892a901ec45110affb69ed63"],"state_sha256":"e6c79149f28227500036eec6fdcaf447e5b0fced1c4ff4cfc7bd7bb2da240d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsbEf6jw1gDQIwhdsG1ql5vdu+omujIyj0a+iY8HoRmBGlPGfDDmjwxAYQnM41aZ7zdosbuLDOxMwxgDQgefDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:19:44.460179Z","bundle_sha256":"59e7a0ace20509b2eabbf390d163a34f86c9a957812b6765c6a6a4a9cc269aeb"}}