{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BZSMO3GQNCY7RFFQURIKFRJ6GK","short_pith_number":"pith:BZSMO3GQ","schema_version":"1.0","canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","source":{"kind":"arxiv","id":"2001.11465","version":1},"attestation_state":"computed","paper":{"title":"Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Charlie Vanaret","submitted_at":"2020-01-30T17:23:32Z","abstract_excerpt":"Reliable global optimization is dedicated to finding a global minimum in the presence of rounding errors. The only approaches for achieving a numerical proof of global optimality are interval branch and bound methods that interleave branching of the search-space and pruning of the subdomains that cannot contain an optimal solution. It is of the utmost importance: i) to compute sharp enclosures of the objective function and the constraints on a given subdomain; ii) to find a good approximation (an upper bound) of the global minimum.\n  State-of-the-art solvers are generally integrative methods, "},"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":"2001.11465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-01-30T17:23:32Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"cfed7cad33fb341a5a678879817e1db9cec86973cc059b59bd45aaf9ac737ace","abstract_canon_sha256":"c8236a6cf4bc0652b0fcdf80d040b4a053276dd4950428932d4ff9c184cc10a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:24.277889Z","signature_b64":"A3VsOvP3wOh+bXcrpBcyX09PXHdCB/LHEMMQgufV47GqdhJhq+AW0XoaQMd1e29RxjYQN5V8j8XRrc0C2hIqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","last_reissued_at":"2026-07-05T00:37:24.277458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:24.277458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Charlie Vanaret","submitted_at":"2020-01-30T17:23:32Z","abstract_excerpt":"Reliable global optimization is dedicated to finding a global minimum in the presence of rounding errors. The only approaches for achieving a numerical proof of global optimality are interval branch and bound methods that interleave branching of the search-space and pruning of the subdomains that cannot contain an optimal solution. It is of the utmost importance: i) to compute sharp enclosures of the objective function and the constraints on a given subdomain; ii) to find a good approximation (an upper bound) of the global minimum.\n  State-of-the-art solvers are generally integrative methods, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11465","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/2001.11465/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":"2001.11465","created_at":"2026-07-05T00:37:24.277508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.11465v1","created_at":"2026-07-05T00:37:24.277508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11465","created_at":"2026-07-05T00:37:24.277508+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZSMO3GQNCY7","created_at":"2026-07-05T00:37:24.277508+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZSMO3GQNCY7RFFQ","created_at":"2026-07-05T00:37:24.277508+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZSMO3GQ","created_at":"2026-07-05T00:37:24.277508+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/BZSMO3GQNCY7RFFQURIKFRJ6GK","json":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK.json","graph_json":"https://pith.science/api/pith-number/BZSMO3GQNCY7RFFQURIKFRJ6GK/graph.json","events_json":"https://pith.science/api/pith-number/BZSMO3GQNCY7RFFQURIKFRJ6GK/events.json","paper":"https://pith.science/paper/BZSMO3GQ"},"agent_actions":{"view_html":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK","download_json":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK.json","view_paper":"https://pith.science/paper/BZSMO3GQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.11465&json=true","fetch_graph":"https://pith.science/api/pith-number/BZSMO3GQNCY7RFFQURIKFRJ6GK/graph.json","fetch_events":"https://pith.science/api/pith-number/BZSMO3GQNCY7RFFQURIKFRJ6GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/action/storage_attestation","attest_author":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/action/author_attestation","sign_citation":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/action/citation_signature","submit_replication":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/action/replication_record"}},"created_at":"2026-07-05T00:37:24.277508+00:00","updated_at":"2026-07-05T00:37:24.277508+00:00"}