{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7HEZJ7T5OPTBHHCR63QFYV62HW","short_pith_number":"pith:7HEZJ7T5","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"},"canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","source":{"kind":"arxiv","id":"1907.02368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02368","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02368v1","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02368","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"7HEZJ7T5OPTB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7HEZJ7T5OPTBHHCR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7HEZJ7T5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7HEZJ7T5OPTBHHCR63QFYV62HW","target":"record","payload":{"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"},"canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","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"},"source_kind":"arxiv","source_id":"1907.02368","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-05-17T23:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yztbelc5Z3GPh312cZ7MMjnxOUU6zwm4pBps19RuzOO387RqU05RSyVhmyks+RSMmSyvX1xOC9uFCmbTacNTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:40:07.061140Z"},"content_sha256":"8310e64664bc22451f8b55ae859f12cfa7fb6df8e79b38fa3df06a8236572d85","schema_version":"1.0","event_id":"sha256:8310e64664bc22451f8b55ae859f12cfa7fb6df8e79b38fa3df06a8236572d85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7HEZJ7T5OPTBHHCR63QFYV62HW","target":"graph","payload":{"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"},"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-05-17T23:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpmaAQOHkcdSzuEXvL4J3eAjHCUK+noiUqfWvoUetx6+wHlks2U4c2mE/m1Sf4sCfZ7ZQyrpu1Yl6zlu1PDECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:40:07.061513Z"},"content_sha256":"eec4154c0d1f0b679b68e64f341ad96e9a676ff5fc138deed43a0f76f280aef0","schema_version":"1.0","event_id":"sha256:eec4154c0d1f0b679b68e64f341ad96e9a676ff5fc138deed43a0f76f280aef0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/bundle.json","state_url":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/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-06-25T12:40:07Z","links":{"resolver":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW","bundle":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/bundle.json","state":"https://pith.science/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HEZJ7T5OPTBHHCR63QFYV62HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7HEZJ7T5OPTBHHCR63QFYV62HW","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":"b00dc8acbc312b2a5f69348362c905b48522e145fefe3346118f2434a1cdf02f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T12:36:53Z","title_canon_sha256":"726b155e33458acef61a788863882bb86e953a8f5a6af03bc9a010929e5b604a"},"schema_version":"1.0","source":{"id":"1907.02368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02368","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02368v1","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02368","created_at":"2026-05-17T23:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"7HEZJ7T5OPTB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7HEZJ7T5OPTBHHCR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7HEZJ7T5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:eec4154c0d1f0b679b68e64f341ad96e9a676ff5fc138deed43a0f76f280aef0","target":"graph","created_at":"2026-05-17T23:41:28Z","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"},"paper":{"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.","authors_text":"Etienne de Klerk, Riley Badenbroek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T12:36:53Z","title":"Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02368","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:8310e64664bc22451f8b55ae859f12cfa7fb6df8e79b38fa3df06a8236572d85","target":"record","created_at":"2026-05-17T23:41:28Z","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":"b00dc8acbc312b2a5f69348362c905b48522e145fefe3346118f2434a1cdf02f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-04T12:36:53Z","title_canon_sha256":"726b155e33458acef61a788863882bb86e953a8f5a6af03bc9a010929e5b604a"},"schema_version":"1.0","source":{"id":"1907.02368","kind":"arxiv","version":1}},"canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9c994fe7d73e6139c51f6e05c57da3db97dae944fe19e77021cebe768936514","first_computed_at":"2026-05-17T23:41:28.802769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:28.802769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6T47lsUlJrXks50oTftidHHGaE1W7hkNlqm6sz+bffBX9PjnY+LTrp2aD3kR8CamThxxG5KBdS2KGb7TOYkzCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:28.803515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8310e64664bc22451f8b55ae859f12cfa7fb6df8e79b38fa3df06a8236572d85","sha256:eec4154c0d1f0b679b68e64f341ad96e9a676ff5fc138deed43a0f76f280aef0"],"state_sha256":"63bf93543ea45fe2bb117bd5a9663115aad12662f6d95ef72468137a68f755e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEPjU3oOEEn84/vvU7H1A4q/aqCSzHY/uv8ULKuSNB+/FCkbM5fgF+p+EcwAc2GoEHlNtPO1jUQjbq7jyopGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:40:07.063456Z","bundle_sha256":"a4652f3a432aea7c6b5080d98eb9848b0cbb9fbd4337dae8003a6f0c21b3e1e4"}}