{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IBCJH2KW6UYMLRDJY7KIG2BOEY","short_pith_number":"pith:IBCJH2KW","schema_version":"1.0","canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","source":{"kind":"arxiv","id":"1505.01005","version":2},"attestation_state":"computed","paper":{"title":"Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture","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, Peruvemba Sundaram Ravi","submitted_at":"2015-05-05T13:40:02Z","abstract_excerpt":"Coffman and Sethi proposed a heuristic algorithm, called LD, for multi-processor scheduling, to minimize makespan over flowtime-optimal schedules. LD algorithm is a natural extension of a very well-known list scheduling algorithm, Longest Processing Time (LPT) list scheduling, to our bicriteria scheduling problem. Moreover, in 1976, Coffman and Sethi conjectured that LD algorithm has precisely the following worst-case performance bound: $\\frac{5}{4} - \\frac{3}{4(4m-1)}$, where m is the number of machines. In this paper, utilizing some recent work by the authors and Huang, from 2013, which expo"},"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":"1505.01005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-05T13:40:02Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"344c458513ef004501f4fee2ef0c8dec69f14b18484d2adfe8213e6dce93bfa3","abstract_canon_sha256":"045a6f71b1f27ba86ce71cc662ca7b552d095a7e8559f5ee302ec8ca4ccf7618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:48.703628Z","signature_b64":"lN6e4mj2RZ4z2G3MRYygZs4Ie5cUSKEQtcXTSBO9lrZ3po7fe7wbc69ylxvIJekYLUBu1nwrMimdeeibrkTWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","last_reissued_at":"2026-05-18T02:16:48.702918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:48.702918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture","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, Peruvemba Sundaram Ravi","submitted_at":"2015-05-05T13:40:02Z","abstract_excerpt":"Coffman and Sethi proposed a heuristic algorithm, called LD, for multi-processor scheduling, to minimize makespan over flowtime-optimal schedules. LD algorithm is a natural extension of a very well-known list scheduling algorithm, Longest Processing Time (LPT) list scheduling, to our bicriteria scheduling problem. Moreover, in 1976, Coffman and Sethi conjectured that LD algorithm has precisely the following worst-case performance bound: $\\frac{5}{4} - \\frac{3}{4(4m-1)}$, where m is the number of machines. In this paper, utilizing some recent work by the authors and Huang, from 2013, which expo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01005","kind":"arxiv","version":2},"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":"1505.01005","created_at":"2026-05-18T02:16:48.703030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01005v2","created_at":"2026-05-18T02:16:48.703030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01005","created_at":"2026-05-18T02:16:48.703030+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBCJH2KW6UYM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBCJH2KW6UYMLRDJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBCJH2KW","created_at":"2026-05-18T12:29:25.134429+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/IBCJH2KW6UYMLRDJY7KIG2BOEY","json":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY.json","graph_json":"https://pith.science/api/pith-number/IBCJH2KW6UYMLRDJY7KIG2BOEY/graph.json","events_json":"https://pith.science/api/pith-number/IBCJH2KW6UYMLRDJY7KIG2BOEY/events.json","paper":"https://pith.science/paper/IBCJH2KW"},"agent_actions":{"view_html":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY","download_json":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY.json","view_paper":"https://pith.science/paper/IBCJH2KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01005&json=true","fetch_graph":"https://pith.science/api/pith-number/IBCJH2KW6UYMLRDJY7KIG2BOEY/graph.json","fetch_events":"https://pith.science/api/pith-number/IBCJH2KW6UYMLRDJY7KIG2BOEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/action/storage_attestation","attest_author":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/action/author_attestation","sign_citation":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/action/citation_signature","submit_replication":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/action/replication_record"}},"created_at":"2026-05-18T02:16:48.703030+00:00","updated_at":"2026-05-18T02:16:48.703030+00:00"}