{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WDSXFD2DIHEPQXKCRC62NYGSRB","short_pith_number":"pith:WDSXFD2D","canonical_record":{"source":{"id":"1809.02018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-06T14:40:10Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"4e479f3fa2bfbf74658aadaa550091a3e04763cc4bee431a4a9f6f0a176bfcfb","abstract_canon_sha256":"e0b180a99d29ccc4bdc4194bb35f7693aade63b272dcf6bbae7a304bfa80b8a5"},"schema_version":"1.0"},"canonical_sha256":"b0e5728f4341c8f85d4288bda6e0d28869cdb7b7d3bdbe67bb4ae7fdde24a24e","source":{"kind":"arxiv","id":"1809.02018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02018","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02018v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02018","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WDSXFD2DIHEP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDSXFD2DIHEPQXKC","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDSXFD2D","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WDSXFD2DIHEPQXKCRC62NYGSRB","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-06T14:40:10Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"4e479f3fa2bfbf74658aadaa550091a3e04763cc4bee431a4a9f6f0a176bfcfb","abstract_canon_sha256":"e0b180a99d29ccc4bdc4194bb35f7693aade63b272dcf6bbae7a304bfa80b8a5"},"schema_version":"1.0"},"canonical_sha256":"b0e5728f4341c8f85d4288bda6e0d28869cdb7b7d3bdbe67bb4ae7fdde24a24e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.514281Z","signature_b64":"NAX5Za3+t6R9fHakvHBfKdY8sdQwr+m64fkbuFse12+Y/A166er4dwKIpHH1t6gdZp8WV0NLIVDQiRMxY2EBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e5728f4341c8f85d4288bda6e0d28869cdb7b7d3bdbe67bb4ae7fdde24a24e","last_reissued_at":"2026-05-18T00:06:21.513939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.513939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02018","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4pimnjqlrWgvKPBgR9KUGgCGXqH96S00lyVUp0v7Q7KmgdFIkZzhO+WrMuhDPD7auIjd0RwpXMVjbDy+lToDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:42:11.196824Z"},"content_sha256":"a544b42971be9d7800498a578c62e50888af800a0c5af77106a53e5d1899f99d","schema_version":"1.0","event_id":"sha256:a544b42971be9d7800498a578c62e50888af800a0c5af77106a53e5d1899f99d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WDSXFD2DIHEPQXKCRC62NYGSRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Load Balancing Algorithms in Networked Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee","submitted_at":"2018-09-06T14:40:10Z","abstract_excerpt":"A fundamental challenge in large-scale networked systems viz., data centers and cloud networks is to distribute tasks to a pool of servers, using minimal instantaneous state information, while providing excellent delay performance. In this thesis we design and analyze load balancing algorithms that aim to achieve a highly efficient distribution of tasks, optimize server utilization, and minimize communication overhead."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02018","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfrlO8K4YT6zdnl5O5xVVuPkVRnE2sLbzHfZWKgFn0YJnTgVz/DRBcYjq+BdwaC2pkOstgU1P4nUowedfIQCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:42:11.197197Z"},"content_sha256":"13111e2ccfcc4c64b109fb88d5b541233679ccead997c20de9ae0316fe045f4c","schema_version":"1.0","event_id":"sha256:13111e2ccfcc4c64b109fb88d5b541233679ccead997c20de9ae0316fe045f4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/bundle.json","state_url":"https://pith.science/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/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-11T21:42:11Z","links":{"resolver":"https://pith.science/pith/WDSXFD2DIHEPQXKCRC62NYGSRB","bundle":"https://pith.science/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/bundle.json","state":"https://pith.science/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDSXFD2DIHEPQXKCRC62NYGSRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WDSXFD2DIHEPQXKCRC62NYGSRB","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":"e0b180a99d29ccc4bdc4194bb35f7693aade63b272dcf6bbae7a304bfa80b8a5","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-06T14:40:10Z","title_canon_sha256":"4e479f3fa2bfbf74658aadaa550091a3e04763cc4bee431a4a9f6f0a176bfcfb"},"schema_version":"1.0","source":{"id":"1809.02018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02018","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02018v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02018","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WDSXFD2DIHEP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDSXFD2DIHEPQXKC","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDSXFD2D","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:13111e2ccfcc4c64b109fb88d5b541233679ccead997c20de9ae0316fe045f4c","target":"graph","created_at":"2026-05-18T00:06:21Z","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":"A fundamental challenge in large-scale networked systems viz., data centers and cloud networks is to distribute tasks to a pool of servers, using minimal instantaneous state information, while providing excellent delay performance. In this thesis we design and analyze load balancing algorithms that aim to achieve a highly efficient distribution of tasks, optimize server utilization, and minimize communication overhead.","authors_text":"Debankur Mukherjee","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-06T14:40:10Z","title":"Scalable Load Balancing Algorithms in Networked Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02018","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:a544b42971be9d7800498a578c62e50888af800a0c5af77106a53e5d1899f99d","target":"record","created_at":"2026-05-18T00:06:21Z","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":"e0b180a99d29ccc4bdc4194bb35f7693aade63b272dcf6bbae7a304bfa80b8a5","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-06T14:40:10Z","title_canon_sha256":"4e479f3fa2bfbf74658aadaa550091a3e04763cc4bee431a4a9f6f0a176bfcfb"},"schema_version":"1.0","source":{"id":"1809.02018","kind":"arxiv","version":1}},"canonical_sha256":"b0e5728f4341c8f85d4288bda6e0d28869cdb7b7d3bdbe67bb4ae7fdde24a24e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e5728f4341c8f85d4288bda6e0d28869cdb7b7d3bdbe67bb4ae7fdde24a24e","first_computed_at":"2026-05-18T00:06:21.513939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.513939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAX5Za3+t6R9fHakvHBfKdY8sdQwr+m64fkbuFse12+Y/A166er4dwKIpHH1t6gdZp8WV0NLIVDQiRMxY2EBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.514281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a544b42971be9d7800498a578c62e50888af800a0c5af77106a53e5d1899f99d","sha256:13111e2ccfcc4c64b109fb88d5b541233679ccead997c20de9ae0316fe045f4c"],"state_sha256":"2c8f8c1775df32a0e210a74191350793329f87202df9a66048ca1820ed6135a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCUPI8E4orOy1y6drUUwX/boL58KIxR3Mr1qLr31vO5Phwu9OTPjTM+sUXxVrFCtMgdcPoo2xfr/Elz+bdnsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:42:11.199592Z","bundle_sha256":"86dcda7d68058c76ac1e2f3f377c49e2dc4e59cd3d195e307967ce9a4fd923fb"}}