{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TB3NUXL52PL3QY2U2OLHANMYGW","short_pith_number":"pith:TB3NUXL5","canonical_record":{"source":{"id":"2411.18321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-27T13:22:31Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MS"],"title_canon_sha256":"0ba8245111dfbe5457881357902e3acf8131f33ddd865729af18ab58ee102d90","abstract_canon_sha256":"7073330248ade1706385458f50159f1ee5ad3121f1b78e88da3a6d49f87b1545"},"schema_version":"1.0"},"canonical_sha256":"9876da5d7dd3d7b86354d3967035983599325dd567b2dfda94cc3e5e10aa3954","source":{"kind":"arxiv","id":"2411.18321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18321","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18321v1","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18321","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"TB3NUXL52PL3","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_16","alias_value":"TB3NUXL52PL3QY2U","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_8","alias_value":"TB3NUXL5","created_at":"2026-07-05T09:41:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TB3NUXL52PL3QY2U2OLHANMYGW","target":"record","payload":{"canonical_record":{"source":{"id":"2411.18321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-27T13:22:31Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MS"],"title_canon_sha256":"0ba8245111dfbe5457881357902e3acf8131f33ddd865729af18ab58ee102d90","abstract_canon_sha256":"7073330248ade1706385458f50159f1ee5ad3121f1b78e88da3a6d49f87b1545"},"schema_version":"1.0"},"canonical_sha256":"9876da5d7dd3d7b86354d3967035983599325dd567b2dfda94cc3e5e10aa3954","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:14.828023Z","signature_b64":"hmNGWmSed9/GbET4QPikBIPCH0p1m9103cCDb5ZZHYUUuWsBMZGBgBUhmGp76mzd6Qd+GfTw4DEmsjXABdNIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9876da5d7dd3d7b86354d3967035983599325dd567b2dfda94cc3e5e10aa3954","last_reissued_at":"2026-07-05T09:41:14.827569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:14.827569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.18321","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-05T09:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bcpah1oT3w8qW/8QrvJK/WP1MH8XRDIsqnxYJ4Lxlol1UjDjLuLcvlELx8JmKeAREx0uKK+RrIQ9yOB5vSetAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:58:55.605885Z"},"content_sha256":"2abc6882533fcd12a5d8e7a8d7c3aeb5bba3de3443d4de74138c7a1d11de2892","schema_version":"1.0","event_id":"sha256:2abc6882533fcd12a5d8e7a8d7c3aeb5bba3de3443d4de74138c7a1d11de2892"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TB3NUXL52PL3QY2U2OLHANMYGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning optimal objective values for MILP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MS"],"primary_cat":"math.OC","authors_text":"Karen Aardal, Lara Scavuzzo, Neil Yorke-Smith","submitted_at":"2024-11-27T13:22:31Z","abstract_excerpt":"Modern Mixed Integer Linear Programming (MILP) solvers use the Branch-and-Bound algorithm together with a plethora of auxiliary components that speed up the search. In recent years, there has been an explosive development in the use of machine learning for enhancing and supporting these algorithmic components. Within this line, we propose a methodology for predicting the optimal objective value, or, equivalently, predicting if the current incumbent is optimal. For this task, we introduce a predictor based on a graph neural network (GNN) architecture, together with a set of dynamic features. Ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18321","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/2411.18321/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-05T09:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fdzzq/6ApiXY6V2g3iHsmAT85zWViWtp+r4mINCpxIRDHkQN8Ps79WWQDdDmei2/weunjLSW/JN3kdQ8ssw1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:58:55.606303Z"},"content_sha256":"49ab54abf9e684231aa25d6d4b687b203093d70635f73ae84e993cb407ab6187","schema_version":"1.0","event_id":"sha256:49ab54abf9e684231aa25d6d4b687b203093d70635f73ae84e993cb407ab6187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TB3NUXL52PL3QY2U2OLHANMYGW/bundle.json","state_url":"https://pith.science/pith/TB3NUXL52PL3QY2U2OLHANMYGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TB3NUXL52PL3QY2U2OLHANMYGW/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-13T00:58:55Z","links":{"resolver":"https://pith.science/pith/TB3NUXL52PL3QY2U2OLHANMYGW","bundle":"https://pith.science/pith/TB3NUXL52PL3QY2U2OLHANMYGW/bundle.json","state":"https://pith.science/pith/TB3NUXL52PL3QY2U2OLHANMYGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TB3NUXL52PL3QY2U2OLHANMYGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TB3NUXL52PL3QY2U2OLHANMYGW","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":"7073330248ade1706385458f50159f1ee5ad3121f1b78e88da3a6d49f87b1545","cross_cats_sorted":["cs.AI","cs.LG","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-27T13:22:31Z","title_canon_sha256":"0ba8245111dfbe5457881357902e3acf8131f33ddd865729af18ab58ee102d90"},"schema_version":"1.0","source":{"id":"2411.18321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18321","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18321v1","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18321","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"TB3NUXL52PL3","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_16","alias_value":"TB3NUXL52PL3QY2U","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_8","alias_value":"TB3NUXL5","created_at":"2026-07-05T09:41:14Z"}],"graph_snapshots":[{"event_id":"sha256:49ab54abf9e684231aa25d6d4b687b203093d70635f73ae84e993cb407ab6187","target":"graph","created_at":"2026-07-05T09:41:14Z","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/2411.18321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern Mixed Integer Linear Programming (MILP) solvers use the Branch-and-Bound algorithm together with a plethora of auxiliary components that speed up the search. In recent years, there has been an explosive development in the use of machine learning for enhancing and supporting these algorithmic components. Within this line, we propose a methodology for predicting the optimal objective value, or, equivalently, predicting if the current incumbent is optimal. For this task, we introduce a predictor based on a graph neural network (GNN) architecture, together with a set of dynamic features. Ex","authors_text":"Karen Aardal, Lara Scavuzzo, Neil Yorke-Smith","cross_cats":["cs.AI","cs.LG","cs.MS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-27T13:22:31Z","title":"Learning optimal objective values for MILP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18321","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:2abc6882533fcd12a5d8e7a8d7c3aeb5bba3de3443d4de74138c7a1d11de2892","target":"record","created_at":"2026-07-05T09:41:14Z","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":"7073330248ade1706385458f50159f1ee5ad3121f1b78e88da3a6d49f87b1545","cross_cats_sorted":["cs.AI","cs.LG","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-27T13:22:31Z","title_canon_sha256":"0ba8245111dfbe5457881357902e3acf8131f33ddd865729af18ab58ee102d90"},"schema_version":"1.0","source":{"id":"2411.18321","kind":"arxiv","version":1}},"canonical_sha256":"9876da5d7dd3d7b86354d3967035983599325dd567b2dfda94cc3e5e10aa3954","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9876da5d7dd3d7b86354d3967035983599325dd567b2dfda94cc3e5e10aa3954","first_computed_at":"2026-07-05T09:41:14.827569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:14.827569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmNGWmSed9/GbET4QPikBIPCH0p1m9103cCDb5ZZHYUUuWsBMZGBgBUhmGp76mzd6Qd+GfTw4DEmsjXABdNIDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:14.828023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2abc6882533fcd12a5d8e7a8d7c3aeb5bba3de3443d4de74138c7a1d11de2892","sha256:49ab54abf9e684231aa25d6d4b687b203093d70635f73ae84e993cb407ab6187"],"state_sha256":"f21a3ec11f838830cdb205f3b366952f29d29630d623f62d20102868d9cf85a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vA/ktCRqwDxBWInY6e2QgugWpllhn4WeKsLmxPcVt5navfB7vtvOLy0HFAagO3VM48S6uJ4wys9S+HnVjZUuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T00:58:55.608747Z","bundle_sha256":"e026026049a8244cb983b8896356071b33d3cb4e49755792ce5df61fb82ef9cf"}}