{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VR3BPYMYQ6M3BJVBTLGMHRQM33","short_pith_number":"pith:VR3BPYMY","canonical_record":{"source":{"id":"1903.09035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"822e332c39ec0cc071b9b4cf880bc8db354af3217ec4e88e80a74ac364d7fd5c","abstract_canon_sha256":"827a732245a4a149fd50ff3b08466263907d3744973cc958d427defc1633d012"},"schema_version":"1.0"},"canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","source":{"kind":"arxiv","id":"1903.09035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09035","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09035v1","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09035","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"VR3BPYMYQ6M3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VR3BPYMYQ6M3BJVB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VR3BPYMY","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VR3BPYMYQ6M3BJVBTLGMHRQM33","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"822e332c39ec0cc071b9b4cf880bc8db354af3217ec4e88e80a74ac364d7fd5c","abstract_canon_sha256":"827a732245a4a149fd50ff3b08466263907d3744973cc958d427defc1633d012"},"schema_version":"1.0"},"canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.301823Z","signature_b64":"LmanPq+dOIvV15geLYLzB2KxhEZaCoUtp3vTivaDyPyJoV0dntf8AmVXUgeu6FHlNqjDa3KIN8HcD20DmG1NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","last_reissued_at":"2026-05-17T23:50:43.301415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.301415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09035","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-17T23:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upC4ur+/zSpmQA1NMd4fAHXBHsz8/iy+8HDZurRTIpl+6z12wFx6f5YznOJ2mHIoWcmM8do9kdGDBPZFKldOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:38:49.845006Z"},"content_sha256":"5c7b4da4ed7b31526e5096fed38d300c3898f5f14ebe1eb2ecc1f14d6e642e0c","schema_version":"1.0","event_id":"sha256:5c7b4da4ed7b31526e5096fed38d300c3898f5f14ebe1eb2ecc1f14d6e642e0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VR3BPYMYQ6M3BJVBTLGMHRQM33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Clarisse Dhaenens, Lucien Mousin, Marie-El\\'eonore Kessaci","submitted_at":"2019-03-21T14:48:00Z","abstract_excerpt":"The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard combinatorial optimization problem we conduct an analysis of the structure of good quality solutions. This analysis shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs, we call super-jobs. After a discussion on the way to identify these super-jobs, we propose IG-SJ, an algorithm that exploits su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09035","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-17T23:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aFa48x422zeSvezqUWGhdvJMZT/UMwYFW+aDGwcN/CawHmjPKBSZ14cXm1SMh4lX32vSnZEwFYR9YdjJfxnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:38:49.845400Z"},"content_sha256":"59d4b3540e4afeecca9dbd87b4e5f4244e1760f80b849eb919d615bd393de777","schema_version":"1.0","event_id":"sha256:59d4b3540e4afeecca9dbd87b4e5f4244e1760f80b849eb919d615bd393de777"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/bundle.json","state_url":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/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-10T20:38:49Z","links":{"resolver":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33","bundle":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/bundle.json","state":"https://pith.science/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VR3BPYMYQ6M3BJVBTLGMHRQM33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VR3BPYMYQ6M3BJVBTLGMHRQM33","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":"827a732245a4a149fd50ff3b08466263907d3744973cc958d427defc1633d012","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","title_canon_sha256":"822e332c39ec0cc071b9b4cf880bc8db354af3217ec4e88e80a74ac364d7fd5c"},"schema_version":"1.0","source":{"id":"1903.09035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09035","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09035v1","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09035","created_at":"2026-05-17T23:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"VR3BPYMYQ6M3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VR3BPYMYQ6M3BJVB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VR3BPYMY","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:59d4b3540e4afeecca9dbd87b4e5f4244e1760f80b849eb919d615bd393de777","target":"graph","created_at":"2026-05-17T23:50:43Z","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":"The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard combinatorial optimization problem we conduct an analysis of the structure of good quality solutions. This analysis shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs, we call super-jobs. After a discussion on the way to identify these super-jobs, we propose IG-SJ, an algorithm that exploits su","authors_text":"Clarisse Dhaenens, Lucien Mousin, Marie-El\\'eonore Kessaci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","title":"Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09035","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:5c7b4da4ed7b31526e5096fed38d300c3898f5f14ebe1eb2ecc1f14d6e642e0c","target":"record","created_at":"2026-05-17T23:50:43Z","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":"827a732245a4a149fd50ff3b08466263907d3744973cc958d427defc1633d012","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-21T14:48:00Z","title_canon_sha256":"822e332c39ec0cc071b9b4cf880bc8db354af3217ec4e88e80a74ac364d7fd5c"},"schema_version":"1.0","source":{"id":"1903.09035","kind":"arxiv","version":1}},"canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac7617e1988799b0a6a19accc3c60cdefb0fa38a386c7b7c610b6918875bf0af","first_computed_at":"2026-05-17T23:50:43.301415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:43.301415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmanPq+dOIvV15geLYLzB2KxhEZaCoUtp3vTivaDyPyJoV0dntf8AmVXUgeu6FHlNqjDa3KIN8HcD20DmG1NBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:43.301823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c7b4da4ed7b31526e5096fed38d300c3898f5f14ebe1eb2ecc1f14d6e642e0c","sha256:59d4b3540e4afeecca9dbd87b4e5f4244e1760f80b849eb919d615bd393de777"],"state_sha256":"5a40b22cce5a3b8f2b8ba623a6f6d45a3f20642fa6b7cfd4331a79920aec21a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Jb/k1K9JA9LpYLN53xIhmxd5xf1jEW1daJxM/YmQYiNRfYBAlveb+OBV7DrttWtlAq09iWFUbE9V+Mi08GtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:38:49.847547Z","bundle_sha256":"f3af47bff7d2eea2caf7612de8fb502ef392ec3a7f558c399a4e5c6306c3d564"}}