{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DPFJUFOJUX2H2NSVJESN5CTUSQ","short_pith_number":"pith:DPFJUFOJ","schema_version":"1.0","canonical_sha256":"1bca9a15c9a5f47d36554924de8a74940ac9e2f59b65c9ba6d87fe240ca28a94","source":{"kind":"arxiv","id":"1302.3946","version":1},"attestation_state":"computed","paper":{"title":"Approximating the optimal competitive ratio for an ancient online scheduling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deshi Ye, Guochuan Zhang, Lin Chen","submitted_at":"2013-02-16T08:32:11Z","abstract_excerpt":"We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorithm whose competitive ratio is at most (1+\\epsilon) times that of an optimal online algorithm could be achieved in polynomial time, where m, the number of machines, is a part of the input. It substantially improves upon the previous results by almost closing the gap between the currently best known lower bound of 1.88 (Rudin, Ph.D thesis, 2001) and the best known upper bound of 1.92 (Fleischer, Wahl, Journal of Schedu"},"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":"1302.3946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-16T08:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"7b3f55f81b3fde922a1c28fc27886147c534bcbfd0966581aecc244288242cd9","abstract_canon_sha256":"d7cd297aa0d447c0b3f9a72e61a8f3a1712dee188e413f4ea4fc9e422ce2d58b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:24.827544Z","signature_b64":"uy/Xi1iSXVvfijhxQ7nhoZ/UsIsvXAXufDZ75braYDG/UbbSnOq10/RT5SF6WQDmE/sSGvddrupCuWxCXKjXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bca9a15c9a5f47d36554924de8a74940ac9e2f59b65c9ba6d87fe240ca28a94","last_reissued_at":"2026-05-18T03:33:24.826883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:24.826883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the optimal competitive ratio for an ancient online scheduling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deshi Ye, Guochuan Zhang, Lin Chen","submitted_at":"2013-02-16T08:32:11Z","abstract_excerpt":"We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorithm whose competitive ratio is at most (1+\\epsilon) times that of an optimal online algorithm could be achieved in polynomial time, where m, the number of machines, is a part of the input. It substantially improves upon the previous results by almost closing the gap between the currently best known lower bound of 1.88 (Rudin, Ph.D thesis, 2001) and the best known upper bound of 1.92 (Fleischer, Wahl, Journal of Schedu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3946","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":"1302.3946","created_at":"2026-05-18T03:33:24.826983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3946v1","created_at":"2026-05-18T03:33:24.826983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3946","created_at":"2026-05-18T03:33:24.826983+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPFJUFOJUX2H","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPFJUFOJUX2H2NSV","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPFJUFOJ","created_at":"2026-05-18T12:27:43.054852+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/DPFJUFOJUX2H2NSVJESN5CTUSQ","json":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ.json","graph_json":"https://pith.science/api/pith-number/DPFJUFOJUX2H2NSVJESN5CTUSQ/graph.json","events_json":"https://pith.science/api/pith-number/DPFJUFOJUX2H2NSVJESN5CTUSQ/events.json","paper":"https://pith.science/paper/DPFJUFOJ"},"agent_actions":{"view_html":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ","download_json":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ.json","view_paper":"https://pith.science/paper/DPFJUFOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3946&json=true","fetch_graph":"https://pith.science/api/pith-number/DPFJUFOJUX2H2NSVJESN5CTUSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DPFJUFOJUX2H2NSVJESN5CTUSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ/action/storage_attestation","attest_author":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ/action/author_attestation","sign_citation":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ/action/citation_signature","submit_replication":"https://pith.science/pith/DPFJUFOJUX2H2NSVJESN5CTUSQ/action/replication_record"}},"created_at":"2026-05-18T03:33:24.826983+00:00","updated_at":"2026-05-18T03:33:24.826983+00:00"}