{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EEWNUN5F7N63W7RDX3HZRY2ZX4","short_pith_number":"pith:EEWNUN5F","schema_version":"1.0","canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","source":{"kind":"arxiv","id":"1701.03370","version":1},"attestation_state":"computed","paper":{"title":"Heavy-traffic approximations for a layered network with limited resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Angelos Aveklouris, Bert Zwart, Jiheng Zhang, Maria Vlasiou","submitted_at":"2017-01-12T15:11:29Z","abstract_excerpt":"Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the inter-arrival and the service times have general distributions. Customers are served according to their arrival order at each node and after finishing their service they can re-enter at nodes several times (as new customers) for new services. At the second layer, active servers act as jobs which are served by a single server working at speed one in a Processor-Sharing fashion. We further assume"},"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":"1701.03370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-12T15:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"58e3f62526fe2063ad507e543662f09cd537de7fce8a87ca105e094c595f525d","abstract_canon_sha256":"7f975458e360606553f7ac604583cb8c484a13738a2e899c0641c3b1893c3c92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:56.032886Z","signature_b64":"Dm9HKah95BoNJ91Xu0mIbNcwb5/eolSVYmJ8FDMODEha9FrPRZSuq+bT445mCT5O6l1Xvh76Arr4E1OcbHKNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","last_reissued_at":"2026-05-18T00:52:56.032429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:56.032429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heavy-traffic approximations for a layered network with limited resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Angelos Aveklouris, Bert Zwart, Jiheng Zhang, Maria Vlasiou","submitted_at":"2017-01-12T15:11:29Z","abstract_excerpt":"Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the inter-arrival and the service times have general distributions. Customers are served according to their arrival order at each node and after finishing their service they can re-enter at nodes several times (as new customers) for new services. At the second layer, active servers act as jobs which are served by a single server working at speed one in a Processor-Sharing fashion. We further assume"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03370","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":"1701.03370","created_at":"2026-05-18T00:52:56.032497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03370v1","created_at":"2026-05-18T00:52:56.032497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03370","created_at":"2026-05-18T00:52:56.032497+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEWNUN5F7N63","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEWNUN5F7N63W7RD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEWNUN5F","created_at":"2026-05-18T12:31:12.930513+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/EEWNUN5F7N63W7RDX3HZRY2ZX4","json":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4.json","graph_json":"https://pith.science/api/pith-number/EEWNUN5F7N63W7RDX3HZRY2ZX4/graph.json","events_json":"https://pith.science/api/pith-number/EEWNUN5F7N63W7RDX3HZRY2ZX4/events.json","paper":"https://pith.science/paper/EEWNUN5F"},"agent_actions":{"view_html":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4","download_json":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4.json","view_paper":"https://pith.science/paper/EEWNUN5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03370&json=true","fetch_graph":"https://pith.science/api/pith-number/EEWNUN5F7N63W7RDX3HZRY2ZX4/graph.json","fetch_events":"https://pith.science/api/pith-number/EEWNUN5F7N63W7RDX3HZRY2ZX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/action/storage_attestation","attest_author":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/action/author_attestation","sign_citation":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/action/citation_signature","submit_replication":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/action/replication_record"}},"created_at":"2026-05-18T00:52:56.032497+00:00","updated_at":"2026-05-18T00:52:56.032497+00:00"}