{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C2KBSABR7QJUCHEZVIYDPOVWMN","short_pith_number":"pith:C2KBSABR","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"},"canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","source":{"kind":"arxiv","id":"1304.6188","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6188","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6188v5","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6188","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"C2KBSABR7QJU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C2KBSABR7QJUCHEZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C2KBSABR","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C2KBSABR7QJUCHEZVIYDPOVWMN","target":"record","payload":{"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"},"canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","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"},"source_kind":"arxiv","source_id":"1304.6188","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccKqf68DbFGG/XT9VE27ob95AjEhhPsOzne1DkiIX/KpcqccsRf+LrCOov8qeaxAfOspV7xwvOZo09Cd3HxoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:07:51.213846Z"},"content_sha256":"77214e66b33486b14e03678b2bbc6ffdee58f0cdf524017a9de6476f40da339d","schema_version":"1.0","event_id":"sha256:77214e66b33486b14e03678b2bbc6ffdee58f0cdf524017a9de6476f40da339d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C2KBSABR7QJUCHEZVIYDPOVWMN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vssc7w0cEcvAEeS30Vpoqx0p+JnhsB12G8B25xa0NpDEXWR83V2i5wWZISKdsZmwQ5MT9n8OLxrCIMdgDwVsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:07:51.214587Z"},"content_sha256":"8f4c308c5537479aa3d5367391b798791d92edf378892222e8c6ecdf76dba223","schema_version":"1.0","event_id":"sha256:8f4c308c5537479aa3d5367391b798791d92edf378892222e8c6ecdf76dba223"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/bundle.json","state_url":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T19:07:51Z","links":{"resolver":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN","bundle":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/bundle.json","state":"https://pith.science/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2KBSABR7QJUCHEZVIYDPOVWMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C2KBSABR7QJUCHEZVIYDPOVWMN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"38a425bd68ccba05277cac166764135355da17754b0d31ba08875d3a32b32da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:29:55Z","title_canon_sha256":"eca5c6a97865658dcc0487c0594321d2473133dc61f637b65a6293641727f072"},"schema_version":"1.0","source":{"id":"1304.6188","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6188","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6188v5","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6188","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"C2KBSABR7QJU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C2KBSABR7QJUCHEZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C2KBSABR","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:8f4c308c5537479aa3d5367391b798791d92edf378892222e8c6ecdf76dba223","target":"graph","created_at":"2026-05-18T01:24:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christoph D\\\"urr, Nguyen Kim Thang, Nikhil Bansal, \\'Oscar C. V\\'asquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:29:55Z","title":"The local-global conjecture for scheduling with non-linear cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6188","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:77214e66b33486b14e03678b2bbc6ffdee58f0cdf524017a9de6476f40da339d","target":"record","created_at":"2026-05-18T01:24:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"38a425bd68ccba05277cac166764135355da17754b0d31ba08875d3a32b32da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T07:29:55Z","title_canon_sha256":"eca5c6a97865658dcc0487c0594321d2473133dc61f637b65a6293641727f072"},"schema_version":"1.0","source":{"id":"1304.6188","kind":"arxiv","version":5}},"canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1694190031fc13411c99aa3037bab663793d57be43968342ff6e727e31528c8e","first_computed_at":"2026-05-18T01:24:04.559188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:04.559188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IEfjZteyQF6iInO4aaocVhAuC473qk8/G+9nVvDp2FwP5tH48IsRASxrKE37Wfn+3fpW/h6O/PTLAoQz/DDtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:04.560086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6188","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77214e66b33486b14e03678b2bbc6ffdee58f0cdf524017a9de6476f40da339d","sha256:8f4c308c5537479aa3d5367391b798791d92edf378892222e8c6ecdf76dba223"],"state_sha256":"8d42487042f2a69170e810cf803024fbcc9c06b1dd54f7440a96c6b730be43b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlVvUdZ4QXK0rJFnVDUgq9TCLUw5/LuAgPxPNRUtx/WdOuk42jfJnBATZJR5kNsMPE+U7Y3QzX6nPxbU2GedAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:07:51.220513Z","bundle_sha256":"aee5cca2e645d2ae15e201b73eec06caa192c4c04ef89aa9771bef9327d661ea"}}