{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S6XYYPLAFTZB3OVKXCVJ36WLF2","short_pith_number":"pith:S6XYYPLA","canonical_record":{"source":{"id":"1509.05533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-18T08:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd2598da88f5671959502fd6bbe1ff436ae2de0bbc91586abc7dfe3b597c5526","abstract_canon_sha256":"fe474d0118f4a689190a8b08abd166bb10ced42a2d7c37e51c8a27d646d6c68d"},"schema_version":"1.0"},"canonical_sha256":"97af8c3d602cf21dbaaab8aa9dfacb2e989a1739db25e127510a26b22d2ed57b","source":{"kind":"arxiv","id":"1509.05533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05533","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05533v2","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05533","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"S6XYYPLAFTZB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6XYYPLAFTZB3OVK","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6XYYPLA","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S6XYYPLAFTZB3OVKXCVJ36WLF2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-18T08:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd2598da88f5671959502fd6bbe1ff436ae2de0bbc91586abc7dfe3b597c5526","abstract_canon_sha256":"fe474d0118f4a689190a8b08abd166bb10ced42a2d7c37e51c8a27d646d6c68d"},"schema_version":"1.0"},"canonical_sha256":"97af8c3d602cf21dbaaab8aa9dfacb2e989a1739db25e127510a26b22d2ed57b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:33.121182Z","signature_b64":"kEGVVxsJGR6xM8ovAq7+Z3A/30o3wD1g3A6/fYduFWvET55Cr1ZEKvDKVU14WcLklCPk6LP1a/CWpJR+pJJ5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97af8c3d602cf21dbaaab8aa9dfacb2e989a1739db25e127510a26b22d2ed57b","last_reissued_at":"2026-05-18T00:48:33.120543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:33.120543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05533","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:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puoy9n+cLUbB9/eLxQX0cVg2H7ROPf0da5JGakV0Rn6m6onWzEIeTZwakDR9UmpOcjZO8r3ntlM7lZnK6YiJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:51:09.198157Z"},"content_sha256":"5f8fb7cbb12f95f7be2b8e7091afdc65742378e42252c7f34230385633476384","schema_version":"1.0","event_id":"sha256:5f8fb7cbb12f95f7be2b8e7091afdc65742378e42252c7f34230385633476384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S6XYYPLAFTZB3OVKXCVJ36WLF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate performance analysis of generalized join the shortest queue routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ivo J.B.F. Adan, Jori Selen, Stella Kapodistria","submitted_at":"2015-09-18T08:05:47Z","abstract_excerpt":"In this paper we propose a highly accurate approximate performance analysis of a heterogeneous server system with a processor sharing service discipline and a general job-size distribution under a generalized join the shortest queue (GJSQ) routing protocol. The GJSQ routing protocol is a natural extension of the well-known join the shortest queue routing policy that takes into account the non-identical service rates in addition to the number of jobs at each server. The performance metrics that are of interest here are the equilibrium distribution and the mean and standard deviation of the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05533","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:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPayEDQj4pEVHNnNe2Uma+sM4AlOJV4SqjkK6UimJWk3QQAHsvMFufc5Hf0mxDk1vXYEWZUSfV19c3u8Y11sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:51:09.198830Z"},"content_sha256":"d3a1d0c5e1643538ad362cc445f10c1a25db6204a5e5dbf5891e2156cbddfdde","schema_version":"1.0","event_id":"sha256:d3a1d0c5e1643538ad362cc445f10c1a25db6204a5e5dbf5891e2156cbddfdde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/bundle.json","state_url":"https://pith.science/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/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-09T01:51:09Z","links":{"resolver":"https://pith.science/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2","bundle":"https://pith.science/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/bundle.json","state":"https://pith.science/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6XYYPLAFTZB3OVKXCVJ36WLF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S6XYYPLAFTZB3OVKXCVJ36WLF2","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":"fe474d0118f4a689190a8b08abd166bb10ced42a2d7c37e51c8a27d646d6c68d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-18T08:05:47Z","title_canon_sha256":"cd2598da88f5671959502fd6bbe1ff436ae2de0bbc91586abc7dfe3b597c5526"},"schema_version":"1.0","source":{"id":"1509.05533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05533","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05533v2","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05533","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"S6XYYPLAFTZB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6XYYPLAFTZB3OVK","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6XYYPLA","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:d3a1d0c5e1643538ad362cc445f10c1a25db6204a5e5dbf5891e2156cbddfdde","target":"graph","created_at":"2026-05-18T00:48:33Z","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":"In this paper we propose a highly accurate approximate performance analysis of a heterogeneous server system with a processor sharing service discipline and a general job-size distribution under a generalized join the shortest queue (GJSQ) routing protocol. The GJSQ routing protocol is a natural extension of the well-known join the shortest queue routing policy that takes into account the non-identical service rates in addition to the number of jobs at each server. The performance metrics that are of interest here are the equilibrium distribution and the mean and standard deviation of the numb","authors_text":"Ivo J.B.F. Adan, Jori Selen, Stella Kapodistria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-18T08:05:47Z","title":"Approximate performance analysis of generalized join the shortest queue routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05533","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:5f8fb7cbb12f95f7be2b8e7091afdc65742378e42252c7f34230385633476384","target":"record","created_at":"2026-05-18T00:48:33Z","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":"fe474d0118f4a689190a8b08abd166bb10ced42a2d7c37e51c8a27d646d6c68d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-18T08:05:47Z","title_canon_sha256":"cd2598da88f5671959502fd6bbe1ff436ae2de0bbc91586abc7dfe3b597c5526"},"schema_version":"1.0","source":{"id":"1509.05533","kind":"arxiv","version":2}},"canonical_sha256":"97af8c3d602cf21dbaaab8aa9dfacb2e989a1739db25e127510a26b22d2ed57b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97af8c3d602cf21dbaaab8aa9dfacb2e989a1739db25e127510a26b22d2ed57b","first_computed_at":"2026-05-18T00:48:33.120543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:33.120543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kEGVVxsJGR6xM8ovAq7+Z3A/30o3wD1g3A6/fYduFWvET55Cr1ZEKvDKVU14WcLklCPk6LP1a/CWpJR+pJJ5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:33.121182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f8fb7cbb12f95f7be2b8e7091afdc65742378e42252c7f34230385633476384","sha256:d3a1d0c5e1643538ad362cc445f10c1a25db6204a5e5dbf5891e2156cbddfdde"],"state_sha256":"d6846226300557b4abfb00dfaa5ac8bacc87b56b3acf45d1619fef0ee14502f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qtvx91/IXQXAGXK9CKdzDcjoX5AxfiXao8FDroX9KLdV/9Ww0do+l4U6fwDVMrBq1dxYyRr2YgoEg/T4SzfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:51:09.202961Z","bundle_sha256":"8f175ec76a5587cef36b679ea199a11f26b5f737d68f8655c0fa9c23944d4869"}}