{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TYR56BKPS3BLPFWKNGQRCY7KEK","short_pith_number":"pith:TYR56BKP","canonical_record":{"source":{"id":"1603.01404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-04T10:03:09Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"53e7ca10e88fce56b96f486a1412048fa3a44842e7b88828122588b3c4da5367","abstract_canon_sha256":"7a132d57d23304577d4eede61885b6c77ba4a81bc55de0a4825956b5f71f0359"},"schema_version":"1.0"},"canonical_sha256":"9e23df054f96c2b796ca69a11163ea2289f6659db083e07fc3e9da1555302057","source":{"kind":"arxiv","id":"1603.01404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01404","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01404v2","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01404","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"TYR56BKPS3BL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYR56BKPS3BLPFWK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYR56BKP","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TYR56BKPS3BLPFWKNGQRCY7KEK","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-04T10:03:09Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"53e7ca10e88fce56b96f486a1412048fa3a44842e7b88828122588b3c4da5367","abstract_canon_sha256":"7a132d57d23304577d4eede61885b6c77ba4a81bc55de0a4825956b5f71f0359"},"schema_version":"1.0"},"canonical_sha256":"9e23df054f96c2b796ca69a11163ea2289f6659db083e07fc3e9da1555302057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.918381Z","signature_b64":"lJQiw0kK5i/fISn91PB1p+aJiMtJEop0VYQ3e9kE4zjWTtTFk6vUxml/HxwNW4FkoEjdsUmxZQjmgfJupIFLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e23df054f96c2b796ca69a11163ea2289f6659db083e07fc3e9da1555302057","last_reissued_at":"2026-05-18T00:16:14.917671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.917671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01404","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:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6VeJMK1soIG2905u/pQj97momQauAKWRIo+BNhtFMYuvQTnjRhnPxjD8gSIvGhQKPWPbn3hgDnLEbTJI/cdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:58:18.333836Z"},"content_sha256":"09a517bade957cbe6226cf03fd18572daed3447e4e89107ac7b6768e073812a6","schema_version":"1.0","event_id":"sha256:09a517bade957cbe6226cf03fd18572daed3447e4e89107ac7b6768e073812a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TYR56BKPS3BLPFWKNGQRCY7KEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design Heuristic for Parallel Many Server Systems under FCFS-ALIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Gideon Weiss, Ivo Adan, Marko Boon","submitted_at":"2016-03-04T10:03:09Z","abstract_excerpt":"We study a parallel queueing system with multiple types of servers and customers. A bipartite graph describes which pairs of customer-server types are compatible. We consider the service policy that always assigns servers to the first, longest waiting compatible customer, and that always assigns customers to the longest idle compatible server if on arrival, multiple compatible servers are available. For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated. In particular, the calculation of matching rates, the fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01404","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:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p52Ltp6/kjV7INZ9yNGLgrVD+Qf09dnW2Td52Z+lq16oFEOBXmjwZ5g+4zEkVni0VuAqOeMfMDE6muEG0StmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:58:18.334536Z"},"content_sha256":"ece7be1942b8eda0ec5b8a6c86bc6e29c5715cc967ca7641b2f789b59a793a7c","schema_version":"1.0","event_id":"sha256:ece7be1942b8eda0ec5b8a6c86bc6e29c5715cc967ca7641b2f789b59a793a7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/bundle.json","state_url":"https://pith.science/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/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-30T08:58:18Z","links":{"resolver":"https://pith.science/pith/TYR56BKPS3BLPFWKNGQRCY7KEK","bundle":"https://pith.science/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/bundle.json","state":"https://pith.science/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYR56BKPS3BLPFWKNGQRCY7KEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TYR56BKPS3BLPFWKNGQRCY7KEK","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":"7a132d57d23304577d4eede61885b6c77ba4a81bc55de0a4825956b5f71f0359","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-04T10:03:09Z","title_canon_sha256":"53e7ca10e88fce56b96f486a1412048fa3a44842e7b88828122588b3c4da5367"},"schema_version":"1.0","source":{"id":"1603.01404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01404","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01404v2","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01404","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"TYR56BKPS3BL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYR56BKPS3BLPFWK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYR56BKP","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ece7be1942b8eda0ec5b8a6c86bc6e29c5715cc967ca7641b2f789b59a793a7c","target":"graph","created_at":"2026-05-18T00:16:14Z","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 study a parallel queueing system with multiple types of servers and customers. A bipartite graph describes which pairs of customer-server types are compatible. We consider the service policy that always assigns servers to the first, longest waiting compatible customer, and that always assigns customers to the longest idle compatible server if on arrival, multiple compatible servers are available. For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated. In particular, the calculation of matching rates, the fr","authors_text":"Gideon Weiss, Ivo Adan, Marko Boon","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-04T10:03:09Z","title":"Design Heuristic for Parallel Many Server Systems under FCFS-ALIS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01404","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:09a517bade957cbe6226cf03fd18572daed3447e4e89107ac7b6768e073812a6","target":"record","created_at":"2026-05-18T00:16:14Z","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":"7a132d57d23304577d4eede61885b6c77ba4a81bc55de0a4825956b5f71f0359","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-04T10:03:09Z","title_canon_sha256":"53e7ca10e88fce56b96f486a1412048fa3a44842e7b88828122588b3c4da5367"},"schema_version":"1.0","source":{"id":"1603.01404","kind":"arxiv","version":2}},"canonical_sha256":"9e23df054f96c2b796ca69a11163ea2289f6659db083e07fc3e9da1555302057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e23df054f96c2b796ca69a11163ea2289f6659db083e07fc3e9da1555302057","first_computed_at":"2026-05-18T00:16:14.917671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:14.917671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJQiw0kK5i/fISn91PB1p+aJiMtJEop0VYQ3e9kE4zjWTtTFk6vUxml/HxwNW4FkoEjdsUmxZQjmgfJupIFLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:14.918381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09a517bade957cbe6226cf03fd18572daed3447e4e89107ac7b6768e073812a6","sha256:ece7be1942b8eda0ec5b8a6c86bc6e29c5715cc967ca7641b2f789b59a793a7c"],"state_sha256":"deb32fceff2f46834a2ee504dbdbf745c4a7de6da0c7b30b05197f35bd263076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4bEUZqV7MdUwmpBEd82Obzbrhj6CeeTPzGLCkExjYyByA95hKVxZK0BSbQ3gokrtPWpwzDCHy+HxK/wDO9lCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:58:18.338188Z","bundle_sha256":"ce0ebe46f59f1776756d381803a71f9584a10f11e5af2c4e4d1dfe13a959edff"}}