{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YH725QIMGNPTXTGCRY3XO65FVO","short_pith_number":"pith:YH725QIM","canonical_record":{"source":{"id":"2302.05636","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-11T09:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"8a1926d6aded01569d7b06c0f2a375676593f55e20adea82936618e3313bb675","abstract_canon_sha256":"9623ca7ee7c7875318f3832f7327b33493027ec003905c83403142c136a43ec5"},"schema_version":"1.0"},"canonical_sha256":"c1ffaec10c335f3bccc28e37777ba5ab8cd9ccb9bad54004ac6d345573da1d4d","source":{"kind":"arxiv","id":"2302.05636","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05636","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05636v4","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05636","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"YH725QIMGNPT","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_16","alias_value":"YH725QIMGNPTXTGC","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_8","alias_value":"YH725QIM","created_at":"2026-07-05T05:48:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YH725QIMGNPTXTGCRY3XO65FVO","target":"record","payload":{"canonical_record":{"source":{"id":"2302.05636","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-11T09:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"8a1926d6aded01569d7b06c0f2a375676593f55e20adea82936618e3313bb675","abstract_canon_sha256":"9623ca7ee7c7875318f3832f7327b33493027ec003905c83403142c136a43ec5"},"schema_version":"1.0"},"canonical_sha256":"c1ffaec10c335f3bccc28e37777ba5ab8cd9ccb9bad54004ac6d345573da1d4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:06.002240Z","signature_b64":"cpVpHSQcloZNtiN6zQuuzVi5frQBsdFAqHMhVqcaqpKyV32PZ095p7iPrwFDncZEYYj/6kKooTvUplgyFmXHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1ffaec10c335f3bccc28e37777ba5ab8cd9ccb9bad54004ac6d345573da1d4d","last_reissued_at":"2026-07-05T05:48:06.001713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:06.001713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.05636","source_version":4,"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-05T05:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA+5IXtbOKXyMIjH9eDM0qXehcyFOMVEt1WZ05rbO8FguwPBtnvRThsPXVGEKX1GFp2+8FsL0GQDNCPIEmnSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:46:31.484529Z"},"content_sha256":"ecc93f41a4746a145aa0954cc020378af7e0b5b773f8f0f9d4eb3e98968fc924","schema_version":"1.0","event_id":"sha256:ecc93f41a4746a145aa0954cc020378af7e0b5b773f8f0f9d4eb3e98968fc924"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YH725QIMGNPTXTGCRY3XO65FVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Dong Zhang, Linxin Yang, Qian Chen, Qingyu Han, Ruoyu Sun, Xiang Zhou, Xiaodong Luo","submitted_at":"2023-02-11T09:38:26Z","abstract_excerpt":"Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learning (ML) algorithms are capable of capturing common patterns across these MILP instances. In this work, we combine ML with optimization and propose a novel predict-and-search framework for efficiently identifying high-quality feasible solutions. Specifically, we first utilize graph neural networks to predict the marginal probability of each variable, and then search for the best f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05636","kind":"arxiv","version":4},"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/2302.05636/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-05T05:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQg2JoNcbUjgEBHs7/PXcEty0v0mJUfdkqwzspvjTlIZ+J1sHbwEHSlX9zZcyGYq5eEe1B2xEHeLKU7UXf7DDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:46:31.485425Z"},"content_sha256":"864126a756bd578b06d54d105bb71a2e55f0c7ce551dca0111546cff1ec821e4","schema_version":"1.0","event_id":"sha256:864126a756bd578b06d54d105bb71a2e55f0c7ce551dca0111546cff1ec821e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YH725QIMGNPTXTGCRY3XO65FVO/bundle.json","state_url":"https://pith.science/pith/YH725QIMGNPTXTGCRY3XO65FVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YH725QIMGNPTXTGCRY3XO65FVO/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-11T11:46:31Z","links":{"resolver":"https://pith.science/pith/YH725QIMGNPTXTGCRY3XO65FVO","bundle":"https://pith.science/pith/YH725QIMGNPTXTGCRY3XO65FVO/bundle.json","state":"https://pith.science/pith/YH725QIMGNPTXTGCRY3XO65FVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YH725QIMGNPTXTGCRY3XO65FVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YH725QIMGNPTXTGCRY3XO65FVO","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":"9623ca7ee7c7875318f3832f7327b33493027ec003905c83403142c136a43ec5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-11T09:38:26Z","title_canon_sha256":"8a1926d6aded01569d7b06c0f2a375676593f55e20adea82936618e3313bb675"},"schema_version":"1.0","source":{"id":"2302.05636","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.05636","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"2302.05636v4","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05636","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"YH725QIMGNPT","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_16","alias_value":"YH725QIMGNPTXTGC","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_8","alias_value":"YH725QIM","created_at":"2026-07-05T05:48:06Z"}],"graph_snapshots":[{"event_id":"sha256:864126a756bd578b06d54d105bb71a2e55f0c7ce551dca0111546cff1ec821e4","target":"graph","created_at":"2026-07-05T05:48:06Z","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/2302.05636/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learning (ML) algorithms are capable of capturing common patterns across these MILP instances. In this work, we combine ML with optimization and propose a novel predict-and-search framework for efficiently identifying high-quality feasible solutions. Specifically, we first utilize graph neural networks to predict the marginal probability of each variable, and then search for the best f","authors_text":"Akang Wang, Dong Zhang, Linxin Yang, Qian Chen, Qingyu Han, Ruoyu Sun, Xiang Zhou, Xiaodong Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-11T09:38:26Z","title":"A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05636","kind":"arxiv","version":4},"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:ecc93f41a4746a145aa0954cc020378af7e0b5b773f8f0f9d4eb3e98968fc924","target":"record","created_at":"2026-07-05T05:48:06Z","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":"9623ca7ee7c7875318f3832f7327b33493027ec003905c83403142c136a43ec5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-11T09:38:26Z","title_canon_sha256":"8a1926d6aded01569d7b06c0f2a375676593f55e20adea82936618e3313bb675"},"schema_version":"1.0","source":{"id":"2302.05636","kind":"arxiv","version":4}},"canonical_sha256":"c1ffaec10c335f3bccc28e37777ba5ab8cd9ccb9bad54004ac6d345573da1d4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1ffaec10c335f3bccc28e37777ba5ab8cd9ccb9bad54004ac6d345573da1d4d","first_computed_at":"2026-07-05T05:48:06.001713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:06.001713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cpVpHSQcloZNtiN6zQuuzVi5frQBsdFAqHMhVqcaqpKyV32PZ095p7iPrwFDncZEYYj/6kKooTvUplgyFmXHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:06.002240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.05636","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecc93f41a4746a145aa0954cc020378af7e0b5b773f8f0f9d4eb3e98968fc924","sha256:864126a756bd578b06d54d105bb71a2e55f0c7ce551dca0111546cff1ec821e4"],"state_sha256":"87899b8c39ac87535b30a36568bdc9088ba6d62d1a57e37f57d69a24c181b569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NHAChQMK6x8R8ENumoNi5CzVC5i+++YLPJeSijejH/cYxf45eX/iN7YDuYeZLgrijk1wUwPLv5xFSbZm9xoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:46:31.490055Z","bundle_sha256":"5a6f39b1b9f3e58060b77c73a7e0992c20b58d862844145117957d6653f9e484"}}