{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:VYCQCX5HNMO43W3PHRZWM7XGDL","short_pith_number":"pith:VYCQCX5H","canonical_record":{"source":{"id":"0808.0513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-08-04T21:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"7ba1397737c5126b447ba089f6c8b9a3cf670eb1a2258e663558fa768aa06c1a","abstract_canon_sha256":"66b0f1ac73aa82f1d38dde3fab6f4e22dfafa1904f0efa8fe63b4e8c06b7a596"},"schema_version":"1.0"},"canonical_sha256":"ae05015fa76b1dcddb6f3c73667ee61ac7930ba44c70ecda152ae4da6eb1f277","source":{"kind":"arxiv","id":"0808.0513","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0513","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0513v3","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0513","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"VYCQCX5HNMO4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"VYCQCX5HNMO43W3P","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"VYCQCX5H","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:VYCQCX5HNMO43W3PHRZWM7XGDL","target":"record","payload":{"canonical_record":{"source":{"id":"0808.0513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-08-04T21:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"7ba1397737c5126b447ba089f6c8b9a3cf670eb1a2258e663558fa768aa06c1a","abstract_canon_sha256":"66b0f1ac73aa82f1d38dde3fab6f4e22dfafa1904f0efa8fe63b4e8c06b7a596"},"schema_version":"1.0"},"canonical_sha256":"ae05015fa76b1dcddb6f3c73667ee61ac7930ba44c70ecda152ae4da6eb1f277","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.462646Z","signature_b64":"NB8RBag0BLaRkVClQOfMNFHIofHvsMe4MshSMr2nYDPQhPLc//FL5IuM8WceSVBh9lSD/6rrjiqX12v8QoFdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae05015fa76b1dcddb6f3c73667ee61ac7930ba44c70ecda152ae4da6eb1f277","last_reissued_at":"2026-05-18T04:18:15.462238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.462238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.0513","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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfNod/8TQnp0HX8GeWk0vrtcVdTO/ZZK+ZYRvGW66rYvB4KoBvPGNpP3EXUdrz5oRvQo6P32G6TOjrx2YoJCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:09:11.362338Z"},"content_sha256":"94a4e0e609207fe7fc323aa995fa4ccdefd37aaf13401c82a8e5224126bd46a3","schema_version":"1.0","event_id":"sha256:94a4e0e609207fe7fc323aa995fa4ccdefd37aaf13401c82a8e5224126bd46a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:VYCQCX5HNMO43W3PHRZWM7XGDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Series Jackson networks and non-crossing probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A.B. Dieker, J. Warren","submitted_at":"2008-08-04T21:15:04Z","abstract_excerpt":"This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that questions on time-dependent queueing behavior are translated to questions on non-crossing probabilities. This makes previous work on non-crossing probabilities relevant to queueing systems and allows new queueing results to be established. To illustrate the latter, we prove that the relaxation time (i.e., the reciprocal of the `spectral gap') of a positive recurrent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0513","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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVYk8UgIbWj5INsQvDmZeqfyFlhAM5kVp2WWcpayR/IGM5gbjThUyKAcSaEsdfKc299p+4h5G/HWMxJgpxS+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:09:11.362675Z"},"content_sha256":"288d527f7b68cce69d0d030eed3fa43f3df5319768603d78e00a25dbc4f4fe01","schema_version":"1.0","event_id":"sha256:288d527f7b68cce69d0d030eed3fa43f3df5319768603d78e00a25dbc4f4fe01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/bundle.json","state_url":"https://pith.science/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/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-20T18:09:11Z","links":{"resolver":"https://pith.science/pith/VYCQCX5HNMO43W3PHRZWM7XGDL","bundle":"https://pith.science/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/bundle.json","state":"https://pith.science/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYCQCX5HNMO43W3PHRZWM7XGDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:VYCQCX5HNMO43W3PHRZWM7XGDL","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":"66b0f1ac73aa82f1d38dde3fab6f4e22dfafa1904f0efa8fe63b4e8c06b7a596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-08-04T21:15:04Z","title_canon_sha256":"7ba1397737c5126b447ba089f6c8b9a3cf670eb1a2258e663558fa768aa06c1a"},"schema_version":"1.0","source":{"id":"0808.0513","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0513","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0513v3","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0513","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"VYCQCX5HNMO4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"VYCQCX5HNMO43W3P","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"VYCQCX5H","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:288d527f7b68cce69d0d030eed3fa43f3df5319768603d78e00a25dbc4f4fe01","target":"graph","created_at":"2026-05-18T04:18: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":"This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that questions on time-dependent queueing behavior are translated to questions on non-crossing probabilities. This makes previous work on non-crossing probabilities relevant to queueing systems and allows new queueing results to be established. To illustrate the latter, we prove that the relaxation time (i.e., the reciprocal of the `spectral gap') of a positive recurrent","authors_text":"A.B. Dieker, J. Warren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-08-04T21:15:04Z","title":"Series Jackson networks and non-crossing probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0513","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:94a4e0e609207fe7fc323aa995fa4ccdefd37aaf13401c82a8e5224126bd46a3","target":"record","created_at":"2026-05-18T04:18: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":"66b0f1ac73aa82f1d38dde3fab6f4e22dfafa1904f0efa8fe63b4e8c06b7a596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-08-04T21:15:04Z","title_canon_sha256":"7ba1397737c5126b447ba089f6c8b9a3cf670eb1a2258e663558fa768aa06c1a"},"schema_version":"1.0","source":{"id":"0808.0513","kind":"arxiv","version":3}},"canonical_sha256":"ae05015fa76b1dcddb6f3c73667ee61ac7930ba44c70ecda152ae4da6eb1f277","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae05015fa76b1dcddb6f3c73667ee61ac7930ba44c70ecda152ae4da6eb1f277","first_computed_at":"2026-05-18T04:18:15.462238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:15.462238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NB8RBag0BLaRkVClQOfMNFHIofHvsMe4MshSMr2nYDPQhPLc//FL5IuM8WceSVBh9lSD/6rrjiqX12v8QoFdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:15.462646Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.0513","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94a4e0e609207fe7fc323aa995fa4ccdefd37aaf13401c82a8e5224126bd46a3","sha256:288d527f7b68cce69d0d030eed3fa43f3df5319768603d78e00a25dbc4f4fe01"],"state_sha256":"4e325ac5184ddb690479febf8815d583bdbb917e6675a2bbf5b23d264d91bd6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+QbUTBAGcCH8jw1aexnam3yarC+IfqYfRdVfbY6T6HCKr2wquXtmIdEqO+gWn/M+yzdRQ/hIINq5mYspAFfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:09:11.364450Z","bundle_sha256":"89402b72eb0323fa7f2d521b37b7670aeec4818d7371a6e21e0481e2ffe8657b"}}