{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BVT4XE3OZBEA4FTBRVO56C7WFZ","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":"167a019b5340b72012b3529d57d8eedcf55d9ddce911a37c574a371f722641e9","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T17:59:40Z","title_canon_sha256":"8cc6293760b451d06c7962ea27fef07d22dcbc4febe26c6b0fd81a844539b2bd"},"schema_version":"1.0","source":{"id":"1906.01629","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01629","created_at":"2026-07-05T00:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01629v3","created_at":"2026-07-05T00:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01629","created_at":"2026-07-05T00:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"BVT4XE3OZBEA","created_at":"2026-07-05T00:15:48Z"},{"alias_kind":"pith_short_16","alias_value":"BVT4XE3OZBEA4FTB","created_at":"2026-07-05T00:15:48Z"},{"alias_kind":"pith_short_8","alias_value":"BVT4XE3O","created_at":"2026-07-05T00:15:48Z"}],"graph_snapshots":[{"event_id":"sha256:cab5e16e46e87685017ed3edd38cc80dc2fd30ef82d030b373cfbade2e7d942a","target":"graph","created_at":"2026-07-05T00:15:48Z","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/1906.01629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural variable-constraint bipartite graph representation of mixed-integer linear programs. We train our model via imitation learning from the strong branching expert rule, and demonstrate on a series of hard problems that our approach produces policies that improve upon state-of-the-art machine-learning methods for branching and generalize to instances significantly ","authors_text":"Andrea Lodi, Didier Ch\\'etelat, Laurent Charlin, Maxime Gasse, Nicola Ferroni","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T17:59:40Z","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01629","kind":"arxiv","version":3},"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:d1f6260b460707984b86a8a320e61426c5dc6ce07e686236e0e35e56a548a98b","target":"record","created_at":"2026-07-05T00:15:48Z","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":"167a019b5340b72012b3529d57d8eedcf55d9ddce911a37c574a371f722641e9","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T17:59:40Z","title_canon_sha256":"8cc6293760b451d06c7962ea27fef07d22dcbc4febe26c6b0fd81a844539b2bd"},"schema_version":"1.0","source":{"id":"1906.01629","kind":"arxiv","version":3}},"canonical_sha256":"0d67cb936ec8480e16618d5ddf0bf62e73a6834690a23b604f9748d78b096e52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d67cb936ec8480e16618d5ddf0bf62e73a6834690a23b604f9748d78b096e52","first_computed_at":"2026-07-05T00:15:48.948352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:48.948352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A3GNmgv8g6lqhugjgZEzXQGkU54Fj7J+/OR8/K1gAo/KBojxws6Ll4NV31QiUiMdOMLxw2QKHS0mkKykMRgtDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:48.948888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01629","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f6260b460707984b86a8a320e61426c5dc6ce07e686236e0e35e56a548a98b","sha256:cab5e16e46e87685017ed3edd38cc80dc2fd30ef82d030b373cfbade2e7d942a"],"state_sha256":"dde0e719a2d5101c7d6a719cf9ba720697b3337773f5b3ed0fcc000d965ec162"}