{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MJOXH4EXLPPDHXN7GIDYCHH4SW","short_pith_number":"pith:MJOXH4EX","schema_version":"1.0","canonical_sha256":"625d73f0975bde33ddbf3207811cfc95baddec402db836c2a1e0c47ed449e993","source":{"kind":"arxiv","id":"2402.17702","version":2},"attestation_state":"computed","paper":{"title":"The SCIP Optimization Suite 9.0","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Hoen, Ambros Gleixner, Antonia Chmiela, Christopher Hojny, Christoph Graczyk, Dieter Weninger, Dominik Kamp, Erik M\\\"uhmer, Felipe Serrano, Franziska Schl\\\"osser, Gioni Mexi, Ivo Hedtke, Jasper van Doornmalen, Jo\\~ao Dion\\'isio, Julian Manns, Jurgen Lentz, Katrin Halbig, Kevin Kofler, Ksenia Bestuzheva, Leon Eifler, Liding Xu, Marc E. Pfetsch, Mark Turner, Mathieu Besan\\c{c}on, Mohammed Ghannam, Rolf van der Hulst, Stefan Vigerske, Suresh Bolusani, Thorsten Koch, Tim Donkiewicz, Yuji Shinano","submitted_at":"2024-02-27T17:27:47Z","abstract_excerpt":"The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in the SCIP Optimization Suite 9.0. The updates in SCIP 9.0 include improved symmetry handling, additions and improvements of nonlinear handlers and primal heuristics, a new cut generator and two new cut selection schemes, a new branching rule, a new LP interface, and several bug fixes. The SCIP Optimization Suite 9.0 also features new Rust and C++ interfaces "},"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":"2402.17702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-27T17:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"83a97eae1a4fd43f128298fe234da98acaec2399b47e38cbcdc861e990a3f7a1","abstract_canon_sha256":"1211d761bd6413ae661f2aa91837a77cd5059a2ce883785c8dcb6e3d6b273c67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:05.675365Z","signature_b64":"Yz4+VETGAH8rFrJB0c/WlPMrukKfikPhYRSPxS43w5ddupqM/PVqkThuX+ifTefKYc4E+u8AiQt9u1anfGHTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"625d73f0975bde33ddbf3207811cfc95baddec402db836c2a1e0c47ed449e993","last_reissued_at":"2026-07-05T09:39:05.674851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:05.674851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The SCIP Optimization Suite 9.0","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Hoen, Ambros Gleixner, Antonia Chmiela, Christopher Hojny, Christoph Graczyk, Dieter Weninger, Dominik Kamp, Erik M\\\"uhmer, Felipe Serrano, Franziska Schl\\\"osser, Gioni Mexi, Ivo Hedtke, Jasper van Doornmalen, Jo\\~ao Dion\\'isio, Julian Manns, Jurgen Lentz, Katrin Halbig, Kevin Kofler, Ksenia Bestuzheva, Leon Eifler, Liding Xu, Marc E. Pfetsch, Mark Turner, Mathieu Besan\\c{c}on, Mohammed Ghannam, Rolf van der Hulst, Stefan Vigerske, Suresh Bolusani, Thorsten Koch, Tim Donkiewicz, Yuji Shinano","submitted_at":"2024-02-27T17:27:47Z","abstract_excerpt":"The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in the SCIP Optimization Suite 9.0. The updates in SCIP 9.0 include improved symmetry handling, additions and improvements of nonlinear handlers and primal heuristics, a new cut generator and two new cut selection schemes, a new branching rule, a new LP interface, and several bug fixes. The SCIP Optimization Suite 9.0 also features new Rust and C++ interfaces "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17702","kind":"arxiv","version":2},"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/2402.17702/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":"2402.17702","created_at":"2026-07-05T09:39:05.674909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17702v2","created_at":"2026-07-05T09:39:05.674909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17702","created_at":"2026-07-05T09:39:05.674909+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJOXH4EXLPPD","created_at":"2026-07-05T09:39:05.674909+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJOXH4EXLPPDHXN7","created_at":"2026-07-05T09:39:05.674909+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJOXH4EX","created_at":"2026-07-05T09:39:05.674909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10836","citing_title":"Bounding the Null Space: Interval-Based Uncertainty Quantification for Non-Identifiable Groundwater Models","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01552","citing_title":"Symbolic Discovery of Iterative Algorithms: A Continuous Latent Space Bayesian Optimization Framework","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2412.13235","citing_title":"Logic-Constrained Shortest Paths for Flight Planning","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03871","citing_title":"Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08639","citing_title":"ReLibra: Routing-Replay-Guided Load Balancing for MoE Training in Reinforcement Learning","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11758","citing_title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16804","citing_title":"AutoOR: Scalably Post-training LLMs to Autoformalize Operations Research Problems","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW","json":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW.json","graph_json":"https://pith.science/api/pith-number/MJOXH4EXLPPDHXN7GIDYCHH4SW/graph.json","events_json":"https://pith.science/api/pith-number/MJOXH4EXLPPDHXN7GIDYCHH4SW/events.json","paper":"https://pith.science/paper/MJOXH4EX"},"agent_actions":{"view_html":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW","download_json":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW.json","view_paper":"https://pith.science/paper/MJOXH4EX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17702&json=true","fetch_graph":"https://pith.science/api/pith-number/MJOXH4EXLPPDHXN7GIDYCHH4SW/graph.json","fetch_events":"https://pith.science/api/pith-number/MJOXH4EXLPPDHXN7GIDYCHH4SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW/action/storage_attestation","attest_author":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW/action/author_attestation","sign_citation":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW/action/citation_signature","submit_replication":"https://pith.science/pith/MJOXH4EXLPPDHXN7GIDYCHH4SW/action/replication_record"}},"created_at":"2026-07-05T09:39:05.674909+00:00","updated_at":"2026-07-05T09:39:05.674909+00:00"}