{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:FONYFOA56MPLLFHO7OUXKWOQCN","short_pith_number":"pith:FONYFOA5","schema_version":"1.0","canonical_sha256":"2b9b82b81df31eb594eefba97559d0134720847a84aa2ece794cd5d3b96ce8cd","source":{"kind":"arxiv","id":"cond-mat/9501047","version":1},"attestation_state":"computed","paper":{"title":"Generalized Simulated Annealing","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat","authors_text":"Ast, Constantino Tsallis (Dept of Phys, Daniel A. Stariolo (Centro Brasileiro de Pesquisas Fisicas), Michigan State Univ.)","submitted_at":"1995-01-12T20:35:56Z","abstract_excerpt":"We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm recovers, as particular cases, the so called classical (\"Boltzmann machine\") and fast (\"Cauchy machine\") simulated annealings, and can be quicker than both. Key-words: simulated annealing; nonconvex optimization; gradient descent; generalized statistical mechanics."},"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":"cond-mat/9501047","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat","submitted_at":"1995-01-12T20:35:56Z","cross_cats_sorted":[],"title_canon_sha256":"cfe64e98ddde82a66de3e6b12180262779e451d21bb6ec7632faeed072a13dbf","abstract_canon_sha256":"f8902b8032d0d3884930966357d31e8d1d0fc6cda7f823740f84743d949e3d27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:35.367464Z","signature_b64":"3T7ZGAXqKDnaocnh3cYUsuTgc6wTid11J2NxrU43MkxKxeJ1At9b7wkbsklTsNrFP7Wx++3PQqM8VD1LnK4hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b9b82b81df31eb594eefba97559d0134720847a84aa2ece794cd5d3b96ce8cd","last_reissued_at":"2026-05-18T01:39:35.366870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:35.366870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Simulated Annealing","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat","authors_text":"Ast, Constantino Tsallis (Dept of Phys, Daniel A. Stariolo (Centro Brasileiro de Pesquisas Fisicas), Michigan State Univ.)","submitted_at":"1995-01-12T20:35:56Z","abstract_excerpt":"We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm recovers, as particular cases, the so called classical (\"Boltzmann machine\") and fast (\"Cauchy machine\") simulated annealings, and can be quicker than both. Key-words: simulated annealing; nonconvex optimization; gradient descent; generalized statistical mechanics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9501047","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":"cond-mat/9501047","created_at":"2026-05-18T01:39:35.366954+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9501047v1","created_at":"2026-05-18T01:39:35.366954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9501047","created_at":"2026-05-18T01:39:35.366954+00:00"},{"alias_kind":"pith_short_12","alias_value":"FONYFOA56MPL","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"FONYFOA56MPLLFHO","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"FONYFOA5","created_at":"2026-05-18T12:25:47.700082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12566","citing_title":"Scalable 3D silicon nitride photonic interposer for high-density optical interconnects","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN","json":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN.json","graph_json":"https://pith.science/api/pith-number/FONYFOA56MPLLFHO7OUXKWOQCN/graph.json","events_json":"https://pith.science/api/pith-number/FONYFOA56MPLLFHO7OUXKWOQCN/events.json","paper":"https://pith.science/paper/FONYFOA5"},"agent_actions":{"view_html":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN","download_json":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN.json","view_paper":"https://pith.science/paper/FONYFOA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9501047&json=true","fetch_graph":"https://pith.science/api/pith-number/FONYFOA56MPLLFHO7OUXKWOQCN/graph.json","fetch_events":"https://pith.science/api/pith-number/FONYFOA56MPLLFHO7OUXKWOQCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN/action/storage_attestation","attest_author":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN/action/author_attestation","sign_citation":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN/action/citation_signature","submit_replication":"https://pith.science/pith/FONYFOA56MPLLFHO7OUXKWOQCN/action/replication_record"}},"created_at":"2026-05-18T01:39:35.366954+00:00","updated_at":"2026-05-18T01:39:35.366954+00:00"}