{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GS3CZ4NE5B6EYW4TB6TJGY76RI","short_pith_number":"pith:GS3CZ4NE","canonical_record":{"source":{"id":"2504.07383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T02:04:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ba9dbc86cbb44d53fa34e73399de92ad3a022a65e00115ca6e04ae0cdf2f59a8","abstract_canon_sha256":"deb48ffd5555b861f5115b133931cdba9c7756bf8dc03c7463fa97d0fd219fac"},"schema_version":"1.0"},"canonical_sha256":"34b62cf1a4e87c4c5b930fa69363fe8a144f9e9ea0b855bf81d9be93ef03dc43","source":{"kind":"arxiv","id":"2504.07383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07383","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07383v1","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07383","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"GS3CZ4NE5B6E","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"GS3CZ4NE5B6EYW4T","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"GS3CZ4NE","created_at":"2026-07-05T10:47:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GS3CZ4NE5B6EYW4TB6TJGY76RI","target":"record","payload":{"canonical_record":{"source":{"id":"2504.07383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T02:04:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ba9dbc86cbb44d53fa34e73399de92ad3a022a65e00115ca6e04ae0cdf2f59a8","abstract_canon_sha256":"deb48ffd5555b861f5115b133931cdba9c7756bf8dc03c7463fa97d0fd219fac"},"schema_version":"1.0"},"canonical_sha256":"34b62cf1a4e87c4c5b930fa69363fe8a144f9e9ea0b855bf81d9be93ef03dc43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:07.940324Z","signature_b64":"yp7qZxJcw74MZJ6R/pALwbQhHMrxxS4eUi6XVsk5/joAc5bDSWsI7kgLr5CdfQaSqXqHqi+3O3/yLpmxijgZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34b62cf1a4e87c4c5b930fa69363fe8a144f9e9ea0b855bf81d9be93ef03dc43","last_reissued_at":"2026-07-05T10:47:07.939880Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:07.939880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.07383","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-07-05T10:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"et4ZkA3g6Z08FezHjeMPzPgLTk42N+KNhzV5Wp3K4c/xCzaUbfzf7lrtiX8ynscKAedsciijUmg4HsXnTWCeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:14:24.749003Z"},"content_sha256":"b2bd4aecfc93327f0e900d057beac7e0981779127e51609743dd132fbbe8331e","schema_version":"1.0","event_id":"sha256:b2bd4aecfc93327f0e900d057beac7e0981779127e51609743dd132fbbe8331e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GS3CZ4NE5B6EYW4TB6TJGY76RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PROPEL: Supervised and Reinforcement Learning for Large-Scale Supply Chain Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Pascal Van Hentenryck, Reza Zandehshahvar, Vahid Eghbal Akhlaghi","submitted_at":"2025-04-10T02:04:29Z","abstract_excerpt":"This paper considers how to fuse Machine Learning (ML) and optimization to solve large-scale Supply Chain Planning (SCP) optimization problems. These problems can be formulated as MIP models which feature both integer (non-binary) and continuous variables, as well as flow balance and capacity constraints. This raises fundamental challenges for existing integrations of ML and optimization that have focused on binary MIPs and graph problems. To address these, the paper proposes PROPEL, a new framework that combines optimization with both supervised and Deep Reinforcement Learning (DRL) to reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07383","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.07383/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-07-05T10:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTdXipyooUwqiq8McFDsanqTFb9zpKT9yFq8zyRh56mtD4RTnG4wYR0HorlVMadpsptQWnJw7CseQAxCJn33Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:14:24.749851Z"},"content_sha256":"855e4a6ef328630f0a7dd5da583db9a440c7d69c30e8e4482c0fcc4b505a98e1","schema_version":"1.0","event_id":"sha256:855e4a6ef328630f0a7dd5da583db9a440c7d69c30e8e4482c0fcc4b505a98e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/bundle.json","state_url":"https://pith.science/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/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-08-11T08:14:24Z","links":{"resolver":"https://pith.science/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI","bundle":"https://pith.science/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/bundle.json","state":"https://pith.science/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GS3CZ4NE5B6EYW4TB6TJGY76RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GS3CZ4NE5B6EYW4TB6TJGY76RI","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":"deb48ffd5555b861f5115b133931cdba9c7756bf8dc03c7463fa97d0fd219fac","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T02:04:29Z","title_canon_sha256":"ba9dbc86cbb44d53fa34e73399de92ad3a022a65e00115ca6e04ae0cdf2f59a8"},"schema_version":"1.0","source":{"id":"2504.07383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07383","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07383v1","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07383","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"GS3CZ4NE5B6E","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"GS3CZ4NE5B6EYW4T","created_at":"2026-07-05T10:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"GS3CZ4NE","created_at":"2026-07-05T10:47:07Z"}],"graph_snapshots":[{"event_id":"sha256:855e4a6ef328630f0a7dd5da583db9a440c7d69c30e8e4482c0fcc4b505a98e1","target":"graph","created_at":"2026-07-05T10:47:07Z","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/2504.07383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers how to fuse Machine Learning (ML) and optimization to solve large-scale Supply Chain Planning (SCP) optimization problems. These problems can be formulated as MIP models which feature both integer (non-binary) and continuous variables, as well as flow balance and capacity constraints. This raises fundamental challenges for existing integrations of ML and optimization that have focused on binary MIPs and graph problems. To address these, the paper proposes PROPEL, a new framework that combines optimization with both supervised and Deep Reinforcement Learning (DRL) to reduce","authors_text":"Pascal Van Hentenryck, Reza Zandehshahvar, Vahid Eghbal Akhlaghi","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T02:04:29Z","title":"PROPEL: Supervised and Reinforcement Learning for Large-Scale Supply Chain Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07383","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:b2bd4aecfc93327f0e900d057beac7e0981779127e51609743dd132fbbe8331e","target":"record","created_at":"2026-07-05T10:47:07Z","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":"deb48ffd5555b861f5115b133931cdba9c7756bf8dc03c7463fa97d0fd219fac","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T02:04:29Z","title_canon_sha256":"ba9dbc86cbb44d53fa34e73399de92ad3a022a65e00115ca6e04ae0cdf2f59a8"},"schema_version":"1.0","source":{"id":"2504.07383","kind":"arxiv","version":1}},"canonical_sha256":"34b62cf1a4e87c4c5b930fa69363fe8a144f9e9ea0b855bf81d9be93ef03dc43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34b62cf1a4e87c4c5b930fa69363fe8a144f9e9ea0b855bf81d9be93ef03dc43","first_computed_at":"2026-07-05T10:47:07.939880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:07.939880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yp7qZxJcw74MZJ6R/pALwbQhHMrxxS4eUi6XVsk5/joAc5bDSWsI7kgLr5CdfQaSqXqHqi+3O3/yLpmxijgZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:07.940324Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.07383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2bd4aecfc93327f0e900d057beac7e0981779127e51609743dd132fbbe8331e","sha256:855e4a6ef328630f0a7dd5da583db9a440c7d69c30e8e4482c0fcc4b505a98e1"],"state_sha256":"77b0271b6ab2127ccd944ed68b7bd54e6451be8eab0f14223ee3f19695aeaf73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ir1fvNd4B5qy9Mkv0CTLML/NVSHlXLOT/nw3WtyesuHx4C+XcJ4Df8xCeGY+zVjQT/9Os5cM3PRotvYFhUwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:14:24.761567Z","bundle_sha256":"80717e1b7df2bcbd9a053b83a02863c80bbb3e6fa5734b7b38b6daab0a1101cf"}}