{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3UZNREWTRE5CHNWK46NA5BKCYX","short_pith_number":"pith:3UZNREWT","canonical_record":{"source":{"id":"1402.5613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-23T14:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"71ea3da29ca4095320d079aa6ec25a341eae0dc1c79248e18c4f2c1b1e1c9ebc","abstract_canon_sha256":"6d22001b469e68c083e1f7acdaaca76dd05fdc74cc6030d7bd3ac0ba48c9214c"},"schema_version":"1.0"},"canonical_sha256":"dd32d892d3893a23b6cae79a0e8542c5e47929afb6f06f5f335150ccf077518a","source":{"kind":"arxiv","id":"1402.5613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5613","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5613v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5613","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"3UZNREWTRE5C","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3UZNREWTRE5CHNWK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3UZNREWT","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3UZNREWTRE5CHNWK46NA5BKCYX","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-23T14:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"71ea3da29ca4095320d079aa6ec25a341eae0dc1c79248e18c4f2c1b1e1c9ebc","abstract_canon_sha256":"6d22001b469e68c083e1f7acdaaca76dd05fdc74cc6030d7bd3ac0ba48c9214c"},"schema_version":"1.0"},"canonical_sha256":"dd32d892d3893a23b6cae79a0e8542c5e47929afb6f06f5f335150ccf077518a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:14.320562Z","signature_b64":"LXE0k3jB8LW/LGAhe7aSEaqPKC8zyymDrUVlL0Vl+0SO+Inn78RvwqQRckxOShAJwjuEWiefu5qavH1bdliSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd32d892d3893a23b6cae79a0e8542c5e47929afb6f06f5f335150ccf077518a","last_reissued_at":"2026-05-18T02:58:14.320000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:14.320000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5613","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHkXIbX0Fmf55CDOIVixf5R7RjsBkvXxtWNJKfbKcDKo6MTm9mhAi04sXYVb3v0kO5rjbu3zoQhRGjqxekXNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:19:30.033655Z"},"content_sha256":"39b03b4878602cf5e8d4f8bdd3bdf3c127b8a5085eef765a2703920cf579699f","schema_version":"1.0","event_id":"sha256:39b03b4878602cf5e8d4f8bdd3bdf3c127b8a5085eef765a2703920cf579699f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3UZNREWTRE5CHNWK46NA5BKCYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Peng, T.C.E. Cheng, Zhipeng Lu","submitted_at":"2014-02-23T14:46:04Z","abstract_excerpt":"We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all of the benchmark JSP instances available in the literature. The test results show that TS/PR obtains competitive results compared with state-of-the-art algorithms for JSP in the literature, demonstratin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5613","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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Bfs+qiGdFkMkRrx5lNElbG0a70PVS65kInC4iF4kqr31BX6WiHsL8EdacSrg7lCbVQV/AU3+Yn7XCmA/I6SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:19:30.034002Z"},"content_sha256":"52a72db886b3bfb03205a6a073125ddaaa09074e1bbe8404f8157cedcbf63b36","schema_version":"1.0","event_id":"sha256:52a72db886b3bfb03205a6a073125ddaaa09074e1bbe8404f8157cedcbf63b36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UZNREWTRE5CHNWK46NA5BKCYX/bundle.json","state_url":"https://pith.science/pith/3UZNREWTRE5CHNWK46NA5BKCYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UZNREWTRE5CHNWK46NA5BKCYX/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-10T21:19:30Z","links":{"resolver":"https://pith.science/pith/3UZNREWTRE5CHNWK46NA5BKCYX","bundle":"https://pith.science/pith/3UZNREWTRE5CHNWK46NA5BKCYX/bundle.json","state":"https://pith.science/pith/3UZNREWTRE5CHNWK46NA5BKCYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UZNREWTRE5CHNWK46NA5BKCYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3UZNREWTRE5CHNWK46NA5BKCYX","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":"6d22001b469e68c083e1f7acdaaca76dd05fdc74cc6030d7bd3ac0ba48c9214c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-23T14:46:04Z","title_canon_sha256":"71ea3da29ca4095320d079aa6ec25a341eae0dc1c79248e18c4f2c1b1e1c9ebc"},"schema_version":"1.0","source":{"id":"1402.5613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5613","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5613v1","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5613","created_at":"2026-05-18T02:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"3UZNREWTRE5C","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3UZNREWTRE5CHNWK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3UZNREWT","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:52a72db886b3bfb03205a6a073125ddaaa09074e1bbe8404f8157cedcbf63b36","target":"graph","created_at":"2026-05-18T02:58:14Z","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 present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all of the benchmark JSP instances available in the literature. The test results show that TS/PR obtains competitive results compared with state-of-the-art algorithms for JSP in the literature, demonstratin","authors_text":"Bo Peng, T.C.E. Cheng, Zhipeng Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-23T14:46:04Z","title":"A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5613","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:39b03b4878602cf5e8d4f8bdd3bdf3c127b8a5085eef765a2703920cf579699f","target":"record","created_at":"2026-05-18T02:58:14Z","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":"6d22001b469e68c083e1f7acdaaca76dd05fdc74cc6030d7bd3ac0ba48c9214c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-23T14:46:04Z","title_canon_sha256":"71ea3da29ca4095320d079aa6ec25a341eae0dc1c79248e18c4f2c1b1e1c9ebc"},"schema_version":"1.0","source":{"id":"1402.5613","kind":"arxiv","version":1}},"canonical_sha256":"dd32d892d3893a23b6cae79a0e8542c5e47929afb6f06f5f335150ccf077518a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd32d892d3893a23b6cae79a0e8542c5e47929afb6f06f5f335150ccf077518a","first_computed_at":"2026-05-18T02:58:14.320000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:14.320000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LXE0k3jB8LW/LGAhe7aSEaqPKC8zyymDrUVlL0Vl+0SO+Inn78RvwqQRckxOShAJwjuEWiefu5qavH1bdliSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:14.320562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b03b4878602cf5e8d4f8bdd3bdf3c127b8a5085eef765a2703920cf579699f","sha256:52a72db886b3bfb03205a6a073125ddaaa09074e1bbe8404f8157cedcbf63b36"],"state_sha256":"33d22919e28da792412edd4c47d453a484c383f584e852481fc62c29deb7f500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Do0S/GYTe7SVF1+k2C76SJ4gW6yM1qn0O8HFhnvmuFQylbyknhllQXpyayp4zRvYFY0kQ50wpImM38fx9z6YCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:19:30.035971Z","bundle_sha256":"80ccb591b22ea1997ec3f372e975b511ff513fbdffdc5a621f42fa567a95ceb0"}}