{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2F3DQSWXAI3MIIFDD4ROV4OJHN","short_pith_number":"pith:2F3DQSWX","schema_version":"1.0","canonical_sha256":"d176384ad70236c420a31f22eaf1c93b52ea8863a09f9b2b9ff8fee434805800","source":{"kind":"arxiv","id":"1504.00053","version":1},"attestation_state":"computed","paper":{"title":"Ensemble annealing of complex physical systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.data-an","stat.CO"],"primary_cat":"physics.comp-ph","authors_text":"Michael Habeck","submitted_at":"2015-03-31T21:52:49Z","abstract_excerpt":"Algorithms for simulating complex physical systems or solving difficult optimization problems often resort to an annealing process. Rather than simulating the system at the temperature of interest, an annealing algorithm starts at a temperature that is high enough to ensure ergodicity and gradually decreases it until the destination temperature is reached. This idea is used in popular algorithms such as parallel tempering and simulated annealing. A general problem with annealing methods is that they require a temperature schedule. Choosing well-balanced temperature schedules can be tedious and"},"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":"1504.00053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2015-03-31T21:52:49Z","cross_cats_sorted":["cond-mat.stat-mech","physics.data-an","stat.CO"],"title_canon_sha256":"912571a848d3792da70a2ac3a532c75d6c80fcf46c9d9f06ed6f5cdd2ba93429","abstract_canon_sha256":"1cd276c394cef49d1b718b219af0688a29fd28cb08c48184ffa0b4dd3a52f24c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:49.882607Z","signature_b64":"13CeErAr4k2dYsQXj/GoUP9midBYD6T8gL9MqxVYIVFB7jsTXmX5fEPC6jKsPBQEgpFQFlbVzqeP8MimvjZ3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d176384ad70236c420a31f22eaf1c93b52ea8863a09f9b2b9ff8fee434805800","last_reissued_at":"2026-05-18T02:19:49.882050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:49.882050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble annealing of complex physical systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.data-an","stat.CO"],"primary_cat":"physics.comp-ph","authors_text":"Michael Habeck","submitted_at":"2015-03-31T21:52:49Z","abstract_excerpt":"Algorithms for simulating complex physical systems or solving difficult optimization problems often resort to an annealing process. Rather than simulating the system at the temperature of interest, an annealing algorithm starts at a temperature that is high enough to ensure ergodicity and gradually decreases it until the destination temperature is reached. This idea is used in popular algorithms such as parallel tempering and simulated annealing. A general problem with annealing methods is that they require a temperature schedule. Choosing well-balanced temperature schedules can be tedious and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00053","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":"1504.00053","created_at":"2026-05-18T02:19:49.882122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00053v1","created_at":"2026-05-18T02:19:49.882122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00053","created_at":"2026-05-18T02:19:49.882122+00:00"},{"alias_kind":"pith_short_12","alias_value":"2F3DQSWXAI3M","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2F3DQSWXAI3MIIFD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2F3DQSWX","created_at":"2026-05-18T12:28:59.999130+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/2F3DQSWXAI3MIIFDD4ROV4OJHN","json":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN.json","graph_json":"https://pith.science/api/pith-number/2F3DQSWXAI3MIIFDD4ROV4OJHN/graph.json","events_json":"https://pith.science/api/pith-number/2F3DQSWXAI3MIIFDD4ROV4OJHN/events.json","paper":"https://pith.science/paper/2F3DQSWX"},"agent_actions":{"view_html":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN","download_json":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN.json","view_paper":"https://pith.science/paper/2F3DQSWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00053&json=true","fetch_graph":"https://pith.science/api/pith-number/2F3DQSWXAI3MIIFDD4ROV4OJHN/graph.json","fetch_events":"https://pith.science/api/pith-number/2F3DQSWXAI3MIIFDD4ROV4OJHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN/action/storage_attestation","attest_author":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN/action/author_attestation","sign_citation":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN/action/citation_signature","submit_replication":"https://pith.science/pith/2F3DQSWXAI3MIIFDD4ROV4OJHN/action/replication_record"}},"created_at":"2026-05-18T02:19:49.882122+00:00","updated_at":"2026-05-18T02:19:49.882122+00:00"}