{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LFROZTAHO6JG5IUCMTSCMEX2P6","short_pith_number":"pith:LFROZTAH","canonical_record":{"source":{"id":"1307.4689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-17T16:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"b91c54ce0a900d336ea49e15f79dcfecdbbd537461548589487ca9f4421d714a","abstract_canon_sha256":"d4cba88bce5293ec58985c1b1b9a16be8d49093d8cf0ff7b722e354f7fe4bc07"},"schema_version":"1.0"},"canonical_sha256":"5962eccc0777926ea28264e42612fa7fab52339c7ce5fcf2ad61fdc0a8f56c3d","source":{"kind":"arxiv","id":"1307.4689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4689","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4689v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4689","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LFROZTAHO6JG","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LFROZTAHO6JG5IUC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LFROZTAH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LFROZTAHO6JG5IUCMTSCMEX2P6","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-17T16:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"b91c54ce0a900d336ea49e15f79dcfecdbbd537461548589487ca9f4421d714a","abstract_canon_sha256":"d4cba88bce5293ec58985c1b1b9a16be8d49093d8cf0ff7b722e354f7fe4bc07"},"schema_version":"1.0"},"canonical_sha256":"5962eccc0777926ea28264e42612fa7fab52339c7ce5fcf2ad61fdc0a8f56c3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.474600Z","signature_b64":"24Z5sZnp1wUA1eUubcyYx+zue7l30A7eN1Db5QSmbKd4GSatvGyMAXBYOSdUeKngB4NKcnCquz0Rv83E4z2OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5962eccc0777926ea28264e42612fa7fab52339c7ce5fcf2ad61fdc0a8f56c3d","last_reissued_at":"2026-05-18T03:18:07.473800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.473800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4689","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAlgXkjpe++PKHqNDJqXreK+VJ2tbVHf+q9jdPbDvuMX+izmNYKeLp6pwUaiknTqlhVq+5V99aeH/gjRu8BCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:08:46.308124Z"},"content_sha256":"4681f986507ff45260317f2525594e303c442350f6dfa8a6376ecf8d98daa570","schema_version":"1.0","event_id":"sha256:4681f986507ff45260317f2525594e303c442350f6dfa8a6376ecf8d98daa570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LFROZTAHO6JG5IUCMTSCMEX2P6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DASH: Dynamic Approach for Switching Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Giovanni Di Liberto, Kevin Leo, Serdar Kadioglu, Yuri Malitsky","submitted_at":"2013-07-17T16:31:14Z","abstract_excerpt":"Complete tree search is a highly effective method for tackling MIP problems, and over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Recently, portfolio algorithms have taken the process a step further, trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered subproblem. In this paper we identify a feature space that captures both the evolution of the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4689","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWx0LemqVnmBVlCgbp5WUXfzAYZ1xyea2b4fBCsyGfR1fol2nrQ38Dv3H/1wEn09qlgANBqkURYxAJ8/WSBqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:08:46.308487Z"},"content_sha256":"e7950b94c32d9318893b6887fe7b9728445adb0e9af8a9dd461c855be21d2dbd","schema_version":"1.0","event_id":"sha256:e7950b94c32d9318893b6887fe7b9728445adb0e9af8a9dd461c855be21d2dbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/bundle.json","state_url":"https://pith.science/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/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-23T10:08:46Z","links":{"resolver":"https://pith.science/pith/LFROZTAHO6JG5IUCMTSCMEX2P6","bundle":"https://pith.science/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/bundle.json","state":"https://pith.science/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFROZTAHO6JG5IUCMTSCMEX2P6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LFROZTAHO6JG5IUCMTSCMEX2P6","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":"d4cba88bce5293ec58985c1b1b9a16be8d49093d8cf0ff7b722e354f7fe4bc07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-17T16:31:14Z","title_canon_sha256":"b91c54ce0a900d336ea49e15f79dcfecdbbd537461548589487ca9f4421d714a"},"schema_version":"1.0","source":{"id":"1307.4689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4689","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4689v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4689","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LFROZTAHO6JG","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LFROZTAHO6JG5IUC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LFROZTAH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:e7950b94c32d9318893b6887fe7b9728445adb0e9af8a9dd461c855be21d2dbd","target":"graph","created_at":"2026-05-18T03:18:07Z","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":"Complete tree search is a highly effective method for tackling MIP problems, and over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Recently, portfolio algorithms have taken the process a step further, trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered subproblem. In this paper we identify a feature space that captures both the evolution of the pro","authors_text":"Giovanni Di Liberto, Kevin Leo, Serdar Kadioglu, Yuri Malitsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-17T16:31:14Z","title":"DASH: Dynamic Approach for Switching Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4689","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:4681f986507ff45260317f2525594e303c442350f6dfa8a6376ecf8d98daa570","target":"record","created_at":"2026-05-18T03:18:07Z","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":"d4cba88bce5293ec58985c1b1b9a16be8d49093d8cf0ff7b722e354f7fe4bc07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-17T16:31:14Z","title_canon_sha256":"b91c54ce0a900d336ea49e15f79dcfecdbbd537461548589487ca9f4421d714a"},"schema_version":"1.0","source":{"id":"1307.4689","kind":"arxiv","version":1}},"canonical_sha256":"5962eccc0777926ea28264e42612fa7fab52339c7ce5fcf2ad61fdc0a8f56c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5962eccc0777926ea28264e42612fa7fab52339c7ce5fcf2ad61fdc0a8f56c3d","first_computed_at":"2026-05-18T03:18:07.473800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.473800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"24Z5sZnp1wUA1eUubcyYx+zue7l30A7eN1Db5QSmbKd4GSatvGyMAXBYOSdUeKngB4NKcnCquz0Rv83E4z2OAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.474600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4681f986507ff45260317f2525594e303c442350f6dfa8a6376ecf8d98daa570","sha256:e7950b94c32d9318893b6887fe7b9728445adb0e9af8a9dd461c855be21d2dbd"],"state_sha256":"14480199c4e8ffdfd25aeed075eb675129488ffc010caf33375ee9d184e13abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nyJCknPVH62V052bG1dGkoIOyiFxoDLYk9uw57raDH1Mp6i/NhaP9p5iFu6DpSIQ/BSs5Xyo1cvpB7Ml5PJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:08:46.310465Z","bundle_sha256":"fd9bdd0ba267c33790782901b348bd04cfc38f4d7ceedbe226827d6da6a809d8"}}