{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PGJVLMCUOEXDBQVQ7YJJQ2VOZF","short_pith_number":"pith:PGJVLMCU","schema_version":"1.0","canonical_sha256":"799355b054712e30c2b0fe12986aaec963628e0198c7e90c275dba5fc06ef0a6","source":{"kind":"arxiv","id":"1907.04824","version":1},"attestation_state":"computed","paper":{"title":"Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PF","authors_text":"Matteo Dell'Amico","submitted_at":"2019-07-10T16:52:10Z","abstract_excerpt":"It is well known that size-based scheduling policies, which take into account job size (i.e., the time it takes to run them), can perform very desirably in terms of both response time and fairness. Unfortunately, the requirement of knowing a priori the exact job size is a major obstacle which is frequently insurmountable in practice. Often, it is possible to get a coarse estimation of job size, but unfortunately analytical results with inexact job sizes are challenging to obtain, and simulation-based studies show that several size-based algorithm are severely impacted by job estimation errors."},"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":"1907.04824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-07-10T16:52:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9868ccadd1c56562fbd7807e2d700dd10d9c5b78900fc2ce5a16ffbfbddc528c","abstract_canon_sha256":"481c3a36bdc6717308cb6de7119d6494ef3c4265507892ab51f7b881f3b5aecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.587495Z","signature_b64":"kqY1a9b5TXPoAtRoW3TdThZJruZ0scMLdPagASA7wh7LIqe1gcQyd3GnJ6Z4kNBFhW5Nfet4C/Z9NHuQzqp6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"799355b054712e30c2b0fe12986aaec963628e0198c7e90c275dba5fc06ef0a6","last_reissued_at":"2026-05-17T23:40:56.586764Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.586764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PF","authors_text":"Matteo Dell'Amico","submitted_at":"2019-07-10T16:52:10Z","abstract_excerpt":"It is well known that size-based scheduling policies, which take into account job size (i.e., the time it takes to run them), can perform very desirably in terms of both response time and fairness. Unfortunately, the requirement of knowing a priori the exact job size is a major obstacle which is frequently insurmountable in practice. Often, it is possible to get a coarse estimation of job size, but unfortunately analytical results with inexact job sizes are challenging to obtain, and simulation-based studies show that several size-based algorithm are severely impacted by job estimation errors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04824","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":"1907.04824","created_at":"2026-05-17T23:40:56.586874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04824v1","created_at":"2026-05-17T23:40:56.586874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04824","created_at":"2026-05-17T23:40:56.586874+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGJVLMCUOEXD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGJVLMCUOEXDBQVQ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGJVLMCU","created_at":"2026-05-18T12:33:24.271573+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/PGJVLMCUOEXDBQVQ7YJJQ2VOZF","json":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF.json","graph_json":"https://pith.science/api/pith-number/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/graph.json","events_json":"https://pith.science/api/pith-number/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/events.json","paper":"https://pith.science/paper/PGJVLMCU"},"agent_actions":{"view_html":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF","download_json":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF.json","view_paper":"https://pith.science/paper/PGJVLMCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04824&json=true","fetch_graph":"https://pith.science/api/pith-number/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/graph.json","fetch_events":"https://pith.science/api/pith-number/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/action/storage_attestation","attest_author":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/action/author_attestation","sign_citation":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/action/citation_signature","submit_replication":"https://pith.science/pith/PGJVLMCUOEXDBQVQ7YJJQ2VOZF/action/replication_record"}},"created_at":"2026-05-17T23:40:56.586874+00:00","updated_at":"2026-05-17T23:40:56.586874+00:00"}