{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HAAPXZ5I62SBGU62AY6IOSZ6PK","short_pith_number":"pith:HAAPXZ5I","canonical_record":{"source":{"id":"1805.04266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-11T08:02:53Z","cross_cats_sorted":[],"title_canon_sha256":"89231e667785360c57e9c3251fdc5655ce154c73e714f8f61d3757b8b86540d9","abstract_canon_sha256":"f32a085a52ad6b5e06ce12213859a253567e4eeab2e5ee1ce958aeb21fdcbec7"},"schema_version":"1.0"},"canonical_sha256":"3800fbe7a8f6a41353da063c874b3e7aaffa202fdc8d0e00247ea3a9ef5f0713","source":{"kind":"arxiv","id":"1805.04266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04266","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04266v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04266","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"HAAPXZ5I62SB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HAAPXZ5I62SBGU62","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HAAPXZ5I","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HAAPXZ5I62SBGU62AY6IOSZ6PK","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-11T08:02:53Z","cross_cats_sorted":[],"title_canon_sha256":"89231e667785360c57e9c3251fdc5655ce154c73e714f8f61d3757b8b86540d9","abstract_canon_sha256":"f32a085a52ad6b5e06ce12213859a253567e4eeab2e5ee1ce958aeb21fdcbec7"},"schema_version":"1.0"},"canonical_sha256":"3800fbe7a8f6a41353da063c874b3e7aaffa202fdc8d0e00247ea3a9ef5f0713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:13.022959Z","signature_b64":"QCLYJ3NnuDyDyUl1+a7+QtJ6bs+bMmXuM+vB3G9TpXQN3D+1FCKnEFo38wAoces2v3tlsZ7iL/CPTc9x01ATAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3800fbe7a8f6a41353da063c874b3e7aaffa202fdc8d0e00247ea3a9ef5f0713","last_reissued_at":"2026-05-18T00:16:13.022473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:13.022473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04266","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:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JGptX02IB527OcX2WZ8l6swTVpDDm9kHtU0pICE77cdnv+jadQPqNmwawkMDx+AaPfYFc0U/1YcZE16ab7bCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:09:59.276969Z"},"content_sha256":"d2d51178a72a78a0b9eb75f097e531c99a9ba8a1489684e24f5be578ca0ed716","schema_version":"1.0","event_id":"sha256:d2d51178a72a78a0b9eb75f097e531c99a9ba8a1489684e24f5be578ca0ed716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HAAPXZ5I62SBGU62AY6IOSZ6PK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FCFS Parallel Service Systems and Matching Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gideon Weiss, Igor Kleiner, Ivo Adan, Rhonda Righter","submitted_at":"2018-05-11T08:02:53Z","abstract_excerpt":"We consider three parallel service models in which customers of several types are served by several types of servers subject to a bipartite compatibility graph, and the service policy is first come first served. Two of the models have a fixed set of servers. The first is a queueing model in which arriving customers are assigned to the longest idling compatible server if available, or else queue up in a single queue, and servers that become available pick the longest waiting compatible customer, as studied by Adan and Weiss, 2014. The second is a redundancy service model where arriving customer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04266","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:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnwA4J0xTLY9TVQjaBjYPOQjFmInri9mDECsAVAVMGQIS8FMZS0G13rETht/R8S0n3OoE/yrg4CXgNH7tItrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:09:59.277311Z"},"content_sha256":"4cbf3d2e9bc8e72db9b4ce74df96bf4c44298f2cad064628efdb6aa2eee6b83d","schema_version":"1.0","event_id":"sha256:4cbf3d2e9bc8e72db9b4ce74df96bf4c44298f2cad064628efdb6aa2eee6b83d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/bundle.json","state_url":"https://pith.science/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/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-21T10:09:59Z","links":{"resolver":"https://pith.science/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK","bundle":"https://pith.science/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/bundle.json","state":"https://pith.science/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAAPXZ5I62SBGU62AY6IOSZ6PK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HAAPXZ5I62SBGU62AY6IOSZ6PK","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":"f32a085a52ad6b5e06ce12213859a253567e4eeab2e5ee1ce958aeb21fdcbec7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-11T08:02:53Z","title_canon_sha256":"89231e667785360c57e9c3251fdc5655ce154c73e714f8f61d3757b8b86540d9"},"schema_version":"1.0","source":{"id":"1805.04266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04266","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04266v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04266","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"HAAPXZ5I62SB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HAAPXZ5I62SBGU62","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HAAPXZ5I","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:4cbf3d2e9bc8e72db9b4ce74df96bf4c44298f2cad064628efdb6aa2eee6b83d","target":"graph","created_at":"2026-05-18T00:16:13Z","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 consider three parallel service models in which customers of several types are served by several types of servers subject to a bipartite compatibility graph, and the service policy is first come first served. Two of the models have a fixed set of servers. The first is a queueing model in which arriving customers are assigned to the longest idling compatible server if available, or else queue up in a single queue, and servers that become available pick the longest waiting compatible customer, as studied by Adan and Weiss, 2014. The second is a redundancy service model where arriving customer","authors_text":"Gideon Weiss, Igor Kleiner, Ivo Adan, Rhonda Righter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-11T08:02:53Z","title":"FCFS Parallel Service Systems and Matching Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04266","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:d2d51178a72a78a0b9eb75f097e531c99a9ba8a1489684e24f5be578ca0ed716","target":"record","created_at":"2026-05-18T00:16:13Z","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":"f32a085a52ad6b5e06ce12213859a253567e4eeab2e5ee1ce958aeb21fdcbec7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-11T08:02:53Z","title_canon_sha256":"89231e667785360c57e9c3251fdc5655ce154c73e714f8f61d3757b8b86540d9"},"schema_version":"1.0","source":{"id":"1805.04266","kind":"arxiv","version":1}},"canonical_sha256":"3800fbe7a8f6a41353da063c874b3e7aaffa202fdc8d0e00247ea3a9ef5f0713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3800fbe7a8f6a41353da063c874b3e7aaffa202fdc8d0e00247ea3a9ef5f0713","first_computed_at":"2026-05-18T00:16:13.022473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:13.022473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCLYJ3NnuDyDyUl1+a7+QtJ6bs+bMmXuM+vB3G9TpXQN3D+1FCKnEFo38wAoces2v3tlsZ7iL/CPTc9x01ATAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:13.022959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2d51178a72a78a0b9eb75f097e531c99a9ba8a1489684e24f5be578ca0ed716","sha256:4cbf3d2e9bc8e72db9b4ce74df96bf4c44298f2cad064628efdb6aa2eee6b83d"],"state_sha256":"e700b99359efab2827a78fea053c51e6da12289298b229502594a85f20d2dddb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"058GquJMwJ7xv33bpKeTffXb2fYA/1dKIxLv+RuijTg+zyjorvfmlYxvBrnYa8YXxzAngdHZeA/8TUnu1oRCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:09:59.279272Z","bundle_sha256":"db6f1c8c9a0c0da6c59252e01aa48a53cf8cac1670d149349e2b5ab90421fe10"}}