{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M5VJMLZH7OQTSLMZELQ67O53T3","short_pith_number":"pith:M5VJMLZH","canonical_record":{"source":{"id":"1312.3345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T21:07:58Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"15decb51ecb2ef6ccffc4d4f494581d99ccafc3c8e37cd5c21cb031dba979540","abstract_canon_sha256":"d838bd729720a60c34e9414d7a56bd7cb78288bc09384a401a842a926405ab00"},"schema_version":"1.0"},"canonical_sha256":"676a962f27fba1392d9922e1efbbbb9eca886cc563834913c2fb04dde5bef8e7","source":{"kind":"arxiv","id":"1312.3345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3345","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3345v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3345","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"M5VJMLZH7OQT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5VJMLZH7OQTSLMZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5VJMLZH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M5VJMLZH7OQTSLMZELQ67O53T3","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T21:07:58Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"15decb51ecb2ef6ccffc4d4f494581d99ccafc3c8e37cd5c21cb031dba979540","abstract_canon_sha256":"d838bd729720a60c34e9414d7a56bd7cb78288bc09384a401a842a926405ab00"},"schema_version":"1.0"},"canonical_sha256":"676a962f27fba1392d9922e1efbbbb9eca886cc563834913c2fb04dde5bef8e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.697681Z","signature_b64":"6VDzc03yiRgrJE39ICdFGdkdJM97uD6DfrFgA3AE4srmy3qcrEj/BlvCDDgx6VkT5Fd5MJWNE6IvLSQKHn1yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676a962f27fba1392d9922e1efbbbb9eca886cc563834913c2fb04dde5bef8e7","last_reissued_at":"2026-05-18T03:04:23.697213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.697213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3345","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uinrvlkqrrI/4quWKMpUOl//631ReOahhwf8e7Y7szXwuJMMnskSL5KbpwC9KpEa+cAOTFNOjGAboowGec0vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:26:53.764860Z"},"content_sha256":"2abd583dc7543a46eaa8c50d4c94cc89a92242afc82ea16463f67186c01344d2","schema_version":"1.0","event_id":"sha256:2abd583dc7543a46eaa8c50d4c94cc89a92242afc82ea16463f67186c01344d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M5VJMLZH7OQTSLMZELQ67O53T3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Levent Tuncel, Michael Huang, Peruvemba Sundaram Ravi","submitted_at":"2013-12-11T21:07:58Z","abstract_excerpt":"In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime optimal schedules, called LD algorithm, has a simple worst-case performance bound: (5m-2)/(4m-1), where m is the number of machines. We study structure of potential minimal counterexamples to this conjecture and prove that the conjecture holds for the cases (i) n > 5m, (ii) m = 2, (iii) m = 3, and (iv) m greater than or equal to 4, n less than or equal to 3m, where n is the number of jobs. We further conclude that to verify the conject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3345","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teznEx8k7Fi8IcWzP76o9ZzeUMfI/oGUtWdqfWiH19oqUgQWjQ8Mnu10f4W9RzplffTgEnf2PJnJbz8WNXvTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:26:53.765220Z"},"content_sha256":"54d238587cdaaf1932f58cce0cc8551b5665f8fd51e75a4c2545945a2a17727e","schema_version":"1.0","event_id":"sha256:54d238587cdaaf1932f58cce0cc8551b5665f8fd51e75a4c2545945a2a17727e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5VJMLZH7OQTSLMZELQ67O53T3/bundle.json","state_url":"https://pith.science/pith/M5VJMLZH7OQTSLMZELQ67O53T3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5VJMLZH7OQTSLMZELQ67O53T3/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-22T23:26:53Z","links":{"resolver":"https://pith.science/pith/M5VJMLZH7OQTSLMZELQ67O53T3","bundle":"https://pith.science/pith/M5VJMLZH7OQTSLMZELQ67O53T3/bundle.json","state":"https://pith.science/pith/M5VJMLZH7OQTSLMZELQ67O53T3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5VJMLZH7OQTSLMZELQ67O53T3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M5VJMLZH7OQTSLMZELQ67O53T3","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":"d838bd729720a60c34e9414d7a56bd7cb78288bc09384a401a842a926405ab00","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T21:07:58Z","title_canon_sha256":"15decb51ecb2ef6ccffc4d4f494581d99ccafc3c8e37cd5c21cb031dba979540"},"schema_version":"1.0","source":{"id":"1312.3345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3345","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3345v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3345","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"M5VJMLZH7OQT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5VJMLZH7OQTSLMZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5VJMLZH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:54d238587cdaaf1932f58cce0cc8551b5665f8fd51e75a4c2545945a2a17727e","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime optimal schedules, called LD algorithm, has a simple worst-case performance bound: (5m-2)/(4m-1), where m is the number of machines. We study structure of potential minimal counterexamples to this conjecture and prove that the conjecture holds for the cases (i) n > 5m, (ii) m = 2, (iii) m = 3, and (iv) m greater than or equal to 4, n less than or equal to 3m, where n is the number of jobs. We further conclude that to verify the conject","authors_text":"Levent Tuncel, Michael Huang, Peruvemba Sundaram Ravi","cross_cats":["cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T21:07:58Z","title":"Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3345","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:2abd583dc7543a46eaa8c50d4c94cc89a92242afc82ea16463f67186c01344d2","target":"record","created_at":"2026-05-18T03:04:23Z","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":"d838bd729720a60c34e9414d7a56bd7cb78288bc09384a401a842a926405ab00","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T21:07:58Z","title_canon_sha256":"15decb51ecb2ef6ccffc4d4f494581d99ccafc3c8e37cd5c21cb031dba979540"},"schema_version":"1.0","source":{"id":"1312.3345","kind":"arxiv","version":1}},"canonical_sha256":"676a962f27fba1392d9922e1efbbbb9eca886cc563834913c2fb04dde5bef8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"676a962f27fba1392d9922e1efbbbb9eca886cc563834913c2fb04dde5bef8e7","first_computed_at":"2026-05-18T03:04:23.697213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.697213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6VDzc03yiRgrJE39ICdFGdkdJM97uD6DfrFgA3AE4srmy3qcrEj/BlvCDDgx6VkT5Fd5MJWNE6IvLSQKHn1yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.697681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2abd583dc7543a46eaa8c50d4c94cc89a92242afc82ea16463f67186c01344d2","sha256:54d238587cdaaf1932f58cce0cc8551b5665f8fd51e75a4c2545945a2a17727e"],"state_sha256":"a57b355937739d3039d8513b499f7cdbbfd49a06d7a15d9cba80c809ff997f84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlMG7oYv/SXdwdarRGEV2qjcg27sOYxb8AGefiJjCnR8BR9o6Dfjh24oC+jrdvlzzMz3TAiOunUY0rPKL3QtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:26:53.767216Z","bundle_sha256":"9252334f906ca29d0e94e614e3b0f03fa2ded2158766bd2db3894301846049ad"}}