{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QZPVK7PQOTJJWDRN2NMI7QQQJ3","short_pith_number":"pith:QZPVK7PQ","schema_version":"1.0","canonical_sha256":"865f557df074d29b0e2dd3588fc2104ecbae01ebafa03d6f1541ad397f7d0750","source":{"kind":"arxiv","id":"1205.2200","version":1},"attestation_state":"computed","paper":{"title":"A Greedy Double Swap Heuristic for Nurse Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Michelle Cheong, Murphy Choy","submitted_at":"2012-05-10T08:54:57Z","abstract_excerpt":"One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients' demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent i"},"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":"1205.2200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2012-05-10T08:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"2f154a53f90d073102c7ed391d717baf832ba299bfc01d37753a48bd852dba10","abstract_canon_sha256":"3fc99c0ecd4f0d9421987d5dfefd9092240c53f5f4787e2169ed5f9aaed4e110"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:31.305235Z","signature_b64":"jaolP/dRuaGBzv4K8LnKHIKxv6KeIggV+btlKybMCJpukWPiI69lT12t3zxNBX44bEc7kcI7zcv3VjAvArulBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865f557df074d29b0e2dd3588fc2104ecbae01ebafa03d6f1541ad397f7d0750","last_reissued_at":"2026-05-18T03:53:31.304586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:31.304586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Greedy Double Swap Heuristic for Nurse Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Michelle Cheong, Murphy Choy","submitted_at":"2012-05-10T08:54:57Z","abstract_excerpt":"One of the key challenges of nurse scheduling problem (NSP) is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients' demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2200","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.2200","created_at":"2026-05-18T03:53:31.304692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2200v1","created_at":"2026-05-18T03:53:31.304692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2200","created_at":"2026-05-18T03:53:31.304692+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZPVK7PQOTJJ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZPVK7PQOTJJWDRN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZPVK7PQ","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3","json":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3.json","graph_json":"https://pith.science/api/pith-number/QZPVK7PQOTJJWDRN2NMI7QQQJ3/graph.json","events_json":"https://pith.science/api/pith-number/QZPVK7PQOTJJWDRN2NMI7QQQJ3/events.json","paper":"https://pith.science/paper/QZPVK7PQ"},"agent_actions":{"view_html":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3","download_json":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3.json","view_paper":"https://pith.science/paper/QZPVK7PQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2200&json=true","fetch_graph":"https://pith.science/api/pith-number/QZPVK7PQOTJJWDRN2NMI7QQQJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/QZPVK7PQOTJJWDRN2NMI7QQQJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3/action/storage_attestation","attest_author":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3/action/author_attestation","sign_citation":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3/action/citation_signature","submit_replication":"https://pith.science/pith/QZPVK7PQOTJJWDRN2NMI7QQQJ3/action/replication_record"}},"created_at":"2026-05-18T03:53:31.304692+00:00","updated_at":"2026-05-18T03:53:31.304692+00:00"}