{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NNA73H2JYF7E5UVCZ7WJ3C4EAH","short_pith_number":"pith:NNA73H2J","schema_version":"1.0","canonical_sha256":"6b41fd9f49c17e4ed2a2cfec9d8b8401e77ddd4fe2f87bc3d683a78395bae49d","source":{"kind":"arxiv","id":"2409.00013","version":1},"attestation_state":"computed","paper":{"title":"CEopt: A MATLAB Package for Non-convex Optimization with the Cross-Entropy Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.OC","stat.ME"],"primary_cat":"stat.CO","authors_text":"Americo Cunha Jr, Jos\\'e Geraldo Telles Ribeiro, Julio Cesar Basilio, Marcos Vinicius Issa","submitted_at":"2024-08-15T23:53:50Z","abstract_excerpt":"This paper introduces CEopt (https://ceopt.org), a MATLAB tool leveraging the Cross-Entropy method for non-convex optimization. Due to the relative simplicity of the algorithm, it provides a kind of transparent ``gray-box'' optimization solver, with intuitive control parameters. Unique in its approach, CEopt effectively handles both equality and inequality constraints using an augmented Lagrangian method, offering robustness and scalability for moderately sized complex problems. Through select case studies, the package's applicability and effectiveness in various optimization scenarios are sho"},"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":"2409.00013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-08-15T23:53:50Z","cross_cats_sorted":["cs.MS","math.OC","stat.ME"],"title_canon_sha256":"8594517b475e4adf7342e7cd16338385992c85a15df2b4b6b1b5e80c5206af0d","abstract_canon_sha256":"30623b35d53d3ca704315b27db30b0f5a0b3a4668fd26f400b085bac7e753b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:39.395700Z","signature_b64":"BnbBtp1DPVX+jMWXS8rzY4110lvk7aNQxJccmqhzn8PBeEB3SlV1NL/SzZsWbHq9ArcMk7T5fC0vAi9ghVCXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b41fd9f49c17e4ed2a2cfec9d8b8401e77ddd4fe2f87bc3d683a78395bae49d","last_reissued_at":"2026-07-05T09:01:39.395214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:39.395214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CEopt: A MATLAB Package for Non-convex Optimization with the Cross-Entropy Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.OC","stat.ME"],"primary_cat":"stat.CO","authors_text":"Americo Cunha Jr, Jos\\'e Geraldo Telles Ribeiro, Julio Cesar Basilio, Marcos Vinicius Issa","submitted_at":"2024-08-15T23:53:50Z","abstract_excerpt":"This paper introduces CEopt (https://ceopt.org), a MATLAB tool leveraging the Cross-Entropy method for non-convex optimization. Due to the relative simplicity of the algorithm, it provides a kind of transparent ``gray-box'' optimization solver, with intuitive control parameters. Unique in its approach, CEopt effectively handles both equality and inequality constraints using an augmented Lagrangian method, offering robustness and scalability for moderately sized complex problems. Through select case studies, the package's applicability and effectiveness in various optimization scenarios are sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.00013/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.00013","created_at":"2026-07-05T09:01:39.395268+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.00013v1","created_at":"2026-07-05T09:01:39.395268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00013","created_at":"2026-07-05T09:01:39.395268+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNA73H2JYF7E","created_at":"2026-07-05T09:01:39.395268+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNA73H2JYF7E5UVC","created_at":"2026-07-05T09:01:39.395268+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNA73H2J","created_at":"2026-07-05T09:01:39.395268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05235","citing_title":"Scenario-driven optimization of passive vehicle suspensions: explaining the effectiveness of asymmetric damping","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH","json":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH.json","graph_json":"https://pith.science/api/pith-number/NNA73H2JYF7E5UVCZ7WJ3C4EAH/graph.json","events_json":"https://pith.science/api/pith-number/NNA73H2JYF7E5UVCZ7WJ3C4EAH/events.json","paper":"https://pith.science/paper/NNA73H2J"},"agent_actions":{"view_html":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH","download_json":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH.json","view_paper":"https://pith.science/paper/NNA73H2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.00013&json=true","fetch_graph":"https://pith.science/api/pith-number/NNA73H2JYF7E5UVCZ7WJ3C4EAH/graph.json","fetch_events":"https://pith.science/api/pith-number/NNA73H2JYF7E5UVCZ7WJ3C4EAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH/action/storage_attestation","attest_author":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH/action/author_attestation","sign_citation":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH/action/citation_signature","submit_replication":"https://pith.science/pith/NNA73H2JYF7E5UVCZ7WJ3C4EAH/action/replication_record"}},"created_at":"2026-07-05T09:01:39.395268+00:00","updated_at":"2026-07-05T09:01:39.395268+00:00"}