{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:NQELXUNFASWT72KFMUAOYDCJS4","short_pith_number":"pith:NQELXUNF","canonical_record":{"source":{"id":"math/0407136","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T14:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"ba9a87c19a06650453ba152985872d277dace0940b4c54e6cb6a215deb35f021","abstract_canon_sha256":"ad76462215d5af9b71e637e22f5dc74e2ea5efbb26ea11ef40ac402a3aff0cc6"},"schema_version":"1.0"},"canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","source":{"kind":"arxiv","id":"math/0407136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407136","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407136v1","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407136","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"NQELXUNFASWT","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQELXUNFASWT72KF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQELXUNF","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:NQELXUNFASWT72KFMUAOYDCJS4","target":"record","payload":{"canonical_record":{"source":{"id":"math/0407136","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T14:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"ba9a87c19a06650453ba152985872d277dace0940b4c54e6cb6a215deb35f021","abstract_canon_sha256":"ad76462215d5af9b71e637e22f5dc74e2ea5efbb26ea11ef40ac402a3aff0cc6"},"schema_version":"1.0"},"canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:26.195798Z","signature_b64":"EEWRxYCr9v1sHjEXM6wxlTV6nEylezq9IOXru76l86PHXwXIkSrqCNPgn3mwLo6ij3i90CLhw3kLDKYIlTs0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","last_reissued_at":"2026-05-18T01:05:26.195243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:26.195243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0407136","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:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2tn318KAkL534PlYIuchZY7axmQaTGk1uIfkk5u+Iu8iLiERpXTugIsu4/Ji08u8JJA62uUSQ1azVN0UNf1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:29:13.174824Z"},"content_sha256":"880e21688f62a8fbd481d3c5ae3e6e95e885a50d611856756aeebc571f9cf9f4","schema_version":"1.0","event_id":"sha256:880e21688f62a8fbd481d3c5ae3e6e95e885a50d611856756aeebc571f9cf9f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:NQELXUNFASWT72KFMUAOYDCJS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Earliest-deadline-first service in heavy-traffic acyclic networks","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"John Lehoczky, Lukasz Kruk, Shu-Ngai Yeung, Steven Shreve","submitted_at":"2004-07-08T14:25:42Z","abstract_excerpt":"This paper presents a heavy traffic analysis of the behavior of multi-class acyclic queueing networks in which the customers have deadlines. We assume the queueing system consists of J stations, and there are K different customer classes. Customers from each class arrive to the network according to independent renewal processes. The customers from each class are assigned a random deadline drawn from a deadline distribution associated with that class and they move from station to station according to a fixed acyclic route.\n The customers at a given node are processed according to the earliest-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407136","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:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oKDQ1i2jOqCmrwB+uNoQWB6XxIQkiMmUdyykmfCk9ol2gJLPRvxuQftnh3TNrPbHXwlR7CUIiLwG5Y+mtkrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:29:13.175526Z"},"content_sha256":"d7d3cb3f9f897f357d8731ab015ff393161bfc22c0d9bc02c9f25bb5243af20a","schema_version":"1.0","event_id":"sha256:d7d3cb3f9f897f357d8731ab015ff393161bfc22c0d9bc02c9f25bb5243af20a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/bundle.json","state_url":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQELXUNFASWT72KFMUAOYDCJS4/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-07-01T23:29:13Z","links":{"resolver":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4","bundle":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/bundle.json","state":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQELXUNFASWT72KFMUAOYDCJS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:NQELXUNFASWT72KFMUAOYDCJS4","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":"ad76462215d5af9b71e637e22f5dc74e2ea5efbb26ea11ef40ac402a3aff0cc6","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T14:25:42Z","title_canon_sha256":"ba9a87c19a06650453ba152985872d277dace0940b4c54e6cb6a215deb35f021"},"schema_version":"1.0","source":{"id":"math/0407136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407136","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407136v1","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407136","created_at":"2026-05-18T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"NQELXUNFASWT","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQELXUNFASWT72KF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQELXUNF","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:d7d3cb3f9f897f357d8731ab015ff393161bfc22c0d9bc02c9f25bb5243af20a","target":"graph","created_at":"2026-05-18T01:05:26Z","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":"This paper presents a heavy traffic analysis of the behavior of multi-class acyclic queueing networks in which the customers have deadlines. We assume the queueing system consists of J stations, and there are K different customer classes. Customers from each class arrive to the network according to independent renewal processes. The customers from each class are assigned a random deadline drawn from a deadline distribution associated with that class and they move from station to station according to a fixed acyclic route.\n The customers at a given node are processed according to the earliest-d","authors_text":"John Lehoczky, Lukasz Kruk, Shu-Ngai Yeung, Steven Shreve","cross_cats":[],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T14:25:42Z","title":"Earliest-deadline-first service in heavy-traffic acyclic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407136","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:880e21688f62a8fbd481d3c5ae3e6e95e885a50d611856756aeebc571f9cf9f4","target":"record","created_at":"2026-05-18T01:05:26Z","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":"ad76462215d5af9b71e637e22f5dc74e2ea5efbb26ea11ef40ac402a3aff0cc6","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2004-07-08T14:25:42Z","title_canon_sha256":"ba9a87c19a06650453ba152985872d277dace0940b4c54e6cb6a215deb35f021"},"schema_version":"1.0","source":{"id":"math/0407136","kind":"arxiv","version":1}},"canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","first_computed_at":"2026-05-18T01:05:26.195243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:26.195243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EEWRxYCr9v1sHjEXM6wxlTV6nEylezq9IOXru76l86PHXwXIkSrqCNPgn3mwLo6ij3i90CLhw3kLDKYIlTs0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:26.195798Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0407136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:880e21688f62a8fbd481d3c5ae3e6e95e885a50d611856756aeebc571f9cf9f4","sha256:d7d3cb3f9f897f357d8731ab015ff393161bfc22c0d9bc02c9f25bb5243af20a"],"state_sha256":"18316e0809b182d1272097823a6f211a0d4f501e222d11b99df3a1af1bf623ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlBSg+wd2GfHixKQq5LO2oMH6ZIVo54zttc00rD0iknYYXU3B/HK6rPNfB8so4eGx64J4xdaRJFu7DwyevRAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:29:13.179222Z","bundle_sha256":"4d52160f319d32ffc20eaa63d3c01c218eac970ebab6c0920b9bd5425a4d77d3"}}