{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IGRYDMVE6VQFMRO266H4KKNACJ","short_pith_number":"pith:IGRYDMVE","canonical_record":{"source":{"id":"2307.12405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-23T19:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"899ebd96846bd224a9f1c6ee3560c5104485d98a116ff179e7a508104ed96a2f","abstract_canon_sha256":"6a1784dfcf0721487ffe33cbbc54699eb2beb3f17dd04b135f76c05ce5397180"},"schema_version":"1.0"},"canonical_sha256":"41a381b2a4f5605645daf78fc529a01263d3ec3cfce3072b0830da0d4fdef8d2","source":{"kind":"arxiv","id":"2307.12405","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12405","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12405v2","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12405","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"IGRYDMVE6VQF","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"IGRYDMVE6VQFMRO2","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"IGRYDMVE","created_at":"2026-05-20T00:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IGRYDMVE6VQFMRO266H4KKNACJ","target":"record","payload":{"canonical_record":{"source":{"id":"2307.12405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-23T19:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"899ebd96846bd224a9f1c6ee3560c5104485d98a116ff179e7a508104ed96a2f","abstract_canon_sha256":"6a1784dfcf0721487ffe33cbbc54699eb2beb3f17dd04b135f76c05ce5397180"},"schema_version":"1.0"},"canonical_sha256":"41a381b2a4f5605645daf78fc529a01263d3ec3cfce3072b0830da0d4fdef8d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:03.496577Z","signature_b64":"Kt65zeFTt7nvusqx3qt8AOOrq43YYm7OZCpLsdmcqHGuJG+Fx/R9cRR1a2mpRhO8VZVWRQO5quyLYBDTprVuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a381b2a4f5605645daf78fc529a01263d3ec3cfce3072b0830da0d4fdef8d2","last_reissued_at":"2026-05-20T00:04:03.495729Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:03.495729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.12405","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-20T00:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMfpRuzCurvs7SBRBIVNpM9U1W6kW3oHg7EXqPpRw6RDSGCZCEQz5qrlb0g3T2wtK/BQuF1Cz6+kLgAMiF6dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:06:16.641705Z"},"content_sha256":"c66e1c68324677542e4f9c3465ff9112f4fe3f792addaa01cbe6e97779a8d6e3","schema_version":"1.0","event_id":"sha256:c66e1c68324677542e4f9c3465ff9112f4fe3f792addaa01cbe6e97779a8d6e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IGRYDMVE6VQFMRO266H4KKNACJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Control of Multiclass Fluid Queueing Networks: A Machine Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheol Woo Kim, Dimitris Bertsimas","submitted_at":"2023-07-23T19:12:44Z","abstract_excerpt":"We propose a machine learning approach to the optimal control of multiclass fluid queueing networks (MFQNETs) that provides explicit and insightful control policies. We prove that a piecewise constant optimal policy exists for MFQNET control problems, with segments separated by hyperplanes passing through the origin. We use Optimal Classification Trees with hyperplane splits (OCT-H) to learn an optimal control policy for MFQNETs. We use numerical solutions of MFQNET control problems as a training set and apply OCT-H to learn explicit control policies. Furthermore, we show that both the theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12405","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.12405/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T00:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIqcNjZDkoRL5/aJfqYkTRrU/Kj3ORjji80ZsyWPW7jSwU18b5SYaKOU99MjgDqkuTcdTdMAU7XOSC2LIbzqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:06:16.642498Z"},"content_sha256":"94dd8f3bfe29112cc65cf1fe808835a29ec2bc1cbbe622b7347e8d045999488b","schema_version":"1.0","event_id":"sha256:94dd8f3bfe29112cc65cf1fe808835a29ec2bc1cbbe622b7347e8d045999488b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGRYDMVE6VQFMRO266H4KKNACJ/bundle.json","state_url":"https://pith.science/pith/IGRYDMVE6VQFMRO266H4KKNACJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGRYDMVE6VQFMRO266H4KKNACJ/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-23T14:06:16Z","links":{"resolver":"https://pith.science/pith/IGRYDMVE6VQFMRO266H4KKNACJ","bundle":"https://pith.science/pith/IGRYDMVE6VQFMRO266H4KKNACJ/bundle.json","state":"https://pith.science/pith/IGRYDMVE6VQFMRO266H4KKNACJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGRYDMVE6VQFMRO266H4KKNACJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IGRYDMVE6VQFMRO266H4KKNACJ","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":"6a1784dfcf0721487ffe33cbbc54699eb2beb3f17dd04b135f76c05ce5397180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-23T19:12:44Z","title_canon_sha256":"899ebd96846bd224a9f1c6ee3560c5104485d98a116ff179e7a508104ed96a2f"},"schema_version":"1.0","source":{"id":"2307.12405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12405","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12405v2","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12405","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"IGRYDMVE6VQF","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"IGRYDMVE6VQFMRO2","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"IGRYDMVE","created_at":"2026-05-20T00:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:94dd8f3bfe29112cc65cf1fe808835a29ec2bc1cbbe622b7347e8d045999488b","target":"graph","created_at":"2026-05-20T00:04:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.12405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a machine learning approach to the optimal control of multiclass fluid queueing networks (MFQNETs) that provides explicit and insightful control policies. We prove that a piecewise constant optimal policy exists for MFQNET control problems, with segments separated by hyperplanes passing through the origin. We use Optimal Classification Trees with hyperplane splits (OCT-H) to learn an optimal control policy for MFQNETs. We use numerical solutions of MFQNET control problems as a training set and apply OCT-H to learn explicit control policies. Furthermore, we show that both the theoret","authors_text":"Cheol Woo Kim, Dimitris Bertsimas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-23T19:12:44Z","title":"Optimal Control of Multiclass Fluid Queueing Networks: A Machine Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12405","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:c66e1c68324677542e4f9c3465ff9112f4fe3f792addaa01cbe6e97779a8d6e3","target":"record","created_at":"2026-05-20T00:04:03Z","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":"6a1784dfcf0721487ffe33cbbc54699eb2beb3f17dd04b135f76c05ce5397180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-23T19:12:44Z","title_canon_sha256":"899ebd96846bd224a9f1c6ee3560c5104485d98a116ff179e7a508104ed96a2f"},"schema_version":"1.0","source":{"id":"2307.12405","kind":"arxiv","version":2}},"canonical_sha256":"41a381b2a4f5605645daf78fc529a01263d3ec3cfce3072b0830da0d4fdef8d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41a381b2a4f5605645daf78fc529a01263d3ec3cfce3072b0830da0d4fdef8d2","first_computed_at":"2026-05-20T00:04:03.495729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:03.495729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kt65zeFTt7nvusqx3qt8AOOrq43YYm7OZCpLsdmcqHGuJG+Fx/R9cRR1a2mpRhO8VZVWRQO5quyLYBDTprVuAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:03.496577Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.12405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c66e1c68324677542e4f9c3465ff9112f4fe3f792addaa01cbe6e97779a8d6e3","sha256:94dd8f3bfe29112cc65cf1fe808835a29ec2bc1cbbe622b7347e8d045999488b"],"state_sha256":"eeb8bd4f32bebe4dac111ece8735d31d588f590f6fc886958899f913a44c45fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MpI3FwRDuFDgp3ZDawjCLq4bQtkJBr87T82s0Q3XBvX5fUwn1Okbu3haP5dRAX3LN/yWwsN6mocW+SIYvG5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T14:06:16.646577Z","bundle_sha256":"9bb79263cc0946b81ec8c13f9f68c2e1ba966c66f6ed6793e3f2e01ceb2fdd49"}}