{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5P3WHNWWTL6BGG6MPZ6B5J3SAS","short_pith_number":"pith:5P3WHNWW","schema_version":"1.0","canonical_sha256":"ebf763b6d69afc131bcc7e7c1ea77204b580a352db31c742ffccbf9dc198fb48","source":{"kind":"arxiv","id":"1704.03738","version":1},"attestation_state":"computed","paper":{"title":"Counterexample Guided Inductive Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Higo F. Albuquerque, Iury V. de Bessa, Joao Edgar C. Filho, Lucas C. Cordeiro, Rodrigo F. Araujo","submitted_at":"2017-04-11T15:33:50Z","abstract_excerpt":"This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers. In particular, CEGIO relies on iterative executions to constrain a verification procedure, in order to perform inductive generalization, based on counterexamples extracted from SMT solvers. CEGIO is able to successfully optimize a wide range of functions, including non-linear and non-convex optimization problems based on SMT solvers, in which data provided by counterexamples are employed to guide the verification engine, thus reducing the"},"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":"1704.03738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-11T15:33:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5018cd49c86e5a2d58dcec4dfeb1c736da50bcc9d9f7a2153192db9246b4f497","abstract_canon_sha256":"95f45d5b7699ac37189031c70c84326f30555e7a6a86fd642fd55a1871b7fbe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:27.001775Z","signature_b64":"NtQYsNcVGHLsGELFfGwdfrpgT5uJMxDMIEjqxkCtcNctCKndlDHUZ5fKV6hsAgZR9KEKWihec3jIeVX2fn+XAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf763b6d69afc131bcc7e7c1ea77204b580a352db31c742ffccbf9dc198fb48","last_reissued_at":"2026-05-18T00:46:27.001029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:27.001029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterexample Guided Inductive Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Higo F. Albuquerque, Iury V. de Bessa, Joao Edgar C. Filho, Lucas C. Cordeiro, Rodrigo F. Araujo","submitted_at":"2017-04-11T15:33:50Z","abstract_excerpt":"This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers. In particular, CEGIO relies on iterative executions to constrain a verification procedure, in order to perform inductive generalization, based on counterexamples extracted from SMT solvers. CEGIO is able to successfully optimize a wide range of functions, including non-linear and non-convex optimization problems based on SMT solvers, in which data provided by counterexamples are employed to guide the verification engine, thus reducing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03738","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":"1704.03738","created_at":"2026-05-18T00:46:27.001153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03738v1","created_at":"2026-05-18T00:46:27.001153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03738","created_at":"2026-05-18T00:46:27.001153+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P3WHNWWTL6B","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P3WHNWWTL6BGG6M","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P3WHNWW","created_at":"2026-05-18T12:31:00.734936+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/5P3WHNWWTL6BGG6MPZ6B5J3SAS","json":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS.json","graph_json":"https://pith.science/api/pith-number/5P3WHNWWTL6BGG6MPZ6B5J3SAS/graph.json","events_json":"https://pith.science/api/pith-number/5P3WHNWWTL6BGG6MPZ6B5J3SAS/events.json","paper":"https://pith.science/paper/5P3WHNWW"},"agent_actions":{"view_html":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS","download_json":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS.json","view_paper":"https://pith.science/paper/5P3WHNWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03738&json=true","fetch_graph":"https://pith.science/api/pith-number/5P3WHNWWTL6BGG6MPZ6B5J3SAS/graph.json","fetch_events":"https://pith.science/api/pith-number/5P3WHNWWTL6BGG6MPZ6B5J3SAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS/action/storage_attestation","attest_author":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS/action/author_attestation","sign_citation":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS/action/citation_signature","submit_replication":"https://pith.science/pith/5P3WHNWWTL6BGG6MPZ6B5J3SAS/action/replication_record"}},"created_at":"2026-05-18T00:46:27.001153+00:00","updated_at":"2026-05-18T00:46:27.001153+00:00"}