{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D4NHMW6IQ62H2WIUAHA42TAQLS","short_pith_number":"pith:D4NHMW6I","schema_version":"1.0","canonical_sha256":"1f1a765bc887b47d591401c1cd4c105caba4212ac78a3ff19c2c38ae0b23e324","source":{"kind":"arxiv","id":"1509.04518","version":1},"attestation_state":"computed","paper":{"title":"A deterministic global optimization using smooth diagonal auxiliary functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.NA"],"primary_cat":"math.OC","authors_text":"Dmitri E. Kvasov, Yaroslav D. Sergeyev","submitted_at":"2015-09-15T12:24:58Z","abstract_excerpt":"In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function~$f(x)$ and its gradient $f'(x)$ are black-box functions. It is supposed that $f'(x)$ satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant~$K$. A new deterministic `Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic ve"},"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":"1509.04518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-15T12:24:58Z","cross_cats_sorted":["cs.MS","math.NA"],"title_canon_sha256":"4f82feb06f18be9cfe693692b28a75d106bb56fb47100dd042c2c3882a3e7f4c","abstract_canon_sha256":"edbffd4705f64465da4a633e1bdedfbf4f44333a8497e7f2a999c104ea46d3db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.655899Z","signature_b64":"YuVUUoI7jc4VM9bPciEhulFe7Mu+qh19IrkwkwsLPc6khzkfIKVg5a4gRM+RDonGHuxtGDk9T2fbFumTnSh5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f1a765bc887b47d591401c1cd4c105caba4212ac78a3ff19c2c38ae0b23e324","last_reissued_at":"2026-05-18T01:32:58.655256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.655256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A deterministic global optimization using smooth diagonal auxiliary functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.NA"],"primary_cat":"math.OC","authors_text":"Dmitri E. Kvasov, Yaroslav D. Sergeyev","submitted_at":"2015-09-15T12:24:58Z","abstract_excerpt":"In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function~$f(x)$ and its gradient $f'(x)$ are black-box functions. It is supposed that $f'(x)$ satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant~$K$. A new deterministic `Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04518","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":"1509.04518","created_at":"2026-05-18T01:32:58.655378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04518v1","created_at":"2026-05-18T01:32:58.655378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04518","created_at":"2026-05-18T01:32:58.655378+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4NHMW6IQ62H","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4NHMW6IQ62H2WIU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4NHMW6I","created_at":"2026-05-18T12:29:17.054201+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/D4NHMW6IQ62H2WIUAHA42TAQLS","json":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS.json","graph_json":"https://pith.science/api/pith-number/D4NHMW6IQ62H2WIUAHA42TAQLS/graph.json","events_json":"https://pith.science/api/pith-number/D4NHMW6IQ62H2WIUAHA42TAQLS/events.json","paper":"https://pith.science/paper/D4NHMW6I"},"agent_actions":{"view_html":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS","download_json":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS.json","view_paper":"https://pith.science/paper/D4NHMW6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04518&json=true","fetch_graph":"https://pith.science/api/pith-number/D4NHMW6IQ62H2WIUAHA42TAQLS/graph.json","fetch_events":"https://pith.science/api/pith-number/D4NHMW6IQ62H2WIUAHA42TAQLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS/action/storage_attestation","attest_author":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS/action/author_attestation","sign_citation":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS/action/citation_signature","submit_replication":"https://pith.science/pith/D4NHMW6IQ62H2WIUAHA42TAQLS/action/replication_record"}},"created_at":"2026-05-18T01:32:58.655378+00:00","updated_at":"2026-05-18T01:32:58.655378+00:00"}