{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EGL3RJWEKVCSPZCL2KYKPIAVHQ","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":"9365c0957fab8749034d33948b8d3a9181c64a6db6f7b8d57acc837f2076c841","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-13T15:47:00Z","title_canon_sha256":"490dad21038a64c3889eaad257ab07a946b1991ee223a8dbde854f670370aeea"},"schema_version":"1.0","source":{"id":"1804.05002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05002","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05002v1","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05002","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"EGL3RJWEKVCS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EGL3RJWEKVCSPZCL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EGL3RJWE","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f07410273c71baa348a8ec48f9fcc27b6aa8401c31e28e1ede665e3d9e175553","target":"graph","created_at":"2026-05-18T00:15:36Z","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":"The personnel scheduling problem is a well-known NP-hard combinatorial problem. Due to the complexity of this problem and the size of the real-world instances, it is not possible to use exact methods, and thus heuristics, meta-heuristics, or hyper-heuristics must be employed. The majority of heuristic approaches are based on iterative search, where the quality of intermediate solutions must be calculated. Unfortunately, this is computationally highly expensive because these problems have many constraints and some are very complex. In this study, we propose a machine learning technique as a too","authors_text":"P\\v{r}emysl \\v{S}\\r{u}cha, Roman V\\'aclav\\'ik, Zden\\v{e}k Hanz\\'alek","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-13T15:47:00Z","title":"Roster Evaluation Based on Classifiers for the Nurse Rostering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05002","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:cba1c07192a8d6956ce11942650e805b015b5683dd2a5ab1caefb77e8181d95b","target":"record","created_at":"2026-05-18T00:15:36Z","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":"9365c0957fab8749034d33948b8d3a9181c64a6db6f7b8d57acc837f2076c841","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-13T15:47:00Z","title_canon_sha256":"490dad21038a64c3889eaad257ab07a946b1991ee223a8dbde854f670370aeea"},"schema_version":"1.0","source":{"id":"1804.05002","kind":"arxiv","version":1}},"canonical_sha256":"2197b8a6c4554527e44bd2b0a7a0153c1e8c77c9db4c46cbdc2ca6af2be53051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2197b8a6c4554527e44bd2b0a7a0153c1e8c77c9db4c46cbdc2ca6af2be53051","first_computed_at":"2026-05-18T00:15:36.303674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:36.303674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CO5H9AHwRnrqWRIU5dCPdvkb6OUElpuyWdapo2yjniFPombRxlI0BID68GO9/C7Mow9lQq/QlcTGXtUOhcsKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:36.304306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cba1c07192a8d6956ce11942650e805b015b5683dd2a5ab1caefb77e8181d95b","sha256:f07410273c71baa348a8ec48f9fcc27b6aa8401c31e28e1ede665e3d9e175553"],"state_sha256":"1bbd9b1760d5ed1cd1d06383d5e7d32981d1b04910323421cadf1c7fbdc21685"}