{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JLWMY2GRVWEUMYAXOZLM5J5HIH","short_pith_number":"pith:JLWMY2GR","schema_version":"1.0","canonical_sha256":"4aeccc68d1ad894660177656cea7a741c52c621ff164829c5ebd4c776e394206","source":{"kind":"arxiv","id":"2504.10622","version":1},"attestation_state":"computed","paper":{"title":"Improving Upon the generalized c-mu rule: a Whittle approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Keerthana Gurushankar, Mor Harchol-Balter, Zhouzi Li","submitted_at":"2025-04-14T18:22:15Z","abstract_excerpt":"Scheduling a stream of jobs whose holding cost changes over time is a classic and practical problem. Specifically, each job is associated with a holding cost (penalty), where a job's instantaneous holding cost is some increasing function of its class and current age (the time it has spent in the system since its arrival). The goal is to schedule the jobs to minimize the time-average total holding cost across all jobs.\n  The seminal paper on this problem, by Van Mieghem in 1995, introduced the generalized c-mu rule for scheduling jobs. Since then, this problem has attracted significant interest"},"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":"2504.10622","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2025-04-14T18:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"bd35113b2fa4e017d68526c4937d1bc9b5593463effc49a39c56e74a96cb6e73","abstract_canon_sha256":"53486cff494a8aa6f29237235c309ef5076e0d3af76c37a960ce90446cb6b97d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:20.652598Z","signature_b64":"IJMnnzHIdFfhweFyKJsEK1EmnZkaVH1Aagt/gl6dU20pQ74T/MQRsqCw2uZog+oLiiAOKQrfmK6phloBRm1NBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aeccc68d1ad894660177656cea7a741c52c621ff164829c5ebd4c776e394206","last_reissued_at":"2026-07-05T10:49:20.651401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:20.651401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Upon the generalized c-mu rule: a Whittle approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Keerthana Gurushankar, Mor Harchol-Balter, Zhouzi Li","submitted_at":"2025-04-14T18:22:15Z","abstract_excerpt":"Scheduling a stream of jobs whose holding cost changes over time is a classic and practical problem. Specifically, each job is associated with a holding cost (penalty), where a job's instantaneous holding cost is some increasing function of its class and current age (the time it has spent in the system since its arrival). The goal is to schedule the jobs to minimize the time-average total holding cost across all jobs.\n  The seminal paper on this problem, by Van Mieghem in 1995, introduced the generalized c-mu rule for scheduling jobs. Since then, this problem has attracted significant interest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.10622/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.10622","created_at":"2026-07-05T10:49:20.652078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10622v1","created_at":"2026-07-05T10:49:20.652078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10622","created_at":"2026-07-05T10:49:20.652078+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLWMY2GRVWEU","created_at":"2026-07-05T10:49:20.652078+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLWMY2GRVWEUMYAX","created_at":"2026-07-05T10:49:20.652078+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLWMY2GR","created_at":"2026-07-05T10:49:20.652078+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21331","citing_title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH","json":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH.json","graph_json":"https://pith.science/api/pith-number/JLWMY2GRVWEUMYAXOZLM5J5HIH/graph.json","events_json":"https://pith.science/api/pith-number/JLWMY2GRVWEUMYAXOZLM5J5HIH/events.json","paper":"https://pith.science/paper/JLWMY2GR"},"agent_actions":{"view_html":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH","download_json":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH.json","view_paper":"https://pith.science/paper/JLWMY2GR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10622&json=true","fetch_graph":"https://pith.science/api/pith-number/JLWMY2GRVWEUMYAXOZLM5J5HIH/graph.json","fetch_events":"https://pith.science/api/pith-number/JLWMY2GRVWEUMYAXOZLM5J5HIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH/action/storage_attestation","attest_author":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH/action/author_attestation","sign_citation":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH/action/citation_signature","submit_replication":"https://pith.science/pith/JLWMY2GRVWEUMYAXOZLM5J5HIH/action/replication_record"}},"created_at":"2026-07-05T10:49:20.652078+00:00","updated_at":"2026-07-05T10:49:20.652078+00:00"}