{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GB76M3FKJ3ZOURIPPWQFJGNACC","short_pith_number":"pith:GB76M3FK","schema_version":"1.0","canonical_sha256":"307fe66caa4ef2ea450f7da05499a010b260ca045cce91d8c0ba97bd588a8203","source":{"kind":"arxiv","id":"0808.1246","version":2},"attestation_state":"computed","paper":{"title":"Minimum Dissatisfaction Personnel Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Angela Andreica, Mugurel Ionut Andreica, Romulus Andreica","submitted_at":"2008-08-08T17:15:34Z","abstract_excerpt":"In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequence of activities. We are interested in schedules which minimize the overall dissatisfaction, where each employee's dissatisfaction is modeled as a time-dependent linear function. For the two situations considered we provide a detailed mathematical analysis, as well as efficient algorithms for determining optimal schedules."},"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":"0808.1246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-08T17:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"559856a9d80b17b0a19aafd89f00f98a69b87d6ba6d889b6c6a4ce4d349c8263","abstract_canon_sha256":"c368fd266a7849efb3c823f7c7dd9ee9e414143cef9e7827de01443b758fd369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.280146Z","signature_b64":"kXvZde17NHKKTsQBtapqFHlGH069dtQ5D2Izno/Tc+DCIUn0Qc3eQ65bn/a32S/BGdTPLYrcco0Z7sZMAwK2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307fe66caa4ef2ea450f7da05499a010b260ca045cce91d8c0ba97bd588a8203","last_reissued_at":"2026-05-18T03:36:05.279571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.279571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Dissatisfaction Personnel Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Angela Andreica, Mugurel Ionut Andreica, Romulus Andreica","submitted_at":"2008-08-08T17:15:34Z","abstract_excerpt":"In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequence of activities. We are interested in schedules which minimize the overall dissatisfaction, where each employee's dissatisfaction is modeled as a time-dependent linear function. For the two situations considered we provide a detailed mathematical analysis, as well as efficient algorithms for determining optimal schedules."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1246","kind":"arxiv","version":2},"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":"0808.1246","created_at":"2026-05-18T03:36:05.279663+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1246v2","created_at":"2026-05-18T03:36:05.279663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1246","created_at":"2026-05-18T03:36:05.279663+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB76M3FKJ3ZO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB76M3FKJ3ZOURIP","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB76M3FK","created_at":"2026-05-18T12:25:57.157939+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/GB76M3FKJ3ZOURIPPWQFJGNACC","json":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC.json","graph_json":"https://pith.science/api/pith-number/GB76M3FKJ3ZOURIPPWQFJGNACC/graph.json","events_json":"https://pith.science/api/pith-number/GB76M3FKJ3ZOURIPPWQFJGNACC/events.json","paper":"https://pith.science/paper/GB76M3FK"},"agent_actions":{"view_html":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC","download_json":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC.json","view_paper":"https://pith.science/paper/GB76M3FK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1246&json=true","fetch_graph":"https://pith.science/api/pith-number/GB76M3FKJ3ZOURIPPWQFJGNACC/graph.json","fetch_events":"https://pith.science/api/pith-number/GB76M3FKJ3ZOURIPPWQFJGNACC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC/action/storage_attestation","attest_author":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC/action/author_attestation","sign_citation":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC/action/citation_signature","submit_replication":"https://pith.science/pith/GB76M3FKJ3ZOURIPPWQFJGNACC/action/replication_record"}},"created_at":"2026-05-18T03:36:05.279663+00:00","updated_at":"2026-05-18T03:36:05.279663+00:00"}