{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NSUEVQMLYVIEYQJT5PXBDWCJPD","short_pith_number":"pith:NSUEVQML","schema_version":"1.0","canonical_sha256":"6ca84ac18bc5504c4133ebee11d84978c42c56f1dcd5f711247376142e908ade","source":{"kind":"arxiv","id":"0709.2989","version":1},"attestation_state":"computed","paper":{"title":"Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains","license":"","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"A. Lecchini-Visintini, J. Lygeros, J. Maciejowski","submitted_at":"2007-09-19T10:56:13Z","abstract_excerpt":"Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of co"},"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":"0709.2989","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"stat.ML","submitted_at":"2007-09-19T10:56:13Z","cross_cats_sorted":[],"title_canon_sha256":"7e42e604d4ce864ad93e1b4a61c4fca71e8dd055923a4d9a78e5f02ad62aeae1","abstract_canon_sha256":"e87423ca8e652b3caaa84786f2e16bc24fae58fe101d22b879f42bc4fb714671"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:22.610156Z","signature_b64":"h02+sDG0994E55Vd7WQRqnHhAGPjicE9eqwdrXr/1+oqE3M6/Yb/sj3pWrnB0Uk5vCeQaXrjqrfQewPnvl82AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca84ac18bc5504c4133ebee11d84978c42c56f1dcd5f711247376142e908ade","last_reissued_at":"2026-07-04T15:04:22.609814Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:22.609814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains","license":"","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"A. Lecchini-Visintini, J. Lygeros, J. Maciejowski","submitted_at":"2007-09-19T10:56:13Z","abstract_excerpt":"Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.2989","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/0709.2989/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":"0709.2989","created_at":"2026-07-04T15:04:22.609868+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.2989v1","created_at":"2026-07-04T15:04:22.609868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.2989","created_at":"2026-07-04T15:04:22.609868+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSUEVQMLYVIE","created_at":"2026-07-04T15:04:22.609868+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSUEVQMLYVIEYQJT","created_at":"2026-07-04T15:04:22.609868+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSUEVQML","created_at":"2026-07-04T15:04:22.609868+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15393","citing_title":"A Decision Transformer Approach to Grain Boundary Network Optimization","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD","json":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD.json","graph_json":"https://pith.science/api/pith-number/NSUEVQMLYVIEYQJT5PXBDWCJPD/graph.json","events_json":"https://pith.science/api/pith-number/NSUEVQMLYVIEYQJT5PXBDWCJPD/events.json","paper":"https://pith.science/paper/NSUEVQML"},"agent_actions":{"view_html":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD","download_json":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD.json","view_paper":"https://pith.science/paper/NSUEVQML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.2989&json=true","fetch_graph":"https://pith.science/api/pith-number/NSUEVQMLYVIEYQJT5PXBDWCJPD/graph.json","fetch_events":"https://pith.science/api/pith-number/NSUEVQMLYVIEYQJT5PXBDWCJPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD/action/storage_attestation","attest_author":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD/action/author_attestation","sign_citation":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD/action/citation_signature","submit_replication":"https://pith.science/pith/NSUEVQMLYVIEYQJT5PXBDWCJPD/action/replication_record"}},"created_at":"2026-07-04T15:04:22.609868+00:00","updated_at":"2026-07-04T15:04:22.609868+00:00"}