{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JD3OE2NLDNIIRIU2LPZZ4G3YSW","short_pith_number":"pith:JD3OE2NL","schema_version":"1.0","canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","source":{"kind":"arxiv","id":"1710.09025","version":3},"attestation_state":"computed","paper":{"title":"Optimization of population annealing Monte Carlo for large-scale spin-glass simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.comp-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Amin Barzegar, Christopher Pattison, Helmut G. Katzgraber, Wenlong Wang","submitted_at":"2017-10-25T00:10:12Z","abstract_excerpt":"Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. We demonstrate how the algorithm can be optimized from an implementation, algorithmic accelerator, as well as scalable parallelization points of view. This makes population annealing Monte Carlo perfectl"},"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":"1710.09025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-25T00:10:12Z","cross_cats_sorted":["cs.DC","physics.comp-ph"],"title_canon_sha256":"419d76482bb035ce41522ef0a5c44c944a2d66ca3395102434e7780efe219f12","abstract_canon_sha256":"46e17ff0391bdfb08d0e578569c6077d4dea1e67b1ce8ce7c3a85d97e8c663e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.068348Z","signature_b64":"xw1bgampSAHjqfubakQfuJMVOwJS8KNj1yOV3x4DBND1L6wzbkP1+DpGSze3BSs+F35LcREpLn9AVCaRE7CmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","last_reissued_at":"2026-05-18T00:00:09.067902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.067902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of population annealing Monte Carlo for large-scale spin-glass simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.comp-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Amin Barzegar, Christopher Pattison, Helmut G. Katzgraber, Wenlong Wang","submitted_at":"2017-10-25T00:10:12Z","abstract_excerpt":"Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. We demonstrate how the algorithm can be optimized from an implementation, algorithmic accelerator, as well as scalable parallelization points of view. This makes population annealing Monte Carlo perfectl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09025","kind":"arxiv","version":3},"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":"1710.09025","created_at":"2026-05-18T00:00:09.067969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09025v3","created_at":"2026-05-18T00:00:09.067969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09025","created_at":"2026-05-18T00:00:09.067969+00:00"},{"alias_kind":"pith_short_12","alias_value":"JD3OE2NLDNII","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JD3OE2NLDNIIRIU2","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JD3OE2NL","created_at":"2026-05-18T12:31:21.493067+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/JD3OE2NLDNIIRIU2LPZZ4G3YSW","json":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW.json","graph_json":"https://pith.science/api/pith-number/JD3OE2NLDNIIRIU2LPZZ4G3YSW/graph.json","events_json":"https://pith.science/api/pith-number/JD3OE2NLDNIIRIU2LPZZ4G3YSW/events.json","paper":"https://pith.science/paper/JD3OE2NL"},"agent_actions":{"view_html":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW","download_json":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW.json","view_paper":"https://pith.science/paper/JD3OE2NL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09025&json=true","fetch_graph":"https://pith.science/api/pith-number/JD3OE2NLDNIIRIU2LPZZ4G3YSW/graph.json","fetch_events":"https://pith.science/api/pith-number/JD3OE2NLDNIIRIU2LPZZ4G3YSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/action/storage_attestation","attest_author":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/action/author_attestation","sign_citation":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/action/citation_signature","submit_replication":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/action/replication_record"}},"created_at":"2026-05-18T00:00:09.067969+00:00","updated_at":"2026-05-18T00:00:09.067969+00:00"}