{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GD45ZHKHVOBA7UK6KTFM674BDD","short_pith_number":"pith:GD45ZHKH","canonical_record":{"source":{"id":"1410.1255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4ed241b952dc65e6a129a266ecd6af7011397d978ddc22ecc0bbcdda4844f630","abstract_canon_sha256":"d3502bebee7f812e2b1ba766d2569917e1fc3f026ca15eee42871161cfeb4bb5"},"schema_version":"1.0"},"canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","source":{"kind":"arxiv","id":"1410.1255","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1255","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1255v3","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1255","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"GD45ZHKHVOBA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GD45ZHKHVOBA7UK6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GD45ZHKH","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GD45ZHKHVOBA7UK6KTFM674BDD","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4ed241b952dc65e6a129a266ecd6af7011397d978ddc22ecc0bbcdda4844f630","abstract_canon_sha256":"d3502bebee7f812e2b1ba766d2569917e1fc3f026ca15eee42871161cfeb4bb5"},"schema_version":"1.0"},"canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.215949Z","signature_b64":"/5WqslGUGdgOqwuxpfHjIQjM4L9Kj0i2P5spvHJl2NQ8fmzSoUQ22ss9E1xTvVe3xDEWtJETn6iyG47q3gk2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","last_reissued_at":"2026-05-18T01:01:16.215380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.215380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1255","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-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4pBE+6uRZ9U0Eo3uPQc3Jc2FUHTk2uxC7ob8qXL55G9zmTFfTmIwvAzE6FWnUXkAKl6peHyiVCZlwk5lS3QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:46:25.462201Z"},"content_sha256":"84dd6cefa8a76a913648630a0bea42111b8269651906eb2b96a03d14f9359f31","schema_version":"1.0","event_id":"sha256:84dd6cefa8a76a913648630a0bea42111b8269651906eb2b96a03d14f9359f31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GD45ZHKHVOBA7UK6KTFM674BDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Weidong Li, Xiaolu Zhang, Xi Liu, Xuejie Zhang","submitted_at":"2014-10-06T05:22:56Z","abstract_excerpt":"Dominant resource fairness (DRF) is a popular mechanism for multi-resource allocation in cloud computing systems. In this paper, we consider a problem of multi-resource fair allocation with bounded number of tasks. Firstly, we propose the lexicographically max-min normalized share (LMMNS) fair allocation mechanism, which is a natural generalization of DRF, and design a non-trivial optimal algorithm to find a LMMNS fair allocation, whose running time is linear in the number of users. Secondly, we prove that LMMNS satisfies envy-freeness (EF) and group strategy-proofness (GSP), and analysis the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1255","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-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4PwU4Avh/mVjyCrDAlnhaMNO3rPJeKCqYy6rDFb1XKl8vIh73dErfwoNBnhmXiVxwU++mcWSOgOSZ3eXfdRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:46:25.462658Z"},"content_sha256":"86f4dd8deab5be373af52db0ef19fede01f5cf886a05a0ee653a3047c91ce4af","schema_version":"1.0","event_id":"sha256:86f4dd8deab5be373af52db0ef19fede01f5cf886a05a0ee653a3047c91ce4af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/bundle.json","state_url":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GD45ZHKHVOBA7UK6KTFM674BDD/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-26T13:46:25Z","links":{"resolver":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD","bundle":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/bundle.json","state":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GD45ZHKHVOBA7UK6KTFM674BDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GD45ZHKHVOBA7UK6KTFM674BDD","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":"d3502bebee7f812e2b1ba766d2569917e1fc3f026ca15eee42871161cfeb4bb5","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","title_canon_sha256":"4ed241b952dc65e6a129a266ecd6af7011397d978ddc22ecc0bbcdda4844f630"},"schema_version":"1.0","source":{"id":"1410.1255","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1255","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1255v3","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1255","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"GD45ZHKHVOBA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GD45ZHKHVOBA7UK6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GD45ZHKH","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:86f4dd8deab5be373af52db0ef19fede01f5cf886a05a0ee653a3047c91ce4af","target":"graph","created_at":"2026-05-18T01:01:16Z","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":"Dominant resource fairness (DRF) is a popular mechanism for multi-resource allocation in cloud computing systems. In this paper, we consider a problem of multi-resource fair allocation with bounded number of tasks. Firstly, we propose the lexicographically max-min normalized share (LMMNS) fair allocation mechanism, which is a natural generalization of DRF, and design a non-trivial optimal algorithm to find a LMMNS fair allocation, whose running time is linear in the number of users. Secondly, we prove that LMMNS satisfies envy-freeness (EF) and group strategy-proofness (GSP), and analysis the ","authors_text":"Weidong Li, Xiaolu Zhang, Xi Liu, Xuejie Zhang","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","title":"Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1255","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:84dd6cefa8a76a913648630a0bea42111b8269651906eb2b96a03d14f9359f31","target":"record","created_at":"2026-05-18T01:01:16Z","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":"d3502bebee7f812e2b1ba766d2569917e1fc3f026ca15eee42871161cfeb4bb5","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","title_canon_sha256":"4ed241b952dc65e6a129a266ecd6af7011397d978ddc22ecc0bbcdda4844f630"},"schema_version":"1.0","source":{"id":"1410.1255","kind":"arxiv","version":3}},"canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","first_computed_at":"2026-05-18T01:01:16.215380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:16.215380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5WqslGUGdgOqwuxpfHjIQjM4L9Kj0i2P5spvHJl2NQ8fmzSoUQ22ss9E1xTvVe3xDEWtJETn6iyG47q3gk2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:16.215949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1255","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84dd6cefa8a76a913648630a0bea42111b8269651906eb2b96a03d14f9359f31","sha256:86f4dd8deab5be373af52db0ef19fede01f5cf886a05a0ee653a3047c91ce4af"],"state_sha256":"1a84bba228352378d72c3dc726cdfb44ef8d5dd56f407d0b47c0c83bb634d0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbZWM1szZVtlwlX3XdnJ7p04qtSVoNqBUANfVaaI9zAXpWaXFdQq42eCnnx5DNtJbByHZ+1go5GloqrlKBpMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:46:25.465067Z","bundle_sha256":"ac86ea27d37790aaa597c0d7823f27fdf446bb517e0f198c846a6882af8924e7"}}