{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LLDFYQECJ224YMX3FDW2LFVKK3","short_pith_number":"pith:LLDFYQEC","canonical_record":{"source":{"id":"1507.02528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-09T14:32:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ea925fcfdc10fb76ed541a30b8dd63ce48ecbaeb4a65295178fb39c730997dc8","abstract_canon_sha256":"5b8b51bba230e68501c4f56ba7abe616f4d3af8130d19456ae858abfbbd89544"},"schema_version":"1.0"},"canonical_sha256":"5ac65c40824eb5cc32fb28eda596aa56e783d5f5f84205d056f4c73b1875e644","source":{"kind":"arxiv","id":"1507.02528","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02528","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02528v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02528","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"LLDFYQECJ224","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLDFYQECJ224YMX3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLDFYQEC","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LLDFYQECJ224YMX3FDW2LFVKK3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-09T14:32:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ea925fcfdc10fb76ed541a30b8dd63ce48ecbaeb4a65295178fb39c730997dc8","abstract_canon_sha256":"5b8b51bba230e68501c4f56ba7abe616f4d3af8130d19456ae858abfbbd89544"},"schema_version":"1.0"},"canonical_sha256":"5ac65c40824eb5cc32fb28eda596aa56e783d5f5f84205d056f4c73b1875e644","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:45.841836Z","signature_b64":"7Jl+hUL3a4kuFQfO8T3HuRz9yCXzQjrg4sJ3VTjO+tB9ZNLgAc92Yo0IIb9hfYzhrr0D2J2Jjzl8372LQiDeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac65c40824eb5cc32fb28eda596aa56e783d5f5f84205d056f4c73b1875e644","last_reissued_at":"2026-05-18T01:27:45.841164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:45.841164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02528","source_version":2,"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-18T01:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4NBRGjnIuBiuy+fR3cm81nqd/xIw78C0v26FdkGNOPDiL3pmWpMuaTm3zPbS1MRcI6+dKt2t7FhaxPzv4+3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:42.565739Z"},"content_sha256":"5a6fd0c124521cee69584d85ea241d69ebc241f4837b2dd59321e6f7b75b2be9","schema_version":"1.0","event_id":"sha256:5a6fd0c124521cee69584d85ea241d69ebc241f4837b2dd59321e6f7b75b2be9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LLDFYQECJ224YMX3FDW2LFVKK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Elad Hazan, Jacob Abernethy","submitted_at":"2015-07-09T14:32:55Z","abstract_excerpt":"This paper explores a surprising equivalence between two seemingly-distinct convex optimization methods. We show that simulated annealing, a well-studied random walk algorithms, is directly equivalent, in a certain sense, to the central path interior point algorithm for the the entropic universal barrier function. This connection exhibits several benefits. First, we are able improve the state of the art time complexity for convex optimization under the membership oracle model. We improve the analysis of the randomized algorithm of Kalai and Vempala by utilizing tools developed by Nesterov and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02528","kind":"arxiv","version":2},"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-18T01:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zz6owcm9M03cgjmZk51xdIbhiRgz0qO8KCiHkP7ujRSfb5A3SP+RSJfhcerAWKgYtG1uzJ9h8tQjrffQZvdUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:10:42.566248Z"},"content_sha256":"c3aa092272d1548bd0879aeb3bc1409b8aa00bcd56807f0da968bc1d0dbeebf3","schema_version":"1.0","event_id":"sha256:c3aa092272d1548bd0879aeb3bc1409b8aa00bcd56807f0da968bc1d0dbeebf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLDFYQECJ224YMX3FDW2LFVKK3/bundle.json","state_url":"https://pith.science/pith/LLDFYQECJ224YMX3FDW2LFVKK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLDFYQECJ224YMX3FDW2LFVKK3/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-05-31T03:10:42Z","links":{"resolver":"https://pith.science/pith/LLDFYQECJ224YMX3FDW2LFVKK3","bundle":"https://pith.science/pith/LLDFYQECJ224YMX3FDW2LFVKK3/bundle.json","state":"https://pith.science/pith/LLDFYQECJ224YMX3FDW2LFVKK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLDFYQECJ224YMX3FDW2LFVKK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLDFYQECJ224YMX3FDW2LFVKK3","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":"5b8b51bba230e68501c4f56ba7abe616f4d3af8130d19456ae858abfbbd89544","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-09T14:32:55Z","title_canon_sha256":"ea925fcfdc10fb76ed541a30b8dd63ce48ecbaeb4a65295178fb39c730997dc8"},"schema_version":"1.0","source":{"id":"1507.02528","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02528","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02528v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02528","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"LLDFYQECJ224","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLDFYQECJ224YMX3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLDFYQEC","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:c3aa092272d1548bd0879aeb3bc1409b8aa00bcd56807f0da968bc1d0dbeebf3","target":"graph","created_at":"2026-05-18T01:27:45Z","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":"This paper explores a surprising equivalence between two seemingly-distinct convex optimization methods. We show that simulated annealing, a well-studied random walk algorithms, is directly equivalent, in a certain sense, to the central path interior point algorithm for the the entropic universal barrier function. This connection exhibits several benefits. First, we are able improve the state of the art time complexity for convex optimization under the membership oracle model. We improve the analysis of the randomized algorithm of Kalai and Vempala by utilizing tools developed by Nesterov and ","authors_text":"Elad Hazan, Jacob Abernethy","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-09T14:32:55Z","title":"Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02528","kind":"arxiv","version":2},"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:5a6fd0c124521cee69584d85ea241d69ebc241f4837b2dd59321e6f7b75b2be9","target":"record","created_at":"2026-05-18T01:27:45Z","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":"5b8b51bba230e68501c4f56ba7abe616f4d3af8130d19456ae858abfbbd89544","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-09T14:32:55Z","title_canon_sha256":"ea925fcfdc10fb76ed541a30b8dd63ce48ecbaeb4a65295178fb39c730997dc8"},"schema_version":"1.0","source":{"id":"1507.02528","kind":"arxiv","version":2}},"canonical_sha256":"5ac65c40824eb5cc32fb28eda596aa56e783d5f5f84205d056f4c73b1875e644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ac65c40824eb5cc32fb28eda596aa56e783d5f5f84205d056f4c73b1875e644","first_computed_at":"2026-05-18T01:27:45.841164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:45.841164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Jl+hUL3a4kuFQfO8T3HuRz9yCXzQjrg4sJ3VTjO+tB9ZNLgAc92Yo0IIb9hfYzhrr0D2J2Jjzl8372LQiDeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:45.841836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02528","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a6fd0c124521cee69584d85ea241d69ebc241f4837b2dd59321e6f7b75b2be9","sha256:c3aa092272d1548bd0879aeb3bc1409b8aa00bcd56807f0da968bc1d0dbeebf3"],"state_sha256":"cb30a3c4198ef1bc29c58db15639a9eb871c0e3e4d82dfc330127f2c85abd27a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALShEko7c3f5UDogMrC3xkFaxK5ih1zBqrOOBrkngE6YPvjwz2yFdeFz4YvH+zIYH2cIZnMbMz/Vz5a1Xm1VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:10:42.569973Z","bundle_sha256":"8ab575bfd674a475a142751fbe9dd9ec1cf12e16af61f46f180d7ecdbb21c2e4"}}