{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BZSMO3GQNCY7RFFQURIKFRJ6GK","short_pith_number":"pith:BZSMO3GQ","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"},"canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","source":{"kind":"arxiv","id":"2001.11465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11465","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11465v1","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11465","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"BZSMO3GQNCY7","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_16","alias_value":"BZSMO3GQNCY7RFFQ","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_8","alias_value":"BZSMO3GQ","created_at":"2026-07-05T00:37:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BZSMO3GQNCY7RFFQURIKFRJ6GK","target":"record","payload":{"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"},"canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","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"},"source_kind":"arxiv","source_id":"2001.11465","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-07-05T00:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbaPwHU+OjTMCjDsUjXBPNKJANkIp1LoCViLxJNu9JBtuEjfVrWuMtLCX1pFP2gq+IBIEvTCBdXTbkyNKD48Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:26:20.129187Z"},"content_sha256":"4dee27d1a2d2a693f77975e9c8899ccca9cb90071b435d23bd831dac05946a2f","schema_version":"1.0","event_id":"sha256:4dee27d1a2d2a693f77975e9c8899ccca9cb90071b435d23bd831dac05946a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BZSMO3GQNCY7RFFQURIKFRJ6GK","target":"graph","payload":{"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"},"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-07-05T00:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5db+9VkESvKDDvt7XHZaxofjFQFw0cNjvg+8sa2brlV+p/0ItmFD/QxcnVnLI+K8tpKWkSt8T8GZwKDgufcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:26:20.129718Z"},"content_sha256":"4ae5171f3f9685170ba482059ee3b4e66fb669db33e6c772a612967b6c216000","schema_version":"1.0","event_id":"sha256:4ae5171f3f9685170ba482059ee3b4e66fb669db33e6c772a612967b6c216000"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/bundle.json","state_url":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/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-08-15T13:26:20Z","links":{"resolver":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK","bundle":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/bundle.json","state":"https://pith.science/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZSMO3GQNCY7RFFQURIKFRJ6GK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BZSMO3GQNCY7RFFQURIKFRJ6GK","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":"c8236a6cf4bc0652b0fcdf80d040b4a053276dd4950428932d4ff9c184cc10a7","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-01-30T17:23:32Z","title_canon_sha256":"cfed7cad33fb341a5a678879817e1db9cec86973cc059b59bd45aaf9ac737ace"},"schema_version":"1.0","source":{"id":"2001.11465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11465","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11465v1","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11465","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"BZSMO3GQNCY7","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_16","alias_value":"BZSMO3GQNCY7RFFQ","created_at":"2026-07-05T00:37:24Z"},{"alias_kind":"pith_short_8","alias_value":"BZSMO3GQ","created_at":"2026-07-05T00:37:24Z"}],"graph_snapshots":[{"event_id":"sha256:4ae5171f3f9685170ba482059ee3b4e66fb669db33e6c772a612967b6c216000","target":"graph","created_at":"2026-07-05T00:37:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.11465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Charlie Vanaret","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-01-30T17:23:32Z","title":"Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11465","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:4dee27d1a2d2a693f77975e9c8899ccca9cb90071b435d23bd831dac05946a2f","target":"record","created_at":"2026-07-05T00:37:24Z","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":"c8236a6cf4bc0652b0fcdf80d040b4a053276dd4950428932d4ff9c184cc10a7","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-01-30T17:23:32Z","title_canon_sha256":"cfed7cad33fb341a5a678879817e1db9cec86973cc059b59bd45aaf9ac737ace"},"schema_version":"1.0","source":{"id":"2001.11465","kind":"arxiv","version":1}},"canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e64c76cd068b1f894b0a450a2c53e32b7039821e5a43f19057a28e6013207b8","first_computed_at":"2026-07-05T00:37:24.277458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:37:24.277458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A3VsOvP3wOh+bXcrpBcyX09PXHdCB/LHEMMQgufV47GqdhJhq+AW0XoaQMd1e29RxjYQN5V8j8XRrc0C2hIqBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:37:24.277889Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.11465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dee27d1a2d2a693f77975e9c8899ccca9cb90071b435d23bd831dac05946a2f","sha256:4ae5171f3f9685170ba482059ee3b4e66fb669db33e6c772a612967b6c216000"],"state_sha256":"fdea06192d16d36a9492fad3b76ad49829f1b062e45a1caa20b5fcbcf0f93da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flrLbIar5LfJe06EeT7lN94i+Hd0YUUN6QSe2gSiVq7CCvk0X0jvLDfWDPQJh+z/6+0ItHpVYB4oCMetuPxNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:26:20.134084Z","bundle_sha256":"e9dd9868ec7dd4428ee386705c3893c715d9fd157e3be904b3803adbb1dcf092"}}