{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IZQ4IM3MQIHHADWTEJLC2KYKZX","short_pith_number":"pith:IZQ4IM3M","canonical_record":{"source":{"id":"1809.05745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-15T17:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"a45183858f59168de216dccbe4adb2b044d9e4a8d4db556234f6c5ec4494be08","abstract_canon_sha256":"da4041532e57d2be3c584f5fcec6365ec516b78a67b61f110a70fa14d8f7f64a"},"schema_version":"1.0"},"canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","source":{"kind":"arxiv","id":"1809.05745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05745","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05745v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05745","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"IZQ4IM3MQIHH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZQ4IM3MQIHHADWT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZQ4IM3M","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IZQ4IM3MQIHHADWTEJLC2KYKZX","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-15T17:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"a45183858f59168de216dccbe4adb2b044d9e4a8d4db556234f6c5ec4494be08","abstract_canon_sha256":"da4041532e57d2be3c584f5fcec6365ec516b78a67b61f110a70fa14d8f7f64a"},"schema_version":"1.0"},"canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.650850Z","signature_b64":"3I4Mx7Q+CCi6EiyG2BrDpkLmEnZ9r85F+GHG1hnEhm/ZSVjisfQwfCiwuwK2AxQg7u402yRupjWCni3wyTmcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","last_reissued_at":"2026-05-18T00:05:36.650329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.650329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05745","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-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sltUyyEO9Zn9OdKXd7dA3p0jNKYarGuGu4wtjZboHocSXQu86PovM6ylouqWoWMgSb1XnpB2Ct1B+YfnW5YEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:24:24.631067Z"},"content_sha256":"1fb140f3d489757374b7b7f14a1c74009e6f9caace5492ed013ee02645ec0835","schema_version":"1.0","event_id":"sha256:1fb140f3d489757374b7b7f14a1c74009e6f9caace5492ed013ee02645ec0835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IZQ4IM3MQIHHADWTEJLC2KYKZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithms for the three-machine proportionate mixed shop scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Bing Su, Guanqun Ni, Guohui Lin, Jianming Dong, Longcheng Liu, Randy Goebel, Yong Chen, Yue Luo","submitted_at":"2018-09-15T17:16:26Z","abstract_excerpt":"A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as $M3 \\mid prpt \\mid C_{\\max}$, in which each job has equal processing times on all three machines. Koulamas and Kyparisis [{\\it European Journal of Operational Research}, 243:70--74,2015] showed that the problem is solvable in polynomial time in some very special c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05745","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-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AKtrqGo1JXNlCjKvO4l3uZHhfTCIuSYtUGwMSJopjKYfuYnl/gKT8Q1IebazuX1UOu7R373SQ2YahQ8da2UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:24:24.631727Z"},"content_sha256":"faf48b582b7172a7397a639fcab0179a19c818bb45342f03b9ba9be81a12eba6","schema_version":"1.0","event_id":"sha256:faf48b582b7172a7397a639fcab0179a19c818bb45342f03b9ba9be81a12eba6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/bundle.json","state_url":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/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-05-23T20:24:24Z","links":{"resolver":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX","bundle":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/bundle.json","state":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IZQ4IM3MQIHHADWTEJLC2KYKZX","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":"da4041532e57d2be3c584f5fcec6365ec516b78a67b61f110a70fa14d8f7f64a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-15T17:16:26Z","title_canon_sha256":"a45183858f59168de216dccbe4adb2b044d9e4a8d4db556234f6c5ec4494be08"},"schema_version":"1.0","source":{"id":"1809.05745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05745","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05745v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05745","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"IZQ4IM3MQIHH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZQ4IM3MQIHHADWT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZQ4IM3M","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:faf48b582b7172a7397a639fcab0179a19c818bb45342f03b9ba9be81a12eba6","target":"graph","created_at":"2026-05-18T00:05:36Z","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":"A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as $M3 \\mid prpt \\mid C_{\\max}$, in which each job has equal processing times on all three machines. Koulamas and Kyparisis [{\\it European Journal of Operational Research}, 243:70--74,2015] showed that the problem is solvable in polynomial time in some very special c","authors_text":"An Zhang, Bing Su, Guanqun Ni, Guohui Lin, Jianming Dong, Longcheng Liu, Randy Goebel, Yong Chen, Yue Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-15T17:16:26Z","title":"Approximation algorithms for the three-machine proportionate mixed shop scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05745","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:1fb140f3d489757374b7b7f14a1c74009e6f9caace5492ed013ee02645ec0835","target":"record","created_at":"2026-05-18T00:05:36Z","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":"da4041532e57d2be3c584f5fcec6365ec516b78a67b61f110a70fa14d8f7f64a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-15T17:16:26Z","title_canon_sha256":"a45183858f59168de216dccbe4adb2b044d9e4a8d4db556234f6c5ec4494be08"},"schema_version":"1.0","source":{"id":"1809.05745","kind":"arxiv","version":1}},"canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","first_computed_at":"2026-05-18T00:05:36.650329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.650329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3I4Mx7Q+CCi6EiyG2BrDpkLmEnZ9r85F+GHG1hnEhm/ZSVjisfQwfCiwuwK2AxQg7u402yRupjWCni3wyTmcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.650850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fb140f3d489757374b7b7f14a1c74009e6f9caace5492ed013ee02645ec0835","sha256:faf48b582b7172a7397a639fcab0179a19c818bb45342f03b9ba9be81a12eba6"],"state_sha256":"12835761f99315b72abc62efcc8ca95579b5ba5984d0a44fc0a68355055e2775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ulwJu5/d/uZ1DyvAntMBFkUcAKiJtRnZH1hcgC6I3EJZNpe6Kc3I7ssg3VrjFVkpwrQFvYoPn+24xGWafTTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:24:24.635029Z","bundle_sha256":"2f14f82836a6a600b2a53af4e6209e9959fc367b6b762a6553d8a59e0f5d0ee1"}}