{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FQYDKLGXAPTQR4F5JB4JSW27P5","short_pith_number":"pith:FQYDKLGX","canonical_record":{"source":{"id":"2605.27339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T17:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"07ae603f8d3c7131d339e3f300f538e8818873030b1fc32184329b4224e5c165","abstract_canon_sha256":"742f3a49dac5821c2e68068f7048bfb52f3afed212792f8b492713cd98eba7b4"},"schema_version":"1.0"},"canonical_sha256":"2c30352cd703e708f0bd4878995b5f7f608723392121ad2d49931a53ac184285","source":{"kind":"arxiv","id":"2605.27339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27339","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27339v1","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27339","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"FQYDKLGXAPTQ","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"FQYDKLGXAPTQR4F5","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"FQYDKLGX","created_at":"2026-05-27T02:06:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FQYDKLGXAPTQR4F5JB4JSW27P5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.27339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T17:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"07ae603f8d3c7131d339e3f300f538e8818873030b1fc32184329b4224e5c165","abstract_canon_sha256":"742f3a49dac5821c2e68068f7048bfb52f3afed212792f8b492713cd98eba7b4"},"schema_version":"1.0"},"canonical_sha256":"2c30352cd703e708f0bd4878995b5f7f608723392121ad2d49931a53ac184285","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:06:18.832170Z","signature_b64":"WHBF2lVetsTu326cqMg5KYTXmceiROALw8TtE0N0M/LZi60UkpvvSPxKOGJJH8xe6sQ3ymjZAGrblZfe/4AYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c30352cd703e708f0bd4878995b5f7f608723392121ad2d49931a53ac184285","last_reissued_at":"2026-05-27T02:06:18.831472Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:06:18.831472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.27339","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-27T02:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elwabS2DFfL9g1ED2UIrjRHZdlOSJ6kg8TFOPuaW7jEURysInJHynWXvgB0yU8K3L6PMkRGdcknXyO5eJhjzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:17.928611Z"},"content_sha256":"ceea389928cbd4d41a2cefbbe1ed2f333fd0d351f19762259c38a516fa01b332","schema_version":"1.0","event_id":"sha256:ceea389928cbd4d41a2cefbbe1ed2f333fd0d351f19762259c38a516fa01b332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FQYDKLGXAPTQR4F5JB4JSW27P5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Lodi, Enrico Malaguti, Filippo Focacci, Mathieu Lerouge, Michele Monaci","submitted_at":"2026-05-26T17:44:41Z","abstract_excerpt":"In many operational contexts, solutions to NP-hard combinatorial optimization problems, modeled by means of Mixed-Integer Linear Programming (MILP), may become infeasible due to unpredictable disruptions. Typically, reoptimizing by solving the MILP formulation on the perturbed instance is not possible as new solutions must be obtained in a very short computing time, while simple repairing heuristics may result in low-quality solutions. To bridge this gap, we propose a learning-to-reoptimize framework, and apply it to the Lot Sizing Problem (LSP) under machine breakdown disruptions. We design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27339","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/2605.27339/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-27T02:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ee+dDkPAZMCV2+F4DCSTZWWo4+yZXlkFFCHx9KQK1R+eGzQtr4YZusO5ntXrgGkdNsvoQ52KClCK83L/mpLODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:17.928992Z"},"content_sha256":"129ef0ead0d6edc5450e80d4bca7a3a78fe2c5fefeffe45e839d2fcf1d686d50","schema_version":"1.0","event_id":"sha256:129ef0ead0d6edc5450e80d4bca7a3a78fe2c5fefeffe45e839d2fcf1d686d50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/bundle.json","state_url":"https://pith.science/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/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-04T19:17:17Z","links":{"resolver":"https://pith.science/pith/FQYDKLGXAPTQR4F5JB4JSW27P5","bundle":"https://pith.science/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/bundle.json","state":"https://pith.science/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQYDKLGXAPTQR4F5JB4JSW27P5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FQYDKLGXAPTQR4F5JB4JSW27P5","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":"742f3a49dac5821c2e68068f7048bfb52f3afed212792f8b492713cd98eba7b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T17:44:41Z","title_canon_sha256":"07ae603f8d3c7131d339e3f300f538e8818873030b1fc32184329b4224e5c165"},"schema_version":"1.0","source":{"id":"2605.27339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27339","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27339v1","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27339","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"FQYDKLGXAPTQ","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"FQYDKLGXAPTQR4F5","created_at":"2026-05-27T02:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"FQYDKLGX","created_at":"2026-05-27T02:06:18Z"}],"graph_snapshots":[{"event_id":"sha256:129ef0ead0d6edc5450e80d4bca7a3a78fe2c5fefeffe45e839d2fcf1d686d50","target":"graph","created_at":"2026-05-27T02:06:18Z","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/2605.27339/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many operational contexts, solutions to NP-hard combinatorial optimization problems, modeled by means of Mixed-Integer Linear Programming (MILP), may become infeasible due to unpredictable disruptions. Typically, reoptimizing by solving the MILP formulation on the perturbed instance is not possible as new solutions must be obtained in a very short computing time, while simple repairing heuristics may result in low-quality solutions. To bridge this gap, we propose a learning-to-reoptimize framework, and apply it to the Lot Sizing Problem (LSP) under machine breakdown disruptions. We design a","authors_text":"Andrea Lodi, Enrico Malaguti, Filippo Focacci, Mathieu Lerouge, Michele Monaci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T17:44:41Z","title":"Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27339","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:ceea389928cbd4d41a2cefbbe1ed2f333fd0d351f19762259c38a516fa01b332","target":"record","created_at":"2026-05-27T02:06:18Z","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":"742f3a49dac5821c2e68068f7048bfb52f3afed212792f8b492713cd98eba7b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T17:44:41Z","title_canon_sha256":"07ae603f8d3c7131d339e3f300f538e8818873030b1fc32184329b4224e5c165"},"schema_version":"1.0","source":{"id":"2605.27339","kind":"arxiv","version":1}},"canonical_sha256":"2c30352cd703e708f0bd4878995b5f7f608723392121ad2d49931a53ac184285","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c30352cd703e708f0bd4878995b5f7f608723392121ad2d49931a53ac184285","first_computed_at":"2026-05-27T02:06:18.831472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T02:06:18.831472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WHBF2lVetsTu326cqMg5KYTXmceiROALw8TtE0N0M/LZi60UkpvvSPxKOGJJH8xe6sQ3ymjZAGrblZfe/4AYBA==","signature_status":"signed_v1","signed_at":"2026-05-27T02:06:18.832170Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceea389928cbd4d41a2cefbbe1ed2f333fd0d351f19762259c38a516fa01b332","sha256:129ef0ead0d6edc5450e80d4bca7a3a78fe2c5fefeffe45e839d2fcf1d686d50"],"state_sha256":"9f71efa6a9abd4085e24fc80d7b6913a6a421de9d5aeeaff9b21287fae1be77e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7AFd0vdqxR6XKg+TVDZNl/CXf73U4ypnKVlBZY90A3SNUg1C383YSRm9U+gTdobNRMA6jyPhoKuEjnTXXRBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:17:17.931019Z","bundle_sha256":"72ad0a81a8c3ae0c21e8c6c5345a1707d17b350c5d30e9642306734c8826aac5"}}