{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3LZFM3M6KXOW2HUHYP4NHT5VRR","short_pith_number":"pith:3LZFM3M6","canonical_record":{"source":{"id":"1704.06442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-21T08:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"0f8b9ca7d02dbe3d69aa1e24b72f32eef647944fff889a3dd053a3619079dbac","abstract_canon_sha256":"680a1d1d3b585d52c23f1400f78108bf54c25fe274ef842684d0cacdde4cd840"},"schema_version":"1.0"},"canonical_sha256":"daf2566d9e55dd6d1e87c3f8d3cfb58c7c249d0df9a43aba93812c36f2fa3435","source":{"kind":"arxiv","id":"1704.06442","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06442","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06442v3","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06442","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"pith_short_12","alias_value":"3LZFM3M6KXOW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LZFM3M6KXOW2HUH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LZFM3M6","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3LZFM3M6KXOW2HUHYP4NHT5VRR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-21T08:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"0f8b9ca7d02dbe3d69aa1e24b72f32eef647944fff889a3dd053a3619079dbac","abstract_canon_sha256":"680a1d1d3b585d52c23f1400f78108bf54c25fe274ef842684d0cacdde4cd840"},"schema_version":"1.0"},"canonical_sha256":"daf2566d9e55dd6d1e87c3f8d3cfb58c7c249d0df9a43aba93812c36f2fa3435","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:15.933841Z","signature_b64":"NIFASWHPTktYkVhM0/ag0fo23AcJa1GQnEqDqj5g6eJmRl+1q8PernZjwZwZ1TV2KjrUpGUj13ZoE/FC2Z2ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf2566d9e55dd6d1e87c3f8d3cfb58c7c249d0df9a43aba93812c36f2fa3435","last_reissued_at":"2026-05-18T00:28:15.933262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:15.933262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06442","source_version":3,"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:28:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQWtPgPpj06xZmFFflsue2Gfe1VkbJ6kvDIoTJ1+DGHTKQJ/WND48PoGikmyZ1jIFba1c9d04iSagGqNeuGSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:36:02.934147Z"},"content_sha256":"d7ffb3e6612540def59bf8bba0540a27dd1cfd45d646a5c28ce712098c349920","schema_version":"1.0","event_id":"sha256:d7ffb3e6612540def59bf8bba0540a27dd1cfd45d646a5c28ce712098c349920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3LZFM3M6KXOW2HUHYP4NHT5VRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stationary analysis of the shortest queue problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christine Fricker, Danielle Tibi, Plinio S. Dester","submitted_at":"2017-04-21T08:37:38Z","abstract_excerpt":"A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal. The arrival process is Poisson, service times at each queue have exponential distributions with the same parameter, and both queues have equal capacity. Using standard generating function arguments, a simple expression for the blocking probability is derived, which as far as we know is original. Using coupling arguments and explicit formulas, comparisons with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06442","kind":"arxiv","version":3},"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:28:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8qW23xSy4Y100XEdW8NeiQ92cUQ3kwigpP3nDAeunNCjhSLnZKqSloATUkuUpyzrg4AHjgnDBhIBCX1fgMAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:36:02.934511Z"},"content_sha256":"de89582949d3c242bd5ccded7daad8204dcd558ed970a1347c06ef19880b0cd8","schema_version":"1.0","event_id":"sha256:de89582949d3c242bd5ccded7daad8204dcd558ed970a1347c06ef19880b0cd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/bundle.json","state_url":"https://pith.science/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/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-23T16:36:02Z","links":{"resolver":"https://pith.science/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR","bundle":"https://pith.science/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/bundle.json","state":"https://pith.science/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LZFM3M6KXOW2HUHYP4NHT5VRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3LZFM3M6KXOW2HUHYP4NHT5VRR","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":"680a1d1d3b585d52c23f1400f78108bf54c25fe274ef842684d0cacdde4cd840","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-21T08:37:38Z","title_canon_sha256":"0f8b9ca7d02dbe3d69aa1e24b72f32eef647944fff889a3dd053a3619079dbac"},"schema_version":"1.0","source":{"id":"1704.06442","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06442","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06442v3","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06442","created_at":"2026-05-18T00:28:15Z"},{"alias_kind":"pith_short_12","alias_value":"3LZFM3M6KXOW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LZFM3M6KXOW2HUH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LZFM3M6","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:de89582949d3c242bd5ccded7daad8204dcd558ed970a1347c06ef19880b0cd8","target":"graph","created_at":"2026-05-18T00:28:15Z","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 simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal. The arrival process is Poisson, service times at each queue have exponential distributions with the same parameter, and both queues have equal capacity. Using standard generating function arguments, a simple expression for the blocking probability is derived, which as far as we know is original. Using coupling arguments and explicit formulas, comparisons with ","authors_text":"Christine Fricker, Danielle Tibi, Plinio S. Dester","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-21T08:37:38Z","title":"Stationary analysis of the shortest queue problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06442","kind":"arxiv","version":3},"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:d7ffb3e6612540def59bf8bba0540a27dd1cfd45d646a5c28ce712098c349920","target":"record","created_at":"2026-05-18T00:28:15Z","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":"680a1d1d3b585d52c23f1400f78108bf54c25fe274ef842684d0cacdde4cd840","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-21T08:37:38Z","title_canon_sha256":"0f8b9ca7d02dbe3d69aa1e24b72f32eef647944fff889a3dd053a3619079dbac"},"schema_version":"1.0","source":{"id":"1704.06442","kind":"arxiv","version":3}},"canonical_sha256":"daf2566d9e55dd6d1e87c3f8d3cfb58c7c249d0df9a43aba93812c36f2fa3435","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daf2566d9e55dd6d1e87c3f8d3cfb58c7c249d0df9a43aba93812c36f2fa3435","first_computed_at":"2026-05-18T00:28:15.933262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:15.933262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIFASWHPTktYkVhM0/ag0fo23AcJa1GQnEqDqj5g6eJmRl+1q8PernZjwZwZ1TV2KjrUpGUj13ZoE/FC2Z2ODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:15.933841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06442","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7ffb3e6612540def59bf8bba0540a27dd1cfd45d646a5c28ce712098c349920","sha256:de89582949d3c242bd5ccded7daad8204dcd558ed970a1347c06ef19880b0cd8"],"state_sha256":"6db164a519d10f3c497ce172fa86ca850f0b97a48d32fe65909331a9e4227f0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlyR3+r9XqsQ2pqvif2NuuaqcyH6T7k6DO5d4BjuV49w8BjGAMvXoRNAeYOfWwajqYMvKPGszL/dshcXKl1dCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:36:02.936348Z","bundle_sha256":"d0ebf42b0a19c9b1c9f9abc8cb600ddb783063b8e015ef95611f641a897c73e0"}}