{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OGQ5AZYDPLNSNPMQMHB7VMPRKN","short_pith_number":"pith:OGQ5AZYD","schema_version":"1.0","canonical_sha256":"71a1d067037adb26bd9061c3fab1f1535ba4b894427f3ec5160f20e48f0e91a5","source":{"kind":"arxiv","id":"2202.04910","version":1},"attestation_state":"computed","paper":{"title":"Instance-wise algorithm configuration with graph neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andisheh Amrollahi, Chris Wendler, Claudio Ferrari, J\\'er\\'emy Scheurer, Max B. Paulus, Romeo Valentin","submitted_at":"2022-02-10T09:06:52Z","abstract_excerpt":"We present our submission for the configuration task of the Machine Learning for Combinatorial Optimization (ML4CO) NeurIPS 2021 competition. The configuration task is to predict a good configuration of the open-source solver SCIP to solve a mixed integer linear program (MILP) efficiently. We pose this task as a supervised learning problem: First, we compile a large dataset of the solver performance for various configurations and all provided MILP instances. Second, we use this data to train a graph neural network that learns to predict a good configuration for a specific instance. The submiss"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2202.04910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-10T09:06:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6208a19f58c51f72d5e3ce4b4b5fa36850ede08b218140f6bba79e00b2547a51","abstract_canon_sha256":"b00831ab37b9ecf790c2c614858ea8935d9aa7ba46ce83231bd9f6414daf4082"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:55.591406Z","signature_b64":"n8Qmc4pQ3yphQrlMBY2uI0R8Yku/7IPm/gxIyf16V93+dOekhmHUi4dGXvX2Ko1+GHZq9UsMqV+De2+lX2oRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a1d067037adb26bd9061c3fab1f1535ba4b894427f3ec5160f20e48f0e91a5","last_reissued_at":"2026-07-05T03:55:55.590908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:55.590908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-wise algorithm configuration with graph neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andisheh Amrollahi, Chris Wendler, Claudio Ferrari, J\\'er\\'emy Scheurer, Max B. Paulus, Romeo Valentin","submitted_at":"2022-02-10T09:06:52Z","abstract_excerpt":"We present our submission for the configuration task of the Machine Learning for Combinatorial Optimization (ML4CO) NeurIPS 2021 competition. The configuration task is to predict a good configuration of the open-source solver SCIP to solve a mixed integer linear program (MILP) efficiently. We pose this task as a supervised learning problem: First, we compile a large dataset of the solver performance for various configurations and all provided MILP instances. Second, we use this data to train a graph neural network that learns to predict a good configuration for a specific instance. The submiss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.04910","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/2202.04910/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.04910","created_at":"2026-07-05T03:55:55.590969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.04910v1","created_at":"2026-07-05T03:55:55.590969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.04910","created_at":"2026-07-05T03:55:55.590969+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGQ5AZYDPLNS","created_at":"2026-07-05T03:55:55.590969+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGQ5AZYDPLNSNPMQ","created_at":"2026-07-05T03:55:55.590969+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGQ5AZYD","created_at":"2026-07-05T03:55:55.590969+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23299","citing_title":"GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN","json":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN.json","graph_json":"https://pith.science/api/pith-number/OGQ5AZYDPLNSNPMQMHB7VMPRKN/graph.json","events_json":"https://pith.science/api/pith-number/OGQ5AZYDPLNSNPMQMHB7VMPRKN/events.json","paper":"https://pith.science/paper/OGQ5AZYD"},"agent_actions":{"view_html":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN","download_json":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN.json","view_paper":"https://pith.science/paper/OGQ5AZYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.04910&json=true","fetch_graph":"https://pith.science/api/pith-number/OGQ5AZYDPLNSNPMQMHB7VMPRKN/graph.json","fetch_events":"https://pith.science/api/pith-number/OGQ5AZYDPLNSNPMQMHB7VMPRKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN/action/storage_attestation","attest_author":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN/action/author_attestation","sign_citation":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN/action/citation_signature","submit_replication":"https://pith.science/pith/OGQ5AZYDPLNSNPMQMHB7VMPRKN/action/replication_record"}},"created_at":"2026-07-05T03:55:55.590969+00:00","updated_at":"2026-07-05T03:55:55.590969+00:00"}