{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WB7RSRPSMBVSAHJNRDDRHFZ52S","short_pith_number":"pith:WB7RSRPS","schema_version":"1.0","canonical_sha256":"b07f1945f2606b201d2d88c713973dd4b4442dd57283e03c8a0943bf7d613971","source":{"kind":"arxiv","id":"2408.06993","version":1},"attestation_state":"computed","paper":{"title":"LLMs can Schedule","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ararat Harutyunyan, Henrik Abgaryan, Tristan Cazenave","submitted_at":"2024-08-13T15:53:58Z","abstract_excerpt":"The job shop scheduling problem (JSSP) remains a significant hurdle in optimizing production processes. This challenge involves efficiently allocating jobs to a limited number of machines while minimizing factors like total processing time or job delays. While recent advancements in artificial intelligence have yielded promising solutions, such as reinforcement learning and graph neural networks, this paper explores the potential of Large Language Models (LLMs) for JSSP. We introduce the very first supervised 120k dataset specifically designed to train LLMs for JSSP. Surprisingly, our findings"},"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":"2408.06993","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-13T15:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"0f22a325acd2689e833a78276623e3e46222e469b6fc1f84d51af00f73345f41","abstract_canon_sha256":"9f9766ef75206e6c411755ec8b1945e4fa35886a177a7f8f6e94d8e228726968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:04.715865Z","signature_b64":"78Lm5LgP0yBe66nrwEIITRIQTFyYyfKWs1n2MmlgWKRZ9x0tcsPXDVZC7qOxlfgZYjYIjC65cdbE5P24qdAJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07f1945f2606b201d2d88c713973dd4b4442dd57283e03c8a0943bf7d613971","last_reissued_at":"2026-07-05T08:55:04.715487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:04.715487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMs can Schedule","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ararat Harutyunyan, Henrik Abgaryan, Tristan Cazenave","submitted_at":"2024-08-13T15:53:58Z","abstract_excerpt":"The job shop scheduling problem (JSSP) remains a significant hurdle in optimizing production processes. This challenge involves efficiently allocating jobs to a limited number of machines while minimizing factors like total processing time or job delays. While recent advancements in artificial intelligence have yielded promising solutions, such as reinforcement learning and graph neural networks, this paper explores the potential of Large Language Models (LLMs) for JSSP. We introduce the very first supervised 120k dataset specifically designed to train LLMs for JSSP. Surprisingly, our findings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06993","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.06993/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":"2408.06993","created_at":"2026-07-05T08:55:04.715543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06993v1","created_at":"2026-07-05T08:55:04.715543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06993","created_at":"2026-07-05T08:55:04.715543+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB7RSRPSMBVS","created_at":"2026-07-05T08:55:04.715543+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB7RSRPSMBVSAHJN","created_at":"2026-07-05T08:55:04.715543+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB7RSRPS","created_at":"2026-07-05T08:55:04.715543+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19119","citing_title":"GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13221","citing_title":"An Agentic AI Framework with Large Language Models and Chain-of-Thought for UAV-Assisted Logistics Scheduling with Mobile Edge Computing","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10989","citing_title":"MAFIG: Multi-agent Driven Formal Instruction Generation Framework","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07214","citing_title":"HMACE: Heterogeneous Multi-Agent Collaborative Evolution for Combinatorial Optimization","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S","json":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S.json","graph_json":"https://pith.science/api/pith-number/WB7RSRPSMBVSAHJNRDDRHFZ52S/graph.json","events_json":"https://pith.science/api/pith-number/WB7RSRPSMBVSAHJNRDDRHFZ52S/events.json","paper":"https://pith.science/paper/WB7RSRPS"},"agent_actions":{"view_html":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S","download_json":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S.json","view_paper":"https://pith.science/paper/WB7RSRPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06993&json=true","fetch_graph":"https://pith.science/api/pith-number/WB7RSRPSMBVSAHJNRDDRHFZ52S/graph.json","fetch_events":"https://pith.science/api/pith-number/WB7RSRPSMBVSAHJNRDDRHFZ52S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S/action/storage_attestation","attest_author":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S/action/author_attestation","sign_citation":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S/action/citation_signature","submit_replication":"https://pith.science/pith/WB7RSRPSMBVSAHJNRDDRHFZ52S/action/replication_record"}},"created_at":"2026-07-05T08:55:04.715543+00:00","updated_at":"2026-07-05T08:55:04.715543+00:00"}