{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UZHQHBKG2HRSWOTOYB6V3KRRSC","short_pith_number":"pith:UZHQHBKG","canonical_record":{"source":{"id":"1812.10703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-27T11:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b4fbf200269eb3986c9efb23a1fe45e6e2fabd1a38163da61a7e564cd6cd965","abstract_canon_sha256":"3fa34640f03f5f5a3f4c62c86ae7c376e0a5bae69182988b406613aeb3af4a2b"},"schema_version":"1.0"},"canonical_sha256":"a64f038546d1e32b3a6ec07d5daa3190b969992594c4f57655e3f8bdd31af53e","source":{"kind":"arxiv","id":"1812.10703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10703","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10703v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10703","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"UZHQHBKG2HRS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZHQHBKG2HRSWOTO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZHQHBKG","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UZHQHBKG2HRSWOTOYB6V3KRRSC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-27T11:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b4fbf200269eb3986c9efb23a1fe45e6e2fabd1a38163da61a7e564cd6cd965","abstract_canon_sha256":"3fa34640f03f5f5a3f4c62c86ae7c376e0a5bae69182988b406613aeb3af4a2b"},"schema_version":"1.0"},"canonical_sha256":"a64f038546d1e32b3a6ec07d5daa3190b969992594c4f57655e3f8bdd31af53e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.225690Z","signature_b64":"lXsqvJcWLmuBwiVCOvd27IaCqGwRyJEXI5615EbwCBn3pwqz6j1fyvtvuri8Bpcv0V1iHqNQjKT+zvmY/YHLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a64f038546d1e32b3a6ec07d5daa3190b969992594c4f57655e3f8bdd31af53e","last_reissued_at":"2026-05-17T23:57:20.224921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.224921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10703","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iybNjytnbx+zEhdwywHcvU6bWY0bBKVGJ/sTesy/QN0NcccC9Xed56yuoSlM2VtcIHc8WgNT5i8REMSLxn9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:30:27.028684Z"},"content_sha256":"e3b53aebea2e305b7208c9c6df0e538edbfb394454bda979c5ef3951fb8078c7","schema_version":"1.0","event_id":"sha256:e3b53aebea2e305b7208c9c6df0e538edbfb394454bda979c5ef3951fb8078c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UZHQHBKG2HRSWOTOYB6V3KRRSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Job Allocation in Large-Scale Service Systems with Affinity Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ellen Cardinaels, Johan S.H. van Leeuwaarden, Sem C. Borst","submitted_at":"2018-12-27T11:51:47Z","abstract_excerpt":"We consider load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be allocated to a fast, primary server from a particular selection associated with this job or to a secondary server to be processed at a slower rate. Such job-server affinity relations can model network topologies based on geographical proximity, or data locality in cloud scenarios. We introduce load balancing schemes that allocate jobs to primary servers if available, and otherwise to secondary servers. A novel coupling construction is developed to obtain stabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10703","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL22ompTTc77DBijpa7Fy6S6FKv3Czqs/EPEUaAOSOw14lZ8MUai7PujCzTbtlHtje1BLTzITNvBR2YI3cl8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:30:27.029273Z"},"content_sha256":"7fa8a419594e7cc0c247b9f1e27f82350bc5030d401f291088576bcb0318f89a","schema_version":"1.0","event_id":"sha256:7fa8a419594e7cc0c247b9f1e27f82350bc5030d401f291088576bcb0318f89a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/bundle.json","state_url":"https://pith.science/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/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-05T06:30:27Z","links":{"resolver":"https://pith.science/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC","bundle":"https://pith.science/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/bundle.json","state":"https://pith.science/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZHQHBKG2HRSWOTOYB6V3KRRSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UZHQHBKG2HRSWOTOYB6V3KRRSC","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":"3fa34640f03f5f5a3f4c62c86ae7c376e0a5bae69182988b406613aeb3af4a2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-27T11:51:47Z","title_canon_sha256":"6b4fbf200269eb3986c9efb23a1fe45e6e2fabd1a38163da61a7e564cd6cd965"},"schema_version":"1.0","source":{"id":"1812.10703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10703","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10703v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10703","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"UZHQHBKG2HRS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZHQHBKG2HRSWOTO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZHQHBKG","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:7fa8a419594e7cc0c247b9f1e27f82350bc5030d401f291088576bcb0318f89a","target":"graph","created_at":"2026-05-17T23:57:20Z","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 load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be allocated to a fast, primary server from a particular selection associated with this job or to a secondary server to be processed at a slower rate. Such job-server affinity relations can model network topologies based on geographical proximity, or data locality in cloud scenarios. We introduce load balancing schemes that allocate jobs to primary servers if available, and otherwise to secondary servers. A novel coupling construction is developed to obtain stabilit","authors_text":"Ellen Cardinaels, Johan S.H. van Leeuwaarden, Sem C. Borst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-27T11:51:47Z","title":"Job Allocation in Large-Scale Service Systems with Affinity Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10703","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:e3b53aebea2e305b7208c9c6df0e538edbfb394454bda979c5ef3951fb8078c7","target":"record","created_at":"2026-05-17T23:57:20Z","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":"3fa34640f03f5f5a3f4c62c86ae7c376e0a5bae69182988b406613aeb3af4a2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-27T11:51:47Z","title_canon_sha256":"6b4fbf200269eb3986c9efb23a1fe45e6e2fabd1a38163da61a7e564cd6cd965"},"schema_version":"1.0","source":{"id":"1812.10703","kind":"arxiv","version":1}},"canonical_sha256":"a64f038546d1e32b3a6ec07d5daa3190b969992594c4f57655e3f8bdd31af53e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a64f038546d1e32b3a6ec07d5daa3190b969992594c4f57655e3f8bdd31af53e","first_computed_at":"2026-05-17T23:57:20.224921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:20.224921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lXsqvJcWLmuBwiVCOvd27IaCqGwRyJEXI5615EbwCBn3pwqz6j1fyvtvuri8Bpcv0V1iHqNQjKT+zvmY/YHLDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:20.225690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3b53aebea2e305b7208c9c6df0e538edbfb394454bda979c5ef3951fb8078c7","sha256:7fa8a419594e7cc0c247b9f1e27f82350bc5030d401f291088576bcb0318f89a"],"state_sha256":"a8f74e9974363649ec5263d226c2b664f5a6ec7c6dedfd188d15702cab36186b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gs+wsBVPTGfxxKyR4CWBdB1LefUXweh9ZV2ZXPyWnFQ+OoaX/aCuYbMszdJ4iySEUoR7pmgsxO9nW7WgpQgNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:30:27.032640Z","bundle_sha256":"2114201984bc74cc14086b50044dc9c3f3ec6866e47a4daeb15cc72850a5b5d4"}}