{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E52A6JLR3ZLXIYXTNEBG7UD4ZN","short_pith_number":"pith:E52A6JLR","canonical_record":{"source":{"id":"1805.11820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-30T06:22:34Z","cross_cats_sorted":[],"title_canon_sha256":"e86284c00c9e8ff1971883b1a7120395f93b2bd2fb922fea6d21512d69ff02b0","abstract_canon_sha256":"34d79a8214b25719fd3257c211fd2432fe8638fb1ca4066d2e35bfb0f3824785"},"schema_version":"1.0"},"canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","source":{"kind":"arxiv","id":"1805.11820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11820","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11820v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11820","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"E52A6JLR3ZLX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E52A6JLR3ZLXIYXT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E52A6JLR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E52A6JLR3ZLXIYXTNEBG7UD4ZN","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-30T06:22:34Z","cross_cats_sorted":[],"title_canon_sha256":"e86284c00c9e8ff1971883b1a7120395f93b2bd2fb922fea6d21512d69ff02b0","abstract_canon_sha256":"34d79a8214b25719fd3257c211fd2432fe8638fb1ca4066d2e35bfb0f3824785"},"schema_version":"1.0"},"canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:36.341791Z","signature_b64":"VpvuXglxlBSb3U7gXUeIbX9YTsKFJcoBLfegsFhOhtGpaT+cqbok+9h0rWeaXdFQF/1l6iRC6RA8xY3T6Uk6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","last_reissued_at":"2026-05-18T00:14:36.341137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:36.341137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11820","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-18T00:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlOT+p/e07HIkUctHqItMqxH52iLur2ZF6d06HeV3gFNarU3RfbJ14oGNw2AF2BQmxjJTut9QlCJqU6+5b9sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:40:07.040408Z"},"content_sha256":"e2024d35238dee1b9ad096b2e64759e2de0f6425bfd77e61fae38d22d7e1374a","schema_version":"1.0","event_id":"sha256:e2024d35238dee1b9ad096b2e64759e2de0f6425bfd77e61fae38d22d7e1374a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E52A6JLR3ZLXIYXTNEBG7UD4ZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic CP-Supported CMSA for Binary Integer Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Blum, Haroldo Gambini Santos","submitted_at":"2018-05-30T06:22:34Z","abstract_excerpt":"Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solutions to the tackled problem instance in a probabilistic way and (2) solves a reduced problem instance (if possible) to optimality. The construction of feasible solutions is hereby problem-specific, usually involving a fast greedy heuristic. The goal of this paper is to design a problem-agnostic CMSA variant whose exclusive input is an integer linear program (ILP). In order to reduce the complexity of this task, the curr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11820","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-18T00:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hi72msauf8J23ggHmlIu3p2gEjSxA9cxlAQ0S/EMdGmLviOnumxN8nY7KVRLOEgstoZio0f70gUMZNfHWCxnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:40:07.041125Z"},"content_sha256":"d414a5bde494dc399327271836423b82c9a22e8bdc71ab8e487cccfebbc7b662","schema_version":"1.0","event_id":"sha256:d414a5bde494dc399327271836423b82c9a22e8bdc71ab8e487cccfebbc7b662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/bundle.json","state_url":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/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-12T03:40:07Z","links":{"resolver":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN","bundle":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/bundle.json","state":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E52A6JLR3ZLXIYXTNEBG7UD4ZN","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":"34d79a8214b25719fd3257c211fd2432fe8638fb1ca4066d2e35bfb0f3824785","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-30T06:22:34Z","title_canon_sha256":"e86284c00c9e8ff1971883b1a7120395f93b2bd2fb922fea6d21512d69ff02b0"},"schema_version":"1.0","source":{"id":"1805.11820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11820","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11820v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11820","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"E52A6JLR3ZLX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E52A6JLR3ZLXIYXT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E52A6JLR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:d414a5bde494dc399327271836423b82c9a22e8bdc71ab8e487cccfebbc7b662","target":"graph","created_at":"2026-05-18T00:14: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"},"paper":{"abstract_excerpt":"Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solutions to the tackled problem instance in a probabilistic way and (2) solves a reduced problem instance (if possible) to optimality. The construction of feasible solutions is hereby problem-specific, usually involving a fast greedy heuristic. The goal of this paper is to design a problem-agnostic CMSA variant whose exclusive input is an integer linear program (ILP). In order to reduce the complexity of this task, the curr","authors_text":"Christian Blum, Haroldo Gambini Santos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-30T06:22:34Z","title":"Generic CP-Supported CMSA for Binary Integer Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11820","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:e2024d35238dee1b9ad096b2e64759e2de0f6425bfd77e61fae38d22d7e1374a","target":"record","created_at":"2026-05-18T00:14: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":"34d79a8214b25719fd3257c211fd2432fe8638fb1ca4066d2e35bfb0f3824785","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-30T06:22:34Z","title_canon_sha256":"e86284c00c9e8ff1971883b1a7120395f93b2bd2fb922fea6d21512d69ff02b0"},"schema_version":"1.0","source":{"id":"1805.11820","kind":"arxiv","version":1}},"canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","first_computed_at":"2026-05-18T00:14:36.341137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:36.341137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VpvuXglxlBSb3U7gXUeIbX9YTsKFJcoBLfegsFhOhtGpaT+cqbok+9h0rWeaXdFQF/1l6iRC6RA8xY3T6Uk6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:36.341791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2024d35238dee1b9ad096b2e64759e2de0f6425bfd77e61fae38d22d7e1374a","sha256:d414a5bde494dc399327271836423b82c9a22e8bdc71ab8e487cccfebbc7b662"],"state_sha256":"4f6841b6d93fc827ebdd87f700f77b5273eacbcaec2640a0e1617308b93a4179"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQqeSDbzhN8XLmYu16BzIkQktAKQqaw5dcTjoez3f4oTGt2AT5nVHECa35zt0vox2bV6IXZoF7uAShnBYkKaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:40:07.045192Z","bundle_sha256":"0ef146fbb9e0c691683f5fc6a2f90eaf0a4fe692df9b3b5b5a1277fdd1ba97ff"}}