{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5THSEODTWKEZ3GWZ5ZHXXZ7S45","short_pith_number":"pith:5THSEODT","canonical_record":{"source":{"id":"1712.10114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T04:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"19780f6296b78e11fdf8218314bb34802395492b2a210f02df76f78146360cb0","abstract_canon_sha256":"2a255bbcb907a5de6af6cf2924d320b445fdb8d1707608cc4015507f24f5f879"},"schema_version":"1.0"},"canonical_sha256":"eccf223873b2899d9ad9ee4f7be7f2e77c7a6a0a6f49dbffd285a316e4ea1ab9","source":{"kind":"arxiv","id":"1712.10114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10114","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10114v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10114","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"5THSEODTWKEZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5THSEODTWKEZ3GWZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5THSEODT","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5THSEODTWKEZ3GWZ5ZHXXZ7S45","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T04:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"19780f6296b78e11fdf8218314bb34802395492b2a210f02df76f78146360cb0","abstract_canon_sha256":"2a255bbcb907a5de6af6cf2924d320b445fdb8d1707608cc4015507f24f5f879"},"schema_version":"1.0"},"canonical_sha256":"eccf223873b2899d9ad9ee4f7be7f2e77c7a6a0a6f49dbffd285a316e4ea1ab9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.907173Z","signature_b64":"T/dDhaBxfwZevKgDAy43SyFGgBUVgHR4vXf4xajTu8NSWh6NftuccpAqhAIGZNcAN+WWBUbTrkiU7sdzx48RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eccf223873b2899d9ad9ee4f7be7f2e77c7a6a0a6f49dbffd285a316e4ea1ab9","last_reissued_at":"2026-05-18T00:27:03.906658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.906658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10114","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssaPa4klmf1wfWo+MtVuW5Qfip5FrUGs/ucCvy00aI+FZ8OkrVK6yphdqaSJbOOFW2YSont1iB2qR3ozBtVKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:07:35.335223Z"},"content_sha256":"ff2a1771787e0546f01d0b97814d6926305fcee719cba37c18195418b25dabaa","schema_version":"1.0","event_id":"sha256:ff2a1771787e0546f01d0b97814d6926305fcee719cba37c18195418b25dabaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5THSEODTWKEZ3GWZ5ZHXXZ7S45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient and Fair Multi-Resource Allocation Mechanism for Heterogeneous Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bhuvan Urgaonkar, George Kesidis, Ioannis Lambadaris, Jalal Khamse-Ashari, Yiqiang Zhao","submitted_at":"2017-12-29T04:40:17Z","abstract_excerpt":"Efficient and fair allocation of multiple types of resources is a crucial objective in a cloud/distributed computing cluster. Users may have diverse resource needs. Furthermore, diversity in server properties/ capabilities may mean that only a subset of servers may be usable by a given user. In platforms with such heterogeneity, we identify important limitations in existing multi-resource fair allocation mechanisms, notably Dominant Resource Fairness (DRF) and its follow-up work. To overcome such limitations, we propose a new server-based approach; each server allocates resources by maximizing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10114","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMD3a2QZkdz5p15KbMWd6KKTIndX1JW634AdZ3l/7FJd4f0C8D1C1aoJNHctc9DDI4LOycJYmkPMFIUp1O56Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:07:35.335597Z"},"content_sha256":"4446ea3a7d690a186ec100c8acb8502f285f7477dff2a0f1c01189601530b60b","schema_version":"1.0","event_id":"sha256:4446ea3a7d690a186ec100c8acb8502f285f7477dff2a0f1c01189601530b60b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/bundle.json","state_url":"https://pith.science/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/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-05T13:07:35Z","links":{"resolver":"https://pith.science/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45","bundle":"https://pith.science/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/bundle.json","state":"https://pith.science/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5THSEODTWKEZ3GWZ5ZHXXZ7S45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5THSEODTWKEZ3GWZ5ZHXXZ7S45","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":"2a255bbcb907a5de6af6cf2924d320b445fdb8d1707608cc4015507f24f5f879","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T04:40:17Z","title_canon_sha256":"19780f6296b78e11fdf8218314bb34802395492b2a210f02df76f78146360cb0"},"schema_version":"1.0","source":{"id":"1712.10114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10114","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10114v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10114","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"5THSEODTWKEZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5THSEODTWKEZ3GWZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5THSEODT","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4446ea3a7d690a186ec100c8acb8502f285f7477dff2a0f1c01189601530b60b","target":"graph","created_at":"2026-05-18T00:27:03Z","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":"Efficient and fair allocation of multiple types of resources is a crucial objective in a cloud/distributed computing cluster. Users may have diverse resource needs. Furthermore, diversity in server properties/ capabilities may mean that only a subset of servers may be usable by a given user. In platforms with such heterogeneity, we identify important limitations in existing multi-resource fair allocation mechanisms, notably Dominant Resource Fairness (DRF) and its follow-up work. To overcome such limitations, we propose a new server-based approach; each server allocates resources by maximizing","authors_text":"Bhuvan Urgaonkar, George Kesidis, Ioannis Lambadaris, Jalal Khamse-Ashari, Yiqiang Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T04:40:17Z","title":"An Efficient and Fair Multi-Resource Allocation Mechanism for Heterogeneous Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10114","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:ff2a1771787e0546f01d0b97814d6926305fcee719cba37c18195418b25dabaa","target":"record","created_at":"2026-05-18T00:27:03Z","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":"2a255bbcb907a5de6af6cf2924d320b445fdb8d1707608cc4015507f24f5f879","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-29T04:40:17Z","title_canon_sha256":"19780f6296b78e11fdf8218314bb34802395492b2a210f02df76f78146360cb0"},"schema_version":"1.0","source":{"id":"1712.10114","kind":"arxiv","version":1}},"canonical_sha256":"eccf223873b2899d9ad9ee4f7be7f2e77c7a6a0a6f49dbffd285a316e4ea1ab9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eccf223873b2899d9ad9ee4f7be7f2e77c7a6a0a6f49dbffd285a316e4ea1ab9","first_computed_at":"2026-05-18T00:27:03.906658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.906658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/dDhaBxfwZevKgDAy43SyFGgBUVgHR4vXf4xajTu8NSWh6NftuccpAqhAIGZNcAN+WWBUbTrkiU7sdzx48RAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.907173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff2a1771787e0546f01d0b97814d6926305fcee719cba37c18195418b25dabaa","sha256:4446ea3a7d690a186ec100c8acb8502f285f7477dff2a0f1c01189601530b60b"],"state_sha256":"3c685f78fd85509da00af7b768a9f91dbc5af2c46049ba65c56005570f6dba49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/dyGiUVtyL/UlqPm+AV2nHsAXGuHkSlY794atG8DnhMZI9cQXXL85s/ZJutyrzTFTwC41JwzQNeVB9/qcxfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:07:35.337750Z","bundle_sha256":"11532b78b524b44c2df5d0298bb99eb82377e5556893cebe7ef629d3d4de1bc0"}}