{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5SJRDVDHYTZ35JJKS54AP7M3O5","short_pith_number":"pith:5SJRDVDH","schema_version":"1.0","canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","source":{"kind":"arxiv","id":"1902.02615","version":1},"attestation_state":"computed","paper":{"title":"Conflict-Driven Heuristics for Mixed Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Jakob Witzig","submitted_at":"2019-02-07T13:32:54Z","abstract_excerpt":"Two essential ingredients of modern mixed-integer programming (MIP) solvers are diving heuristics that simulate a partial depth-first search in a branch-and-bound search tree and conflict analysis of infeasible subproblems to learn valid constraints. So far, these techniques have mostly been studied independently: primal heuristics under the aspect of finding high-quality feasible solutions early during the solving process and conflict analysis for fathoming nodes of the search tree and improving the dual bound. Here, we combine both concepts in two different ways. First, we develop a diving h"},"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":"1902.02615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T13:32:54Z","cross_cats_sorted":[],"title_canon_sha256":"cd54a1748dadd1e1930d4a05826aa8e65c1c91e5f5ca85d13f4abdc10ad9eb55","abstract_canon_sha256":"aff40ca7f46e31e298cea21db1c402ccb3e24b7622762562d9a0992d6e071df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:32.715696Z","signature_b64":"ZezzGORnDSVn5s0BxWB0kXhTs1MZf+JcZNt39gmxEltjBfsZhdFqv75kmKOyrYbIK4kJ9Cofyq8oWovGzfDaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","last_reissued_at":"2026-05-17T23:54:32.715093Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:32.715093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-Driven Heuristics for Mixed Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Jakob Witzig","submitted_at":"2019-02-07T13:32:54Z","abstract_excerpt":"Two essential ingredients of modern mixed-integer programming (MIP) solvers are diving heuristics that simulate a partial depth-first search in a branch-and-bound search tree and conflict analysis of infeasible subproblems to learn valid constraints. So far, these techniques have mostly been studied independently: primal heuristics under the aspect of finding high-quality feasible solutions early during the solving process and conflict analysis for fathoming nodes of the search tree and improving the dual bound. Here, we combine both concepts in two different ways. First, we develop a diving h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02615","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":""},"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":"1902.02615","created_at":"2026-05-17T23:54:32.715189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02615v1","created_at":"2026-05-17T23:54:32.715189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02615","created_at":"2026-05-17T23:54:32.715189+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SJRDVDHYTZ3","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SJRDVDHYTZ35JJK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SJRDVDH","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5","json":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5.json","graph_json":"https://pith.science/api/pith-number/5SJRDVDHYTZ35JJKS54AP7M3O5/graph.json","events_json":"https://pith.science/api/pith-number/5SJRDVDHYTZ35JJKS54AP7M3O5/events.json","paper":"https://pith.science/paper/5SJRDVDH"},"agent_actions":{"view_html":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5","download_json":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5.json","view_paper":"https://pith.science/paper/5SJRDVDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02615&json=true","fetch_graph":"https://pith.science/api/pith-number/5SJRDVDHYTZ35JJKS54AP7M3O5/graph.json","fetch_events":"https://pith.science/api/pith-number/5SJRDVDHYTZ35JJKS54AP7M3O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/action/storage_attestation","attest_author":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/action/author_attestation","sign_citation":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/action/citation_signature","submit_replication":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/action/replication_record"}},"created_at":"2026-05-17T23:54:32.715189+00:00","updated_at":"2026-05-17T23:54:32.715189+00:00"}