{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DV44FFYZ4HJRKG2CRUOSSTHHPO","short_pith_number":"pith:DV44FFYZ","canonical_record":{"source":{"id":"1106.2673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-14T11:20:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5d602f3554599effd4ed62f19da6cccf2b5373e0bd8254523ec4da3c896e1b99","abstract_canon_sha256":"f10d36587016b50ff558d309a5173ebed8fabed626dd1397feaa3e244d267b86"},"schema_version":"1.0"},"canonical_sha256":"1d79c29719e1d3151b428d1d294ce77ba381812ac5ff1a43eedbedea37aeaed0","source":{"kind":"arxiv","id":"1106.2673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2673","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2673v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2673","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"DV44FFYZ4HJR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DV44FFYZ4HJRKG2C","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DV44FFYZ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DV44FFYZ4HJRKG2CRUOSSTHHPO","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-14T11:20:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5d602f3554599effd4ed62f19da6cccf2b5373e0bd8254523ec4da3c896e1b99","abstract_canon_sha256":"f10d36587016b50ff558d309a5173ebed8fabed626dd1397feaa3e244d267b86"},"schema_version":"1.0"},"canonical_sha256":"1d79c29719e1d3151b428d1d294ce77ba381812ac5ff1a43eedbedea37aeaed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:04.336206Z","signature_b64":"GBqtgwbA35/OCqP2s9RtttdYmyGtAPll0DgBJdok+B8cfqZTWJuJuHD8sJp7+lDxARTVqiqzQvX083e03w9VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d79c29719e1d3151b428d1d294ce77ba381812ac5ff1a43eedbedea37aeaed0","last_reissued_at":"2026-05-18T04:20:04.335774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:04.335774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2673","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIdgef/wAj5Shxn6C7NbkRaiafRPswoydB/jhGrVvSPxfQpa/YnhzCLWsJXkBY6YXRymQSF/cr4swYOnf5CVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:09.318580Z"},"content_sha256":"ffee2a715ee38c718171e66db39ce838e0c4d731bfff070f3bc167188e6b8428","schema_version":"1.0","event_id":"sha256:ffee2a715ee38c718171e66db39ce838e0c4d731bfff070f3bc167188e6b8428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DV44FFYZ4HJRKG2CRUOSSTHHPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No justified complaints: On fair sharing of multiple resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Nati Linial, Raz Kupferman","submitted_at":"2011-06-14T11:20:26Z","abstract_excerpt":"Fair allocation has been studied intensively in both economics and  computer science, and fair sharing of resources has aroused renewed  interest with the advent of virtualization and cloud computing.  Prior work has typically focused on mechanisms for fair sharing  of a single resource.  We provide a new definition for the simultaneous fair allocation of  multiple continuously-divisible resources.  Roughly speaking, we define fairness as the situation where every  user either gets all the resources he wishes for, or else gets at  least his entitlement on some bottleneck resource, and therefor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2673","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4MMlxCE0IT8N1aNd+f0XdHzznpgshGf80+2kOYiK/NUOSNlKTvB3HnQlFeqKkH35ULmzAqm1Z+vTxs6BFRACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:09.319261Z"},"content_sha256":"e7340d6d0b0441216c3c72421f90903941204c46a28191ea05f308951f80483b","schema_version":"1.0","event_id":"sha256:e7340d6d0b0441216c3c72421f90903941204c46a28191ea05f308951f80483b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/bundle.json","state_url":"https://pith.science/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/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-27T19:19:09Z","links":{"resolver":"https://pith.science/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO","bundle":"https://pith.science/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/bundle.json","state":"https://pith.science/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV44FFYZ4HJRKG2CRUOSSTHHPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DV44FFYZ4HJRKG2CRUOSSTHHPO","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":"f10d36587016b50ff558d309a5173ebed8fabed626dd1397feaa3e244d267b86","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-14T11:20:26Z","title_canon_sha256":"5d602f3554599effd4ed62f19da6cccf2b5373e0bd8254523ec4da3c896e1b99"},"schema_version":"1.0","source":{"id":"1106.2673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2673","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2673v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2673","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"DV44FFYZ4HJR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DV44FFYZ4HJRKG2C","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DV44FFYZ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:e7340d6d0b0441216c3c72421f90903941204c46a28191ea05f308951f80483b","target":"graph","created_at":"2026-05-18T04:20: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":"Fair allocation has been studied intensively in both economics and  computer science, and fair sharing of resources has aroused renewed  interest with the advent of virtualization and cloud computing.  Prior work has typically focused on mechanisms for fair sharing  of a single resource.  We provide a new definition for the simultaneous fair allocation of  multiple continuously-divisible resources.  Roughly speaking, we define fairness as the situation where every  user either gets all the resources he wishes for, or else gets at  least his entitlement on some bottleneck resource, and therefor","authors_text":"Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Nati Linial, Raz Kupferman","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-14T11:20:26Z","title":"No justified complaints: On fair sharing of multiple resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2673","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:ffee2a715ee38c718171e66db39ce838e0c4d731bfff070f3bc167188e6b8428","target":"record","created_at":"2026-05-18T04:20: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":"f10d36587016b50ff558d309a5173ebed8fabed626dd1397feaa3e244d267b86","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-14T11:20:26Z","title_canon_sha256":"5d602f3554599effd4ed62f19da6cccf2b5373e0bd8254523ec4da3c896e1b99"},"schema_version":"1.0","source":{"id":"1106.2673","kind":"arxiv","version":1}},"canonical_sha256":"1d79c29719e1d3151b428d1d294ce77ba381812ac5ff1a43eedbedea37aeaed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d79c29719e1d3151b428d1d294ce77ba381812ac5ff1a43eedbedea37aeaed0","first_computed_at":"2026-05-18T04:20:04.335774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:04.335774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GBqtgwbA35/OCqP2s9RtttdYmyGtAPll0DgBJdok+B8cfqZTWJuJuHD8sJp7+lDxARTVqiqzQvX083e03w9VAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:04.336206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffee2a715ee38c718171e66db39ce838e0c4d731bfff070f3bc167188e6b8428","sha256:e7340d6d0b0441216c3c72421f90903941204c46a28191ea05f308951f80483b"],"state_sha256":"76a9e1ac34c568f624c1299374583c21ebfb2ea43888ccba5118b5a6c8eea649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFxxcziUhv6t4GVj5RPlGkL8T67M8Gu8qrlvGwcfMS1etm5IFvi2pfRSnZq+yT5dowWQ3r2a/0kTFHhH7M0vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:09.322613Z","bundle_sha256":"a0c7a2ca7c49e6c7a6d6fbd299780bf39fce65dac20710814d2171d84ee15ae1"}}