{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EV4HK4MJRZP6SFB2ANH2AFJ57S","short_pith_number":"pith:EV4HK4MJ","schema_version":"1.0","canonical_sha256":"25787571898e5fe9143a034fa0153dfc9bee802adceb4555d3db9d19cea9c564","source":{"kind":"arxiv","id":"2507.11311","version":1},"attestation_state":"computed","paper":{"title":"Scheduling on Identical Machines with Setup Time and Unknown Execution Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanna Sumita, Kazuhisa Makino, Vinh Long Phan, Yasushi Kawase","submitted_at":"2025-07-15T13:42:42Z","abstract_excerpt":"In this study, we investigate a scheduling problem on identical machines in which jobs require initial setup before execution. We assume that an algorithm can dynamically form a batch (i.e., a collection of jobs to be processed together) from the remaining jobs. The setup time is modeled as a known monotone function of the set of jobs within a batch, while the execution time of each job remains unknown until completion. This uncertainty poses significant challenges for minimizing the makespan. We address these challenges by considering two scenarios: each job batch must be assigned to a single"},"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":"2507.11311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T13:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"35aa7b253bf1c5d235cf9b99f3985b49c04c60f66bc33e714c71f976071c5a1e","abstract_canon_sha256":"9b9516f1bcdd45f7cd07e0b948deda030db4fabdb08c1181b62bf787bb65da4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:36.812926Z","signature_b64":"7dDJA/StGM21hH4stkY9bkfskitAJcBR6ihOxGLV6B3tYHTEoNQS+oz87eNxnszrRyOhU+WgI2XBiP8/TVfSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25787571898e5fe9143a034fa0153dfc9bee802adceb4555d3db9d19cea9c564","last_reissued_at":"2026-07-05T11:37:36.812507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:36.812507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling on Identical Machines with Setup Time and Unknown Execution Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanna Sumita, Kazuhisa Makino, Vinh Long Phan, Yasushi Kawase","submitted_at":"2025-07-15T13:42:42Z","abstract_excerpt":"In this study, we investigate a scheduling problem on identical machines in which jobs require initial setup before execution. We assume that an algorithm can dynamically form a batch (i.e., a collection of jobs to be processed together) from the remaining jobs. The setup time is modeled as a known monotone function of the set of jobs within a batch, while the execution time of each job remains unknown until completion. This uncertainty poses significant challenges for minimizing the makespan. We address these challenges by considering two scenarios: each job batch must be assigned to a single"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11311","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11311/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.11311","created_at":"2026-07-05T11:37:36.812567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11311v1","created_at":"2026-07-05T11:37:36.812567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11311","created_at":"2026-07-05T11:37:36.812567+00:00"},{"alias_kind":"pith_short_12","alias_value":"EV4HK4MJRZP6","created_at":"2026-07-05T11:37:36.812567+00:00"},{"alias_kind":"pith_short_16","alias_value":"EV4HK4MJRZP6SFB2","created_at":"2026-07-05T11:37:36.812567+00:00"},{"alias_kind":"pith_short_8","alias_value":"EV4HK4MJ","created_at":"2026-07-05T11:37:36.812567+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/EV4HK4MJRZP6SFB2ANH2AFJ57S","json":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S.json","graph_json":"https://pith.science/api/pith-number/EV4HK4MJRZP6SFB2ANH2AFJ57S/graph.json","events_json":"https://pith.science/api/pith-number/EV4HK4MJRZP6SFB2ANH2AFJ57S/events.json","paper":"https://pith.science/paper/EV4HK4MJ"},"agent_actions":{"view_html":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S","download_json":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S.json","view_paper":"https://pith.science/paper/EV4HK4MJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11311&json=true","fetch_graph":"https://pith.science/api/pith-number/EV4HK4MJRZP6SFB2ANH2AFJ57S/graph.json","fetch_events":"https://pith.science/api/pith-number/EV4HK4MJRZP6SFB2ANH2AFJ57S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S/action/storage_attestation","attest_author":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S/action/author_attestation","sign_citation":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S/action/citation_signature","submit_replication":"https://pith.science/pith/EV4HK4MJRZP6SFB2ANH2AFJ57S/action/replication_record"}},"created_at":"2026-07-05T11:37:36.812567+00:00","updated_at":"2026-07-05T11:37:36.812567+00:00"}