{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SPNOVJQOYGBSGNSK4IQPB42SWD","short_pith_number":"pith:SPNOVJQO","canonical_record":{"source":{"id":"1707.02005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-07T00:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"8ea088a0be319b5103c049f9b28b0ae986d8a3cf8d917e08d01a5cbbc29e4979","abstract_canon_sha256":"607ea958f05269a35e14d7607b1053ff8101624d566bd6fddba18df0c8270cd4"},"schema_version":"1.0"},"canonical_sha256":"93daeaa60ec18323364ae220f0f352b0fda05b156c619800407089070389c1fe","source":{"kind":"arxiv","id":"1707.02005","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02005","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02005v2","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02005","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"SPNOVJQOYGBS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SPNOVJQOYGBSGNSK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SPNOVJQO","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SPNOVJQOYGBSGNSK4IQPB42SWD","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-07T00:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"8ea088a0be319b5103c049f9b28b0ae986d8a3cf8d917e08d01a5cbbc29e4979","abstract_canon_sha256":"607ea958f05269a35e14d7607b1053ff8101624d566bd6fddba18df0c8270cd4"},"schema_version":"1.0"},"canonical_sha256":"93daeaa60ec18323364ae220f0f352b0fda05b156c619800407089070389c1fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:01.887837Z","signature_b64":"Qzssmnw2+7WKbW+IvH3JwpWRL4eJLccxjVDcCZtCd0DIKOyj9gkcencRHTjmjAoiU3O0/O6PdV3yEhkbEixABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93daeaa60ec18323364ae220f0f352b0fda05b156c619800407089070389c1fe","last_reissued_at":"2026-05-18T00:33:01.887358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:01.887358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02005","source_version":2,"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:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rx74PSgXOKYfr6GJaU+WleAp6KuaiTVN4vZYC0w6elcDjTWGZPBRF04AkRyWngRAq7S84Wm2Jx8uk1HJ5ZovAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:13:16.504063Z"},"content_sha256":"811ebc0a6daf74d52b2703883e816a2fed777aaad7f1a37da074d4b9d2e0401f","schema_version":"1.0","event_id":"sha256:811ebc0a6daf74d52b2703883e816a2fed777aaad7f1a37da074d4b9d2e0401f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SPNOVJQOYGBSGNSK4IQPB42SWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The hydrodynamic limit of a randomized load balancing network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kavita Ramanan, Reza Aghajani","submitted_at":"2017-07-07T00:41:23Z","abstract_excerpt":"Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent and identically distributed service times are assigned to the shortest queue among a randomly chosen subset of $d$ queues, and leave the network on completion of service. Prior work on dynamical properties of this model has focused on the case of exponential service distributions. In this work, we analyze the more realistic case of general service distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02005","kind":"arxiv","version":2},"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:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yUEVVtnqdvR/tarKEUq0tsCDzbPdDgCts5+eW8Yzdql0vVnONy8AZ4TCyBjlWQPKlgJUPByNvF+fOflCzuXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:13:16.504421Z"},"content_sha256":"7073357b63fbc6655c9e5d7600e67098c6751685d883a20b8fcb4a27c1636503","schema_version":"1.0","event_id":"sha256:7073357b63fbc6655c9e5d7600e67098c6751685d883a20b8fcb4a27c1636503"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/bundle.json","state_url":"https://pith.science/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/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-20T05:13:16Z","links":{"resolver":"https://pith.science/pith/SPNOVJQOYGBSGNSK4IQPB42SWD","bundle":"https://pith.science/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/bundle.json","state":"https://pith.science/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPNOVJQOYGBSGNSK4IQPB42SWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SPNOVJQOYGBSGNSK4IQPB42SWD","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":"607ea958f05269a35e14d7607b1053ff8101624d566bd6fddba18df0c8270cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-07T00:41:23Z","title_canon_sha256":"8ea088a0be319b5103c049f9b28b0ae986d8a3cf8d917e08d01a5cbbc29e4979"},"schema_version":"1.0","source":{"id":"1707.02005","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02005","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02005v2","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02005","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"SPNOVJQOYGBS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SPNOVJQOYGBSGNSK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SPNOVJQO","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7073357b63fbc6655c9e5d7600e67098c6751685d883a20b8fcb4a27c1636503","target":"graph","created_at":"2026-05-18T00:33:01Z","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":"Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent and identically distributed service times are assigned to the shortest queue among a randomly chosen subset of $d$ queues, and leave the network on completion of service. Prior work on dynamical properties of this model has focused on the case of exponential service distributions. In this work, we analyze the more realistic case of general service distributi","authors_text":"Kavita Ramanan, Reza Aghajani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-07T00:41:23Z","title":"The hydrodynamic limit of a randomized load balancing network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02005","kind":"arxiv","version":2},"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:811ebc0a6daf74d52b2703883e816a2fed777aaad7f1a37da074d4b9d2e0401f","target":"record","created_at":"2026-05-18T00:33:01Z","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":"607ea958f05269a35e14d7607b1053ff8101624d566bd6fddba18df0c8270cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-07T00:41:23Z","title_canon_sha256":"8ea088a0be319b5103c049f9b28b0ae986d8a3cf8d917e08d01a5cbbc29e4979"},"schema_version":"1.0","source":{"id":"1707.02005","kind":"arxiv","version":2}},"canonical_sha256":"93daeaa60ec18323364ae220f0f352b0fda05b156c619800407089070389c1fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93daeaa60ec18323364ae220f0f352b0fda05b156c619800407089070389c1fe","first_computed_at":"2026-05-18T00:33:01.887358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:01.887358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qzssmnw2+7WKbW+IvH3JwpWRL4eJLccxjVDcCZtCd0DIKOyj9gkcencRHTjmjAoiU3O0/O6PdV3yEhkbEixABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:01.887837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02005","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811ebc0a6daf74d52b2703883e816a2fed777aaad7f1a37da074d4b9d2e0401f","sha256:7073357b63fbc6655c9e5d7600e67098c6751685d883a20b8fcb4a27c1636503"],"state_sha256":"81ae05407fa084f4c209d166fbd39478c5c375f6711f0a587faf87b770866a74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fB1jDu3DDXgWGYXMKhA4/sCdNB/GdMEwTcrLH69E5Abhycxv6NMPv+1l+J57WCIBRCJEKy/v6mbWhIK0RZo8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:13:16.506392Z","bundle_sha256":"f5eb72877f8df48523cc277cbccfcd7ee532e5cf18f223e128ed290ff77e0e83"}}