{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DAPAZQPSZZWAWAXGY6B4CNFV2L","short_pith_number":"pith:DAPAZQPS","canonical_record":{"source":{"id":"1903.02337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-06T12:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"51f952e108dbe2f98e5d21fa9e4b211d557e1b3f89d387e5b952678c068bb358","abstract_canon_sha256":"54e277c5beac9d1a9fa9cc29fdb4caa0e68134794427b108a046f9df545c03a7"},"schema_version":"1.0"},"canonical_sha256":"181e0cc1f2ce6c0b02e6c783c134b5d2da4e25646ebc212b1a84efa487a81de6","source":{"kind":"arxiv","id":"1903.02337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02337","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02337v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02337","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"DAPAZQPSZZWA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DAPAZQPSZZWAWAXG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DAPAZQPS","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DAPAZQPSZZWAWAXGY6B4CNFV2L","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-06T12:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"51f952e108dbe2f98e5d21fa9e4b211d557e1b3f89d387e5b952678c068bb358","abstract_canon_sha256":"54e277c5beac9d1a9fa9cc29fdb4caa0e68134794427b108a046f9df545c03a7"},"schema_version":"1.0"},"canonical_sha256":"181e0cc1f2ce6c0b02e6c783c134b5d2da4e25646ebc212b1a84efa487a81de6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.587842Z","signature_b64":"P23nGsG/0No9WmAnwgLuxX2OWcOyHLZGEA/iTCzPRp4S4bq/Vs39pOsGmBDw+0+BhKT734dkpEnBvOtGCuDsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181e0cc1f2ce6c0b02e6c783c134b5d2da4e25646ebc212b1a84efa487a81de6","last_reissued_at":"2026-05-17T23:51:55.587252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.587252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02337","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjxSFbegQGfBxO4H4wn6cZoHOuQIreFB0WlaGoXpr2YcN0m2/lQqyvbKb0ydguKa/Rzo/7M9PA3cUYxCpuolAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:04:41.169630Z"},"content_sha256":"84c91baab7019e836326e8af811ed6da631170c199d6f328496626a8dd979289","schema_version":"1.0","event_id":"sha256:84c91baab7019e836326e8af811ed6da631170c199d6f328496626a8dd979289"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DAPAZQPSZZWAWAXGY6B4CNFV2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyper-Scalable JSQ with Sparse Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Johan van Leeuwaarden, Mark van der Boor, Sem Borst","submitted_at":"2019-03-06T12:07:55Z","abstract_excerpt":"Load balancing algorithms play a vital role in enhancing performance in data centers and cloud networks. Due to the massive size of these systems, scalability challenges, and especially the communication overhead associated with load balancing mechanisms, have emerged as major concerns. Motivated by these issues, we introduce and analyze a novel class of load balancing schemes where the various servers provide occasional queue updates to guide the load assignment.\n  We show that the proposed schemes strongly outperform JSQ($d$) strategies with comparable communication overhead per job, and can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02337","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYY4cy8EI2lFLD0iidkEWoDFIdyHcKhORxL8A0NSS28o++NdDZpkxpCNEbhhRznImoRWDA92XaBN4KilCuJ7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:04:41.170106Z"},"content_sha256":"6f48a462431fb47393a01a07ac09d031f3bb19c5b27c08dc4322cc506d679db5","schema_version":"1.0","event_id":"sha256:6f48a462431fb47393a01a07ac09d031f3bb19c5b27c08dc4322cc506d679db5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/bundle.json","state_url":"https://pith.science/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/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-27T23:04:41Z","links":{"resolver":"https://pith.science/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L","bundle":"https://pith.science/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/bundle.json","state":"https://pith.science/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAPAZQPSZZWAWAXGY6B4CNFV2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DAPAZQPSZZWAWAXGY6B4CNFV2L","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":"54e277c5beac9d1a9fa9cc29fdb4caa0e68134794427b108a046f9df545c03a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-06T12:07:55Z","title_canon_sha256":"51f952e108dbe2f98e5d21fa9e4b211d557e1b3f89d387e5b952678c068bb358"},"schema_version":"1.0","source":{"id":"1903.02337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02337","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02337v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02337","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"DAPAZQPSZZWA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DAPAZQPSZZWAWAXG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DAPAZQPS","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6f48a462431fb47393a01a07ac09d031f3bb19c5b27c08dc4322cc506d679db5","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"Load balancing algorithms play a vital role in enhancing performance in data centers and cloud networks. Due to the massive size of these systems, scalability challenges, and especially the communication overhead associated with load balancing mechanisms, have emerged as major concerns. Motivated by these issues, we introduce and analyze a novel class of load balancing schemes where the various servers provide occasional queue updates to guide the load assignment.\n  We show that the proposed schemes strongly outperform JSQ($d$) strategies with comparable communication overhead per job, and can","authors_text":"Johan van Leeuwaarden, Mark van der Boor, Sem Borst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-06T12:07:55Z","title":"Hyper-Scalable JSQ with Sparse Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02337","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:84c91baab7019e836326e8af811ed6da631170c199d6f328496626a8dd979289","target":"record","created_at":"2026-05-17T23:51:55Z","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":"54e277c5beac9d1a9fa9cc29fdb4caa0e68134794427b108a046f9df545c03a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-06T12:07:55Z","title_canon_sha256":"51f952e108dbe2f98e5d21fa9e4b211d557e1b3f89d387e5b952678c068bb358"},"schema_version":"1.0","source":{"id":"1903.02337","kind":"arxiv","version":1}},"canonical_sha256":"181e0cc1f2ce6c0b02e6c783c134b5d2da4e25646ebc212b1a84efa487a81de6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181e0cc1f2ce6c0b02e6c783c134b5d2da4e25646ebc212b1a84efa487a81de6","first_computed_at":"2026-05-17T23:51:55.587252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.587252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P23nGsG/0No9WmAnwgLuxX2OWcOyHLZGEA/iTCzPRp4S4bq/Vs39pOsGmBDw+0+BhKT734dkpEnBvOtGCuDsCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.587842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c91baab7019e836326e8af811ed6da631170c199d6f328496626a8dd979289","sha256:6f48a462431fb47393a01a07ac09d031f3bb19c5b27c08dc4322cc506d679db5"],"state_sha256":"3bb8509eb0eaaee1951201f08ff7ae1df32de9d2824b56a8c36ad9d90511e268"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oy7+KV6e4Htpb1XP10krTG/c+wvtiozempSQu54GDyl60R76sL7kqBkbkIwYaqnzTgeBKSCHc4kLIjAZE+sCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:04:41.173160Z","bundle_sha256":"4656dbdcbe43e79bbc8cf87ce5e2e82036d2b873bb5ed7b11e4b6dfc3a751671"}}