{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IZY3WVLZ444WUF5VY7DNNHY5F2","short_pith_number":"pith:IZY3WVLZ","canonical_record":{"source":{"id":"2301.09943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T12:01:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"32fc4c245e0eb87dc0895e43e3422c86e64c4ac188e16dbeaa00b1b558a1ea3a","abstract_canon_sha256":"3055bedbc90e04c2d4e75475f64ef418e124a936f003f296463b508dfc3f3092"},"schema_version":"1.0"},"canonical_sha256":"4671bb5579e7396a17b5c7c6d69f1d2e93bb22b8c70eab96b9768cdbb583317c","source":{"kind":"arxiv","id":"2301.09943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.09943","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"2301.09943v1","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09943","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"IZY3WVLZ444W","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_16","alias_value":"IZY3WVLZ444WUF5V","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_8","alias_value":"IZY3WVLZ","created_at":"2026-07-05T05:35:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IZY3WVLZ444WUF5VY7DNNHY5F2","target":"record","payload":{"canonical_record":{"source":{"id":"2301.09943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T12:01:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"32fc4c245e0eb87dc0895e43e3422c86e64c4ac188e16dbeaa00b1b558a1ea3a","abstract_canon_sha256":"3055bedbc90e04c2d4e75475f64ef418e124a936f003f296463b508dfc3f3092"},"schema_version":"1.0"},"canonical_sha256":"4671bb5579e7396a17b5c7c6d69f1d2e93bb22b8c70eab96b9768cdbb583317c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:36.023490Z","signature_b64":"6FLbwRfW44SPQlqsSuunD+RzuaBJl6ZEHCoUpHtKtVnL6U4ixYkSw9c+VlcZJasnnWEnqonEP3IIdDdm9tzpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4671bb5579e7396a17b5c7c6d69f1d2e93bb22b8c70eab96b9768cdbb583317c","last_reissued_at":"2026-07-05T05:35:36.023017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:36.023017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.09943","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-07-05T05:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkLqpJOsLjtiDGm9v89JWwFZFnWF0APEfcaEsoC8IZDc41hpyLaI4dIV0OfQbOWHxRsAthV8euCQhAZF4xWzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:28:19.458178Z"},"content_sha256":"3799be3444053b7f536a8286b9779dd5a49d7a2a4eab12e40c763f428dbc7b6b","schema_version":"1.0","event_id":"sha256:3799be3444053b7f536a8286b9779dd5a49d7a2a4eab12e40c763f428dbc7b6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IZY3WVLZ444WUF5VY7DNNHY5F2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning To Dive In Branch And Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Max B. Paulus","submitted_at":"2023-01-24T12:01:45Z","abstract_excerpt":"Primal heuristics are important for solving mixed integer linear programs, because they find feasible solutions that facilitate branch and bound search. A prominent group of primal heuristics are diving heuristics. They iteratively modify and resolve linear programs to conduct a depth-first search from any node in the search tree. Existing divers rely on generic decision rules that fail to exploit structural commonality between similar problem instances that often arise in practice. Therefore, we propose L2Dive to learn specific diving heuristics with graph neural networks: We train generative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09943","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/2301.09943/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:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lXwm4iSdNWvwtAqzxeM7d9pnbBkCXt1s50mrT2L0nOX2o9nO7p3QOO+IGyxOoFBe1xVxLcIyOQt6fCIA0mkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:28:19.458677Z"},"content_sha256":"e0e5efb998b31ec4aa963350e72728e166a652f7fb6b2927125c2a9bd004836e","schema_version":"1.0","event_id":"sha256:e0e5efb998b31ec4aa963350e72728e166a652f7fb6b2927125c2a9bd004836e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/bundle.json","state_url":"https://pith.science/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/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-22T18:28:19Z","links":{"resolver":"https://pith.science/pith/IZY3WVLZ444WUF5VY7DNNHY5F2","bundle":"https://pith.science/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/bundle.json","state":"https://pith.science/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZY3WVLZ444WUF5VY7DNNHY5F2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IZY3WVLZ444WUF5VY7DNNHY5F2","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":"3055bedbc90e04c2d4e75475f64ef418e124a936f003f296463b508dfc3f3092","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T12:01:45Z","title_canon_sha256":"32fc4c245e0eb87dc0895e43e3422c86e64c4ac188e16dbeaa00b1b558a1ea3a"},"schema_version":"1.0","source":{"id":"2301.09943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.09943","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"2301.09943v1","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09943","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"IZY3WVLZ444W","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_16","alias_value":"IZY3WVLZ444WUF5V","created_at":"2026-07-05T05:35:36Z"},{"alias_kind":"pith_short_8","alias_value":"IZY3WVLZ","created_at":"2026-07-05T05:35:36Z"}],"graph_snapshots":[{"event_id":"sha256:e0e5efb998b31ec4aa963350e72728e166a652f7fb6b2927125c2a9bd004836e","target":"graph","created_at":"2026-07-05T05:35:36Z","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/2301.09943/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Primal heuristics are important for solving mixed integer linear programs, because they find feasible solutions that facilitate branch and bound search. A prominent group of primal heuristics are diving heuristics. They iteratively modify and resolve linear programs to conduct a depth-first search from any node in the search tree. Existing divers rely on generic decision rules that fail to exploit structural commonality between similar problem instances that often arise in practice. Therefore, we propose L2Dive to learn specific diving heuristics with graph neural networks: We train generative","authors_text":"Andreas Krause, Max B. Paulus","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T12:01:45Z","title":"Learning To Dive In Branch And Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09943","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:3799be3444053b7f536a8286b9779dd5a49d7a2a4eab12e40c763f428dbc7b6b","target":"record","created_at":"2026-07-05T05:35:36Z","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":"3055bedbc90e04c2d4e75475f64ef418e124a936f003f296463b508dfc3f3092","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T12:01:45Z","title_canon_sha256":"32fc4c245e0eb87dc0895e43e3422c86e64c4ac188e16dbeaa00b1b558a1ea3a"},"schema_version":"1.0","source":{"id":"2301.09943","kind":"arxiv","version":1}},"canonical_sha256":"4671bb5579e7396a17b5c7c6d69f1d2e93bb22b8c70eab96b9768cdbb583317c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4671bb5579e7396a17b5c7c6d69f1d2e93bb22b8c70eab96b9768cdbb583317c","first_computed_at":"2026-07-05T05:35:36.023017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:35:36.023017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FLbwRfW44SPQlqsSuunD+RzuaBJl6ZEHCoUpHtKtVnL6U4ixYkSw9c+VlcZJasnnWEnqonEP3IIdDdm9tzpBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:35:36.023490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.09943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3799be3444053b7f536a8286b9779dd5a49d7a2a4eab12e40c763f428dbc7b6b","sha256:e0e5efb998b31ec4aa963350e72728e166a652f7fb6b2927125c2a9bd004836e"],"state_sha256":"7399231bb369f6f5f8fc3f9f24219bfd9984aeb7766ea83bcca3d33f13c77060"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqyztUy3BjKVeIYuiZD284QrDdmobdJfflaOaRQmmjJV968u8cVmX48wYjqzslOzk1GohA1u4LTAQSiJl+i4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T18:28:19.462489Z","bundle_sha256":"410397a4bac8bf4da39a46b67893e17f573ad7e5c3d95feac131566217f7bafd"}}