{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IBCJH2KW6UYMLRDJY7KIG2BOEY","short_pith_number":"pith:IBCJH2KW","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"},"canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","source":{"kind":"arxiv","id":"1505.01005","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01005","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01005v2","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01005","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"pith_short_12","alias_value":"IBCJH2KW6UYM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IBCJH2KW6UYMLRDJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IBCJH2KW","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IBCJH2KW6UYMLRDJY7KIG2BOEY","target":"record","payload":{"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"},"canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","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"},"source_kind":"arxiv","source_id":"1505.01005","source_version":2,"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-18T02:16:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NE5QXBrcXq3CnYy1bzmFcc/PbcyAl1w3/X7sBiE3Z/a18fRRvEzki8mnLF1nleCKwvkBNW2v8m7rMu25/EpPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:30.546297Z"},"content_sha256":"886b83b968c22a578cc496db77437826987df747fea9fd538472de2545e4740c","schema_version":"1.0","event_id":"sha256:886b83b968c22a578cc496db77437826987df747fea9fd538472de2545e4740c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IBCJH2KW6UYMLRDJY7KIG2BOEY","target":"graph","payload":{"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"},"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-18T02:16:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzLp+tcaAg3V8cEFFyvPoKk0BI8AJHEqD2/OUqzzIiShgXvGpKxvYcPhNRonJaseHQ2B+Ar4hE6Q8bmCCaKDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:30.546660Z"},"content_sha256":"c2131c40641d1ccf0e9f0354ca727841ce0c951df5c43f2e29d4caef59d9eebf","schema_version":"1.0","event_id":"sha256:c2131c40641d1ccf0e9f0354ca727841ce0c951df5c43f2e29d4caef59d9eebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/bundle.json","state_url":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/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-22T21:54:30Z","links":{"resolver":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY","bundle":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/bundle.json","state":"https://pith.science/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBCJH2KW6UYMLRDJY7KIG2BOEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IBCJH2KW6UYMLRDJY7KIG2BOEY","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":"045a6f71b1f27ba86ce71cc662ca7b552d095a7e8559f5ee302ec8ca4ccf7618","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-05T13:40:02Z","title_canon_sha256":"344c458513ef004501f4fee2ef0c8dec69f14b18484d2adfe8213e6dce93bfa3"},"schema_version":"1.0","source":{"id":"1505.01005","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01005","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01005v2","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01005","created_at":"2026-05-18T02:16:48Z"},{"alias_kind":"pith_short_12","alias_value":"IBCJH2KW6UYM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IBCJH2KW6UYMLRDJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IBCJH2KW","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:c2131c40641d1ccf0e9f0354ca727841ce0c951df5c43f2e29d4caef59d9eebf","target":"graph","created_at":"2026-05-18T02:16:48Z","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":"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","authors_text":"Levent Tuncel, 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":"2015-05-05T13:40:02Z","title":"Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01005","kind":"arxiv","version":2},"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:886b83b968c22a578cc496db77437826987df747fea9fd538472de2545e4740c","target":"record","created_at":"2026-05-18T02:16:48Z","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":"045a6f71b1f27ba86ce71cc662ca7b552d095a7e8559f5ee302ec8ca4ccf7618","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-05T13:40:02Z","title_canon_sha256":"344c458513ef004501f4fee2ef0c8dec69f14b18484d2adfe8213e6dce93bfa3"},"schema_version":"1.0","source":{"id":"1505.01005","kind":"arxiv","version":2}},"canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"404493e956f530c5c469c7d483682e260ba2d67658b251493143994dec8db973","first_computed_at":"2026-05-18T02:16:48.702918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:48.702918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lN6e4mj2RZ4z2G3MRYygZs4Ie5cUSKEQtcXTSBO9lrZ3po7fe7wbc69ylxvIJekYLUBu1nwrMimdeeibrkTWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:48.703628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01005","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:886b83b968c22a578cc496db77437826987df747fea9fd538472de2545e4740c","sha256:c2131c40641d1ccf0e9f0354ca727841ce0c951df5c43f2e29d4caef59d9eebf"],"state_sha256":"536e6f2e450b5696c9e3d522d40531e8f5724e9186d94d4d1c082988b64fdd62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X89I0nEYMUlfps5lGyPK7USrBTu71t9097GpFTR6Jjo4VpLMBTKa0mpzcy4FfXQvhQohPv384mbj2UIfWV+mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:54:30.548629Z","bundle_sha256":"d2219c1474bcee1b6d09f4ff878286a4bff1096aaadcd09e59d1b4d5e664b81c"}}