{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:F6FAJ647E33KCVZ5GGRNOSP5PU","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":"fa7b7483e2b283d14ecb61a22c63e3b1c8a4da9764e0220e0039571654dd33ea","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-21T17:33:09Z","title_canon_sha256":"7a9e3a86e7d3b85aefa212d82f7379a9d6457cde57e6a7682141bc55f10a043c"},"schema_version":"1.0","source":{"id":"2605.22773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22773","created_at":"2026-05-22T02:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22773v1","created_at":"2026-05-22T02:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22773","created_at":"2026-05-22T02:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"F6FAJ647E33K","created_at":"2026-05-22T02:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"F6FAJ647E33KCVZ5","created_at":"2026-05-22T02:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"F6FAJ647","created_at":"2026-05-22T02:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:cec6d46afbf56c37acc7e08c8687a8f5f79b79e39364cbd8f9a93027bedb5416","target":"graph","created_at":"2026-05-22T02:04:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.22773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Flexible Job Shop Scheduling Problem (FJSP) is the optimal allocation of a set of jobs to machines. Two primary challenges persist in FJSP: the unpredictable arrival of future jobs and the combinatorial complexity of the problem, rendering it intractable for conventional mixed-integer linear programming solvers. This paper proposes an event-based \\gls{DRL} approach to solve FJSP with random job arrivals. Specifically, we employ the Proximal Policy Optimization algorithm and use lightweight Multi-Layer Perceptrons to train the \\gls{DRL} agent for minimizing the total completion time of all ","authors_text":"Alisa Rupenyan, Efe Balta, John Lygeros, Muhammad Zakwan, Yu Tang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-21T17:33:09Z","title":"Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22773","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:5ce7cda22efc892bf72d0229ee917f80c05d2a1176e5151385f3553cfea74c57","target":"record","created_at":"2026-05-22T02:04:54Z","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":"fa7b7483e2b283d14ecb61a22c63e3b1c8a4da9764e0220e0039571654dd33ea","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-21T17:33:09Z","title_canon_sha256":"7a9e3a86e7d3b85aefa212d82f7379a9d6457cde57e6a7682141bc55f10a043c"},"schema_version":"1.0","source":{"id":"2605.22773","kind":"arxiv","version":1}},"canonical_sha256":"2f8a04fb9f26f6a1573d31a2d749fd7d1318c96fd2c09267aae7c6da518c2402","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f8a04fb9f26f6a1573d31a2d749fd7d1318c96fd2c09267aae7c6da518c2402","first_computed_at":"2026-05-22T02:04:54.307040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T02:04:54.307040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UaPLU2xb7BhDHQCPSwLPslO4zelhCdojAlQfGzuSzPjk3BOnGqBujhhQw2W6cspa6qCHhK2Me4B4EsatT6LcDg==","signature_status":"signed_v1","signed_at":"2026-05-22T02:04:54.307512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ce7cda22efc892bf72d0229ee917f80c05d2a1176e5151385f3553cfea74c57","sha256:cec6d46afbf56c37acc7e08c8687a8f5f79b79e39364cbd8f9a93027bedb5416"],"state_sha256":"40b2f26f6670765752ef4f5a197ca996a07635a3e9503d1d94d41a87c55f460c"}