{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DBO3WQPOJXKQAJ42QNFTFGRM5S","short_pith_number":"pith:DBO3WQPO","schema_version":"1.0","canonical_sha256":"185dbb41ee4dd500279a834b329a2cecbdc9d9c801d924de388127b309f1ea6a","source":{"kind":"arxiv","id":"2308.09050","version":1},"attestation_state":"computed","paper":{"title":"Derivative-Free Global Minimization in One Dimension: Relaxation, Monte Carlo, and Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandra A. Gomes, Diogo A. Gomes","submitted_at":"2023-08-17T15:31:21Z","abstract_excerpt":"We introduce a derivative-free global optimization algorithm that efficiently computes minima for various classes of one-dimensional functions, including non-convex, and non-smooth functions.This algorithm numerically approximates the gradient flow of a relaxed functional, integrating strategies such as Monte Carlos methods, rejection sampling, and adaptive techniques. These strategies enhance performance in solving a diverse range of optimization problems while significantly reducing the number of required function evaluations compared to established methods. We present a proof of the converg"},"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":"2308.09050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-17T15:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"3d1467d2152f3d0173b49b6c2c24c3540b81f4a06038c7af8b239f6f16049037","abstract_canon_sha256":"6ebbb0758eb5f4921b046bf663df5e156881951a7f25e2648e3dc4da31e11033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:26.511972Z","signature_b64":"tyv5xjXOxfn8cUz7BdhaZoMUm/b5c7r5Ic69rYkWFDYPZW6ci2ujAr1MWbe4Q7tb1VbyKgDdx2mV9GwmoQbzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185dbb41ee4dd500279a834b329a2cecbdc9d9c801d924de388127b309f1ea6a","last_reissued_at":"2026-07-05T06:42:26.511451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:26.511451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Derivative-Free Global Minimization in One Dimension: Relaxation, Monte Carlo, and Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandra A. Gomes, Diogo A. Gomes","submitted_at":"2023-08-17T15:31:21Z","abstract_excerpt":"We introduce a derivative-free global optimization algorithm that efficiently computes minima for various classes of one-dimensional functions, including non-convex, and non-smooth functions.This algorithm numerically approximates the gradient flow of a relaxed functional, integrating strategies such as Monte Carlos methods, rejection sampling, and adaptive techniques. These strategies enhance performance in solving a diverse range of optimization problems while significantly reducing the number of required function evaluations compared to established methods. We present a proof of the converg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09050","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/2308.09050/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":"2308.09050","created_at":"2026-07-05T06:42:26.511512+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09050v1","created_at":"2026-07-05T06:42:26.511512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09050","created_at":"2026-07-05T06:42:26.511512+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBO3WQPOJXKQ","created_at":"2026-07-05T06:42:26.511512+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBO3WQPOJXKQAJ42","created_at":"2026-07-05T06:42:26.511512+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBO3WQPO","created_at":"2026-07-05T06:42:26.511512+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11485","citing_title":"Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S","json":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S.json","graph_json":"https://pith.science/api/pith-number/DBO3WQPOJXKQAJ42QNFTFGRM5S/graph.json","events_json":"https://pith.science/api/pith-number/DBO3WQPOJXKQAJ42QNFTFGRM5S/events.json","paper":"https://pith.science/paper/DBO3WQPO"},"agent_actions":{"view_html":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S","download_json":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S.json","view_paper":"https://pith.science/paper/DBO3WQPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09050&json=true","fetch_graph":"https://pith.science/api/pith-number/DBO3WQPOJXKQAJ42QNFTFGRM5S/graph.json","fetch_events":"https://pith.science/api/pith-number/DBO3WQPOJXKQAJ42QNFTFGRM5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S/action/storage_attestation","attest_author":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S/action/author_attestation","sign_citation":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S/action/citation_signature","submit_replication":"https://pith.science/pith/DBO3WQPOJXKQAJ42QNFTFGRM5S/action/replication_record"}},"created_at":"2026-07-05T06:42:26.511512+00:00","updated_at":"2026-07-05T06:42:26.511512+00:00"}