{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:5V4VZ5CW3OR5A2HDEB37NWIEGS","short_pith_number":"pith:5V4VZ5CW","schema_version":"1.0","canonical_sha256":"ed795cf456dba3d068e32077f6d9043490e27b9ca58fe7ef28547c94cea577d9","source":{"kind":"arxiv","id":"math/0609353","version":1},"attestation_state":"computed","paper":{"title":"Fast simulated annealing in $\\R^d$ and an application to maximum likelihood estimation","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Magnus Wiktorsson (CENTRE for Mathematical Sciences), Sylvain Rubenthaler (JAD), Tobias Ryd\\'en (CENTRE for Mathematical Sciences)","submitted_at":"2006-09-13T12:44:39Z","abstract_excerpt":"Using classical simulated annealing to maximise a function $\\psi$ defined on a subset of $\\R^d$, the probability $\\p(\\psi(\\theta\\_n)\\leq \\psi\\_{\\max}-\\epsilon)$ tends to zero at a logarithmic rate as $n$ increases; here $\\theta\\_n$ is the state in the $n$-th stage of the simulated annealing algorithm and $\\psi\\_{\\max}$ is the maximal value of $\\psi$. We propose a modified scheme for which this probability is of order $n^{-1/3}\\log n$, and hence vanishes at an algebraic rate. To obtain this faster rate, the exponentially decaying acceptance probability of classical simulated annealing is replac"},"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":"math/0609353","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-09-13T12:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"50a394bf315df8a1375d34d01a248ebe0b112aaa41d80b90ac4dcb59157aabb7","abstract_canon_sha256":"bfeed4e12eb2a17846613cc75a955e71863f7886b3fbdf4b02c66bcad2bd0d4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:49.737860Z","signature_b64":"WKhO4Xa8mvMzF6hRwZ7QJpS3bqBtr9x3u+wOE/fKE5t66VKZax8+uHY2IrVzqxYDmPOiWp4XCyBWNYuwq7LWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed795cf456dba3d068e32077f6d9043490e27b9ca58fe7ef28547c94cea577d9","last_reissued_at":"2026-05-18T01:08:49.736993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:49.736993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast simulated annealing in $\\R^d$ and an application to maximum likelihood estimation","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Magnus Wiktorsson (CENTRE for Mathematical Sciences), Sylvain Rubenthaler (JAD), Tobias Ryd\\'en (CENTRE for Mathematical Sciences)","submitted_at":"2006-09-13T12:44:39Z","abstract_excerpt":"Using classical simulated annealing to maximise a function $\\psi$ defined on a subset of $\\R^d$, the probability $\\p(\\psi(\\theta\\_n)\\leq \\psi\\_{\\max}-\\epsilon)$ tends to zero at a logarithmic rate as $n$ increases; here $\\theta\\_n$ is the state in the $n$-th stage of the simulated annealing algorithm and $\\psi\\_{\\max}$ is the maximal value of $\\psi$. We propose a modified scheme for which this probability is of order $n^{-1/3}\\log n$, and hence vanishes at an algebraic rate. To obtain this faster rate, the exponentially decaying acceptance probability of classical simulated annealing is replac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0609353","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":"math/0609353","created_at":"2026-05-18T01:08:49.737136+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0609353v1","created_at":"2026-05-18T01:08:49.737136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0609353","created_at":"2026-05-18T01:08:49.737136+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V4VZ5CW3OR5","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V4VZ5CW3OR5A2HD","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V4VZ5CW","created_at":"2026-05-18T12:25:53.939244+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/5V4VZ5CW3OR5A2HDEB37NWIEGS","json":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS.json","graph_json":"https://pith.science/api/pith-number/5V4VZ5CW3OR5A2HDEB37NWIEGS/graph.json","events_json":"https://pith.science/api/pith-number/5V4VZ5CW3OR5A2HDEB37NWIEGS/events.json","paper":"https://pith.science/paper/5V4VZ5CW"},"agent_actions":{"view_html":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS","download_json":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS.json","view_paper":"https://pith.science/paper/5V4VZ5CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0609353&json=true","fetch_graph":"https://pith.science/api/pith-number/5V4VZ5CW3OR5A2HDEB37NWIEGS/graph.json","fetch_events":"https://pith.science/api/pith-number/5V4VZ5CW3OR5A2HDEB37NWIEGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS/action/storage_attestation","attest_author":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS/action/author_attestation","sign_citation":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS/action/citation_signature","submit_replication":"https://pith.science/pith/5V4VZ5CW3OR5A2HDEB37NWIEGS/action/replication_record"}},"created_at":"2026-05-18T01:08:49.737136+00:00","updated_at":"2026-05-18T01:08:49.737136+00:00"}