{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3TXA5A3VXX3TF4NXP2WKJRZCYY","short_pith_number":"pith:3TXA5A3V","canonical_record":{"source":{"id":"1404.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"40fd1fd624a9fbdcf3ccac85237cd7b9d102bfa7ebac13f4b47913baf678e792","abstract_canon_sha256":"a0d80266e2b6ed717ea7f5200b9be683ee05ddb16a12ce6eacf11a68148fd6d5"},"schema_version":"1.0"},"canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","source":{"kind":"arxiv","id":"1404.1943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1943","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1943v1","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1943","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TXA5A3VXX3T","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TXA5A3VXX3TF4NX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TXA5A3V","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3TXA5A3VXX3TF4NXP2WKJRZCYY","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"40fd1fd624a9fbdcf3ccac85237cd7b9d102bfa7ebac13f4b47913baf678e792","abstract_canon_sha256":"a0d80266e2b6ed717ea7f5200b9be683ee05ddb16a12ce6eacf11a68148fd6d5"},"schema_version":"1.0"},"canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:38.975891Z","signature_b64":"t1bI6dpQfH5BexxrAHZJxyf10e/vn33b4zY95rdN2P1Iz7dvr4CplXMQslmwtfpwvV47rTyHhnZr70oD/UxMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","last_reissued_at":"2026-05-18T02:54:38.975369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:38.975369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1943","source_version":1,"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-18T02:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCZASEK5eJFAHY07rJJ4+RlKlqV1S7/GyXge50KGF5WpYgMB1SYZuHTnr+LMzEc09ksbmK+7YeAxNCI4iAUCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:56:44.491181Z"},"content_sha256":"902c3caf36cbb8a856ca2d0f7ead854504bc0fff424e96c53c93dde301599895","schema_version":"1.0","event_id":"sha256:902c3caf36cbb8a856ca2d0f7ead854504bc0fff424e96c53c93dde301599895"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3TXA5A3VXX3TF4NXP2WKJRZCYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs, Sungjin Im","submitted_at":"2014-04-07T20:24:08Z","abstract_excerpt":"We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \\emph{non-clairvoyant} setting. In this problem, a set of jobs $J$ arrive over time to be scheduled on a set of $M$ machines. Each job $j$ has processing length $p_j$, weight $w_j$, and is processed at a rate of $\\ell_{ij}$ when scheduled on machine $i$. The online scheduler knows the values of $w_j$ and $\\ell_{ij}$ upon arrival of the job, but is not aware of the quantity $p_j$. We present the {\\em first} online algorithm that is {\\em scalable} ($(1+\\eps)$-speed $O(\\frac{1}{\\epsil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1943","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"},"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-18T02:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOr6YxbkG+qNJrFrnXxKUFntsuJ6I0/Zha9rLspAy2qI4slE2Ke7ffcrLevFdiJUXLRN4fvh2b/dkWEyF2TPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:56:44.491528Z"},"content_sha256":"26a683447eb117de0cf87e25b37609e46c2863293c0b61033afc3c43ccb3260e","schema_version":"1.0","event_id":"sha256:26a683447eb117de0cf87e25b37609e46c2863293c0b61033afc3c43ccb3260e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/bundle.json","state_url":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/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-06-27T12:56:44Z","links":{"resolver":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY","bundle":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/bundle.json","state":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3TXA5A3VXX3TF4NXP2WKJRZCYY","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":"a0d80266e2b6ed717ea7f5200b9be683ee05ddb16a12ce6eacf11a68148fd6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","title_canon_sha256":"40fd1fd624a9fbdcf3ccac85237cd7b9d102bfa7ebac13f4b47913baf678e792"},"schema_version":"1.0","source":{"id":"1404.1943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1943","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1943v1","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1943","created_at":"2026-05-18T02:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TXA5A3VXX3T","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TXA5A3VXX3TF4NX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TXA5A3V","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:26a683447eb117de0cf87e25b37609e46c2863293c0b61033afc3c43ccb3260e","target":"graph","created_at":"2026-05-18T02:54:38Z","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 problem of minimizing the total weighted flow-time for unrelated machines in the online \\emph{non-clairvoyant} setting. In this problem, a set of jobs $J$ arrive over time to be scheduled on a set of $M$ machines. Each job $j$ has processing length $p_j$, weight $w_j$, and is processed at a rate of $\\ell_{ij}$ when scheduled on machine $i$. The online scheduler knows the values of $w_j$ and $\\ell_{ij}$ upon arrival of the job, but is not aware of the quantity $p_j$. We present the {\\em first} online algorithm that is {\\em scalable} ($(1+\\eps)$-speed $O(\\frac{1}{\\epsil","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","title":"SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1943","kind":"arxiv","version":1},"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:902c3caf36cbb8a856ca2d0f7ead854504bc0fff424e96c53c93dde301599895","target":"record","created_at":"2026-05-18T02:54:38Z","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":"a0d80266e2b6ed717ea7f5200b9be683ee05ddb16a12ce6eacf11a68148fd6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","title_canon_sha256":"40fd1fd624a9fbdcf3ccac85237cd7b9d102bfa7ebac13f4b47913baf678e792"},"schema_version":"1.0","source":{"id":"1404.1943","kind":"arxiv","version":1}},"canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","first_computed_at":"2026-05-18T02:54:38.975369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:38.975369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t1bI6dpQfH5BexxrAHZJxyf10e/vn33b4zY95rdN2P1Iz7dvr4CplXMQslmwtfpwvV47rTyHhnZr70oD/UxMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:38.975891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:902c3caf36cbb8a856ca2d0f7ead854504bc0fff424e96c53c93dde301599895","sha256:26a683447eb117de0cf87e25b37609e46c2863293c0b61033afc3c43ccb3260e"],"state_sha256":"e209367a25e679064bef6be6b2f76494a1c70dd5b12b7b9c719c30e7dec16f0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3uF93pIIpseFCe/igo6q0mEk2K0d3SGrmvE0JRFkiyt9KXyRf/z4EbD9281KHoLEhY6uXpKE5uKc7vCBomG7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:56:44.493537Z","bundle_sha256":"fadc1b39293a465729ebf72276ce8037619ee12d6a71e68252c08a9705f64915"}}