{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GE54EBTCMK5FO5SAZLPEOCEUYY","short_pith_number":"pith:GE54EBTC","canonical_record":{"source":{"id":"1702.01778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-06T20:05:05Z","cross_cats_sorted":[],"title_canon_sha256":"5b5da4ff32ea5abe961e801a8c036b74d49a53c148560a29534442508a39127d","abstract_canon_sha256":"a8520329e35de546d563ef1f8e24e3d4089c482fe8ad91e78f60c5835fe9a0f4"},"schema_version":"1.0"},"canonical_sha256":"313bc2066262ba577640cade470894c612d50f4f575d3417f4d7a16f1140068d","source":{"kind":"arxiv","id":"1702.01778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01778","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01778v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01778","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"GE54EBTCMK5F","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GE54EBTCMK5FO5SA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GE54EBTC","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GE54EBTCMK5FO5SAZLPEOCEUYY","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-06T20:05:05Z","cross_cats_sorted":[],"title_canon_sha256":"5b5da4ff32ea5abe961e801a8c036b74d49a53c148560a29534442508a39127d","abstract_canon_sha256":"a8520329e35de546d563ef1f8e24e3d4089c482fe8ad91e78f60c5835fe9a0f4"},"schema_version":"1.0"},"canonical_sha256":"313bc2066262ba577640cade470894c612d50f4f575d3417f4d7a16f1140068d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:11.333474Z","signature_b64":"Wu3fjEWgBGH1Sf+utg2SQ+FVZ+2gJAZTr2kukSlwsDnDMcPJFzy2IldNjQbTbN83mFDPz17bLnWKAIjUx7/FBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"313bc2066262ba577640cade470894c612d50f4f575d3417f4d7a16f1140068d","last_reissued_at":"2026-05-18T00:51:11.332758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:11.332758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01778","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:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIW/zQC4e91XoaKgbLB6qTa+X28+YFpQ6uCNuKYfQ8E3xhKCNwAtj9mqa+yeBF/h3pUYa82kP/hHBWR7MeCWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:25:49.640330Z"},"content_sha256":"b5e4ecfdf6d8dbb848019d4b048111e59e76a1b3e5fd92a9f283f39039a0cf7e","schema_version":"1.0","event_id":"sha256:b5e4ecfdf6d8dbb848019d4b048111e59e76a1b3e5fd92a9f283f39039a0cf7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GE54EBTCMK5FO5SAZLPEOCEUYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heavy Traffic Limit for a Tandem Queue with Identical Service Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Bert Zwart, Bryce Terwilliger, H. Christian Gromoll","submitted_at":"2017-02-06T20:05:05Z","abstract_excerpt":"We consider a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate the amount of work in the second queue at certain embedded arrival time points, namely when the upstream queue has just emptied. We focus on the case of infinite-variance service times and obtain a heavy traffic process limit for the embedded Markov chain."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01778","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:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKzTLmcRQzqqEipWCJ8uDa1A0Vaznk76fjb5+8VVhlRieVqFrJHuUpBzVW4Sl3AoNkM8nktEPyUYSvgSJ3B8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:25:49.641050Z"},"content_sha256":"8abf547338133b5c6857d575f43138088eb7f04d53c0e21ced26253a1a0c6e55","schema_version":"1.0","event_id":"sha256:8abf547338133b5c6857d575f43138088eb7f04d53c0e21ced26253a1a0c6e55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/bundle.json","state_url":"https://pith.science/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/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-09T04:25:49Z","links":{"resolver":"https://pith.science/pith/GE54EBTCMK5FO5SAZLPEOCEUYY","bundle":"https://pith.science/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/bundle.json","state":"https://pith.science/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GE54EBTCMK5FO5SAZLPEOCEUYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GE54EBTCMK5FO5SAZLPEOCEUYY","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":"a8520329e35de546d563ef1f8e24e3d4089c482fe8ad91e78f60c5835fe9a0f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-06T20:05:05Z","title_canon_sha256":"5b5da4ff32ea5abe961e801a8c036b74d49a53c148560a29534442508a39127d"},"schema_version":"1.0","source":{"id":"1702.01778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01778","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01778v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01778","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"GE54EBTCMK5F","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GE54EBTCMK5FO5SA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GE54EBTC","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8abf547338133b5c6857d575f43138088eb7f04d53c0e21ced26253a1a0c6e55","target":"graph","created_at":"2026-05-18T00:51:11Z","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 a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate the amount of work in the second queue at certain embedded arrival time points, namely when the upstream queue has just emptied. We focus on the case of infinite-variance service times and obtain a heavy traffic process limit for the embedded Markov chain.","authors_text":"Bert Zwart, Bryce Terwilliger, H. Christian Gromoll","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-06T20:05:05Z","title":"Heavy Traffic Limit for a Tandem Queue with Identical Service Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01778","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:b5e4ecfdf6d8dbb848019d4b048111e59e76a1b3e5fd92a9f283f39039a0cf7e","target":"record","created_at":"2026-05-18T00:51:11Z","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":"a8520329e35de546d563ef1f8e24e3d4089c482fe8ad91e78f60c5835fe9a0f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-06T20:05:05Z","title_canon_sha256":"5b5da4ff32ea5abe961e801a8c036b74d49a53c148560a29534442508a39127d"},"schema_version":"1.0","source":{"id":"1702.01778","kind":"arxiv","version":1}},"canonical_sha256":"313bc2066262ba577640cade470894c612d50f4f575d3417f4d7a16f1140068d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"313bc2066262ba577640cade470894c612d50f4f575d3417f4d7a16f1140068d","first_computed_at":"2026-05-18T00:51:11.332758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:11.332758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wu3fjEWgBGH1Sf+utg2SQ+FVZ+2gJAZTr2kukSlwsDnDMcPJFzy2IldNjQbTbN83mFDPz17bLnWKAIjUx7/FBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:11.333474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5e4ecfdf6d8dbb848019d4b048111e59e76a1b3e5fd92a9f283f39039a0cf7e","sha256:8abf547338133b5c6857d575f43138088eb7f04d53c0e21ced26253a1a0c6e55"],"state_sha256":"9be4ce6ba927e2e0eec095da1f126cc383d2a3fe5aa828df380746c943af4355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8gqW6tpoHg1ZmvLveOfrzO5g0k6HnkbB9VAz9wdf1MP7iNvSF4qKojHRukDS0EklfdqVSSiLCDnKkB+QZjWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:25:49.645262Z","bundle_sha256":"18a7f481df896c72b853bde24e4330c996a3b6043c02c87403439bba843e0aa6"}}