{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T7ANYYIMYC46WG24IBRLFHCXYK","short_pith_number":"pith:T7ANYYIM","schema_version":"1.0","canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","source":{"kind":"arxiv","id":"1709.05896","version":1},"attestation_state":"computed","paper":{"title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Friedhelm Meyer auf der Heide, Manuel Malatyali, S\\\"oren Riechers","submitted_at":"2017-09-18T12:37:40Z","abstract_excerpt":"Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type. We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).\n  We are interested in the potential of simple \"greedy-lik"},"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":"1709.05896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-18T12:37:40Z","cross_cats_sorted":[],"title_canon_sha256":"81c705636238c7244a6aa855fbc6fedb2ca2fd90cb909f5e0abe3d91889a76fe","abstract_canon_sha256":"0f85023ae3749b90002da1b85c59eb51df53e011b0c02ddfe3afd0fc915d979c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.957548Z","signature_b64":"dS5Y0XXJ/7c3IcLLppr9C8Ep02UasYMlyR1eDIqPfmwUTJ3kHr1C9yo/MOdgI+nHXaao92lXUzrZq5kGuAj1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","last_reissued_at":"2026-05-18T00:34:58.956806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.956806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Friedhelm Meyer auf der Heide, Manuel Malatyali, S\\\"oren Riechers","submitted_at":"2017-09-18T12:37:40Z","abstract_excerpt":"Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type. We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).\n  We are interested in the potential of simple \"greedy-lik"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05896","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":"1709.05896","created_at":"2026-05-18T00:34:58.956924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05896v1","created_at":"2026-05-18T00:34:58.956924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05896","created_at":"2026-05-18T00:34:58.956924+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7ANYYIMYC46","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7ANYYIMYC46WG24","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7ANYYIM","created_at":"2026-05-18T12:31:43.269735+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/T7ANYYIMYC46WG24IBRLFHCXYK","json":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK.json","graph_json":"https://pith.science/api/pith-number/T7ANYYIMYC46WG24IBRLFHCXYK/graph.json","events_json":"https://pith.science/api/pith-number/T7ANYYIMYC46WG24IBRLFHCXYK/events.json","paper":"https://pith.science/paper/T7ANYYIM"},"agent_actions":{"view_html":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK","download_json":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK.json","view_paper":"https://pith.science/paper/T7ANYYIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/T7ANYYIMYC46WG24IBRLFHCXYK/graph.json","fetch_events":"https://pith.science/api/pith-number/T7ANYYIMYC46WG24IBRLFHCXYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/action/storage_attestation","attest_author":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/action/author_attestation","sign_citation":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/action/citation_signature","submit_replication":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/action/replication_record"}},"created_at":"2026-05-18T00:34:58.956924+00:00","updated_at":"2026-05-18T00:34:58.956924+00:00"}