{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BSSZYV7ORFMFDCABNMKPLBON3H","short_pith_number":"pith:BSSZYV7O","schema_version":"1.0","canonical_sha256":"0ca59c57ee89585188016b14f585cdd9c122868ca4c1948aa2469ff6e661fa90","source":{"kind":"arxiv","id":"2307.16560","version":1},"attestation_state":"computed","paper":{"title":"Line Search for Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Laurent Orseau, Marcus Hutter","submitted_at":"2023-07-31T10:39:01Z","abstract_excerpt":"Golden-section search and bisection search are the two main principled algorithms for 1d minimization of quasiconvex (unimodal) functions. The first one only uses function queries, while the second one also uses gradient queries. Other algorithms exist under much stronger assumptions, such as Newton's method. However, to the best of our knowledge, there is no principled exact line search algorithm for general convex functions -- including piecewise-linear and max-compositions of convex functions -- that takes advantage of convexity. We propose two such algorithms: $\\Delta$-Bisection is a varia"},"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":"2307.16560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-31T10:39:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c56b33a291d61412b0d7058e9f773287b83f99d939003f71b85c74f8da9655e9","abstract_canon_sha256":"c386ee7a8c1afa15436b6750903cac30923fe22a3dbbe02f8aef94ec474b0186"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:05.213266Z","signature_b64":"Wg+FcR5M6RBxjrxy7hFQhOpzzzCFCJhe5R6Ej4y6FalJD5HUNpYEGEjWS1Bt27oNDJqnYTzgiDDSFwZGdBSiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca59c57ee89585188016b14f585cdd9c122868ca4c1948aa2469ff6e661fa90","last_reissued_at":"2026-07-05T06:36:05.212715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:05.212715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line Search for Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Laurent Orseau, Marcus Hutter","submitted_at":"2023-07-31T10:39:01Z","abstract_excerpt":"Golden-section search and bisection search are the two main principled algorithms for 1d minimization of quasiconvex (unimodal) functions. The first one only uses function queries, while the second one also uses gradient queries. Other algorithms exist under much stronger assumptions, such as Newton's method. However, to the best of our knowledge, there is no principled exact line search algorithm for general convex functions -- including piecewise-linear and max-compositions of convex functions -- that takes advantage of convexity. We propose two such algorithms: $\\Delta$-Bisection is a varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16560","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/2307.16560/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":"2307.16560","created_at":"2026-07-05T06:36:05.212783+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.16560v1","created_at":"2026-07-05T06:36:05.212783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16560","created_at":"2026-07-05T06:36:05.212783+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSSZYV7ORFMF","created_at":"2026-07-05T06:36:05.212783+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSSZYV7ORFMFDCAB","created_at":"2026-07-05T06:36:05.212783+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSSZYV7O","created_at":"2026-07-05T06:36:05.212783+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.15972","citing_title":"In ratio section method and algorithms for minimizing unimodal functions","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H","json":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H.json","graph_json":"https://pith.science/api/pith-number/BSSZYV7ORFMFDCABNMKPLBON3H/graph.json","events_json":"https://pith.science/api/pith-number/BSSZYV7ORFMFDCABNMKPLBON3H/events.json","paper":"https://pith.science/paper/BSSZYV7O"},"agent_actions":{"view_html":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H","download_json":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H.json","view_paper":"https://pith.science/paper/BSSZYV7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.16560&json=true","fetch_graph":"https://pith.science/api/pith-number/BSSZYV7ORFMFDCABNMKPLBON3H/graph.json","fetch_events":"https://pith.science/api/pith-number/BSSZYV7ORFMFDCABNMKPLBON3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H/action/storage_attestation","attest_author":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H/action/author_attestation","sign_citation":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H/action/citation_signature","submit_replication":"https://pith.science/pith/BSSZYV7ORFMFDCABNMKPLBON3H/action/replication_record"}},"created_at":"2026-07-05T06:36:05.212783+00:00","updated_at":"2026-07-05T06:36:05.212783+00:00"}