{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDHRA5SCRRWLZSHWIYHGAPXV3V","short_pith_number":"pith:KDHRA5SC","canonical_record":{"source":{"id":"1502.05786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","cross_cats_sorted":["cs.PF","cs.SY","math.PR","stat.AP"],"title_canon_sha256":"6e215f4629b970e06384f828e35a9f84709e9280b3acb96fff2f445a9e520b97","abstract_canon_sha256":"6804046eaa6ccfe74dab2cf885211f15d68df8469c5f613ca2e127156c902b3f"},"schema_version":"1.0"},"canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","source":{"kind":"arxiv","id":"1502.05786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05786","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05786v1","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05786","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"KDHRA5SCRRWL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDHRA5SCRRWLZSHW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDHRA5SC","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDHRA5SCRRWLZSHWIYHGAPXV3V","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","cross_cats_sorted":["cs.PF","cs.SY","math.PR","stat.AP"],"title_canon_sha256":"6e215f4629b970e06384f828e35a9f84709e9280b3acb96fff2f445a9e520b97","abstract_canon_sha256":"6804046eaa6ccfe74dab2cf885211f15d68df8469c5f613ca2e127156c902b3f"},"schema_version":"1.0"},"canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.794148Z","signature_b64":"viyFnBbykQUTprhRntJDvYbtLjUPzo/ciIDZ3mItiDZ2fN+Wir7uSUEoN4ZPc8PmK+fli8rjwYdQ+R+7Q5FBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","last_reissued_at":"2026-05-18T02:26:44.793683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.793683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05786","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:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohPG1KN58JPBYYnsMWSld/II75Y/4oCaOE7xzoILpoubtlaDQQgbxvIX6Aaf7lLan18y+GSIlR7pbXU8ubY8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:22:41.525735Z"},"content_sha256":"ee3b18a1961090e3381543c68fa608d7ee6d4dda85d2b61afed4c0945a35b487","schema_version":"1.0","event_id":"sha256:ee3b18a1961090e3381543c68fa608d7ee6d4dda85d2b61afed4c0945a35b487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDHRA5SCRRWLZSHWIYHGAPXV3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SY","math.PR","stat.AP"],"primary_cat":"cs.DC","authors_text":"A. Karthik, Arpan Mukhopadhyay, Ravi R. Mazumdar","submitted_at":"2015-02-20T06:51:01Z","abstract_excerpt":"We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \\lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05786","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:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cyx2uHwxtIPerMILNEAAdUvJoSVn7lBqBLpmtp3Bzv8IBEQC9fDLwzLD35POSIEsV5LzeE3ybSVnMWwCLszWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:22:41.526271Z"},"content_sha256":"90cb9b8d2e9cd5b3ee612b4d71db7c0a68bf457cc56bf0c3a1cd7f3d9306fafe","schema_version":"1.0","event_id":"sha256:90cb9b8d2e9cd5b3ee612b4d71db7c0a68bf457cc56bf0c3a1cd7f3d9306fafe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/bundle.json","state_url":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/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-24T20:22:41Z","links":{"resolver":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V","bundle":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/bundle.json","state":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDHRA5SCRRWLZSHWIYHGAPXV3V","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":"6804046eaa6ccfe74dab2cf885211f15d68df8469c5f613ca2e127156c902b3f","cross_cats_sorted":["cs.PF","cs.SY","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","title_canon_sha256":"6e215f4629b970e06384f828e35a9f84709e9280b3acb96fff2f445a9e520b97"},"schema_version":"1.0","source":{"id":"1502.05786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05786","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05786v1","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05786","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"KDHRA5SCRRWL","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDHRA5SCRRWLZSHW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDHRA5SC","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:90cb9b8d2e9cd5b3ee612b4d71db7c0a68bf457cc56bf0c3a1cd7f3d9306fafe","target":"graph","created_at":"2026-05-18T02:26:44Z","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 job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \\lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time ","authors_text":"A. Karthik, Arpan Mukhopadhyay, Ravi R. Mazumdar","cross_cats":["cs.PF","cs.SY","math.PR","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","title":"Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05786","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:ee3b18a1961090e3381543c68fa608d7ee6d4dda85d2b61afed4c0945a35b487","target":"record","created_at":"2026-05-18T02:26:44Z","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":"6804046eaa6ccfe74dab2cf885211f15d68df8469c5f613ca2e127156c902b3f","cross_cats_sorted":["cs.PF","cs.SY","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","title_canon_sha256":"6e215f4629b970e06384f828e35a9f84709e9280b3acb96fff2f445a9e520b97"},"schema_version":"1.0","source":{"id":"1502.05786","kind":"arxiv","version":1}},"canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","first_computed_at":"2026-05-18T02:26:44.793683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:44.793683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"viyFnBbykQUTprhRntJDvYbtLjUPzo/ciIDZ3mItiDZ2fN+Wir7uSUEoN4ZPc8PmK+fli8rjwYdQ+R+7Q5FBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:44.794148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3b18a1961090e3381543c68fa608d7ee6d4dda85d2b61afed4c0945a35b487","sha256:90cb9b8d2e9cd5b3ee612b4d71db7c0a68bf457cc56bf0c3a1cd7f3d9306fafe"],"state_sha256":"8b5b77b9d986dfe987e990031d3cc9a61c72b3466013dccd679b2bdc91ec5b75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wbn26TbDbNiY40ouMyDSI9aFUZc9++Lnru0uWrdj0ZRe9GeIAX/IlrDn07UGp2movU8MoPjlXQ3uG4Iti0K2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:22:41.529617Z","bundle_sha256":"6c4691e09aaa67c8c83130b70672797bc52b66abbce3c955002113a3900127bd"}}