{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6CABDJFM3W4UVYWRSINXQDPXV7","short_pith_number":"pith:6CABDJFM","schema_version":"1.0","canonical_sha256":"f08011a4acddb94ae2d1921b780df7afd16c6e4b9d325a4c1521269f1f278042","source":{"kind":"arxiv","id":"2308.12794","version":2},"attestation_state":"computed","paper":{"title":"Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Hongxiang Zhang, Igor G. Smit, Robbert Reijnen, Yaoxin Wu, Yingqian Zhang, Zaharah Bukhsh","submitted_at":"2023-08-24T13:49:48Z","abstract_excerpt":"Job shop scheduling problems address the routing and sequencing of tasks in a job shop setting. Despite significant interest from operations research and machine learning communities over the years, a comprehensive platform for testing and comparing solution methods has been notably lacking. To fill this gap, we introduce a unified implementation of job shop scheduling problems and their solution methods, addressing the long-standing need for a standardized benchmarking platform in this domain. Our platform supports classic Job Shop (JSP), Flow Shop (FSP), Flexible Job Shop (FJSP), and Assembl"},"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":"2308.12794","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-24T13:49:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d6a8d888e1aa315b24e226db1353054498f3dfa860657e6859931c00d411cfe0","abstract_canon_sha256":"7a4ef8c4cf192144a5f6816b94be17b76bf49ef7262a747a0485b6e46c263716"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:23.532057Z","signature_b64":"WV9p722gvwN4hfW8XE60o1c69mhd76e5jTcCgAxEax0SGCI8uRwIEkFLEGou7VqmWLb1VF6jeL0hUMUNxyL5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f08011a4acddb94ae2d1921b780df7afd16c6e4b9d325a4c1521269f1f278042","last_reissued_at":"2026-07-05T10:32:23.531403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:23.531403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Hongxiang Zhang, Igor G. Smit, Robbert Reijnen, Yaoxin Wu, Yingqian Zhang, Zaharah Bukhsh","submitted_at":"2023-08-24T13:49:48Z","abstract_excerpt":"Job shop scheduling problems address the routing and sequencing of tasks in a job shop setting. Despite significant interest from operations research and machine learning communities over the years, a comprehensive platform for testing and comparing solution methods has been notably lacking. To fill this gap, we introduce a unified implementation of job shop scheduling problems and their solution methods, addressing the long-standing need for a standardized benchmarking platform in this domain. Our platform supports classic Job Shop (JSP), Flow Shop (FSP), Flexible Job Shop (FJSP), and Assembl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12794","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.12794/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.12794","created_at":"2026-07-05T10:32:23.531473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12794v2","created_at":"2026-07-05T10:32:23.531473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12794","created_at":"2026-07-05T10:32:23.531473+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CABDJFM3W4U","created_at":"2026-07-05T10:32:23.531473+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CABDJFM3W4UVYWR","created_at":"2026-07-05T10:32:23.531473+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CABDJFM","created_at":"2026-07-05T10:32:23.531473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.16159","citing_title":"A Benchmarking Suite for Flexible Job Shop Scheduling Problems with Worker Flexibility under Uncertainty","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18454","citing_title":"Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Framework","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7","json":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7.json","graph_json":"https://pith.science/api/pith-number/6CABDJFM3W4UVYWRSINXQDPXV7/graph.json","events_json":"https://pith.science/api/pith-number/6CABDJFM3W4UVYWRSINXQDPXV7/events.json","paper":"https://pith.science/paper/6CABDJFM"},"agent_actions":{"view_html":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7","download_json":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7.json","view_paper":"https://pith.science/paper/6CABDJFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12794&json=true","fetch_graph":"https://pith.science/api/pith-number/6CABDJFM3W4UVYWRSINXQDPXV7/graph.json","fetch_events":"https://pith.science/api/pith-number/6CABDJFM3W4UVYWRSINXQDPXV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7/action/storage_attestation","attest_author":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7/action/author_attestation","sign_citation":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7/action/citation_signature","submit_replication":"https://pith.science/pith/6CABDJFM3W4UVYWRSINXQDPXV7/action/replication_record"}},"created_at":"2026-07-05T10:32:23.531473+00:00","updated_at":"2026-07-05T10:32:23.531473+00:00"}