{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SIFCRZODCHOWDSPJGTA5BYBQXU","short_pith_number":"pith:SIFCRZOD","canonical_record":{"source":{"id":"1307.6505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-24T17:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"3cb94c92819897ce54300fa4e5e0bdccd9de16aa5baf4f491fa86146a4830ba6","abstract_canon_sha256":"ae4dbf724f71d7c41703a336eb15c7c06b09d6451511196638a999d27f0f2265"},"schema_version":"1.0"},"canonical_sha256":"920a28e5c311dd61c9e934c1d0e030bd2b77885504347cb9ad9a91cd74f9fb86","source":{"kind":"arxiv","id":"1307.6505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6505","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6505v2","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6505","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"SIFCRZODCHOW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SIFCRZODCHOWDSPJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SIFCRZOD","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SIFCRZODCHOWDSPJGTA5BYBQXU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-24T17:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"3cb94c92819897ce54300fa4e5e0bdccd9de16aa5baf4f491fa86146a4830ba6","abstract_canon_sha256":"ae4dbf724f71d7c41703a336eb15c7c06b09d6451511196638a999d27f0f2265"},"schema_version":"1.0"},"canonical_sha256":"920a28e5c311dd61c9e934c1d0e030bd2b77885504347cb9ad9a91cd74f9fb86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:58.911085Z","signature_b64":"8CD5/r39JzJ3VZ2bZPLu7CkG+t/JrRTebXW1CBSuhsjhmBz9htU0vpif1/pMeMv40th4JUMYBhRzkOU0LUo0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"920a28e5c311dd61c9e934c1d0e030bd2b77885504347cb9ad9a91cd74f9fb86","last_reissued_at":"2026-05-18T02:23:58.910451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:58.910451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6505","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-18T02:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jENUffTVjuB3zGhc1cuKj7gbcDFw1AKKzLm83MHsiFUBUjUVH7wVnXW1YmaWp4jHIl0YAMSLNXJrgGneay4jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:58:24.503681Z"},"content_sha256":"ec7314ad744a3a802dd4681c9aa48bbdcf69593c75fd9123287ca5db6260f2bc","schema_version":"1.0","event_id":"sha256:ec7314ad744a3a802dd4681c9aa48bbdcf69593c75fd9123287ca5db6260f2bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SIFCRZODCHOWDSPJGTA5BYBQXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandar Ilic","submitted_at":"2013-07-24T17:41:00Z","abstract_excerpt":"We consider a special case of the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n^2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012), 7-13.], the authors presented quadratic algorithm for the problem when each job has its smaller processing time on the first machine. In this note, we improve the running time of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6505","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-18T02:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xZxiN8zy30/T+4BNI7ahVD7Nwj3auORxxIvde7QChFdzMAgzfxbElo0jHrdkyFAk5w5FGeGHY6GSmK86NXjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:58:24.504027Z"},"content_sha256":"4b0c274a43795e1b785d1d8ed2fb08c24ae116338bda2fd42e966e7824cf5565","schema_version":"1.0","event_id":"sha256:4b0c274a43795e1b785d1d8ed2fb08c24ae116338bda2fd42e966e7824cf5565"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/bundle.json","state_url":"https://pith.science/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/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-07-03T07:58:24Z","links":{"resolver":"https://pith.science/pith/SIFCRZODCHOWDSPJGTA5BYBQXU","bundle":"https://pith.science/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/bundle.json","state":"https://pith.science/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIFCRZODCHOWDSPJGTA5BYBQXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SIFCRZODCHOWDSPJGTA5BYBQXU","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":"ae4dbf724f71d7c41703a336eb15c7c06b09d6451511196638a999d27f0f2265","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-24T17:41:00Z","title_canon_sha256":"3cb94c92819897ce54300fa4e5e0bdccd9de16aa5baf4f491fa86146a4830ba6"},"schema_version":"1.0","source":{"id":"1307.6505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6505","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6505v2","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6505","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"SIFCRZODCHOW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SIFCRZODCHOWDSPJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SIFCRZOD","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4b0c274a43795e1b785d1d8ed2fb08c24ae116338bda2fd42e966e7824cf5565","target":"graph","created_at":"2026-05-18T02:23:58Z","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":"We consider a special case of the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n^2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012), 7-13.], the authors presented quadratic algorithm for the problem when each job has its smaller processing time on the first machine. In this note, we improve the running time of the","authors_text":"Aleksandar Ilic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-24T17:41:00Z","title":"On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6505","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:ec7314ad744a3a802dd4681c9aa48bbdcf69593c75fd9123287ca5db6260f2bc","target":"record","created_at":"2026-05-18T02:23:58Z","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":"ae4dbf724f71d7c41703a336eb15c7c06b09d6451511196638a999d27f0f2265","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-24T17:41:00Z","title_canon_sha256":"3cb94c92819897ce54300fa4e5e0bdccd9de16aa5baf4f491fa86146a4830ba6"},"schema_version":"1.0","source":{"id":"1307.6505","kind":"arxiv","version":2}},"canonical_sha256":"920a28e5c311dd61c9e934c1d0e030bd2b77885504347cb9ad9a91cd74f9fb86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"920a28e5c311dd61c9e934c1d0e030bd2b77885504347cb9ad9a91cd74f9fb86","first_computed_at":"2026-05-18T02:23:58.910451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:58.910451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8CD5/r39JzJ3VZ2bZPLu7CkG+t/JrRTebXW1CBSuhsjhmBz9htU0vpif1/pMeMv40th4JUMYBhRzkOU0LUo0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:58.911085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec7314ad744a3a802dd4681c9aa48bbdcf69593c75fd9123287ca5db6260f2bc","sha256:4b0c274a43795e1b785d1d8ed2fb08c24ae116338bda2fd42e966e7824cf5565"],"state_sha256":"61b0dadae9b5639f572fc73137c59da2db976a65102a1b97d8014cdc854a17a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMBFK4n0Olu+8AeHYghTn1Qwx7AdKQMr94MJWK99ueS9mklIPxXu2qeLtsxqzDBUz1q3YqFrgrm6ldLEdKVgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T07:58:24.505913Z","bundle_sha256":"e6e3191a9e1424ad8da42d80b31ab7202ed7b2073756ccd4dd389e4a93fe94e1"}}