{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RPJCZNQM3WJI6JDPDL6IOPNJSH","short_pith_number":"pith:RPJCZNQM","canonical_record":{"source":{"id":"1708.05921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-20T01:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"ffa3add399f5244c3d990ac39d7e6c1d9e700b630cd16c1e190e66677bdc7238","abstract_canon_sha256":"4aaf85530d03935a67bd29d36ff47591ec7db2c9432f5890c28f3a496d2beca4"},"schema_version":"1.0"},"canonical_sha256":"8bd22cb60cdd928f246f1afc873da991f679af834726951dfbe6dcea1330ab00","source":{"kind":"arxiv","id":"1708.05921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05921","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05921v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05921","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"RPJCZNQM3WJI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RPJCZNQM3WJI6JDP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RPJCZNQM","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RPJCZNQM3WJI6JDPDL6IOPNJSH","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-20T01:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"ffa3add399f5244c3d990ac39d7e6c1d9e700b630cd16c1e190e66677bdc7238","abstract_canon_sha256":"4aaf85530d03935a67bd29d36ff47591ec7db2c9432f5890c28f3a496d2beca4"},"schema_version":"1.0"},"canonical_sha256":"8bd22cb60cdd928f246f1afc873da991f679af834726951dfbe6dcea1330ab00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.787299Z","signature_b64":"bVSjlOoqKGca1qqxVss1azHRDjaHkie7dF6IYj08UBOEsJTNqGIi7dFkCT9gf9G1V5bf4wRvYOsAiHK0rEPVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd22cb60cdd928f246f1afc873da991f679af834726951dfbe6dcea1330ab00","last_reissued_at":"2026-05-18T00:37:43.786624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.786624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05921","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwTf5yqR3B2rCzESnvQHuq048mRohJEdk3/dp8Cpz7Do1K/OhTrF/ptUZjjCHTzM5IdmA2BWORHmb0sBb21uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:46.580264Z"},"content_sha256":"81c30c8ff97829bf21c44bcafb38f5e33a6fcd03bfb2656fcdf99e189fbb6b10","schema_version":"1.0","event_id":"sha256:81c30c8ff97829bf21c44bcafb38f5e33a6fcd03bfb2656fcdf99e189fbb6b10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RPJCZNQM3WJI6JDPDL6IOPNJSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transitory Queueing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Harsha Honnappa, Rahul Jain","submitted_at":"2017-08-20T01:48:20Z","abstract_excerpt":"Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on Markovian networks, with the recent exception of work in Liu and Whitt (2011) and Mandelbaum and Ramanan (2010). In this paper, we introduce transitory queueing networks as a model of inhomogeneous queueing networks, where a large, but finite, number of jobs arrive at queues in the network over a fixed time horizon. The queues offer FIFO service, and we assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05921","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRztyBeSRIpdF97JAgsWLh4yoUkf7lH7Lh+bujwFh8Gjj276jiWc3WEJAMBUkCQClKFrF2MEZvrrUGDGGy4wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:46.580992Z"},"content_sha256":"594acd2bae54e96943d9060aca5796aa905e8d56a8baeabf50ff52b738da80ae","schema_version":"1.0","event_id":"sha256:594acd2bae54e96943d9060aca5796aa905e8d56a8baeabf50ff52b738da80ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/bundle.json","state_url":"https://pith.science/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/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-25T13:23:46Z","links":{"resolver":"https://pith.science/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH","bundle":"https://pith.science/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/bundle.json","state":"https://pith.science/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPJCZNQM3WJI6JDPDL6IOPNJSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RPJCZNQM3WJI6JDPDL6IOPNJSH","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":"4aaf85530d03935a67bd29d36ff47591ec7db2c9432f5890c28f3a496d2beca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-20T01:48:20Z","title_canon_sha256":"ffa3add399f5244c3d990ac39d7e6c1d9e700b630cd16c1e190e66677bdc7238"},"schema_version":"1.0","source":{"id":"1708.05921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05921","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05921v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05921","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"RPJCZNQM3WJI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RPJCZNQM3WJI6JDP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RPJCZNQM","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:594acd2bae54e96943d9060aca5796aa905e8d56a8baeabf50ff52b738da80ae","target":"graph","created_at":"2026-05-18T00:37:43Z","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":"Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on Markovian networks, with the recent exception of work in Liu and Whitt (2011) and Mandelbaum and Ramanan (2010). In this paper, we introduce transitory queueing networks as a model of inhomogeneous queueing networks, where a large, but finite, number of jobs arrive at queues in the network over a fixed time horizon. The queues offer FIFO service, and we assum","authors_text":"Harsha Honnappa, Rahul Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-20T01:48:20Z","title":"Transitory Queueing Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05921","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:81c30c8ff97829bf21c44bcafb38f5e33a6fcd03bfb2656fcdf99e189fbb6b10","target":"record","created_at":"2026-05-18T00:37:43Z","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":"4aaf85530d03935a67bd29d36ff47591ec7db2c9432f5890c28f3a496d2beca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-20T01:48:20Z","title_canon_sha256":"ffa3add399f5244c3d990ac39d7e6c1d9e700b630cd16c1e190e66677bdc7238"},"schema_version":"1.0","source":{"id":"1708.05921","kind":"arxiv","version":1}},"canonical_sha256":"8bd22cb60cdd928f246f1afc873da991f679af834726951dfbe6dcea1330ab00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bd22cb60cdd928f246f1afc873da991f679af834726951dfbe6dcea1330ab00","first_computed_at":"2026-05-18T00:37:43.786624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.786624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bVSjlOoqKGca1qqxVss1azHRDjaHkie7dF6IYj08UBOEsJTNqGIi7dFkCT9gf9G1V5bf4wRvYOsAiHK0rEPVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.787299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81c30c8ff97829bf21c44bcafb38f5e33a6fcd03bfb2656fcdf99e189fbb6b10","sha256:594acd2bae54e96943d9060aca5796aa905e8d56a8baeabf50ff52b738da80ae"],"state_sha256":"98d5346fc89683fe10e5d08d1da9e8491aaa09ad9913516e4175ced329a1ade2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbCI1u7+cuqN/H7nS4hT2/yivcAgGrUqBT5gvHQLuwWzhhidWwbxamuhFcwbrrcHbhWtHCg3sCJWVUWsb1J2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:23:46.584811Z","bundle_sha256":"b035fdae2b0cd773bd4a21c861990cbcef0786591747a55dfb2294b7c121d6a7"}}