{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QXUYGUZW2WO37OSRYD7B34GWFO","short_pith_number":"pith:QXUYGUZW","canonical_record":{"source":{"id":"1212.6582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-29T01:29:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8911ab5b9d46ff1c6205861cdc8adb31c6d4877ed8cc3d4b43cf3d281fd1a414","abstract_canon_sha256":"2524c62a1570b2ef85761683fd607654e3fb41038ec80dc8724f5ec2fbde4c23"},"schema_version":"1.0"},"canonical_sha256":"85e9835336d59dbfba51c0fe1df0d62bbdeea863afe526ed1dd27d4b75eda60b","source":{"kind":"arxiv","id":"1212.6582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6582","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6582v2","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6582","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"QXUYGUZW2WO3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QXUYGUZW2WO37OSR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QXUYGUZW","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QXUYGUZW2WO37OSRYD7B34GWFO","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-29T01:29:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8911ab5b9d46ff1c6205861cdc8adb31c6d4877ed8cc3d4b43cf3d281fd1a414","abstract_canon_sha256":"2524c62a1570b2ef85761683fd607654e3fb41038ec80dc8724f5ec2fbde4c23"},"schema_version":"1.0"},"canonical_sha256":"85e9835336d59dbfba51c0fe1df0d62bbdeea863afe526ed1dd27d4b75eda60b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:21.560938Z","signature_b64":"RNBMhTXz3ieblpAEzw8QLnOWSio4lzJDxRXD9jtkTA1yQdQo7UzVl4va2etNeMszQXT634WF3SDPK+GBKQJrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85e9835336d59dbfba51c0fe1df0d62bbdeea863afe526ed1dd27d4b75eda60b","last_reissued_at":"2026-05-18T02:16:21.560298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:21.560298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6582","source_version":2,"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-18T02:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEU7v4WDmsHbF5lBb/oA7e12ID22YjmXxGyI+XoloW5xKgRHk1Foy97AbomnE33r1TYljWfFHKBTD5akWCF3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:59:57.283558Z"},"content_sha256":"f452350fa2616b4e5b73f8712ff51cd8dd2a3498b45bfc82adfd8767461a2d67","schema_version":"1.0","event_id":"sha256:f452350fa2616b4e5b73f8712ff51cd8dd2a3498b45bfc82adfd8767461a2d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QXUYGUZW2WO37OSRYD7B34GWFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability of Multiclass Queueing Networks under Longest-Queue and Longest-Dominating-Queue Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Jean Walrand, Ramtin Pedarsani","submitted_at":"2012-12-29T01:29:07Z","abstract_excerpt":"We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6582","kind":"arxiv","version":2},"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-18T02:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayNbPiScyP9XTD9yYm+oAUq6l6OamkyKU3ZlPvZgDjboMyzt7RohNMsLrMOK87BV2ioIHA8I7Fk4gmiiXDVmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:59:57.283948Z"},"content_sha256":"aba464057edb53027826ce7b3b68966a9c99ec9bce4aff2e0f2b8273f3f93d7e","schema_version":"1.0","event_id":"sha256:aba464057edb53027826ce7b3b68966a9c99ec9bce4aff2e0f2b8273f3f93d7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXUYGUZW2WO37OSRYD7B34GWFO/bundle.json","state_url":"https://pith.science/pith/QXUYGUZW2WO37OSRYD7B34GWFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXUYGUZW2WO37OSRYD7B34GWFO/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-21T15:59:57Z","links":{"resolver":"https://pith.science/pith/QXUYGUZW2WO37OSRYD7B34GWFO","bundle":"https://pith.science/pith/QXUYGUZW2WO37OSRYD7B34GWFO/bundle.json","state":"https://pith.science/pith/QXUYGUZW2WO37OSRYD7B34GWFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXUYGUZW2WO37OSRYD7B34GWFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QXUYGUZW2WO37OSRYD7B34GWFO","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":"2524c62a1570b2ef85761683fd607654e3fb41038ec80dc8724f5ec2fbde4c23","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-29T01:29:07Z","title_canon_sha256":"8911ab5b9d46ff1c6205861cdc8adb31c6d4877ed8cc3d4b43cf3d281fd1a414"},"schema_version":"1.0","source":{"id":"1212.6582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6582","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6582v2","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6582","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"QXUYGUZW2WO3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QXUYGUZW2WO37OSR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QXUYGUZW","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:aba464057edb53027826ce7b3b68966a9c99ec9bce4aff2e0f2b8273f3f93d7e","target":"graph","created_at":"2026-05-18T02:16:21Z","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":"We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system ca","authors_text":"Jean Walrand, Ramtin Pedarsani","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-29T01:29:07Z","title":"Stability of Multiclass Queueing Networks under Longest-Queue and Longest-Dominating-Queue Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6582","kind":"arxiv","version":2},"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:f452350fa2616b4e5b73f8712ff51cd8dd2a3498b45bfc82adfd8767461a2d67","target":"record","created_at":"2026-05-18T02:16:21Z","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":"2524c62a1570b2ef85761683fd607654e3fb41038ec80dc8724f5ec2fbde4c23","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-29T01:29:07Z","title_canon_sha256":"8911ab5b9d46ff1c6205861cdc8adb31c6d4877ed8cc3d4b43cf3d281fd1a414"},"schema_version":"1.0","source":{"id":"1212.6582","kind":"arxiv","version":2}},"canonical_sha256":"85e9835336d59dbfba51c0fe1df0d62bbdeea863afe526ed1dd27d4b75eda60b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85e9835336d59dbfba51c0fe1df0d62bbdeea863afe526ed1dd27d4b75eda60b","first_computed_at":"2026-05-18T02:16:21.560298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:21.560298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNBMhTXz3ieblpAEzw8QLnOWSio4lzJDxRXD9jtkTA1yQdQo7UzVl4va2etNeMszQXT634WF3SDPK+GBKQJrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:21.560938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f452350fa2616b4e5b73f8712ff51cd8dd2a3498b45bfc82adfd8767461a2d67","sha256:aba464057edb53027826ce7b3b68966a9c99ec9bce4aff2e0f2b8273f3f93d7e"],"state_sha256":"ddde6173196cdf43379aaa2ea2cdb8bfaf7428faa2b195a01092a97a82f38cb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgppIw9G01rgGTRdk+cUZulhkxbYwsJL0Ns739bSBZTh5sIpnpMvLHnjca+UyG6RceE3J4JLyaDWt6kaJxH6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:59:57.286000Z","bundle_sha256":"304b0e250519edd455f4f47477a4d2104844cd835ea2ef7494b2e6cdba8e0239"}}