{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MG6DXZ5OJZQT222BDZCTNXT4GW","short_pith_number":"pith:MG6DXZ5O","canonical_record":{"source":{"id":"1509.07455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"bf899f52b323beafea571438215725e6af047c8384310881d4572274edc3011d","abstract_canon_sha256":"929f0562cdc16c513bfb2fc21f05d64daf0e7a0f09e0771a34ae7dd8763f0a44"},"schema_version":"1.0"},"canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","source":{"kind":"arxiv","id":"1509.07455","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07455","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07455v3","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07455","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"MG6DXZ5OJZQT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MG6DXZ5OJZQT222B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MG6DXZ5O","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MG6DXZ5OJZQT222BDZCTNXT4GW","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"bf899f52b323beafea571438215725e6af047c8384310881d4572274edc3011d","abstract_canon_sha256":"929f0562cdc16c513bfb2fc21f05d64daf0e7a0f09e0771a34ae7dd8763f0a44"},"schema_version":"1.0"},"canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:43.261162Z","signature_b64":"pA6G94SiQnrwUnFdRSJPpDO50TGkWYuUFscchph+D610VaInZVA8zr3yU34lj6xvZkpRga3pJCjSeYYCKvEEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","last_reissued_at":"2026-05-18T00:47:43.260591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:43.260591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07455","source_version":3,"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-18T00:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbhQkX0CLvLflP3PFdGk49EkYQ2/fYwmZokqPPD9ngPenOCLHoYy8pClTUuhU5X9Xpzd6W0xRMESom8K3lCFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:21:14.772361Z"},"content_sha256":"25d6d58985d862f03d9db20e57d05078baf21884807b50667a368b51bbe0117d","schema_version":"1.0","event_id":"sha256:25d6d58985d862f03d9db20e57d05078baf21884807b50667a368b51bbe0117d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MG6DXZ5OJZQT222BDZCTNXT4GW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The VCG Mechanism for Bayesian Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Maria Kyropoulou, Yiannis Giannakopoulos","submitted_at":"2015-09-24T18:01:56Z","abstract_excerpt":"We study the problem of scheduling $m$ tasks to $n$ selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines. We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of $O\\left(\\frac{\\ln n}{\\ln \\ln n}\\right)$. This improves significantly on the previously best known bound of $O\\left(\\frac{m}{n}\\right)$ for prior-independent mechanisms, given by Chawla et al. [STOC'13] under the additional assumption of Monotone Hazard Rate (MHR) distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07455","kind":"arxiv","version":3},"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-18T00:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9qtot6iUSptSxL0u4L2MKwWXh4S4jWmFnujIOKP3PCuz7eq+4NdhfeDj6eVvFefy2c+bOQbHmDWSH4isNuhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:21:14.772709Z"},"content_sha256":"904d70b68a56136fd45ddbb5a6b379aea92eaf66f3849b5e507527e8665767db","schema_version":"1.0","event_id":"sha256:904d70b68a56136fd45ddbb5a6b379aea92eaf66f3849b5e507527e8665767db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/bundle.json","state_url":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/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-03T17:21:14Z","links":{"resolver":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW","bundle":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/bundle.json","state":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MG6DXZ5OJZQT222BDZCTNXT4GW","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":"929f0562cdc16c513bfb2fc21f05d64daf0e7a0f09e0771a34ae7dd8763f0a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","title_canon_sha256":"bf899f52b323beafea571438215725e6af047c8384310881d4572274edc3011d"},"schema_version":"1.0","source":{"id":"1509.07455","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07455","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07455v3","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07455","created_at":"2026-05-18T00:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"MG6DXZ5OJZQT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MG6DXZ5OJZQT222B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MG6DXZ5O","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:904d70b68a56136fd45ddbb5a6b379aea92eaf66f3849b5e507527e8665767db","target":"graph","created_at":"2026-05-18T00:47:43Z","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 study the problem of scheduling $m$ tasks to $n$ selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines. We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of $O\\left(\\frac{\\ln n}{\\ln \\ln n}\\right)$. This improves significantly on the previously best known bound of $O\\left(\\frac{m}{n}\\right)$ for prior-independent mechanisms, given by Chawla et al. [STOC'13] under the additional assumption of Monotone Hazard Rate (MHR) distribut","authors_text":"Maria Kyropoulou, Yiannis Giannakopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","title":"The VCG Mechanism for Bayesian Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07455","kind":"arxiv","version":3},"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:25d6d58985d862f03d9db20e57d05078baf21884807b50667a368b51bbe0117d","target":"record","created_at":"2026-05-18T00:47:43Z","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":"929f0562cdc16c513bfb2fc21f05d64daf0e7a0f09e0771a34ae7dd8763f0a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","title_canon_sha256":"bf899f52b323beafea571438215725e6af047c8384310881d4572274edc3011d"},"schema_version":"1.0","source":{"id":"1509.07455","kind":"arxiv","version":3}},"canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","first_computed_at":"2026-05-18T00:47:43.260591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:43.260591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pA6G94SiQnrwUnFdRSJPpDO50TGkWYuUFscchph+D610VaInZVA8zr3yU34lj6xvZkpRga3pJCjSeYYCKvEEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:43.261162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07455","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25d6d58985d862f03d9db20e57d05078baf21884807b50667a368b51bbe0117d","sha256:904d70b68a56136fd45ddbb5a6b379aea92eaf66f3849b5e507527e8665767db"],"state_sha256":"2fda5e7de9ba4dafdc4853a60254e824d08afe6fe0c616858bc572c80f7b0dfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ld5r7SaqhM61Xyy/Ae1gGwO/XwgXtgQwq5Kce3ZoP8+gsy4p1pcQzrHzOY7dvnRkfdf2JeRoGVKXIeK+sk5nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:21:14.774673Z","bundle_sha256":"ab14b1d30919aafaa10be3cfa361a97bcc93789520bd4f5aa5191f6c9b08a456"}}