{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3AUKUAXRPKYS3YULTDWJRII7Z3","short_pith_number":"pith:3AUKUAXR","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"},"canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","source":{"kind":"arxiv","id":"1402.1881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1881","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1881v1","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1881","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"3AUKUAXRPKYS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3AUKUAXRPKYS3YUL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3AUKUAXR","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3AUKUAXRPKYS3YULTDWJRII7Z3","target":"record","payload":{"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"},"canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","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"},"source_kind":"arxiv","source_id":"1402.1881","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-18T02:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDk0VMPVO9oKSmsI7d+5sBDCJiAQSEdbHkiHWqoB/iCoQi1he71wvBIFJ1YU56LcdRmYpKoP6uK6L3Rsy/sQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:22:49.217977Z"},"content_sha256":"b21f67d1b4d234d4fd0d42582d93e7f4a09f0ac4fa53d53195ce66c770d83277","schema_version":"1.0","event_id":"sha256:b21f67d1b4d234d4fd0d42582d93e7f4a09f0ac4fa53d53195ce66c770d83277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3AUKUAXRPKYS3YULTDWJRII7Z3","target":"graph","payload":{"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"},"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-18T02:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uV4Pn3cQ8Hs7tyqiqX6dza8527jOwAxze7T6ddtLX5p4KdOtHUgvg3ZgvZTpflAe7kivkrSls/VTlO6V6hK7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:22:49.218642Z"},"content_sha256":"1118eb8142ece83831449e46cd2d3b9d52af7a7436b09911686181b7db324507","schema_version":"1.0","event_id":"sha256:1118eb8142ece83831449e46cd2d3b9d52af7a7436b09911686181b7db324507"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/bundle.json","state_url":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/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-05-19T17:22:49Z","links":{"resolver":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3","bundle":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/bundle.json","state":"https://pith.science/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AUKUAXRPKYS3YULTDWJRII7Z3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3AUKUAXRPKYS3YULTDWJRII7Z3","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":"6c65398ff47cc7cfd81f995ef2e41b11a2ddf5cbb8051a424e0183606d754226","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-08T19:30:16Z","title_canon_sha256":"77440bb317597568996094998bc882cbfa2b5a1218bd924a0fae45cbd61da469"},"schema_version":"1.0","source":{"id":"1402.1881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1881","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1881v1","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1881","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"3AUKUAXRPKYS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3AUKUAXRPKYS3YUL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3AUKUAXR","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:1118eb8142ece83831449e46cd2d3b9d52af7a7436b09911686181b7db324507","target":"graph","created_at":"2026-05-18T02:59:31Z","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":"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","authors_text":"Bo Chen, Shuyu Zhou, Steef van de Velde, Xiandong Zhang","cross_cats":["cs.CE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-08T19:30:16Z","title":"Tactical Fixed Job Scheduling with Spread-Time Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1881","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:b21f67d1b4d234d4fd0d42582d93e7f4a09f0ac4fa53d53195ce66c770d83277","target":"record","created_at":"2026-05-18T02:59:31Z","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":"6c65398ff47cc7cfd81f995ef2e41b11a2ddf5cbb8051a424e0183606d754226","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-08T19:30:16Z","title_canon_sha256":"77440bb317597568996094998bc882cbfa2b5a1218bd924a0fae45cbd61da469"},"schema_version":"1.0","source":{"id":"1402.1881","kind":"arxiv","version":1}},"canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d828aa02f17ab12de28b98ec98a11fcef94aaabd73cceaa3e00817bae179fbb0","first_computed_at":"2026-05-18T02:59:31.313609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:31.313609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdrxDpYPifFQ2FTW8Fkk+KcQDWlwfTr2zYL33kfn+Bz3WGawxKjZ2cYRi2JoZuhRwHj2c5bZqGDAwcfGWCNCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:31.314494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b21f67d1b4d234d4fd0d42582d93e7f4a09f0ac4fa53d53195ce66c770d83277","sha256:1118eb8142ece83831449e46cd2d3b9d52af7a7436b09911686181b7db324507"],"state_sha256":"4b0b926b9101fd6a96b8b2bd45cc3d7e0f715da25090eb225890b0cd0a74df9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCfED9cL96YrGD3bG148575fIujCRTKkA6ZMv3rrR8rWsx7B6dIFqBKwJ3CnTfL3iN7uE3ND8Nc90VMibbaMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:22:49.220625Z","bundle_sha256":"3f2d258e68a81cd7fd1a00628f283f36a0ed9a016d50d8020ad9010f019619e3"}}