{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7HEZJ7T5OPTBHHCR63QFYV62HW","short_pith_number":"pith:7HEZJ7T5","schema_version":"1.0","canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","source":{"kind":"arxiv","id":"1907.02368","version":1},"attestation_state":"computed","paper":{"title":"Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Riley Badenbroek","submitted_at":"2019-07-04T12:36:53Z","abstract_excerpt":"We give a rigorous complexity analysis of the simulated annealing algorithm by Kalai and Vempala [Math of OR 31.2 (2006): 253-266] using the type of temperature update suggested by Abernethy and Hazan [arXiv 1507.02528v2, 2015]. The algorithm only assumes a membership oracle of the feasible set, and we prove that it returns a solution in polynomial time which is near-optimal with high probability. Moreover, we propose a number of modifications to improve the practical performance of this method, and present some numerical results for test problems from copositive programming."},"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":"1907.02368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T12:36:53Z","cross_cats_sorted":[],"title_canon_sha256":"726b155e33458acef61a788863882bb86e953a8f5a6af03bc9a010929e5b604a","abstract_canon_sha256":"b00dc8acbc312b2a5f69348362c905b48522e145fefe3346118f2434a1cdf02f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:28.803515Z","signature_b64":"6T47lsUlJrXks50oTftidHHGaE1W7hkNlqm6sz+bffBX9PjnY+LTrp2aD3kR8CamThxxG5KBdS2KGb7TOYkzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","last_reissued_at":"2026-05-17T23:41:28.802769Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:28.802769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Riley Badenbroek","submitted_at":"2019-07-04T12:36:53Z","abstract_excerpt":"We give a rigorous complexity analysis of the simulated annealing algorithm by Kalai and Vempala [Math of OR 31.2 (2006): 253-266] using the type of temperature update suggested by Abernethy and Hazan [arXiv 1507.02528v2, 2015]. The algorithm only assumes a membership oracle of the feasible set, and we prove that it returns a solution in polynomial time which is near-optimal with high probability. Moreover, we propose a number of modifications to improve the practical performance of this method, and present some numerical results for test problems from copositive programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02368","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":"1907.02368","created_at":"2026-05-17T23:41:28.802886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02368v1","created_at":"2026-05-17T23:41:28.802886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02368","created_at":"2026-05-17T23:41:28.802886+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HEZJ7T5OPTB","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HEZJ7T5OPTBHHCR","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HEZJ7T5","created_at":"2026-05-18T12:33:12.712433+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/7HEZJ7T5OPTBHHCR63QFYV62HW","json":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW.json","graph_json":"https://pith.science/api/pith-number/7HEZJ7T5OPTBHHCR63QFYV62HW/graph.json","events_json":"https://pith.science/api/pith-number/7HEZJ7T5OPTBHHCR63QFYV62HW/events.json","paper":"https://pith.science/paper/7HEZJ7T5"},"agent_actions":{"view_html":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW","download_json":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW.json","view_paper":"https://pith.science/paper/7HEZJ7T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02368&json=true","fetch_graph":"https://pith.science/api/pith-number/7HEZJ7T5OPTBHHCR63QFYV62HW/graph.json","fetch_events":"https://pith.science/api/pith-number/7HEZJ7T5OPTBHHCR63QFYV62HW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/action/storage_attestation","attest_author":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/action/author_attestation","sign_citation":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/action/citation_signature","submit_replication":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/action/replication_record"}},"created_at":"2026-05-17T23:41:28.802886+00:00","updated_at":"2026-05-17T23:41:28.802886+00:00"}