{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5SJRDVDHYTZ35JJKS54AP7M3O5","short_pith_number":"pith:5SJRDVDH","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"},"canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","source":{"kind":"arxiv","id":"1902.02615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02615","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02615v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02615","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"5SJRDVDHYTZ3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5SJRDVDHYTZ35JJK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5SJRDVDH","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5SJRDVDHYTZ35JJKS54AP7M3O5","target":"record","payload":{"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"},"canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","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"},"source_kind":"arxiv","source_id":"1902.02615","source_version":1,"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-05-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TgRTcJPAzSSB1zdM9CokuiN/7FsexzoFuJnac7YKYaieXxayAkaQ4SVmO4NkjHoc7HsIcGOCZW7HnDp+x6iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:29:45.574688Z"},"content_sha256":"38e90c103b218c79df10b7fcaf968c146eb2001cbb1e8d708022a5b68517d428","schema_version":"1.0","event_id":"sha256:38e90c103b218c79df10b7fcaf968c146eb2001cbb1e8d708022a5b68517d428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5SJRDVDHYTZ35JJKS54AP7M3O5","target":"graph","payload":{"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"},"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-05-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9lhkygGIYSxH12CZ+OX4anNA0hB1nyu3Wd25OnG8lGwDvbJkqUjVyVIPmDHOTw+LRklfIPgJY05WFMgfblbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:29:45.575032Z"},"content_sha256":"10123b861f74d1a3b4e51b5c130832b30888a840b5be5117e3d0445adcdabc5e","schema_version":"1.0","event_id":"sha256:10123b861f74d1a3b4e51b5c130832b30888a840b5be5117e3d0445adcdabc5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/bundle.json","state_url":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/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-06-23T21:29:45Z","links":{"resolver":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5","bundle":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/bundle.json","state":"https://pith.science/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SJRDVDHYTZ35JJKS54AP7M3O5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5SJRDVDHYTZ35JJKS54AP7M3O5","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":"aff40ca7f46e31e298cea21db1c402ccb3e24b7622762562d9a0992d6e071df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T13:32:54Z","title_canon_sha256":"cd54a1748dadd1e1930d4a05826aa8e65c1c91e5f5ca85d13f4abdc10ad9eb55"},"schema_version":"1.0","source":{"id":"1902.02615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02615","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02615v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02615","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"5SJRDVDHYTZ3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5SJRDVDHYTZ35JJK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5SJRDVDH","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:10123b861f74d1a3b4e51b5c130832b30888a840b5be5117e3d0445adcdabc5e","target":"graph","created_at":"2026-05-17T23:54:32Z","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"},"paper":{"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","authors_text":"Ambros Gleixner, Jakob Witzig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T13:32:54Z","title":"Conflict-Driven Heuristics for Mixed Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02615","kind":"arxiv","version":1},"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:38e90c103b218c79df10b7fcaf968c146eb2001cbb1e8d708022a5b68517d428","target":"record","created_at":"2026-05-17T23:54:32Z","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":"aff40ca7f46e31e298cea21db1c402ccb3e24b7622762562d9a0992d6e071df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T13:32:54Z","title_canon_sha256":"cd54a1748dadd1e1930d4a05826aa8e65c1c91e5f5ca85d13f4abdc10ad9eb55"},"schema_version":"1.0","source":{"id":"1902.02615","kind":"arxiv","version":1}},"canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9311d467c4f3bea52a977807fd9b7749faeb73c5912d1b01aaa0f54948e6fd","first_computed_at":"2026-05-17T23:54:32.715093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:32.715093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZezzGORnDSVn5s0BxWB0kXhTs1MZf+JcZNt39gmxEltjBfsZhdFqv75kmKOyrYbIK4kJ9Cofyq8oWovGzfDaBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:32.715696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38e90c103b218c79df10b7fcaf968c146eb2001cbb1e8d708022a5b68517d428","sha256:10123b861f74d1a3b4e51b5c130832b30888a840b5be5117e3d0445adcdabc5e"],"state_sha256":"dd07a46c3e1d8dc094ee2cd524fa0484bd27fe31da1fcb9723371520626e31c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2SU8CsTbh5IRPjz+zERy9kjMC6yMuGk0yt82cLj9EsAX9kdT/MWoBhAlTcu4BsdrgSubeOfC5n0FPdYslTtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:29:45.576951Z","bundle_sha256":"a4ea124310a5016de5337311bad9e83c47898866588aa61acfcce5121bbae287"}}