{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SDIIQ7WLAUB4N72V6JKKLF4HI7","short_pith_number":"pith:SDIIQ7WL","canonical_record":{"source":{"id":"2010.14252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-24T22:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"b7f03fcc316988509199f8eae29dde16c35d9055fa56cfcf73eb432a8ac2c139","abstract_canon_sha256":"bea3b451a3aa271ada6ba810bcb5612765c5f0af3f814a5e7fb41f96ee3d9ca9"},"schema_version":"1.0"},"canonical_sha256":"90d0887ecb0503c6ff55f254a5978747cc8b21e1d5f9e869510ce61c7daab0fd","source":{"kind":"arxiv","id":"2010.14252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14252","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14252v1","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14252","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"SDIIQ7WLAUB4","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_16","alias_value":"SDIIQ7WLAUB4N72V","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_8","alias_value":"SDIIQ7WL","created_at":"2026-07-05T01:46:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SDIIQ7WLAUB4N72V6JKKLF4HI7","target":"record","payload":{"canonical_record":{"source":{"id":"2010.14252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-24T22:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"b7f03fcc316988509199f8eae29dde16c35d9055fa56cfcf73eb432a8ac2c139","abstract_canon_sha256":"bea3b451a3aa271ada6ba810bcb5612765c5f0af3f814a5e7fb41f96ee3d9ca9"},"schema_version":"1.0"},"canonical_sha256":"90d0887ecb0503c6ff55f254a5978747cc8b21e1d5f9e869510ce61c7daab0fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:33.149043Z","signature_b64":"V07mKrjcKi6aP9IaGAHqCFP7CtmTl98sgEtxdpWFZL9sITQNR9a8wMD5jp/opXbWMPiNqR/XmKISk6OB97t1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d0887ecb0503c6ff55f254a5978747cc8b21e1d5f9e869510ce61c7daab0fd","last_reissued_at":"2026-07-05T01:46:33.148636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:33.148636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.14252","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-07-05T01:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6psXDy5s/hCWUfzBVuc9SB3zepOXYrPGsk52kokhu1CshmNZtW+vzX+1CmrOxIVvhg8lMFqjj2gVQ4UQGzwUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T06:51:23.059667Z"},"content_sha256":"dcb8d745c4a131ed2d170a2455fcd4df3c3aaadc366c6707462bc18e8213c16e","schema_version":"1.0","event_id":"sha256:dcb8d745c4a131ed2d170a2455fcd4df3c3aaadc366c6707462bc18e8213c16e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SDIIQ7WLAUB4N72V6JKKLF4HI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Networked Assisted Tree Search for the Personnel Rostering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Patrick De Causmaecker, Yajie Dou, Ziyi Chen","submitted_at":"2020-10-24T22:23:20Z","abstract_excerpt":"The personnel rostering problem is the problem of finding an optimal way to assign employees to shifts, subject to a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. The problem has received significant attention in the literature and is addressed by a large number of exact and metaheuristic methods. In order to make the complex and costly design of heuristics for the personnel rostering problem automatic, we propose a new method combined Deep Neural Network and Tree Search. By treating schedules "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14252","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/2010.14252/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"},"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-07-05T01:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHgIrJi8jW7pbRGvOT0a0izQqFdUmTuu3MOXjOVw+f6fzjFWg3nD5eF+BhIHmh72W+D6T9t8LVH90NsxXos0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T06:51:23.060228Z"},"content_sha256":"306ca1d14adaf061e9b92b810451392c2eeb979d4dd9573ce08e043fdc3ce752","schema_version":"1.0","event_id":"sha256:306ca1d14adaf061e9b92b810451392c2eeb979d4dd9573ce08e043fdc3ce752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/bundle.json","state_url":"https://pith.science/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/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-08-10T06:51:23Z","links":{"resolver":"https://pith.science/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7","bundle":"https://pith.science/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/bundle.json","state":"https://pith.science/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDIIQ7WLAUB4N72V6JKKLF4HI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SDIIQ7WLAUB4N72V6JKKLF4HI7","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":"bea3b451a3aa271ada6ba810bcb5612765c5f0af3f814a5e7fb41f96ee3d9ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-24T22:23:20Z","title_canon_sha256":"b7f03fcc316988509199f8eae29dde16c35d9055fa56cfcf73eb432a8ac2c139"},"schema_version":"1.0","source":{"id":"2010.14252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14252","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14252v1","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14252","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"SDIIQ7WLAUB4","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_16","alias_value":"SDIIQ7WLAUB4N72V","created_at":"2026-07-05T01:46:33Z"},{"alias_kind":"pith_short_8","alias_value":"SDIIQ7WL","created_at":"2026-07-05T01:46:33Z"}],"graph_snapshots":[{"event_id":"sha256:306ca1d14adaf061e9b92b810451392c2eeb979d4dd9573ce08e043fdc3ce752","target":"graph","created_at":"2026-07-05T01:46:33Z","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/2010.14252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The personnel rostering problem is the problem of finding an optimal way to assign employees to shifts, subject to a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. The problem has received significant attention in the literature and is addressed by a large number of exact and metaheuristic methods. In order to make the complex and costly design of heuristics for the personnel rostering problem automatic, we propose a new method combined Deep Neural Network and Tree Search. By treating schedules ","authors_text":"Patrick De Causmaecker, Yajie Dou, Ziyi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-24T22:23:20Z","title":"Neural Networked Assisted Tree Search for the Personnel Rostering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14252","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:dcb8d745c4a131ed2d170a2455fcd4df3c3aaadc366c6707462bc18e8213c16e","target":"record","created_at":"2026-07-05T01:46:33Z","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":"bea3b451a3aa271ada6ba810bcb5612765c5f0af3f814a5e7fb41f96ee3d9ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-24T22:23:20Z","title_canon_sha256":"b7f03fcc316988509199f8eae29dde16c35d9055fa56cfcf73eb432a8ac2c139"},"schema_version":"1.0","source":{"id":"2010.14252","kind":"arxiv","version":1}},"canonical_sha256":"90d0887ecb0503c6ff55f254a5978747cc8b21e1d5f9e869510ce61c7daab0fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90d0887ecb0503c6ff55f254a5978747cc8b21e1d5f9e869510ce61c7daab0fd","first_computed_at":"2026-07-05T01:46:33.148636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:46:33.148636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V07mKrjcKi6aP9IaGAHqCFP7CtmTl98sgEtxdpWFZL9sITQNR9a8wMD5jp/opXbWMPiNqR/XmKISk6OB97t1Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:46:33.149043Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.14252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcb8d745c4a131ed2d170a2455fcd4df3c3aaadc366c6707462bc18e8213c16e","sha256:306ca1d14adaf061e9b92b810451392c2eeb979d4dd9573ce08e043fdc3ce752"],"state_sha256":"cb4b373abf01d9dbd0ece4379760111d888964abbf88039bce1c440264036d7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eh6V0r7uzZzirJ4NJy1YE/I4JT/nxj0fsy1VUomsiIcJ5q0KlAfja4j2R3CBwzOK7wUMSURHbJ+q4Z4N6gI6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T06:51:23.065839Z","bundle_sha256":"645ef41a6d0c3e361d0f8e6a64129b7c9bf9c5925e0f381ab147fd21225902d6"}}