{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RALQ7EE36X7NWVTUUX6CTONQ5J","short_pith_number":"pith:RALQ7EE3","schema_version":"1.0","canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","source":{"kind":"arxiv","id":"1703.03676","version":2},"attestation_state":"computed","paper":{"title":"GPU accelerated population annealing algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"primary_cat":"physics.comp-ph","authors_text":"Lev N. Shchur, Lev Yu. Barash, Martin Weigel, Michal Borovsk\\'y, Wolfhard Janke","submitted_at":"2017-03-10T13:27:33Z","abstract_excerpt":"Population annealing is a promising recent approach for Monte Carlo simulations in statistical physics, in particular for the simulation of systems with complex free-energy landscapes. It is a hybrid method, combining importance sampling through Markov chains with elements of sequential Monte Carlo in the form of population control. While it appears to provide algorithmic capabilities for the simulation of such systems that are roughly comparable to those of more established approaches such as parallel tempering, it is intrinsically much more suitable for massively parallel computing. Here, we"},"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":"1703.03676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2017-03-10T13:27:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"title_canon_sha256":"be81a857c8a0ab231e938012644e1aa204476fd5cdea8f5804586b0b36283528","abstract_canon_sha256":"fce13e7a46a85e6d55152e21b23f32aa49203c5506e13683c3653a4ba889f748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:16.387604Z","signature_b64":"Qz72kW/B3lXHXOfou9jikH0z606EUlxYBQbCnFHSNCf4X+GAGdlqoeI0uabD9sEi+OJgP1XV2naieCzI5QNKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","last_reissued_at":"2026-05-18T00:35:16.386979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:16.386979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU accelerated population annealing algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"primary_cat":"physics.comp-ph","authors_text":"Lev N. Shchur, Lev Yu. Barash, Martin Weigel, Michal Borovsk\\'y, Wolfhard Janke","submitted_at":"2017-03-10T13:27:33Z","abstract_excerpt":"Population annealing is a promising recent approach for Monte Carlo simulations in statistical physics, in particular for the simulation of systems with complex free-energy landscapes. It is a hybrid method, combining importance sampling through Markov chains with elements of sequential Monte Carlo in the form of population control. While it appears to provide algorithmic capabilities for the simulation of such systems that are roughly comparable to those of more established approaches such as parallel tempering, it is intrinsically much more suitable for massively parallel computing. Here, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03676","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.03676","created_at":"2026-05-18T00:35:16.387067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03676v2","created_at":"2026-05-18T00:35:16.387067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03676","created_at":"2026-05-18T00:35:16.387067+00:00"},{"alias_kind":"pith_short_12","alias_value":"RALQ7EE36X7N","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RALQ7EE36X7NWVTU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RALQ7EE3","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10254","citing_title":"Algorithmic overlaps as thermodynamic variables: from local to cluster Monte Carlo dynamics in critical phenomena","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J","json":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J.json","graph_json":"https://pith.science/api/pith-number/RALQ7EE36X7NWVTUUX6CTONQ5J/graph.json","events_json":"https://pith.science/api/pith-number/RALQ7EE36X7NWVTUUX6CTONQ5J/events.json","paper":"https://pith.science/paper/RALQ7EE3"},"agent_actions":{"view_html":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J","download_json":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J.json","view_paper":"https://pith.science/paper/RALQ7EE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03676&json=true","fetch_graph":"https://pith.science/api/pith-number/RALQ7EE36X7NWVTUUX6CTONQ5J/graph.json","fetch_events":"https://pith.science/api/pith-number/RALQ7EE36X7NWVTUUX6CTONQ5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/action/storage_attestation","attest_author":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/action/author_attestation","sign_citation":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/action/citation_signature","submit_replication":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/action/replication_record"}},"created_at":"2026-05-18T00:35:16.387067+00:00","updated_at":"2026-05-18T00:35:16.387067+00:00"}