{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEWNUN5F7N63W7RDX3HZRY2ZX4","short_pith_number":"pith:EEWNUN5F","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"},"canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","source":{"kind":"arxiv","id":"1701.03370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03370","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03370v1","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03370","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"EEWNUN5F7N63","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEWNUN5F7N63W7RD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEWNUN5F","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEWNUN5F7N63W7RDX3HZRY2ZX4","target":"record","payload":{"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"},"canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","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"},"source_kind":"arxiv","source_id":"1701.03370","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-18T00:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crjHnZ0adE06sDMhbHbWId2zJSpMIx6IgQWJPgGIxbA0C4sE3bd+CGbWjX83VBTRr2EER0v36z0s4yuJhgFgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:36.731971Z"},"content_sha256":"97c51238c3a59a6fecdf659cd2ff634a8fff9e3a79df501cc7cb74711a7ea29d","schema_version":"1.0","event_id":"sha256:97c51238c3a59a6fecdf659cd2ff634a8fff9e3a79df501cc7cb74711a7ea29d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEWNUN5F7N63W7RDX3HZRY2ZX4","target":"graph","payload":{"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"},"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-18T00:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81GsdzPXg7CuGz3UAP7ocS7HTxXmASPt09PPYQSgmRQ+bSIdKqTIIIxGC4hnzrh1d+OKqg7ZbnvooP35rlCsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:36.732704Z"},"content_sha256":"ccd94b3d7d0b9c7902ec17f0b246212b0ab702a7edf4424219a2b93e76d15013","schema_version":"1.0","event_id":"sha256:ccd94b3d7d0b9c7902ec17f0b246212b0ab702a7edf4424219a2b93e76d15013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/bundle.json","state_url":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/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-05-25T02:47:36Z","links":{"resolver":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4","bundle":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/bundle.json","state":"https://pith.science/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEWNUN5F7N63W7RDX3HZRY2ZX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEWNUN5F7N63W7RDX3HZRY2ZX4","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":"7f975458e360606553f7ac604583cb8c484a13738a2e899c0641c3b1893c3c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-12T15:11:29Z","title_canon_sha256":"58e3f62526fe2063ad507e543662f09cd537de7fce8a87ca105e094c595f525d"},"schema_version":"1.0","source":{"id":"1701.03370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03370","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03370v1","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03370","created_at":"2026-05-18T00:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"EEWNUN5F7N63","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEWNUN5F7N63W7RD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEWNUN5F","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ccd94b3d7d0b9c7902ec17f0b246212b0ab702a7edf4424219a2b93e76d15013","target":"graph","created_at":"2026-05-18T00:52:56Z","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 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","authors_text":"Angelos Aveklouris, Bert Zwart, Jiheng Zhang, Maria Vlasiou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-12T15:11:29Z","title":"Heavy-traffic approximations for a layered network with limited resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03370","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:97c51238c3a59a6fecdf659cd2ff634a8fff9e3a79df501cc7cb74711a7ea29d","target":"record","created_at":"2026-05-18T00:52:56Z","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":"7f975458e360606553f7ac604583cb8c484a13738a2e899c0641c3b1893c3c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-12T15:11:29Z","title_canon_sha256":"58e3f62526fe2063ad507e543662f09cd537de7fce8a87ca105e094c595f525d"},"schema_version":"1.0","source":{"id":"1701.03370","kind":"arxiv","version":1}},"canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"212cda37a5fb7dbb7e23becf98e359bf12809717b5a4ef7a943e24167820616a","first_computed_at":"2026-05-18T00:52:56.032429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:56.032429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dm9HKah95BoNJ91Xu0mIbNcwb5/eolSVYmJ8FDMODEha9FrPRZSuq+bT445mCT5O6l1Xvh76Arr4E1OcbHKNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:56.032886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97c51238c3a59a6fecdf659cd2ff634a8fff9e3a79df501cc7cb74711a7ea29d","sha256:ccd94b3d7d0b9c7902ec17f0b246212b0ab702a7edf4424219a2b93e76d15013"],"state_sha256":"b722aa599f20fa50527ccd9763938bfafccccd4b3103ccfe5cf3492585812472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Na6TZh/StlNBNdmwwfBbtca+09z/zscpShaMOPjW8uJBEBtMqK4qm8Y2CAVJIHXN44UDsstq9yR4Kruvs9TBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:47:36.736358Z","bundle_sha256":"44dc4cbf5c5131c34cd9c72d8a4cbe69d839db1741c4c117633afdc7c823173e"}}