{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C2KBSABR7QJUCHEZVIYDPOVWMN","short_pith_number":"pith:C2KBSABR","schema_version":"1.0","canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","source":{"kind":"arxiv","id":"1304.6188","version":5},"attestation_state":"computed","paper":{"title":"The local-global conjecture for scheduling with non-linear cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, Nguyen Kim Thang, Nikhil Bansal, \\'Oscar C. V\\'asquez","submitted_at":"2013-04-23T07:29:55Z","abstract_excerpt":"We consider the classical scheduling problem on a single machine, on which we need to schedule sequentially $n$ given jobs. Every job $j$ has a processing time $p_j$ and a priority weight $w_j$, and for a given schedule a completion time $C_j$. In this paper we consider the problem of minimizing the objective value $\\sum_j w_j C_j^\\beta$ for some fixed constant $\\beta>0$. This non-linearity is motivated for example by the learning effect of a machine improving its efficiency over time, or by the speed scaling model. For $\\beta=1$, the well-known Smith's rule that orders job in the non-increasi"},"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":"1304.6188","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:29:55Z","cross_cats_sorted":[],"title_canon_sha256":"eca5c6a97865658dcc0487c0594321d2473133dc61f637b65a6293641727f072","abstract_canon_sha256":"38a425bd68ccba05277cac166764135355da17754b0d31ba08875d3a32b32da8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.560086Z","signature_b64":"IEfjZteyQF6iInO4aaocVhAuC473qk8/G+9nVvDp2FwP5tH48IsRASxrKE37Wfn+3fpW/h6O/PTLAoQz/DDtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","last_reissued_at":"2026-05-18T01:24:04.559188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.559188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The local-global conjecture for scheduling with non-linear cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, Nguyen Kim Thang, Nikhil Bansal, \\'Oscar C. V\\'asquez","submitted_at":"2013-04-23T07:29:55Z","abstract_excerpt":"We consider the classical scheduling problem on a single machine, on which we need to schedule sequentially $n$ given jobs. Every job $j$ has a processing time $p_j$ and a priority weight $w_j$, and for a given schedule a completion time $C_j$. In this paper we consider the problem of minimizing the objective value $\\sum_j w_j C_j^\\beta$ for some fixed constant $\\beta>0$. This non-linearity is motivated for example by the learning effect of a machine improving its efficiency over time, or by the speed scaling model. For $\\beta=1$, the well-known Smith's rule that orders job in the non-increasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6188","kind":"arxiv","version":5},"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":"1304.6188","created_at":"2026-05-18T01:24:04.559346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6188v5","created_at":"2026-05-18T01:24:04.559346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6188","created_at":"2026-05-18T01:24:04.559346+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2KBSABR7QJU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2KBSABR7QJUCHEZ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2KBSABR","created_at":"2026-05-18T12:27:40.988391+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/C2KBSABR7QJUCHEZVIYDPOVWMN","json":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN.json","graph_json":"https://pith.science/api/pith-number/C2KBSABR7QJUCHEZVIYDPOVWMN/graph.json","events_json":"https://pith.science/api/pith-number/C2KBSABR7QJUCHEZVIYDPOVWMN/events.json","paper":"https://pith.science/paper/C2KBSABR"},"agent_actions":{"view_html":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN","download_json":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN.json","view_paper":"https://pith.science/paper/C2KBSABR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6188&json=true","fetch_graph":"https://pith.science/api/pith-number/C2KBSABR7QJUCHEZVIYDPOVWMN/graph.json","fetch_events":"https://pith.science/api/pith-number/C2KBSABR7QJUCHEZVIYDPOVWMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/action/storage_attestation","attest_author":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/action/author_attestation","sign_citation":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/action/citation_signature","submit_replication":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/action/replication_record"}},"created_at":"2026-05-18T01:24:04.559346+00:00","updated_at":"2026-05-18T01:24:04.559346+00:00"}