{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:43XBESTL3J3LGIPVHXCC3II4CO","short_pith_number":"pith:43XBESTL","canonical_record":{"source":{"id":"2605.19052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-18T19:16:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8b9cbea3c57937e600c21c66fb04a6b490445ac9d42284a39c3829d0f3d04b53","abstract_canon_sha256":"c361a936ac1979966943c762ad32c01e308705070cc73e07e34aa9f3cd86fb72"},"schema_version":"1.0"},"canonical_sha256":"e6ee124a6bda76b321f53dc42da11c13af0e925f8eca66c9f7e69496233dbb82","source":{"kind":"arxiv","id":"2605.19052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19052","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19052v1","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19052","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"43XBESTL3J3L","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_16","alias_value":"43XBESTL3J3LGIPV","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_8","alias_value":"43XBESTL","created_at":"2026-05-20T01:05:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:43XBESTL3J3LGIPVHXCC3II4CO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-18T19:16:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8b9cbea3c57937e600c21c66fb04a6b490445ac9d42284a39c3829d0f3d04b53","abstract_canon_sha256":"c361a936ac1979966943c762ad32c01e308705070cc73e07e34aa9f3cd86fb72"},"schema_version":"1.0"},"canonical_sha256":"e6ee124a6bda76b321f53dc42da11c13af0e925f8eca66c9f7e69496233dbb82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:24.879028Z","signature_b64":"nRdTFqMfiBZocM1d2sD4QhTQcz1dvI3AKhp9LQlOaTtalxcoCaor4U+1/aZLnfm6zzyRk++6Tun7AiqaSHRmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6ee124a6bda76b321f53dc42da11c13af0e925f8eca66c9f7e69496233dbb82","last_reissued_at":"2026-05-20T01:05:24.878362Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:24.878362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19052","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-20T01:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gbqv6yLTt1D0nSZMDWDjbwoHXBK7yIim8/e43pE7W01osPpONC/2OqOdIUklkRgtFZOMz5EM4urWyGb6RateDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:02:03.347705Z"},"content_sha256":"1e320c03236e701d0fa4eb7e0531b4e4451ff50f4a2fdbc7ee1ce9fdd34759c6","schema_version":"1.0","event_id":"sha256:1e320c03236e701d0fa4eb7e0531b4e4451ff50f4a2fdbc7ee1ce9fdd34759c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:43XBESTL3J3LGIPVHXCC3II4CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anh Tuan Nguyen, Tung Quoc Le, Viet Anh Nguyen","submitted_at":"2026-05-18T19:16:42Z","abstract_excerpt":"Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the coupling constraints, LR enables parallel subproblem solving and often yields tighter dual bounds than standard linear programming relaxations, which is crucial for efficient branch-and-bound pruning. While recent empirical work has shown promising results using machine learning to predict these multipliers, a theoretical understanding of such methods remains an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19052","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.19052/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-20T01:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WpsC0sCx4vIqpL+2dU4AyUjwrCVf/Zzlr96xm9nYVvgRP6vCUyD2t3dJHGWZu6dRmb3TRGcv2hPTRjrYOzBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:02:03.348420Z"},"content_sha256":"dd14cdb4e6e141deefd84168f638c3997700e06a4b02a1c4f9790776612737df","schema_version":"1.0","event_id":"sha256:dd14cdb4e6e141deefd84168f638c3997700e06a4b02a1c4f9790776612737df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43XBESTL3J3LGIPVHXCC3II4CO/bundle.json","state_url":"https://pith.science/pith/43XBESTL3J3LGIPVHXCC3II4CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43XBESTL3J3LGIPVHXCC3II4CO/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-23T05:02:03Z","links":{"resolver":"https://pith.science/pith/43XBESTL3J3LGIPVHXCC3II4CO","bundle":"https://pith.science/pith/43XBESTL3J3LGIPVHXCC3II4CO/bundle.json","state":"https://pith.science/pith/43XBESTL3J3LGIPVHXCC3II4CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43XBESTL3J3LGIPVHXCC3II4CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:43XBESTL3J3LGIPVHXCC3II4CO","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":"c361a936ac1979966943c762ad32c01e308705070cc73e07e34aa9f3cd86fb72","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-18T19:16:42Z","title_canon_sha256":"8b9cbea3c57937e600c21c66fb04a6b490445ac9d42284a39c3829d0f3d04b53"},"schema_version":"1.0","source":{"id":"2605.19052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19052","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19052v1","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19052","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"43XBESTL3J3L","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_16","alias_value":"43XBESTL3J3LGIPV","created_at":"2026-05-20T01:05:24Z"},{"alias_kind":"pith_short_8","alias_value":"43XBESTL","created_at":"2026-05-20T01:05:24Z"}],"graph_snapshots":[{"event_id":"sha256:dd14cdb4e6e141deefd84168f638c3997700e06a4b02a1c4f9790776612737df","target":"graph","created_at":"2026-05-20T01:05:24Z","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.19052/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the coupling constraints, LR enables parallel subproblem solving and often yields tighter dual bounds than standard linear programming relaxations, which is crucial for efficient branch-and-bound pruning. While recent empirical work has shown promising results using machine learning to predict these multipliers, a theoretical understanding of such methods remains an o","authors_text":"Anh Tuan Nguyen, Tung Quoc Le, Viet Anh Nguyen","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-18T19:16:42Z","title":"Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19052","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:1e320c03236e701d0fa4eb7e0531b4e4451ff50f4a2fdbc7ee1ce9fdd34759c6","target":"record","created_at":"2026-05-20T01:05:24Z","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":"c361a936ac1979966943c762ad32c01e308705070cc73e07e34aa9f3cd86fb72","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-18T19:16:42Z","title_canon_sha256":"8b9cbea3c57937e600c21c66fb04a6b490445ac9d42284a39c3829d0f3d04b53"},"schema_version":"1.0","source":{"id":"2605.19052","kind":"arxiv","version":1}},"canonical_sha256":"e6ee124a6bda76b321f53dc42da11c13af0e925f8eca66c9f7e69496233dbb82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6ee124a6bda76b321f53dc42da11c13af0e925f8eca66c9f7e69496233dbb82","first_computed_at":"2026-05-20T01:05:24.878362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:24.878362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nRdTFqMfiBZocM1d2sD4QhTQcz1dvI3AKhp9LQlOaTtalxcoCaor4U+1/aZLnfm6zzyRk++6Tun7AiqaSHRmBw==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:24.879028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e320c03236e701d0fa4eb7e0531b4e4451ff50f4a2fdbc7ee1ce9fdd34759c6","sha256:dd14cdb4e6e141deefd84168f638c3997700e06a4b02a1c4f9790776612737df"],"state_sha256":"964bfc327e4ed75ab56b973f0163ef890d77f37350a61ebc7d3bd0db0d285355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Uu6w568LHGMKxUX0J4mZTgN8gr86cuWAX2lBXR4+c0v0MiFyGmJdb1GBgRePpGHC8BrrPFkQIJOrN9BFr+NAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T05:02:03.351081Z","bundle_sha256":"abc0a159c8051a987a5999233e2b2ad11aa41aaceebfdb07543ca51fe5acd2b8"}}