{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RRCVPVR2AS2TIL37JSL4HJORDX","short_pith_number":"pith:RRCVPVR2","canonical_record":{"source":{"id":"2412.09444","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T16:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"99020d7972cb520990ae1b534bb0b10ba13b3d4df7f719972df31a3c9594612d","abstract_canon_sha256":"6e25b306e78dd390c393d1569c55916aac2eeaae09747709c2f671f6a4eaf763"},"schema_version":"1.0"},"canonical_sha256":"8c4557d63a04b5342f7f4c97c3a5d11de2296116f763837dc76c49e3a5bf65e4","source":{"kind":"arxiv","id":"2412.09444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.09444","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.09444v2","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09444","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"RRCVPVR2AS2T","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"RRCVPVR2AS2TIL37","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"RRCVPVR2","created_at":"2026-07-05T09:50:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RRCVPVR2AS2TIL37JSL4HJORDX","target":"record","payload":{"canonical_record":{"source":{"id":"2412.09444","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T16:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"99020d7972cb520990ae1b534bb0b10ba13b3d4df7f719972df31a3c9594612d","abstract_canon_sha256":"6e25b306e78dd390c393d1569c55916aac2eeaae09747709c2f671f6a4eaf763"},"schema_version":"1.0"},"canonical_sha256":"8c4557d63a04b5342f7f4c97c3a5d11de2296116f763837dc76c49e3a5bf65e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:08.397614Z","signature_b64":"36noe/Y3xECpHLDOYM5G21nPinvvZqzl61IOeLOgmdkFedLao9ot1HSMmEEVsYPNgwh8mgkIvdSB2iH3yIvNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c4557d63a04b5342f7f4c97c3a5d11de2296116f763837dc76c49e3a5bf65e4","last_reissued_at":"2026-07-05T09:50:08.397097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:08.397097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.09444","source_version":2,"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-05T09:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRln+zHAK1GJQfrzY/+jZOGMm8rpCn5HFpul98wrlo/EfQF3fQ4S4pf5gYHU5PVdAd5S5GO1Ve1RVF9fwctlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:10:04.021310Z"},"content_sha256":"6a0d25332dd76b3c645605e191d1f8fa9c541bb4ad4045ab02621e12405ff90f","schema_version":"1.0","event_id":"sha256:6a0d25332dd76b3c645605e191d1f8fa9c541bb4ad4045ab02621e12405ff90f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RRCVPVR2AS2TIL37JSL4HJORDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search Strategy Generation for Branch and Bound Using Genetic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gr\\'egoire Danoy, Gwen Maudet","submitted_at":"2024-12-12T16:57:46Z","abstract_excerpt":"Branch-and-Bound (B\\&B) is an exact method in integer programming that recursively divides the search space into a tree. During the resolution process, determining the next subproblem to explore within the tree-known as the search strategy-is crucial. Hand-crafted heuristics are commonly used, but none are effective over all problem classes. Recent approaches utilizing neural networks claim to make more intelligent decisions but are computationally expensive. In this paper, we introduce GP2S (Genetic Programming for Search Strategy), a novel machine learning approach that automatically generat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09444","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/2412.09444/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-05T09:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9KoWaojQG9BaBcehJVbQAhlwpEd4no9kuLVsV1Q741A50vjet7DTkZG2DQuyaAFKyAbQcPzzX3OUliKqNJwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:10:04.021878Z"},"content_sha256":"d1fceec7e4b24d55389e19ca9a10346f01e989fd566b17a536d9c61c24532666","schema_version":"1.0","event_id":"sha256:d1fceec7e4b24d55389e19ca9a10346f01e989fd566b17a536d9c61c24532666"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRCVPVR2AS2TIL37JSL4HJORDX/bundle.json","state_url":"https://pith.science/pith/RRCVPVR2AS2TIL37JSL4HJORDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRCVPVR2AS2TIL37JSL4HJORDX/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-08T06:10:04Z","links":{"resolver":"https://pith.science/pith/RRCVPVR2AS2TIL37JSL4HJORDX","bundle":"https://pith.science/pith/RRCVPVR2AS2TIL37JSL4HJORDX/bundle.json","state":"https://pith.science/pith/RRCVPVR2AS2TIL37JSL4HJORDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRCVPVR2AS2TIL37JSL4HJORDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RRCVPVR2AS2TIL37JSL4HJORDX","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":"6e25b306e78dd390c393d1569c55916aac2eeaae09747709c2f671f6a4eaf763","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T16:57:46Z","title_canon_sha256":"99020d7972cb520990ae1b534bb0b10ba13b3d4df7f719972df31a3c9594612d"},"schema_version":"1.0","source":{"id":"2412.09444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.09444","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.09444v2","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09444","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"RRCVPVR2AS2T","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"RRCVPVR2AS2TIL37","created_at":"2026-07-05T09:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"RRCVPVR2","created_at":"2026-07-05T09:50:08Z"}],"graph_snapshots":[{"event_id":"sha256:d1fceec7e4b24d55389e19ca9a10346f01e989fd566b17a536d9c61c24532666","target":"graph","created_at":"2026-07-05T09:50:08Z","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/2412.09444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Branch-and-Bound (B\\&B) is an exact method in integer programming that recursively divides the search space into a tree. During the resolution process, determining the next subproblem to explore within the tree-known as the search strategy-is crucial. Hand-crafted heuristics are commonly used, but none are effective over all problem classes. Recent approaches utilizing neural networks claim to make more intelligent decisions but are computationally expensive. In this paper, we introduce GP2S (Genetic Programming for Search Strategy), a novel machine learning approach that automatically generat","authors_text":"Gr\\'egoire Danoy, Gwen Maudet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T16:57:46Z","title":"Search Strategy Generation for Branch and Bound Using Genetic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09444","kind":"arxiv","version":2},"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:6a0d25332dd76b3c645605e191d1f8fa9c541bb4ad4045ab02621e12405ff90f","target":"record","created_at":"2026-07-05T09:50:08Z","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":"6e25b306e78dd390c393d1569c55916aac2eeaae09747709c2f671f6a4eaf763","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T16:57:46Z","title_canon_sha256":"99020d7972cb520990ae1b534bb0b10ba13b3d4df7f719972df31a3c9594612d"},"schema_version":"1.0","source":{"id":"2412.09444","kind":"arxiv","version":2}},"canonical_sha256":"8c4557d63a04b5342f7f4c97c3a5d11de2296116f763837dc76c49e3a5bf65e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c4557d63a04b5342f7f4c97c3a5d11de2296116f763837dc76c49e3a5bf65e4","first_computed_at":"2026-07-05T09:50:08.397097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:08.397097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36noe/Y3xECpHLDOYM5G21nPinvvZqzl61IOeLOgmdkFedLao9ot1HSMmEEVsYPNgwh8mgkIvdSB2iH3yIvNBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:08.397614Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.09444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0d25332dd76b3c645605e191d1f8fa9c541bb4ad4045ab02621e12405ff90f","sha256:d1fceec7e4b24d55389e19ca9a10346f01e989fd566b17a536d9c61c24532666"],"state_sha256":"901fe80e1ef4ee54664bc728b3103781b7aebe461ee9e969ca89e558564cf754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zh1uxlMnoOOTQa1qq9Tp7Y+bBUSFzyiBfqLdQ0osvLPIVgXCad6+PZvlvegRiwjMl5smv8daluJDqs0ex3AFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T06:10:04.026430Z","bundle_sha256":"512eeb773b101888332adfb03232c191297a51638a98eea28284788d0841075d"}}