{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3AUKUAXRPKYS3YULTDWJRII7Z3","short_pith_number":"pith:3AUKUAXR","schema_version":"1.0","canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","source":{"kind":"arxiv","id":"1402.1881","version":1},"attestation_state":"computed","paper":{"title":"Tactical Fixed Job Scheduling with Spread-Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DS","authors_text":"Bo Chen, Shuyu Zhou, Steef van de Velde, Xiandong Zhang","submitted_at":"2014-02-08T19:30:16Z","abstract_excerpt":"We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine is only available for $L$ consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cos"},"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":"1402.1881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-08T19:30:16Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"77440bb317597568996094998bc882cbfa2b5a1218bd924a0fae45cbd61da469","abstract_canon_sha256":"6c65398ff47cc7cfd81f995ef2e41b11a2ddf5cbb8051a424e0183606d754226"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:31.314494Z","signature_b64":"fdrxDpYPifFQ2FTW8Fkk+KcQDWlwfTr2zYL33kfn+Bz3WGawxKjZ2cYRi2JoZuhRwHj2c5bZqGDAwcfGWCNCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","last_reissued_at":"2026-05-18T02:59:31.313609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:31.313609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tactical Fixed Job Scheduling with Spread-Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DS","authors_text":"Bo Chen, Shuyu Zhou, Steef van de Velde, Xiandong Zhang","submitted_at":"2014-02-08T19:30:16Z","abstract_excerpt":"We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine is only available for $L$ consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1881","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":"1402.1881","created_at":"2026-05-18T02:59:31.313765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1881v1","created_at":"2026-05-18T02:59:31.313765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1881","created_at":"2026-05-18T02:59:31.313765+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AUKUAXRPKYS","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AUKUAXRPKYS3YUL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AUKUAXR","created_at":"2026-05-18T12:28:11.866339+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/3AUKUAXRPKYS3YULTDWJRII7Z3","json":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3.json","graph_json":"https://pith.science/api/pith-number/3AUKUAXRPKYS3YULTDWJRII7Z3/graph.json","events_json":"https://pith.science/api/pith-number/3AUKUAXRPKYS3YULTDWJRII7Z3/events.json","paper":"https://pith.science/paper/3AUKUAXR"},"agent_actions":{"view_html":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3","download_json":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3.json","view_paper":"https://pith.science/paper/3AUKUAXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1881&json=true","fetch_graph":"https://pith.science/api/pith-number/3AUKUAXRPKYS3YULTDWJRII7Z3/graph.json","fetch_events":"https://pith.science/api/pith-number/3AUKUAXRPKYS3YULTDWJRII7Z3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/action/storage_attestation","attest_author":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/action/author_attestation","sign_citation":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/action/citation_signature","submit_replication":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/action/replication_record"}},"created_at":"2026-05-18T02:59:31.313765+00:00","updated_at":"2026-05-18T02:59:31.313765+00:00"}