{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6AB4K4TF4BSQKQBFSLNZZESSK3","short_pith_number":"pith:6AB4K4TF","canonical_record":{"source":{"id":"1307.5424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-20T13:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"05083f00adb6f0d0d669a26973a1948d8e89c76241d34ffa9b6a0892e8a90833","abstract_canon_sha256":"1cc05f8b7348d36874583f7ded6a7ce4bd5db95137ad79ceddf82842948e1cdf"},"schema_version":"1.0"},"canonical_sha256":"f003c57265e06505402592db9c925256e82c8a2ff54aa8ced81f89ae14da1b56","source":{"kind":"arxiv","id":"1307.5424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5424","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5424v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5424","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"6AB4K4TF4BSQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6AB4K4TF4BSQKQBF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6AB4K4TF","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6AB4K4TF4BSQKQBFSLNZZESSK3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-20T13:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"05083f00adb6f0d0d669a26973a1948d8e89c76241d34ffa9b6a0892e8a90833","abstract_canon_sha256":"1cc05f8b7348d36874583f7ded6a7ce4bd5db95137ad79ceddf82842948e1cdf"},"schema_version":"1.0"},"canonical_sha256":"f003c57265e06505402592db9c925256e82c8a2ff54aa8ced81f89ae14da1b56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:46.068283Z","signature_b64":"x7cD1MNNpEvyN9FOaq2yoeLan/O7G7YYp2uDEFEyNSIyDHEmBvIOhsOJ+oZDRnwp8xI+OH4FyzF4T3FXaiZVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f003c57265e06505402592db9c925256e82c8a2ff54aa8ced81f89ae14da1b56","last_reissued_at":"2026-05-18T03:17:46.067633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:46.067633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5424","source_version":2,"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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsdVqYe5eA9L6kLmpq42DZ28jORt4h7SWwvfNWuXstdY3GuYbX/1YoEAQb+0HCaGsAla/4769TBEECCHI/TAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:41:20.745882Z"},"content_sha256":"86ba5be403165097a303175e0f58a9fbb97ddc5d95ac87e4e09dc95d6758e5e9","schema_version":"1.0","event_id":"sha256:86ba5be403165097a303175e0f58a9fbb97ddc5d95ac87e4e09dc95d6758e5e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6AB4K4TF4BSQKQBFSLNZZESSK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sandeep Juneja, Sarat Babu Moka","submitted_at":"2013-07-20T13:36:52Z","abstract_excerpt":"Multiclass open queueing networks find wide applications in communication, computer and fabrication networks. Often one is interested in steady-state performance measures associated with these networks. Conceptually, under mild conditions, a regenerative structure exists in multiclass networks, making them amenable to regenerative simulation for estimating the steady-state performance measures. However, typically, identification of a regenerative structure in these networks is difficult. A well known exception is when all the interarrival times are exponentially distributed, where the instants"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5424","kind":"arxiv","version":2},"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-18T03:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWQf52Mgd2LF/QWKCjjff0OojrYaeC+zF0o2YdLqySyVTQdp9wM0XF6A5QwUibtlPJZzkp8uw3I28J2ABpxdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:41:20.746272Z"},"content_sha256":"cb2bebfae84b0076645a315b4eea12170ba7c4dcb7f74dce3b4b731da5806df4","schema_version":"1.0","event_id":"sha256:cb2bebfae84b0076645a315b4eea12170ba7c4dcb7f74dce3b4b731da5806df4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/bundle.json","state_url":"https://pith.science/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/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-12T10:41:20Z","links":{"resolver":"https://pith.science/pith/6AB4K4TF4BSQKQBFSLNZZESSK3","bundle":"https://pith.science/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/bundle.json","state":"https://pith.science/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AB4K4TF4BSQKQBFSLNZZESSK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6AB4K4TF4BSQKQBFSLNZZESSK3","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":"1cc05f8b7348d36874583f7ded6a7ce4bd5db95137ad79ceddf82842948e1cdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-20T13:36:52Z","title_canon_sha256":"05083f00adb6f0d0d669a26973a1948d8e89c76241d34ffa9b6a0892e8a90833"},"schema_version":"1.0","source":{"id":"1307.5424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5424","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5424v2","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5424","created_at":"2026-05-18T03:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"6AB4K4TF4BSQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6AB4K4TF4BSQKQBF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6AB4K4TF","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:cb2bebfae84b0076645a315b4eea12170ba7c4dcb7f74dce3b4b731da5806df4","target":"graph","created_at":"2026-05-18T03:17:46Z","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":"Multiclass open queueing networks find wide applications in communication, computer and fabrication networks. Often one is interested in steady-state performance measures associated with these networks. Conceptually, under mild conditions, a regenerative structure exists in multiclass networks, making them amenable to regenerative simulation for estimating the steady-state performance measures. However, typically, identification of a regenerative structure in these networks is difficult. A well known exception is when all the interarrival times are exponentially distributed, where the instants","authors_text":"Sandeep Juneja, Sarat Babu Moka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-20T13:36:52Z","title":"Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5424","kind":"arxiv","version":2},"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:86ba5be403165097a303175e0f58a9fbb97ddc5d95ac87e4e09dc95d6758e5e9","target":"record","created_at":"2026-05-18T03:17:46Z","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":"1cc05f8b7348d36874583f7ded6a7ce4bd5db95137ad79ceddf82842948e1cdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-20T13:36:52Z","title_canon_sha256":"05083f00adb6f0d0d669a26973a1948d8e89c76241d34ffa9b6a0892e8a90833"},"schema_version":"1.0","source":{"id":"1307.5424","kind":"arxiv","version":2}},"canonical_sha256":"f003c57265e06505402592db9c925256e82c8a2ff54aa8ced81f89ae14da1b56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f003c57265e06505402592db9c925256e82c8a2ff54aa8ced81f89ae14da1b56","first_computed_at":"2026-05-18T03:17:46.067633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:46.067633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x7cD1MNNpEvyN9FOaq2yoeLan/O7G7YYp2uDEFEyNSIyDHEmBvIOhsOJ+oZDRnwp8xI+OH4FyzF4T3FXaiZVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:46.068283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ba5be403165097a303175e0f58a9fbb97ddc5d95ac87e4e09dc95d6758e5e9","sha256:cb2bebfae84b0076645a315b4eea12170ba7c4dcb7f74dce3b4b731da5806df4"],"state_sha256":"a4880db930dee3b2c1550a249efa41c82794e321e919d3db61879d65ed24fb5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UB8Q0G4Wv11n7rPfThO7YigBYgXE3uRwnJGKKVhQvkBWwTBDC03+iJZ/eT2EiowDoMm456j3Izata0B4d3mODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:41:20.749272Z","bundle_sha256":"a13c18df5115e24c387524fb0d8da5e19fba281dce8e4693f70aae3239c313db"}}