{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PLS24BJ3N5XSWPA4FNPGIAH7YZ","short_pith_number":"pith:PLS24BJ3","canonical_record":{"source":{"id":"1504.08150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-04-30T10:01:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ddbf9fc6633f52b2cc756f6a2b09e69bd0f4977f3ea6c4cb5c15f6d4e176ce51","abstract_canon_sha256":"aa61b8961b89a0372964969fbb16fb95382f084b15cb33f8e03b7a6f22984dde"},"schema_version":"1.0"},"canonical_sha256":"7ae5ae053b6f6f2b3c1c2b5e6400ffc65a9aa79bc3a2f28e52a88e40b2ee534c","source":{"kind":"arxiv","id":"1504.08150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08150","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08150v2","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08150","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"PLS24BJ3N5XS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLS24BJ3N5XSWPA4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLS24BJ3","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PLS24BJ3N5XSWPA4FNPGIAH7YZ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-04-30T10:01:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ddbf9fc6633f52b2cc756f6a2b09e69bd0f4977f3ea6c4cb5c15f6d4e176ce51","abstract_canon_sha256":"aa61b8961b89a0372964969fbb16fb95382f084b15cb33f8e03b7a6f22984dde"},"schema_version":"1.0"},"canonical_sha256":"7ae5ae053b6f6f2b3c1c2b5e6400ffc65a9aa79bc3a2f28e52a88e40b2ee534c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:47.159431Z","signature_b64":"woWq4nqOh3xXaOkflJczPWIOpoXCe1u1B1OZWquXa2fQ3Zw3scT25XBleHPo1xQN7PsyUPufN3ayE5x4RNLmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae5ae053b6f6f2b3c1c2b5e6400ffc65a9aa79bc3a2f28e52a88e40b2ee534c","last_reissued_at":"2026-05-18T01:17:47.158808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:47.158808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08150","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-18T01:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElCxOPBVNIiABH5z1994F4g6pGjoq87kpP/aRQfu+zaPClElkFuhTH+VKJ4HaGowqerJPQvHrXhuDum+buLSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:33.612354Z"},"content_sha256":"25627b77f0de63eb0957d06e1c792f3cc004537e1ff8eeb22d490937b225a204","schema_version":"1.0","event_id":"sha256:25627b77f0de63eb0957d06e1c792f3cc004537e1ff8eeb22d490937b225a204"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PLS24BJ3N5XSWPA4FNPGIAH7YZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reward Processes and Performance Simulation in Supermarket Models with Different Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Feifei Yang, Na Li, Quan-Lin Li","submitted_at":"2015-04-30T10:01:34Z","abstract_excerpt":"Supermarket models with different servers become a key in modeling resource management of stochastic networks, such as, computer networks, manufacturing systems and transportation networks. While these different servers always make analysis of such a supermarket model more interesting, difficult and challenging. This paper provides a new novel method for analyzing the supermarket model with different servers through a multi-dimensional continuous-time Markov reward processes. Firstly, the utility functions are constructed for expressing a routine selection mechanism that depends on queue lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08150","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-18T01:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMmhVLDUB7vnH2LKICBlTSNtagURhN2fvMItkra2jMG1Dsp7B0KE+Bj2pkQwmjVKz0cyqTSB2BGb2Zh33aK2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:33.612974Z"},"content_sha256":"34c0c6e31a53eef99556800d262992b5b128664254078ca0c36c718df6595ad7","schema_version":"1.0","event_id":"sha256:34c0c6e31a53eef99556800d262992b5b128664254078ca0c36c718df6595ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/bundle.json","state_url":"https://pith.science/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/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-07T09:13:33Z","links":{"resolver":"https://pith.science/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ","bundle":"https://pith.science/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/bundle.json","state":"https://pith.science/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLS24BJ3N5XSWPA4FNPGIAH7YZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PLS24BJ3N5XSWPA4FNPGIAH7YZ","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":"aa61b8961b89a0372964969fbb16fb95382f084b15cb33f8e03b7a6f22984dde","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-04-30T10:01:34Z","title_canon_sha256":"ddbf9fc6633f52b2cc756f6a2b09e69bd0f4977f3ea6c4cb5c15f6d4e176ce51"},"schema_version":"1.0","source":{"id":"1504.08150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08150","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08150v2","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08150","created_at":"2026-05-18T01:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"PLS24BJ3N5XS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLS24BJ3N5XSWPA4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLS24BJ3","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:34c0c6e31a53eef99556800d262992b5b128664254078ca0c36c718df6595ad7","target":"graph","created_at":"2026-05-18T01:17:47Z","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":"Supermarket models with different servers become a key in modeling resource management of stochastic networks, such as, computer networks, manufacturing systems and transportation networks. While these different servers always make analysis of such a supermarket model more interesting, difficult and challenging. This paper provides a new novel method for analyzing the supermarket model with different servers through a multi-dimensional continuous-time Markov reward processes. Firstly, the utility functions are constructed for expressing a routine selection mechanism that depends on queue lengt","authors_text":"Feifei Yang, Na Li, Quan-Lin Li","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-04-30T10:01:34Z","title":"Reward Processes and Performance Simulation in Supermarket Models with Different Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08150","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:25627b77f0de63eb0957d06e1c792f3cc004537e1ff8eeb22d490937b225a204","target":"record","created_at":"2026-05-18T01:17:47Z","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":"aa61b8961b89a0372964969fbb16fb95382f084b15cb33f8e03b7a6f22984dde","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-04-30T10:01:34Z","title_canon_sha256":"ddbf9fc6633f52b2cc756f6a2b09e69bd0f4977f3ea6c4cb5c15f6d4e176ce51"},"schema_version":"1.0","source":{"id":"1504.08150","kind":"arxiv","version":2}},"canonical_sha256":"7ae5ae053b6f6f2b3c1c2b5e6400ffc65a9aa79bc3a2f28e52a88e40b2ee534c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ae5ae053b6f6f2b3c1c2b5e6400ffc65a9aa79bc3a2f28e52a88e40b2ee534c","first_computed_at":"2026-05-18T01:17:47.158808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:47.158808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"woWq4nqOh3xXaOkflJczPWIOpoXCe1u1B1OZWquXa2fQ3Zw3scT25XBleHPo1xQN7PsyUPufN3ayE5x4RNLmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:47.159431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25627b77f0de63eb0957d06e1c792f3cc004537e1ff8eeb22d490937b225a204","sha256:34c0c6e31a53eef99556800d262992b5b128664254078ca0c36c718df6595ad7"],"state_sha256":"578caedd4c179da231dec64072fe78dc080d9ccbb2fbf7ad34ade78043bf2c6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4Wn4vxXoCmm4ZZJORaqKOjXplltz89W4APCVTeBVcJbjNGQEFGRpfc2dPdZUoYiUuHbB3S2V+nK0dEkFuLOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:13:33.615692Z","bundle_sha256":"5d2b5f490615d8760e8ab2b2929e8e7f92256aef20652a314a26d57a9c805b11"}}