{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SW6WXX5MMUPPLZ2VQMZEDQYGKS","short_pith_number":"pith:SW6WXX5M","canonical_record":{"source":{"id":"1907.08774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T08:13:15Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"52da0d627712a68bf1af76d209d219388a5b868c5738287db81c93a7d59b6738","abstract_canon_sha256":"d7d5ff3cf247effac7fad900f4aba1aaa9ceecbb274aaa5bf9871bf1066d109f"},"schema_version":"1.0"},"canonical_sha256":"95bd6bdfac651ef5e755833241c3065498da708a32b0cb0d08373f8094a5e424","source":{"kind":"arxiv","id":"1907.08774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08774","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08774v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08774","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"SW6WXX5MMUPP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SW6WXX5MMUPPLZ2V","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SW6WXX5M","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SW6WXX5MMUPPLZ2VQMZEDQYGKS","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T08:13:15Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"52da0d627712a68bf1af76d209d219388a5b868c5738287db81c93a7d59b6738","abstract_canon_sha256":"d7d5ff3cf247effac7fad900f4aba1aaa9ceecbb274aaa5bf9871bf1066d109f"},"schema_version":"1.0"},"canonical_sha256":"95bd6bdfac651ef5e755833241c3065498da708a32b0cb0d08373f8094a5e424","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:05.408529Z","signature_b64":"O1fnRzosGqAb0WoyyVUd/0MjZ5Ws8LIJnxWl3NBzKazi4djtRO/EnQeDWKs6qJ9qIa8a/egGqPXtL2NXu4u1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95bd6bdfac651ef5e755833241c3065498da708a32b0cb0d08373f8094a5e424","last_reissued_at":"2026-05-17T23:40:05.407999Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:05.407999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08774","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-17T23:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BfHTY4XjmMCd5YILoTsqE3/kCrf1hM2vKImWM18ks9JxIKuZofo7UlrnNbZyIzhxdXXin5QyYwXI3bseonACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:48.739083Z"},"content_sha256":"4683b3f78536e780d9b05ae6987efa96bd607008e063a185cf67e38dc59c14e9","schema_version":"1.0","event_id":"sha256:4683b3f78536e780d9b05ae6987efa96bd607008e063a185cf67e38dc59c14e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SW6WXX5MMUPPLZ2VQMZEDQYGKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Design of Queuing Systems via Compositional Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ketan Rajawat, Srujan Teja Thomdapu","submitted_at":"2019-07-20T08:13:15Z","abstract_excerpt":"Well-designed queuing systems form the backbone of modern communications, distributed computing, and content delivery architectures. Designs balancing infrastructure costs and user experience indices require tools from teletraffic theory and operations research. A standard approach to designing such systems involves formulating optimization problems that strive to maximize the pertinent utility functions while adhering to quality-of-service and other physical constraints. In many cases, formulating such problems necessitates making simplistic assumptions on arrival and departure processes to k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08774","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-17T23:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BBhGQ9J3Jb/3i+mvdsWUlydZ/R/aWcpWdhNq13e5VF9LU7w2ieLbJwQmFgvkbc7HnRwgVvMsJfSBV5Kx0zFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:48.739560Z"},"content_sha256":"464044d39e728811de4012ef88e96ecc81a335cc2480c6aea8254e668e531738","schema_version":"1.0","event_id":"sha256:464044d39e728811de4012ef88e96ecc81a335cc2480c6aea8254e668e531738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/bundle.json","state_url":"https://pith.science/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/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-25T10:07:48Z","links":{"resolver":"https://pith.science/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS","bundle":"https://pith.science/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/bundle.json","state":"https://pith.science/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SW6WXX5MMUPPLZ2VQMZEDQYGKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SW6WXX5MMUPPLZ2VQMZEDQYGKS","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":"d7d5ff3cf247effac7fad900f4aba1aaa9ceecbb274aaa5bf9871bf1066d109f","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T08:13:15Z","title_canon_sha256":"52da0d627712a68bf1af76d209d219388a5b868c5738287db81c93a7d59b6738"},"schema_version":"1.0","source":{"id":"1907.08774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08774","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08774v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08774","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"SW6WXX5MMUPP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SW6WXX5MMUPPLZ2V","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SW6WXX5M","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:464044d39e728811de4012ef88e96ecc81a335cc2480c6aea8254e668e531738","target":"graph","created_at":"2026-05-17T23:40:05Z","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":"Well-designed queuing systems form the backbone of modern communications, distributed computing, and content delivery architectures. Designs balancing infrastructure costs and user experience indices require tools from teletraffic theory and operations research. A standard approach to designing such systems involves formulating optimization problems that strive to maximize the pertinent utility functions while adhering to quality-of-service and other physical constraints. In many cases, formulating such problems necessitates making simplistic assumptions on arrival and departure processes to k","authors_text":"Ketan Rajawat, Srujan Teja Thomdapu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T08:13:15Z","title":"Optimal Design of Queuing Systems via Compositional Stochastic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08774","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:4683b3f78536e780d9b05ae6987efa96bd607008e063a185cf67e38dc59c14e9","target":"record","created_at":"2026-05-17T23:40:05Z","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":"d7d5ff3cf247effac7fad900f4aba1aaa9ceecbb274aaa5bf9871bf1066d109f","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T08:13:15Z","title_canon_sha256":"52da0d627712a68bf1af76d209d219388a5b868c5738287db81c93a7d59b6738"},"schema_version":"1.0","source":{"id":"1907.08774","kind":"arxiv","version":1}},"canonical_sha256":"95bd6bdfac651ef5e755833241c3065498da708a32b0cb0d08373f8094a5e424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95bd6bdfac651ef5e755833241c3065498da708a32b0cb0d08373f8094a5e424","first_computed_at":"2026-05-17T23:40:05.407999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:05.407999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1fnRzosGqAb0WoyyVUd/0MjZ5Ws8LIJnxWl3NBzKazi4djtRO/EnQeDWKs6qJ9qIa8a/egGqPXtL2NXu4u1DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:05.408529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4683b3f78536e780d9b05ae6987efa96bd607008e063a185cf67e38dc59c14e9","sha256:464044d39e728811de4012ef88e96ecc81a335cc2480c6aea8254e668e531738"],"state_sha256":"08ff38734f4b323112276eb647ef5bed2660070df222577bf57266632c72b2da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9SFSiMZw2GwfAA/QvN0PaPDVpn/g+csxxlE697qtCrx3j8SoykBDZdcikM9VuDlhtsjPBpdZP4MZ3ft5wJ/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:07:48.743077Z","bundle_sha256":"ca6b9a76beb435affdc2d9e15720bbd3538184f6c9b5af93bd0059512d5a22fa"}}