{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VXLZP4RA5EH4MVNZEGP7XUWD5B","short_pith_number":"pith:VXLZP4RA","canonical_record":{"source":{"id":"1210.1753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-04T03:49:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d9f55b35b51f842e18188caf8f5f18889fac623607f74e9192485f39a852b2fd","abstract_canon_sha256":"5f094a2bccfbf1ac8664bf12251d96d244b4f25379b41da191bf956f02437af6"},"schema_version":"1.0"},"canonical_sha256":"add797f220e90fc655b9219ffbd2c3e851048cbc502aee58589399736ce4acc4","source":{"kind":"arxiv","id":"1210.1753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1753","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1753v1","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1753","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"VXLZP4RA5EH4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXLZP4RA5EH4MVNZ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXLZP4RA","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VXLZP4RA5EH4MVNZEGP7XUWD5B","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-04T03:49:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d9f55b35b51f842e18188caf8f5f18889fac623607f74e9192485f39a852b2fd","abstract_canon_sha256":"5f094a2bccfbf1ac8664bf12251d96d244b4f25379b41da191bf956f02437af6"},"schema_version":"1.0"},"canonical_sha256":"add797f220e90fc655b9219ffbd2c3e851048cbc502aee58589399736ce4acc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:53.407707Z","signature_b64":"qzQvRoPEujcv9JUq6+ya24CoeVBcM66s9c09xr9BffX+DlpD1nMv/kQKSSynXzsGmj/K7PKgRDcz7KfATCYcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add797f220e90fc655b9219ffbd2c3e851048cbc502aee58589399736ce4acc4","last_reissued_at":"2026-05-18T03:43:53.407169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:53.407169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1753","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-05-18T03:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFag/SsbKSq3qcL1zK7S4c2oLIleyeyli/DGKXPZiMkK9e1KAmXjnQNKN7hrx8F05K9Gk5U6NPCL0vmIoSkNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:32:27.106886Z"},"content_sha256":"94827eae44995100dcb70d73d190907e0fef84806531b27e34df8bde738d6f5d","schema_version":"1.0","event_id":"sha256:94827eae44995100dcb70d73d190907e0fef84806531b27e34df8bde738d6f5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VXLZP4RA5EH4MVNZEGP7XUWD5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intelligent Search Heuristics for Cost Based Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Michelle Cheong, Murphy Choy","submitted_at":"2012-10-04T03:49:21Z","abstract_excerpt":"Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research in the literature solving the problem using meta-heuristics approaches. In this paper, we will investigate an intelligent search heuristics that handles cost based scheduling problem. The heuristics demonstrated superior performances compared to the original algorithms used to solve the problems described in Li et. Al. (2003) and Ozkarahan (1989) in terms of time needed to establish a feasible solution. Both problems can be formulated as a cost problem. The search heuristic consists of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1753","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":""},"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-05-18T03:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDWZO6Nu5fIg7bZo54DTj3aZagSSWF47TVrRBgPMMMDmLcvmeAx16iHz51HhnMimkRcltK1cKko+QYgAaUUECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:32:27.107232Z"},"content_sha256":"aa2457cb68cb4175f843ec3c427eedb954705f84c981d243f89d68a445cde0ad","schema_version":"1.0","event_id":"sha256:aa2457cb68cb4175f843ec3c427eedb954705f84c981d243f89d68a445cde0ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/bundle.json","state_url":"https://pith.science/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/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-06-30T09:32:27Z","links":{"resolver":"https://pith.science/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B","bundle":"https://pith.science/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/bundle.json","state":"https://pith.science/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXLZP4RA5EH4MVNZEGP7XUWD5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VXLZP4RA5EH4MVNZEGP7XUWD5B","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":"5f094a2bccfbf1ac8664bf12251d96d244b4f25379b41da191bf956f02437af6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-04T03:49:21Z","title_canon_sha256":"d9f55b35b51f842e18188caf8f5f18889fac623607f74e9192485f39a852b2fd"},"schema_version":"1.0","source":{"id":"1210.1753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1753","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1753v1","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1753","created_at":"2026-05-18T03:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"VXLZP4RA5EH4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXLZP4RA5EH4MVNZ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXLZP4RA","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:aa2457cb68cb4175f843ec3c427eedb954705f84c981d243f89d68a445cde0ad","target":"graph","created_at":"2026-05-18T03:43:53Z","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":"Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research in the literature solving the problem using meta-heuristics approaches. In this paper, we will investigate an intelligent search heuristics that handles cost based scheduling problem. The heuristics demonstrated superior performances compared to the original algorithms used to solve the problems described in Li et. Al. (2003) and Ozkarahan (1989) in terms of time needed to establish a feasible solution. Both problems can be formulated as a cost problem. The search heuristic consists of s","authors_text":"Michelle Cheong, Murphy Choy","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-04T03:49:21Z","title":"Intelligent Search Heuristics for Cost Based Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1753","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:94827eae44995100dcb70d73d190907e0fef84806531b27e34df8bde738d6f5d","target":"record","created_at":"2026-05-18T03:43:53Z","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":"5f094a2bccfbf1ac8664bf12251d96d244b4f25379b41da191bf956f02437af6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-04T03:49:21Z","title_canon_sha256":"d9f55b35b51f842e18188caf8f5f18889fac623607f74e9192485f39a852b2fd"},"schema_version":"1.0","source":{"id":"1210.1753","kind":"arxiv","version":1}},"canonical_sha256":"add797f220e90fc655b9219ffbd2c3e851048cbc502aee58589399736ce4acc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add797f220e90fc655b9219ffbd2c3e851048cbc502aee58589399736ce4acc4","first_computed_at":"2026-05-18T03:43:53.407169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:53.407169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qzQvRoPEujcv9JUq6+ya24CoeVBcM66s9c09xr9BffX+DlpD1nMv/kQKSSynXzsGmj/K7PKgRDcz7KfATCYcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:53.407707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94827eae44995100dcb70d73d190907e0fef84806531b27e34df8bde738d6f5d","sha256:aa2457cb68cb4175f843ec3c427eedb954705f84c981d243f89d68a445cde0ad"],"state_sha256":"a62fe3adfd214226883691122546e8175e879bee2a6d00d02913ce6bb512a1e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvnH6/94pKuONMfOLkgkmZ1/8oI55yptSh5LMRj+k90PlDMGtoXEabfWK/yjxdHzAUtrCKPSNAApos+w/CzrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:32:27.109306Z","bundle_sha256":"08ff6641466765328e459cc786ab7c27e04a10c9cd5fa3e7abe666829b6c3f6a"}}