{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7UJFLWGJ7ZDM27BJ5UV2JW3HOM","short_pith_number":"pith:7UJFLWGJ","canonical_record":{"source":{"id":"1503.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-09T18:26:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9d69a4c81b115793c97fbf1f399055ff08f9856c19f2875c54afe36f322710a2","abstract_canon_sha256":"3d80c953ee73cdb41abac05ae90ef692fc5bb4904f2c736786c6076f240a137c"},"schema_version":"1.0"},"canonical_sha256":"fd1255d8c9fe46cd7c29ed2ba4db67732c494eb64cec37db14d62a115a6c4fe9","source":{"kind":"arxiv","id":"1503.02603","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02603","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02603v2","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02603","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"7UJFLWGJ7ZDM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UJFLWGJ7ZDM27BJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UJFLWGJ","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7UJFLWGJ7ZDM27BJ5UV2JW3HOM","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-09T18:26:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9d69a4c81b115793c97fbf1f399055ff08f9856c19f2875c54afe36f322710a2","abstract_canon_sha256":"3d80c953ee73cdb41abac05ae90ef692fc5bb4904f2c736786c6076f240a137c"},"schema_version":"1.0"},"canonical_sha256":"fd1255d8c9fe46cd7c29ed2ba4db67732c494eb64cec37db14d62a115a6c4fe9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:37.836239Z","signature_b64":"lUOVTNVhoofcSW+qg52iZfflhDyXmvH57WxAPTHfhZTDahsDHZ5KUm8QaPlvcrZrHknarew47+e/0a2ooce0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd1255d8c9fe46cd7c29ed2ba4db67732c494eb64cec37db14d62a115a6c4fe9","last_reissued_at":"2026-05-18T01:34:37.835490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:37.835490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02603","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:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l05BxlTJclAtFNSAyQknfH3bP1ZFqzK8kytYEo9+MDvmNNOFk4VVvg1fFN+rnRe0BR0Cv/5gxTXCbxVofCMSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:21.325656Z"},"content_sha256":"8b333fc07fb7f1baa120cbd0887359ce5a342b87841f5c46cdae0a8d620ed424","schema_version":"1.0","event_id":"sha256:8b333fc07fb7f1baa120cbd0887359ce5a342b87841f5c46cdae0a8d620ed424"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7UJFLWGJ7ZDM27BJ5UV2JW3HOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An asymptotically optimal policy and state-space collapse for the multi-class shared queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Mark Shifrin","submitted_at":"2015-03-09T18:26:55Z","abstract_excerpt":"We consider a multi-class G/G/1 queue with a finite shared buffer. There is task admission and server scheduling control which aims to minimize the cost which consists of holding and rejection components. We construct a policy that is asymptotically optimal in the heavy traffic limit. The policy stems from solution to Harrison-Taksar (HT) free boundary problem and is expressed by a single free boundary point. We show that the HT problem solution translated into the queuelength processes follows a specific {\\it triangular} form. This form implies the queuelength control policy which is differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02603","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:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDD0JeuX0FWQqfaG6PereB5+memUEXcJ9h0hBUdi5LQGh90B/vq/tNGxhCxqAPkUjHhiUWJPKtsoFn5T3SeyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:21.326025Z"},"content_sha256":"386bc7e8cc1a241cfdfe33ac18eb68d8c4e60183a2cdfe487c929bff114f3f38","schema_version":"1.0","event_id":"sha256:386bc7e8cc1a241cfdfe33ac18eb68d8c4e60183a2cdfe487c929bff114f3f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/bundle.json","state_url":"https://pith.science/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/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-22T23:23:21Z","links":{"resolver":"https://pith.science/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM","bundle":"https://pith.science/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/bundle.json","state":"https://pith.science/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UJFLWGJ7ZDM27BJ5UV2JW3HOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7UJFLWGJ7ZDM27BJ5UV2JW3HOM","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":"3d80c953ee73cdb41abac05ae90ef692fc5bb4904f2c736786c6076f240a137c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-09T18:26:55Z","title_canon_sha256":"9d69a4c81b115793c97fbf1f399055ff08f9856c19f2875c54afe36f322710a2"},"schema_version":"1.0","source":{"id":"1503.02603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02603","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02603v2","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02603","created_at":"2026-05-18T01:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"7UJFLWGJ7ZDM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UJFLWGJ7ZDM27BJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UJFLWGJ","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:386bc7e8cc1a241cfdfe33ac18eb68d8c4e60183a2cdfe487c929bff114f3f38","target":"graph","created_at":"2026-05-18T01:34:37Z","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 a multi-class G/G/1 queue with a finite shared buffer. There is task admission and server scheduling control which aims to minimize the cost which consists of holding and rejection components. We construct a policy that is asymptotically optimal in the heavy traffic limit. The policy stems from solution to Harrison-Taksar (HT) free boundary problem and is expressed by a single free boundary point. We show that the HT problem solution translated into the queuelength processes follows a specific {\\it triangular} form. This form implies the queuelength control policy which is differen","authors_text":"Mark Shifrin","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-09T18:26:55Z","title":"An asymptotically optimal policy and state-space collapse for the multi-class shared queue"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02603","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:8b333fc07fb7f1baa120cbd0887359ce5a342b87841f5c46cdae0a8d620ed424","target":"record","created_at":"2026-05-18T01:34:37Z","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":"3d80c953ee73cdb41abac05ae90ef692fc5bb4904f2c736786c6076f240a137c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-03-09T18:26:55Z","title_canon_sha256":"9d69a4c81b115793c97fbf1f399055ff08f9856c19f2875c54afe36f322710a2"},"schema_version":"1.0","source":{"id":"1503.02603","kind":"arxiv","version":2}},"canonical_sha256":"fd1255d8c9fe46cd7c29ed2ba4db67732c494eb64cec37db14d62a115a6c4fe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd1255d8c9fe46cd7c29ed2ba4db67732c494eb64cec37db14d62a115a6c4fe9","first_computed_at":"2026-05-18T01:34:37.835490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:37.835490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lUOVTNVhoofcSW+qg52iZfflhDyXmvH57WxAPTHfhZTDahsDHZ5KUm8QaPlvcrZrHknarew47+e/0a2ooce0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:37.836239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b333fc07fb7f1baa120cbd0887359ce5a342b87841f5c46cdae0a8d620ed424","sha256:386bc7e8cc1a241cfdfe33ac18eb68d8c4e60183a2cdfe487c929bff114f3f38"],"state_sha256":"6116cb5cb02688618bf13c0c69ee6aac89f5d181fb0271950f62a4e794e4e05f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7Z11nX5uVu/puFsUjd34AifL2Ay5yglaN+X9QAt5JANfZYMurDoaWlgYyCYVm+uCSuItQC2OFbu0jfrb4e/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:21.327969Z","bundle_sha256":"787f204d898f8f946286c1f90c8c237740abbea929d06f6951f4ab2b3b9cd316"}}