{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K2Y4D3YRLY76RM3VYIM2AOG7M6","short_pith_number":"pith:K2Y4D3YR","canonical_record":{"source":{"id":"2410.13767","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-17T17:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"6a6e394eb70340dc414747669196d8224736d0cfd4b3728c0619c8d4f80bad98","abstract_canon_sha256":"f8843f83610103134600994bad7a6cedcac5ec20f5d8948352799b317a146759"},"schema_version":"1.0"},"canonical_sha256":"56b1c1ef115e3fe8b375c219a038df67860e81041c00644366688f66db3b8506","source":{"kind":"arxiv","id":"2410.13767","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13767","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13767v6","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13767","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"K2Y4D3YRLY76","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"K2Y4D3YRLY76RM3V","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"K2Y4D3YR","created_at":"2026-06-03T01:05:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K2Y4D3YRLY76RM3VYIM2AOG7M6","target":"record","payload":{"canonical_record":{"source":{"id":"2410.13767","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-17T17:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"6a6e394eb70340dc414747669196d8224736d0cfd4b3728c0619c8d4f80bad98","abstract_canon_sha256":"f8843f83610103134600994bad7a6cedcac5ec20f5d8948352799b317a146759"},"schema_version":"1.0"},"canonical_sha256":"56b1c1ef115e3fe8b375c219a038df67860e81041c00644366688f66db3b8506","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:43.070611Z","signature_b64":"uzk2u97iQItSKdRoi3sVNM2dI+gptnn4OG+XiXXGtPTnUii7AKrRCqSwX901vpTNMlx4ZU1WBgTHbVEGfaErBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56b1c1ef115e3fe8b375c219a038df67860e81041c00644366688f66db3b8506","last_reissued_at":"2026-06-03T01:05:43.070163Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:43.070163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.13767","source_version":6,"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-06-03T01:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt80zyx/6u4NpWF44ti+kL9uc+SkDnloqsT2lP6p8i/lP8b0SajdgkOGtCZCUTqdCHcefEftObj8EmGNFN1GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:20:52.605633Z"},"content_sha256":"f50a6ceb97508eff0493215d395a64c0cc3ac5729c2edfa3fa64bc69f3b33283","schema_version":"1.0","event_id":"sha256:f50a6ceb97508eff0493215d395a64c0cc3ac5729c2edfa3fa64bc69f3b33283"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K2Y4D3YRLY76RM3VYIM2AOG7M6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inpatient Overflow Management with Proximal Policy Optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jim Dai, Jingjing Sun, Pengyi Shi","submitted_at":"2024-10-17T17:04:08Z","abstract_excerpt":"Problem Definition: Managing inpatient flow in large hospital systems is challenging due to the complexity of assigning randomly arriving patients -- either waiting for primary units or being overflowed to alternative units. Current practices rely on ad-hoc rules, while prior analytical approaches struggle with the intractably large state and action spaces inherent in patient-unit matching. Scalable decision support is needed to optimize overflow management while accounting for time-periodic fluctuations in patient flow.\n  Methodology/Results: We develop a scalable decision-making framework us"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Case studies on hospital systems with up to twenty patient classes and twenty wards demonstrate that our approach matches or outperforms existing benchmarks, including approximate dynamic programming, which is computationally infeasible beyond five wards.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The queueing-informed value function approximation and partially-shared policy network together preserve near-optimal performance for the original multi-patient combinatorial problem without introducing bias that grows with system size; this premise is invoked when the authors state that the enhancements improve policy evaluation and computational efficiency while still producing competitive policies.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A PPO reinforcement learning method using atomic actions, partially-shared policies, and queueing-informed value approximation scales inpatient overflow optimization to hospital systems with 20 patient classes and wards, matching or beating benchmarks where prior methods fail.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b062603d41318d7774eac846ad8a155f6c1bda1790eadd9792944801a7cd08c8"},"source":{"id":"2410.13767","kind":"arxiv","version":6},"verdict":{"id":"8a10fe58-a2fa-443e-b73a-e2efe5b36dcc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T19:13:56.562353Z","strongest_claim":"Case studies on hospital systems with up to twenty patient classes and twenty wards demonstrate that our approach matches or outperforms existing benchmarks, including approximate dynamic programming, which is computationally infeasible beyond five wards.","one_line_summary":"A PPO reinforcement learning method using atomic actions, partially-shared policies, and queueing-informed value approximation scales inpatient overflow optimization to hospital systems with 20 patient classes and wards, matching or beating benchmarks where prior methods fail.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The queueing-informed value function approximation and partially-shared policy network together preserve near-optimal performance for the original multi-patient combinatorial problem without introducing bias that grows with system size; this premise is invoked when the authors state that the enhancements improve policy evaluation and computational efficiency while still producing competitive policies.","pith_extraction_headline":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.13767/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":"8a10fe58-a2fa-443e-b73a-e2efe5b36dcc"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fdFPMTt4V9AFzsFp1JVXHEg26JotbflgkoST+wm8HUSqeQfIWtFq6Z43dXq5W2PZkaI6T3DqQ4JWf7qqvwtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:20:52.606535Z"},"content_sha256":"ed9e237d6069fab0f6153212625fff63670c8d51970d6b9b4ff4fadf74c56d1a","schema_version":"1.0","event_id":"sha256:ed9e237d6069fab0f6153212625fff63670c8d51970d6b9b4ff4fadf74c56d1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/bundle.json","state_url":"https://pith.science/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/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-07T20:20:52Z","links":{"resolver":"https://pith.science/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6","bundle":"https://pith.science/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/bundle.json","state":"https://pith.science/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2Y4D3YRLY76RM3VYIM2AOG7M6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K2Y4D3YRLY76RM3VYIM2AOG7M6","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":"f8843f83610103134600994bad7a6cedcac5ec20f5d8948352799b317a146759","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-17T17:04:08Z","title_canon_sha256":"6a6e394eb70340dc414747669196d8224736d0cfd4b3728c0619c8d4f80bad98"},"schema_version":"1.0","source":{"id":"2410.13767","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13767","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13767v6","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13767","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"K2Y4D3YRLY76","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"K2Y4D3YRLY76RM3V","created_at":"2026-06-03T01:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"K2Y4D3YR","created_at":"2026-06-03T01:05:43Z"}],"graph_snapshots":[{"event_id":"sha256:ed9e237d6069fab0f6153212625fff63670c8d51970d6b9b4ff4fadf74c56d1a","target":"graph","created_at":"2026-06-03T01:05:43Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Case studies on hospital systems with up to twenty patient classes and twenty wards demonstrate that our approach matches or outperforms existing benchmarks, including approximate dynamic programming, which is computationally infeasible beyond five wards."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The queueing-informed value function approximation and partially-shared policy network together preserve near-optimal performance for the original multi-patient combinatorial problem without introducing bias that grows with system size; this premise is invoked when the authors state that the enhancements improve policy evaluation and computational efficiency while still producing competitive policies."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A PPO reinforcement learning method using atomic actions, partially-shared policies, and queueing-informed value approximation scales inpatient overflow optimization to hospital systems with 20 patient classes and wards, matching or beating benchmarks where prior methods fail."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards."}],"snapshot_sha256":"b062603d41318d7774eac846ad8a155f6c1bda1790eadd9792944801a7cd08c8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.13767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Problem Definition: Managing inpatient flow in large hospital systems is challenging due to the complexity of assigning randomly arriving patients -- either waiting for primary units or being overflowed to alternative units. Current practices rely on ad-hoc rules, while prior analytical approaches struggle with the intractably large state and action spaces inherent in patient-unit matching. Scalable decision support is needed to optimize overflow management while accounting for time-periodic fluctuations in patient flow.\n  Methodology/Results: We develop a scalable decision-making framework us","authors_text":"Jim Dai, Jingjing Sun, Pengyi Shi","cross_cats":[],"headline":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-17T17:04:08Z","title":"Inpatient Overflow Management with Proximal Policy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13767","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-23T19:13:56.562353Z","id":"8a10fe58-a2fa-443e-b73a-e2efe5b36dcc","model_set":{"reader":"grok-4.3"},"one_line_summary":"A PPO reinforcement learning method using atomic actions, partially-shared policies, and queueing-informed value approximation scales inpatient overflow optimization to hospital systems with 20 patient classes and wards, matching or beating benchmarks where prior methods fail.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Proximal policy optimization with atomic actions manages inpatient overflow decisions at the scale of twenty patient classes and twenty wards.","strongest_claim":"Case studies on hospital systems with up to twenty patient classes and twenty wards demonstrate that our approach matches or outperforms existing benchmarks, including approximate dynamic programming, which is computationally infeasible beyond five wards.","weakest_assumption":"The queueing-informed value function approximation and partially-shared policy network together preserve near-optimal performance for the original multi-patient combinatorial problem without introducing bias that grows with system size; this premise is invoked when the authors state that the enhancements improve policy evaluation and computational efficiency while still producing competitive policies."}},"verdict_id":"8a10fe58-a2fa-443e-b73a-e2efe5b36dcc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f50a6ceb97508eff0493215d395a64c0cc3ac5729c2edfa3fa64bc69f3b33283","target":"record","created_at":"2026-06-03T01:05:43Z","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":"f8843f83610103134600994bad7a6cedcac5ec20f5d8948352799b317a146759","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-17T17:04:08Z","title_canon_sha256":"6a6e394eb70340dc414747669196d8224736d0cfd4b3728c0619c8d4f80bad98"},"schema_version":"1.0","source":{"id":"2410.13767","kind":"arxiv","version":6}},"canonical_sha256":"56b1c1ef115e3fe8b375c219a038df67860e81041c00644366688f66db3b8506","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56b1c1ef115e3fe8b375c219a038df67860e81041c00644366688f66db3b8506","first_computed_at":"2026-06-03T01:05:43.070163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:43.070163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzk2u97iQItSKdRoi3sVNM2dI+gptnn4OG+XiXXGtPTnUii7AKrRCqSwX901vpTNMlx4ZU1WBgTHbVEGfaErBw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:43.070611Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.13767","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f50a6ceb97508eff0493215d395a64c0cc3ac5729c2edfa3fa64bc69f3b33283","sha256:ed9e237d6069fab0f6153212625fff63670c8d51970d6b9b4ff4fadf74c56d1a"],"state_sha256":"25deb3cdb90175b4986e1cd295d09e839c4d87054de6bc2782b09c2f93680532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20M7w3bp2a3/GLEUp+inwFgduXD1b27lv/BF9DayckRO+Y21Ld4o90fU0LsgKmgOBNsGZfCbZobk6IUjTXfqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:20:52.610946Z","bundle_sha256":"44ccf85782b0fac7f71c34b3c59e275a4920a912daa610e76e77072fd54af83b"}}