{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E52A6JLR3ZLXIYXTNEBG7UD4ZN","short_pith_number":"pith:E52A6JLR","schema_version":"1.0","canonical_sha256":"27740f2571de577462f369026fd07ccb7aa8667ba505ebac3fce1613a4b601ed","source":{"kind":"arxiv","id":"1805.11820","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.11820","created_at":"2026-05-18T00:14:36.341248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11820v1","created_at":"2026-05-18T00:14:36.341248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11820","created_at":"2026-05-18T00:14:36.341248+00:00"},{"alias_kind":"pith_short_12","alias_value":"E52A6JLR3ZLX","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"E52A6JLR3ZLXIYXT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"E52A6JLR","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN","json":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN.json","graph_json":"https://pith.science/api/pith-number/E52A6JLR3ZLXIYXTNEBG7UD4ZN/graph.json","events_json":"https://pith.science/api/pith-number/E52A6JLR3ZLXIYXTNEBG7UD4ZN/events.json","paper":"https://pith.science/paper/E52A6JLR"},"agent_actions":{"view_html":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN","download_json":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN.json","view_paper":"https://pith.science/paper/E52A6JLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11820&json=true","fetch_graph":"https://pith.science/api/pith-number/E52A6JLR3ZLXIYXTNEBG7UD4ZN/graph.json","fetch_events":"https://pith.science/api/pith-number/E52A6JLR3ZLXIYXTNEBG7UD4ZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/action/storage_attestation","attest_author":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/action/author_attestation","sign_citation":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/action/citation_signature","submit_replication":"https://pith.science/pith/E52A6JLR3ZLXIYXTNEBG7UD4ZN/action/replication_record"}},"created_at":"2026-05-18T00:14:36.341248+00:00","updated_at":"2026-05-18T00:14:36.341248+00:00"}