{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YZRWWXERMBW3OEK5C5Q4FRSGFR","short_pith_number":"pith:YZRWWXER","canonical_record":{"source":{"id":"1312.4088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-14T21:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"b75762565a806798d80f4d74af89bfa6a6efd286d01b1a4af89b1dd1733f0d0d","abstract_canon_sha256":"c26e20283524323402f15d544e92e04663adfc32c7e62efa8a4e9df3fe71ddd8"},"schema_version":"1.0"},"canonical_sha256":"c6636b5c91606db7115d1761c2c6462c40940cc42f6e2b94af85d49ccfe3c0f4","source":{"kind":"arxiv","id":"1312.4088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4088","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4088v1","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4088","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"YZRWWXERMBW3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZRWWXERMBW3OEK5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZRWWXER","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YZRWWXERMBW3OEK5C5Q4FRSGFR","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-14T21:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"b75762565a806798d80f4d74af89bfa6a6efd286d01b1a4af89b1dd1733f0d0d","abstract_canon_sha256":"c26e20283524323402f15d544e92e04663adfc32c7e62efa8a4e9df3fe71ddd8"},"schema_version":"1.0"},"canonical_sha256":"c6636b5c91606db7115d1761c2c6462c40940cc42f6e2b94af85d49ccfe3c0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:35.804827Z","signature_b64":"EeLsxIj7d8HU942ka6FHJSC2cJ4C+P8WtEicTHT3gzAvdsGqNZ0xaG1OgZTT8IIixK2kKOUMxYORtKZ5z//PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6636b5c91606db7115d1761c2c6462c40940cc42f6e2b94af85d49ccfe3c0f4","last_reissued_at":"2026-05-18T03:04:35.803899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:35.803899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4088","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-18T03:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXzz3aHW49+ityk1Pz5reJyH1zTmmyVjbqtZ6Rnpx/fYMtcpxvcNanlbc/FJ6yTzUNuxJPvRk4Aw5cD3+8YMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:12:06.082219Z"},"content_sha256":"f453656fd6509fe8c65c9f5d6b462d348349357dcdbd5ff42efd3b8b24d8214e","schema_version":"1.0","event_id":"sha256:f453656fd6509fe8c65c9f5d6b462d348349357dcdbd5ff42efd3b8b24d8214e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YZRWWXERMBW3OEK5C5Q4FRSGFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect sampling for infinite server and loss systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jing Dong, Jose Blanchet","submitted_at":"2013-12-14T21:12:03Z","abstract_excerpt":"We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a stationary infinite server queue backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We use the infinite server queue as an upper bound process to simulate loss systems. The running time analysis of our perfect sampling algorithm for loss systems i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4088","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-18T03:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyHffjGMWZVSw3be+tD5E2GjHs/UWfDJC2qb4ARdvtcBiB0xDCKxHWKOa2s4kHmHrsE2u/SjA608IFk0ae3fBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:12:06.083048Z"},"content_sha256":"7d55b0860ff5ebbbeec27fb20d247ac4f6c5f01f2f515e66c1717cbecdf4dc91","schema_version":"1.0","event_id":"sha256:7d55b0860ff5ebbbeec27fb20d247ac4f6c5f01f2f515e66c1717cbecdf4dc91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/bundle.json","state_url":"https://pith.science/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/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-31T05:12:06Z","links":{"resolver":"https://pith.science/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR","bundle":"https://pith.science/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/bundle.json","state":"https://pith.science/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZRWWXERMBW3OEK5C5Q4FRSGFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YZRWWXERMBW3OEK5C5Q4FRSGFR","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":"c26e20283524323402f15d544e92e04663adfc32c7e62efa8a4e9df3fe71ddd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-14T21:12:03Z","title_canon_sha256":"b75762565a806798d80f4d74af89bfa6a6efd286d01b1a4af89b1dd1733f0d0d"},"schema_version":"1.0","source":{"id":"1312.4088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4088","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4088v1","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4088","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"YZRWWXERMBW3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZRWWXERMBW3OEK5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZRWWXER","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:7d55b0860ff5ebbbeec27fb20d247ac4f6c5f01f2f515e66c1717cbecdf4dc91","target":"graph","created_at":"2026-05-18T03:04:35Z","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 present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a stationary infinite server queue backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We use the infinite server queue as an upper bound process to simulate loss systems. The running time analysis of our perfect sampling algorithm for loss systems i","authors_text":"Jing Dong, Jose Blanchet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-14T21:12:03Z","title":"Perfect sampling for infinite server and loss systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4088","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:f453656fd6509fe8c65c9f5d6b462d348349357dcdbd5ff42efd3b8b24d8214e","target":"record","created_at":"2026-05-18T03:04:35Z","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":"c26e20283524323402f15d544e92e04663adfc32c7e62efa8a4e9df3fe71ddd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-14T21:12:03Z","title_canon_sha256":"b75762565a806798d80f4d74af89bfa6a6efd286d01b1a4af89b1dd1733f0d0d"},"schema_version":"1.0","source":{"id":"1312.4088","kind":"arxiv","version":1}},"canonical_sha256":"c6636b5c91606db7115d1761c2c6462c40940cc42f6e2b94af85d49ccfe3c0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6636b5c91606db7115d1761c2c6462c40940cc42f6e2b94af85d49ccfe3c0f4","first_computed_at":"2026-05-18T03:04:35.803899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:35.803899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EeLsxIj7d8HU942ka6FHJSC2cJ4C+P8WtEicTHT3gzAvdsGqNZ0xaG1OgZTT8IIixK2kKOUMxYORtKZ5z//PBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:35.804827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f453656fd6509fe8c65c9f5d6b462d348349357dcdbd5ff42efd3b8b24d8214e","sha256:7d55b0860ff5ebbbeec27fb20d247ac4f6c5f01f2f515e66c1717cbecdf4dc91"],"state_sha256":"d423eb1ffed32f625cd4a5945f23c1db47916c4b46760eac32f3a89572579dca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7suBOuirjtkRJZTqNoHUG0vDPMr8vthAlAHze3sYFWvK04tXOHJxGQzn/oRrcH+52R/y0316bY0O+85au5yCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:12:06.087467Z","bundle_sha256":"e761b1d56a99f08fde8667e197f79093d44d64c996a312e06d9ac4848dcfeb1e"}}