{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HU6RTEZGEHFGJVTLCC7NVJ5IDR","short_pith_number":"pith:HU6RTEZG","canonical_record":{"source":{"id":"1407.5931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-07-21T16:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"bda5177f6ed08920d85a8579a01fde6902ba98c70394b8e0efce40594211c400","abstract_canon_sha256":"7864271ef6603106d4b5df9aa22993fb0a74a2453bd611c5a1172e9483befefb"},"schema_version":"1.0"},"canonical_sha256":"3d3d19932621ca64d66b10bedaa7a81c5ae54fccf379b7e414b45518f045eb63","source":{"kind":"arxiv","id":"1407.5931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5931","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5931v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5931","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"HU6RTEZGEHFG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HU6RTEZGEHFGJVTL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HU6RTEZG","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HU6RTEZGEHFGJVTLCC7NVJ5IDR","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-07-21T16:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"bda5177f6ed08920d85a8579a01fde6902ba98c70394b8e0efce40594211c400","abstract_canon_sha256":"7864271ef6603106d4b5df9aa22993fb0a74a2453bd611c5a1172e9483befefb"},"schema_version":"1.0"},"canonical_sha256":"3d3d19932621ca64d66b10bedaa7a81c5ae54fccf379b7e414b45518f045eb63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.373683Z","signature_b64":"TejNT36Et7WdRwcvt0c0vq1Rw1BI3ka97UYy/WAbZoaFipu0YGIXMBDPGI+fxuyuKqr/xGfo7o8IY0VUpsvTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d3d19932621ca64d66b10bedaa7a81c5ae54fccf379b7e414b45518f045eb63","last_reissued_at":"2026-05-18T02:47:06.373141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.373141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5931","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YA+YlgnbUaCPsKhgJX+6oYi3sbpwhZyWr9sto5JA5xHBnGdwunjQK2NKPXG1RRYgReO5971CZUE4cBwFfPUpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:59:54.618608Z"},"content_sha256":"33d18eacda6148697fb82ef5f2d55328e17ac3c307c8796b32dc2a0eb6a0d10a","schema_version":"1.0","event_id":"sha256:33d18eacda6148697fb82ef5f2d55328e17ac3c307c8796b32dc2a0eb6a0d10a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HU6RTEZGEHFGJVTLCC7NVJ5IDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Pooja Jadon, Sandeep Kumar","submitted_at":"2014-07-21T16:57:04Z","abstract_excerpt":"In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customers constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing problem with the objective of makespan minimization using the new modified proposed method of johnsons algorithm as well as the guptas heuristic algorithm. This paper involves the determination of the order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5931","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6hrY7mL0F0CDGRi27EOUIaUc6P5v9DL+DZwbhKelS1z1C+nT0kqDDxXvVI6Z+w/BtLJH2BkZnoIV+A9rp+wDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:59:54.618945Z"},"content_sha256":"f79c9990edd45175ae41de886fdb4a0fc25295522aa8b80c6618ed16f1446c44","schema_version":"1.0","event_id":"sha256:f79c9990edd45175ae41de886fdb4a0fc25295522aa8b80c6618ed16f1446c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/bundle.json","state_url":"https://pith.science/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/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-04T15:59:54Z","links":{"resolver":"https://pith.science/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR","bundle":"https://pith.science/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/bundle.json","state":"https://pith.science/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HU6RTEZGEHFGJVTLCC7NVJ5IDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HU6RTEZGEHFGJVTLCC7NVJ5IDR","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":"7864271ef6603106d4b5df9aa22993fb0a74a2453bd611c5a1172e9483befefb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-07-21T16:57:04Z","title_canon_sha256":"bda5177f6ed08920d85a8579a01fde6902ba98c70394b8e0efce40594211c400"},"schema_version":"1.0","source":{"id":"1407.5931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5931","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5931v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5931","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"HU6RTEZGEHFG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HU6RTEZGEHFGJVTL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HU6RTEZG","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:f79c9990edd45175ae41de886fdb4a0fc25295522aa8b80c6618ed16f1446c44","target":"graph","created_at":"2026-05-18T02:47:06Z","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":"In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customers constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing problem with the objective of makespan minimization using the new modified proposed method of johnsons algorithm as well as the guptas heuristic algorithm. This paper involves the determination of the order","authors_text":"Pooja Jadon, Sandeep Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-07-21T16:57:04Z","title":"A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5931","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:33d18eacda6148697fb82ef5f2d55328e17ac3c307c8796b32dc2a0eb6a0d10a","target":"record","created_at":"2026-05-18T02:47:06Z","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":"7864271ef6603106d4b5df9aa22993fb0a74a2453bd611c5a1172e9483befefb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-07-21T16:57:04Z","title_canon_sha256":"bda5177f6ed08920d85a8579a01fde6902ba98c70394b8e0efce40594211c400"},"schema_version":"1.0","source":{"id":"1407.5931","kind":"arxiv","version":1}},"canonical_sha256":"3d3d19932621ca64d66b10bedaa7a81c5ae54fccf379b7e414b45518f045eb63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d3d19932621ca64d66b10bedaa7a81c5ae54fccf379b7e414b45518f045eb63","first_computed_at":"2026-05-18T02:47:06.373141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.373141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TejNT36Et7WdRwcvt0c0vq1Rw1BI3ka97UYy/WAbZoaFipu0YGIXMBDPGI+fxuyuKqr/xGfo7o8IY0VUpsvTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.373683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33d18eacda6148697fb82ef5f2d55328e17ac3c307c8796b32dc2a0eb6a0d10a","sha256:f79c9990edd45175ae41de886fdb4a0fc25295522aa8b80c6618ed16f1446c44"],"state_sha256":"77348030b3c830e445358aae66deb14e6167f0e855b3bb23e043f77bb8cb56f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxYcpBZpYwvLxIn53C8DZ7+n8c9Bg4os0NXWUICOV2uAasS7l3HoKJNrdJpqyVhrICKnJ2TsZK9x2h9IZ5WmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:59:54.620985Z","bundle_sha256":"139d1f725a113c8b25859730d81ccdb13846fdf69458041a178186138c0c1074"}}