{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DUEQDKX3US5OMQ3PZDOI43BTBW","short_pith_number":"pith:DUEQDKX3","canonical_record":{"source":{"id":"1704.01722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T06:23:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"fb70efa819d56ad15d8a73731fe16a1524430cd6bd5a9b578726e5e878ef899e","abstract_canon_sha256":"3807f560c799623425fa09d38476b68803906f9f738cbc8c2b5f0a561f7fdae1"},"schema_version":"1.0"},"canonical_sha256":"1d0901aafba4bae6436fc8dc8e6c330db2e33db26df18cdd8077ec54e8e2adcf","source":{"kind":"arxiv","id":"1704.01722","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01722","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01722v3","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01722","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"DUEQDKX3US5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUEQDKX3US5OMQ3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUEQDKX3","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DUEQDKX3US5OMQ3PZDOI43BTBW","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T06:23:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"fb70efa819d56ad15d8a73731fe16a1524430cd6bd5a9b578726e5e878ef899e","abstract_canon_sha256":"3807f560c799623425fa09d38476b68803906f9f738cbc8c2b5f0a561f7fdae1"},"schema_version":"1.0"},"canonical_sha256":"1d0901aafba4bae6436fc8dc8e6c330db2e33db26df18cdd8077ec54e8e2adcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.584758Z","signature_b64":"Bt8C59cS4gKdcezmakcScl8ooiKnzg3nqsLA/OU+at6xWV7adV+0E7VH8Rlj+6kuPflWjxiZLPVzVEdFvas0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d0901aafba4bae6436fc8dc8e6c330db2e33db26df18cdd8077ec54e8e2adcf","last_reissued_at":"2026-05-18T00:18:46.584184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.584184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01722","source_version":3,"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:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xV0ZlXetxjzMqSi1HRCNJdjmQoBe1npg3riIH+S+ZHMmg5rKByYzfAHhbLNSpl6azkmCkEReEMvh94Ucnf5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:25:16.835667Z"},"content_sha256":"3c89f8418d1eb289c1cf94fdd9f0e04be3854428308abbed45fb576b225fa79f","schema_version":"1.0","event_id":"sha256:3c89f8418d1eb289c1cf94fdd9f0e04be3854428308abbed45fb576b225fa79f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DUEQDKX3US5OMQ3PZDOI43BTBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the equivalence between multiclass processor sharing and random order scheduling policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Konstantin Avrachenkov (NEO), Tejas Bodas (LAAS-SARA)","submitted_at":"2017-04-06T06:23:45Z","abstract_excerpt":"Consider a single server system serving a multiclass population. Some popular scheduling policies for such system are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). In this paper, we propose two classes of policies, namely MPS (multiclass processor sharing) and MROS (multiclass random order service), that generalize the four policies mentioned above. For the special case when the multiclass population arrive according to Poisson processes and have independent and exponential service r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01722","kind":"arxiv","version":3},"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:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHg78tp5WrqQiZGn1GjArzAuHlGN9tQIt/yiw6Do/0/eMGm4dSM8QWGkepTRdGf/ATTO6Lr19lGD/n/Xr8TvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:25:16.836022Z"},"content_sha256":"915164a62149a4b0ab949d5bd8408e5e0318a68f76a52aaeb7b1bb28ea481731","schema_version":"1.0","event_id":"sha256:915164a62149a4b0ab949d5bd8408e5e0318a68f76a52aaeb7b1bb28ea481731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/bundle.json","state_url":"https://pith.science/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/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-06-20T10:25:16Z","links":{"resolver":"https://pith.science/pith/DUEQDKX3US5OMQ3PZDOI43BTBW","bundle":"https://pith.science/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/bundle.json","state":"https://pith.science/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUEQDKX3US5OMQ3PZDOI43BTBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DUEQDKX3US5OMQ3PZDOI43BTBW","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":"3807f560c799623425fa09d38476b68803906f9f738cbc8c2b5f0a561f7fdae1","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T06:23:45Z","title_canon_sha256":"fb70efa819d56ad15d8a73731fe16a1524430cd6bd5a9b578726e5e878ef899e"},"schema_version":"1.0","source":{"id":"1704.01722","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01722","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01722v3","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01722","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"DUEQDKX3US5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUEQDKX3US5OMQ3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUEQDKX3","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:915164a62149a4b0ab949d5bd8408e5e0318a68f76a52aaeb7b1bb28ea481731","target":"graph","created_at":"2026-05-18T00:18:46Z","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":"Consider a single server system serving a multiclass population. Some popular scheduling policies for such system are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). In this paper, we propose two classes of policies, namely MPS (multiclass processor sharing) and MROS (multiclass random order service), that generalize the four policies mentioned above. For the special case when the multiclass population arrive according to Poisson processes and have independent and exponential service r","authors_text":"Konstantin Avrachenkov (NEO), Tejas Bodas (LAAS-SARA)","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T06:23:45Z","title":"On the equivalence between multiclass processor sharing and random order scheduling policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01722","kind":"arxiv","version":3},"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:3c89f8418d1eb289c1cf94fdd9f0e04be3854428308abbed45fb576b225fa79f","target":"record","created_at":"2026-05-18T00:18:46Z","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":"3807f560c799623425fa09d38476b68803906f9f738cbc8c2b5f0a561f7fdae1","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-04-06T06:23:45Z","title_canon_sha256":"fb70efa819d56ad15d8a73731fe16a1524430cd6bd5a9b578726e5e878ef899e"},"schema_version":"1.0","source":{"id":"1704.01722","kind":"arxiv","version":3}},"canonical_sha256":"1d0901aafba4bae6436fc8dc8e6c330db2e33db26df18cdd8077ec54e8e2adcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d0901aafba4bae6436fc8dc8e6c330db2e33db26df18cdd8077ec54e8e2adcf","first_computed_at":"2026-05-18T00:18:46.584184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:46.584184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bt8C59cS4gKdcezmakcScl8ooiKnzg3nqsLA/OU+at6xWV7adV+0E7VH8Rlj+6kuPflWjxiZLPVzVEdFvas0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:46.584758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01722","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c89f8418d1eb289c1cf94fdd9f0e04be3854428308abbed45fb576b225fa79f","sha256:915164a62149a4b0ab949d5bd8408e5e0318a68f76a52aaeb7b1bb28ea481731"],"state_sha256":"de06d0f5e091ebc48b1eefa86cfc4b8431ac9b20992e4213523eb755d3ae3994"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ns0uNIPa8yDSNxt6pMv/cxlVcsNOGxygt0u02uaqjSI2gc1EGeYPHiibNDMITvnpF7SvQRWqy8cZDQubpw/0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:25:16.837907Z","bundle_sha256":"de7ceaa27f7c7008d758ce2edaf5882567c5f8e1baad3ad35c89feef13a10573"}}