{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IZQ4IM3MQIHHADWTEJLC2KYKZX","short_pith_number":"pith:IZQ4IM3M","schema_version":"1.0","canonical_sha256":"4661c4336c820e700ed322562d2b0acddf7a5fb2e3961c2c648bf64570a8d96b","source":{"kind":"arxiv","id":"1809.05745","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.05745","created_at":"2026-05-18T00:05:36.650410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05745v1","created_at":"2026-05-18T00:05:36.650410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05745","created_at":"2026-05-18T00:05:36.650410+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZQ4IM3MQIHH","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZQ4IM3MQIHHADWT","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZQ4IM3M","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX","json":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX.json","graph_json":"https://pith.science/api/pith-number/IZQ4IM3MQIHHADWTEJLC2KYKZX/graph.json","events_json":"https://pith.science/api/pith-number/IZQ4IM3MQIHHADWTEJLC2KYKZX/events.json","paper":"https://pith.science/paper/IZQ4IM3M"},"agent_actions":{"view_html":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX","download_json":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX.json","view_paper":"https://pith.science/paper/IZQ4IM3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05745&json=true","fetch_graph":"https://pith.science/api/pith-number/IZQ4IM3MQIHHADWTEJLC2KYKZX/graph.json","fetch_events":"https://pith.science/api/pith-number/IZQ4IM3MQIHHADWTEJLC2KYKZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/action/storage_attestation","attest_author":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/action/author_attestation","sign_citation":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/action/citation_signature","submit_replication":"https://pith.science/pith/IZQ4IM3MQIHHADWTEJLC2KYKZX/action/replication_record"}},"created_at":"2026-05-18T00:05:36.650410+00:00","updated_at":"2026-05-18T00:05:36.650410+00:00"}