{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T7ANYYIMYC46WG24IBRLFHCXYK","short_pith_number":"pith:T7ANYYIM","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"},"canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","source":{"kind":"arxiv","id":"1709.05896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05896","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05896v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05896","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"T7ANYYIMYC46","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T7ANYYIMYC46WG24","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T7ANYYIM","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T7ANYYIMYC46WG24IBRLFHCXYK","target":"record","payload":{"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"},"canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","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"},"source_kind":"arxiv","source_id":"1709.05896","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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRD6c/Ixd3Y99/9CGV2QKKpfGeJVAVX6Xxa2mt8u/sFUGzE/betpOJUV/nLiJb5LOWVR+Zk9apvIzrJYcxlFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:08:23.812002Z"},"content_sha256":"ee3f12622fe6f14513ccf4ce630659179331df75c87b427016e9e24b6b8ee2c1","schema_version":"1.0","event_id":"sha256:ee3f12622fe6f14513ccf4ce630659179331df75c87b427016e9e24b6b8ee2c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T7ANYYIMYC46WG24IBRLFHCXYK","target":"graph","payload":{"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"},"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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eW5DZi455UaETu82zZOyXuBH9dIHhcs+5l7pwlNf1OffC+7pEPEvOHJnghKm9NuQgHT8A4c2tsabFDagu9uKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:08:23.812367Z"},"content_sha256":"f26cb8a7ae37ca8896c4dc0051ec4c3582e961ef7490fe7b19e27e1f36419f32","schema_version":"1.0","event_id":"sha256:f26cb8a7ae37ca8896c4dc0051ec4c3582e961ef7490fe7b19e27e1f36419f32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/bundle.json","state_url":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7ANYYIMYC46WG24IBRLFHCXYK/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-06-12T10:08:23Z","links":{"resolver":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK","bundle":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/bundle.json","state":"https://pith.science/pith/T7ANYYIMYC46WG24IBRLFHCXYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7ANYYIMYC46WG24IBRLFHCXYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T7ANYYIMYC46WG24IBRLFHCXYK","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":"0f85023ae3749b90002da1b85c59eb51df53e011b0c02ddfe3afd0fc915d979c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-18T12:37:40Z","title_canon_sha256":"81c705636238c7244a6aa855fbc6fedb2ca2fd90cb909f5e0abe3d91889a76fe"},"schema_version":"1.0","source":{"id":"1709.05896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05896","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05896v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05896","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"T7ANYYIMYC46","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T7ANYYIMYC46WG24","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T7ANYYIM","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f26cb8a7ae37ca8896c4dc0051ec4c3582e961ef7490fe7b19e27e1f36419f32","target":"graph","created_at":"2026-05-18T00:34:58Z","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":"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","authors_text":"Alexander M\\\"acker, Friedhelm Meyer auf der Heide, Manuel Malatyali, S\\\"oren Riechers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-18T12:37:40Z","title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05896","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:ee3f12622fe6f14513ccf4ce630659179331df75c87b427016e9e24b6b8ee2c1","target":"record","created_at":"2026-05-18T00:34:58Z","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":"0f85023ae3749b90002da1b85c59eb51df53e011b0c02ddfe3afd0fc915d979c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-18T12:37:40Z","title_canon_sha256":"81c705636238c7244a6aa855fbc6fedb2ca2fd90cb909f5e0abe3d91889a76fe"},"schema_version":"1.0","source":{"id":"1709.05896","kind":"arxiv","version":1}},"canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fc0dc610cc0b9eb1b5c4062b29c57c283d613e3bbc2446483743027a896913c","first_computed_at":"2026-05-18T00:34:58.956806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:58.956806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dS5Y0XXJ/7c3IcLLppr9C8Ep02UasYMlyR1eDIqPfmwUTJ3kHr1C9yo/MOdgI+nHXaao92lXUzrZq5kGuAj1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:58.957548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3f12622fe6f14513ccf4ce630659179331df75c87b427016e9e24b6b8ee2c1","sha256:f26cb8a7ae37ca8896c4dc0051ec4c3582e961ef7490fe7b19e27e1f36419f32"],"state_sha256":"5f091088852a691ebdde776699081c4adaab1451fde4d966ba9944d668f41c87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aI+BftyC/hLJ7YL8pbauawRiIcOUL8fTP7Ccwyyd4SD6RlyUHn9YYSskfv84ax+PzvcSxf6z1f2C/Ho3E+DqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:08:23.814474Z","bundle_sha256":"f8bb542dddd22153d5a7eac30c9aafd7d6400b83d88ac936f5cc24e3210f078f"}}