{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BUAKJJS2EBQ5KYW53CLQK6PK4P","short_pith_number":"pith:BUAKJJS2","schema_version":"1.0","canonical_sha256":"0d00a4a65a2061d562ddd8970579eae3c18826d3b323ce2e56cae821e0b7e022","source":{"kind":"arxiv","id":"1404.6502","version":2},"attestation_state":"computed","paper":{"title":"Total stretch minimization on single and identical parallel machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhinav Srivastav, Denis Trystram","submitted_at":"2014-04-25T18:58:03Z","abstract_excerpt":"We consider the classical problem of scheduling $n$ jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective is to schedule these jobs non-preemptively so as to minimize sum stretch. So far, there have been very few results for sum stretch minimization especially for the non-preemptive case. For the preemptive version, the Shortest remaining processing time (SRPT) algorithm is known to give $2$-competitive for sum stretch on "},"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":"1404.6502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-25T18:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"642a4d19110d21833557a57d034100d3ade0bef72a189765ab30efa0472d0cf7","abstract_canon_sha256":"10b1db6ff4b5013dfa3cc8a4318a28b6e6e1758ef386b74d5384d2f03ea32931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:56.237677Z","signature_b64":"Blx5yVFbOIFctVqK7y9EzIBI/AinH/69dwl8zVVZE6q3uWQO+PVSL1aSpTFBg8AyRGa4NvnnGxY9rDyP/T4VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d00a4a65a2061d562ddd8970579eae3c18826d3b323ce2e56cae821e0b7e022","last_reissued_at":"2026-05-18T02:48:56.236955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:56.236955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total stretch minimization on single and identical parallel machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhinav Srivastav, Denis Trystram","submitted_at":"2014-04-25T18:58:03Z","abstract_excerpt":"We consider the classical problem of scheduling $n$ jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective is to schedule these jobs non-preemptively so as to minimize sum stretch. So far, there have been very few results for sum stretch minimization especially for the non-preemptive case. For the preemptive version, the Shortest remaining processing time (SRPT) algorithm is known to give $2$-competitive for sum stretch on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6502","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":"1404.6502","created_at":"2026-05-18T02:48:56.237079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6502v2","created_at":"2026-05-18T02:48:56.237079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6502","created_at":"2026-05-18T02:48:56.237079+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUAKJJS2EBQ5","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUAKJJS2EBQ5KYW5","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUAKJJS2","created_at":"2026-05-18T12:28:22.404517+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/BUAKJJS2EBQ5KYW53CLQK6PK4P","json":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P.json","graph_json":"https://pith.science/api/pith-number/BUAKJJS2EBQ5KYW53CLQK6PK4P/graph.json","events_json":"https://pith.science/api/pith-number/BUAKJJS2EBQ5KYW53CLQK6PK4P/events.json","paper":"https://pith.science/paper/BUAKJJS2"},"agent_actions":{"view_html":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P","download_json":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P.json","view_paper":"https://pith.science/paper/BUAKJJS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6502&json=true","fetch_graph":"https://pith.science/api/pith-number/BUAKJJS2EBQ5KYW53CLQK6PK4P/graph.json","fetch_events":"https://pith.science/api/pith-number/BUAKJJS2EBQ5KYW53CLQK6PK4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P/action/storage_attestation","attest_author":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P/action/author_attestation","sign_citation":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P/action/citation_signature","submit_replication":"https://pith.science/pith/BUAKJJS2EBQ5KYW53CLQK6PK4P/action/replication_record"}},"created_at":"2026-05-18T02:48:56.237079+00:00","updated_at":"2026-05-18T02:48:56.237079+00:00"}