{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NXP2WVF44KN7FK325UMXUPBGBM","short_pith_number":"pith:NXP2WVF4","canonical_record":{"source":{"id":"1609.05750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-09-16T06:09:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f800dd519253e2eb5e1eb79efc94ebc94472c57a8fedd7a961e6f8fbe3c144d9","abstract_canon_sha256":"9aeaef451cc07db0ce540669b983a7ec828247f4468960eee1083f728471122c"},"schema_version":"1.0"},"canonical_sha256":"6ddfab54bce29bf2ab7aed197a3c260b0bafbe329171e18524622cbf8b5a76cd","source":{"kind":"arxiv","id":"1609.05750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05750","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05750v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05750","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"NXP2WVF44KN7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NXP2WVF44KN7FK32","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NXP2WVF4","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NXP2WVF44KN7FK325UMXUPBGBM","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-09-16T06:09:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f800dd519253e2eb5e1eb79efc94ebc94472c57a8fedd7a961e6f8fbe3c144d9","abstract_canon_sha256":"9aeaef451cc07db0ce540669b983a7ec828247f4468960eee1083f728471122c"},"schema_version":"1.0"},"canonical_sha256":"6ddfab54bce29bf2ab7aed197a3c260b0bafbe329171e18524622cbf8b5a76cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:25.403496Z","signature_b64":"ef7YcTkNCUZroxnnjND8uK5pjjo4Tnc4vjV5Ay+CBJHGrD+ACkBoPfS6G2kiUoo2GtWY8dAkaNfDkhz6MnRECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ddfab54bce29bf2ab7aed197a3c260b0bafbe329171e18524622cbf8b5a76cd","last_reissued_at":"2026-05-18T01:04:25.402790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:25.402790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05750","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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYw3nco1Ve+lwsefrGX21+5WUj9Xo74iNW+9cx0OQ3T6OFt8T247an7qYGb19y++wnUYlEPNlG6GQszjisfxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:05:20.785070Z"},"content_sha256":"bd383250db1958cbbf0395c565e426133a3777537faedba4fd9d73bfd404690a","schema_version":"1.0","event_id":"sha256:bd383250db1958cbbf0395c565e426133a3777537faedba4fd9d73bfd404690a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NXP2WVF44KN7FK325UMXUPBGBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite Server Queueing Networks with Deadline Based Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Neal Master, Nicholas Bambos","submitted_at":"2016-09-16T06:09:55Z","abstract_excerpt":"Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several independent service times (e.g. the minimum of the amount of time required to complete a transaction and a deadline). Furthermore, routing decisions depend on which of the independent service times achieves the minimum (e.g. exceeding a deadline will require the customer to be routed so they can re-attempt the transaction). Because current routing decisions ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05750","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-18T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCCcCUvhVS9diBcNS9YDUGPya6Gw+aPtGYnikvvqN3x3NpGrmK8aoCdEG0XEItMyFp9PzI27FyZQRRmcO7GxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:05:20.785803Z"},"content_sha256":"226d5199166432572104733cd8085acff5e3d264c27d5c413d83d707568c6657","schema_version":"1.0","event_id":"sha256:226d5199166432572104733cd8085acff5e3d264c27d5c413d83d707568c6657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXP2WVF44KN7FK325UMXUPBGBM/bundle.json","state_url":"https://pith.science/pith/NXP2WVF44KN7FK325UMXUPBGBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXP2WVF44KN7FK325UMXUPBGBM/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-11T02:05:20Z","links":{"resolver":"https://pith.science/pith/NXP2WVF44KN7FK325UMXUPBGBM","bundle":"https://pith.science/pith/NXP2WVF44KN7FK325UMXUPBGBM/bundle.json","state":"https://pith.science/pith/NXP2WVF44KN7FK325UMXUPBGBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXP2WVF44KN7FK325UMXUPBGBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NXP2WVF44KN7FK325UMXUPBGBM","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":"9aeaef451cc07db0ce540669b983a7ec828247f4468960eee1083f728471122c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-09-16T06:09:55Z","title_canon_sha256":"f800dd519253e2eb5e1eb79efc94ebc94472c57a8fedd7a961e6f8fbe3c144d9"},"schema_version":"1.0","source":{"id":"1609.05750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05750","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05750v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05750","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"NXP2WVF44KN7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NXP2WVF44KN7FK32","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NXP2WVF4","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:226d5199166432572104733cd8085acff5e3d264c27d5c413d83d707568c6657","target":"graph","created_at":"2026-05-18T01:04:25Z","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":"Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several independent service times (e.g. the minimum of the amount of time required to complete a transaction and a deadline). Furthermore, routing decisions depend on which of the independent service times achieves the minimum (e.g. exceeding a deadline will require the customer to be routed so they can re-attempt the transaction). Because current routing decisions ar","authors_text":"Neal Master, Nicholas Bambos","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-09-16T06:09:55Z","title":"Infinite Server Queueing Networks with Deadline Based Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05750","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:bd383250db1958cbbf0395c565e426133a3777537faedba4fd9d73bfd404690a","target":"record","created_at":"2026-05-18T01:04:25Z","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":"9aeaef451cc07db0ce540669b983a7ec828247f4468960eee1083f728471122c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-09-16T06:09:55Z","title_canon_sha256":"f800dd519253e2eb5e1eb79efc94ebc94472c57a8fedd7a961e6f8fbe3c144d9"},"schema_version":"1.0","source":{"id":"1609.05750","kind":"arxiv","version":1}},"canonical_sha256":"6ddfab54bce29bf2ab7aed197a3c260b0bafbe329171e18524622cbf8b5a76cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ddfab54bce29bf2ab7aed197a3c260b0bafbe329171e18524622cbf8b5a76cd","first_computed_at":"2026-05-18T01:04:25.402790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:25.402790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ef7YcTkNCUZroxnnjND8uK5pjjo4Tnc4vjV5Ay+CBJHGrD+ACkBoPfS6G2kiUoo2GtWY8dAkaNfDkhz6MnRECA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:25.403496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd383250db1958cbbf0395c565e426133a3777537faedba4fd9d73bfd404690a","sha256:226d5199166432572104733cd8085acff5e3d264c27d5c413d83d707568c6657"],"state_sha256":"00ad3da84122772478f4c65e0feca5b18206bed3d2eacc0ddeb8089ef3564c56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVNXhx1FbNPvtARswHzVpx4cFFzUNk0sFi0Qa7vjrHN1HW7nVlTN9BMAFrTf6KjUeD2MvQiNzcVkSQtEFXzuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:05:20.791617Z","bundle_sha256":"42f4037b78f48813e781a45bd14574de8d086c52675ff962b281c68c9397f78f"}}