{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:NQELXUNFASWT72KFMUAOYDCJS4","short_pith_number":"pith:NQELXUNF","schema_version":"1.0","canonical_sha256":"6c08bbd1a504ad3fe9456500ec0c49973ca4dc147ec01c045e0688f57ff1818d","source":{"kind":"arxiv","id":"math/0407136","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0407136","created_at":"2026-05-18T01:05:26.195333+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0407136v1","created_at":"2026-05-18T01:05:26.195333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407136","created_at":"2026-05-18T01:05:26.195333+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQELXUNFASWT","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQELXUNFASWT72KF","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQELXUNF","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4","json":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4.json","graph_json":"https://pith.science/api/pith-number/NQELXUNFASWT72KFMUAOYDCJS4/graph.json","events_json":"https://pith.science/api/pith-number/NQELXUNFASWT72KFMUAOYDCJS4/events.json","paper":"https://pith.science/paper/NQELXUNF"},"agent_actions":{"view_html":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4","download_json":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4.json","view_paper":"https://pith.science/paper/NQELXUNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0407136&json=true","fetch_graph":"https://pith.science/api/pith-number/NQELXUNFASWT72KFMUAOYDCJS4/graph.json","fetch_events":"https://pith.science/api/pith-number/NQELXUNFASWT72KFMUAOYDCJS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/action/storage_attestation","attest_author":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/action/author_attestation","sign_citation":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/action/citation_signature","submit_replication":"https://pith.science/pith/NQELXUNFASWT72KFMUAOYDCJS4/action/replication_record"}},"created_at":"2026-05-18T01:05:26.195333+00:00","updated_at":"2026-05-18T01:05:26.195333+00:00"}