{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2SXDLDAGYUIE2YQEYSZZHNJNZS","short_pith_number":"pith:2SXDLDAG","canonical_record":{"source":{"id":"1505.03774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-14T16:02:12Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"401b322e4bd6e93d502061fb1d6a93a3d7673a8e16281b5afa12014497558df9","abstract_canon_sha256":"0a6fd51506d7e2875876e203e8219a314fdec578284effebfa0c9cced652ab3d"},"schema_version":"1.0"},"canonical_sha256":"d4ae358c06c5104d6204c4b393b52dcc97d51d6281f9e754b8794af61660affb","source":{"kind":"arxiv","id":"1505.03774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03774","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03774v1","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03774","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"2SXDLDAGYUIE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SXDLDAGYUIE2YQE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SXDLDAG","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2SXDLDAGYUIE2YQEYSZZHNJNZS","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-14T16:02:12Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"401b322e4bd6e93d502061fb1d6a93a3d7673a8e16281b5afa12014497558df9","abstract_canon_sha256":"0a6fd51506d7e2875876e203e8219a314fdec578284effebfa0c9cced652ab3d"},"schema_version":"1.0"},"canonical_sha256":"d4ae358c06c5104d6204c4b393b52dcc97d51d6281f9e754b8794af61660affb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:53.117310Z","signature_b64":"c+himniSXOuKgs9RmA6Qwq07dEd47nNXNZFCrO6zkdElolNiDabwgekRrSKLI1LbP6BZHqFG3nVf/du0DaraDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4ae358c06c5104d6204c4b393b52dcc97d51d6281f9e754b8794af61660affb","last_reissued_at":"2026-05-18T02:09:53.116662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:53.116662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03774","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-18T02:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+rYHmyhjZPI7S7vjvTCIo4bj+lmFVJZrHQ6XXki78inK2L/aRSWE5S5lMs97/dVyvIQvwGwzTGKdr/J5rbIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:45:48.879806Z"},"content_sha256":"e77871f5c217da3108f9e4bd176e2c694e87cf0a68fc98c00aff70b6b6b129a4","schema_version":"1.0","event_id":"sha256:e77871f5c217da3108f9e4bd176e2c694e87cf0a68fc98c00aff70b6b6b129a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2SXDLDAGYUIE2YQEYSZZHNJNZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Cong Shi, Retsef Levi","submitted_at":"2015-05-14T16:02:12Z","abstract_excerpt":"We consider a class of well-known dynamic resource allocation models in loss network systems with advanced reservation. The most important performance measure in any loss network system is to compute its blocking probability, i.e., the probability of an arriving customer in equilibrium finds a fully utilized system (thereby getting rejected by the system). In this paper, we derive upper bounds on the asymptotic blocking probabilities for such systems in high-volume regimes. There have been relatively few results on loss network systems with advanced reservation due to its inherent complexity. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03774","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-18T02:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xPM05ZN4tx75XNGwV0l5EfYCUsI2clTY9vDYLm2TSnYmT5JMyc+p9TsQMDQb0fatQXAk/vi7b3Q7IcO2aW5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:45:48.880355Z"},"content_sha256":"9de19946b658d1da42f775678a17933ad155c9f7832611ab845314c6381dadd8","schema_version":"1.0","event_id":"sha256:9de19946b658d1da42f775678a17933ad155c9f7832611ab845314c6381dadd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/bundle.json","state_url":"https://pith.science/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/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-06T20:45:48Z","links":{"resolver":"https://pith.science/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS","bundle":"https://pith.science/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/bundle.json","state":"https://pith.science/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SXDLDAGYUIE2YQEYSZZHNJNZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2SXDLDAGYUIE2YQEYSZZHNJNZS","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":"0a6fd51506d7e2875876e203e8219a314fdec578284effebfa0c9cced652ab3d","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-14T16:02:12Z","title_canon_sha256":"401b322e4bd6e93d502061fb1d6a93a3d7673a8e16281b5afa12014497558df9"},"schema_version":"1.0","source":{"id":"1505.03774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03774","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03774v1","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03774","created_at":"2026-05-18T02:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"2SXDLDAGYUIE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SXDLDAGYUIE2YQE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SXDLDAG","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:9de19946b658d1da42f775678a17933ad155c9f7832611ab845314c6381dadd8","target":"graph","created_at":"2026-05-18T02:09:53Z","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 class of well-known dynamic resource allocation models in loss network systems with advanced reservation. The most important performance measure in any loss network system is to compute its blocking probability, i.e., the probability of an arriving customer in equilibrium finds a fully utilized system (thereby getting rejected by the system). In this paper, we derive upper bounds on the asymptotic blocking probabilities for such systems in high-volume regimes. There have been relatively few results on loss network systems with advanced reservation due to its inherent complexity. ","authors_text":"Cong Shi, Retsef Levi","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-14T16:02:12Z","title":"Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03774","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:e77871f5c217da3108f9e4bd176e2c694e87cf0a68fc98c00aff70b6b6b129a4","target":"record","created_at":"2026-05-18T02:09:53Z","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":"0a6fd51506d7e2875876e203e8219a314fdec578284effebfa0c9cced652ab3d","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-14T16:02:12Z","title_canon_sha256":"401b322e4bd6e93d502061fb1d6a93a3d7673a8e16281b5afa12014497558df9"},"schema_version":"1.0","source":{"id":"1505.03774","kind":"arxiv","version":1}},"canonical_sha256":"d4ae358c06c5104d6204c4b393b52dcc97d51d6281f9e754b8794af61660affb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4ae358c06c5104d6204c4b393b52dcc97d51d6281f9e754b8794af61660affb","first_computed_at":"2026-05-18T02:09:53.116662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:53.116662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c+himniSXOuKgs9RmA6Qwq07dEd47nNXNZFCrO6zkdElolNiDabwgekRrSKLI1LbP6BZHqFG3nVf/du0DaraDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:53.117310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e77871f5c217da3108f9e4bd176e2c694e87cf0a68fc98c00aff70b6b6b129a4","sha256:9de19946b658d1da42f775678a17933ad155c9f7832611ab845314c6381dadd8"],"state_sha256":"303407be03e0f6a0e00f8a0a6f04cc619afc12862afb2309662cda39334a78d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Boz3x5IQ1mgVz1GnFXXT6ttXarwgp0eDB/HURxirOoA38DyusY9YpdL+ycnzreyVgAnEwbsCX6MoOvqjglBXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:45:48.883027Z","bundle_sha256":"a88ac282d4315de57d22acd23c0a9645b8a8547e07fdf1ae37d38f5f2af5bc1d"}}