{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JD3OE2NLDNIIRIU2LPZZ4G3YSW","short_pith_number":"pith:JD3OE2NL","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"},"canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","source":{"kind":"arxiv","id":"1710.09025","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09025","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09025v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09025","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"JD3OE2NLDNII","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JD3OE2NLDNIIRIU2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JD3OE2NL","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JD3OE2NLDNIIRIU2LPZZ4G3YSW","target":"record","payload":{"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"},"canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","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"},"source_kind":"arxiv","source_id":"1710.09025","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6DKAOurbQ1bYJjKwFlbFQQzoPeylbT7Ry4Ip/2Bru3BEHYIKdvh2frB7mTS32cMhO34qMchB/mDBpPOpFDdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:59.290888Z"},"content_sha256":"7366daa64041af3bcb5f3e2e4f91f7fad739b3db01d87f8fd47649266f4c30ad","schema_version":"1.0","event_id":"sha256:7366daa64041af3bcb5f3e2e4f91f7fad739b3db01d87f8fd47649266f4c30ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JD3OE2NLDNIIRIU2LPZZ4G3YSW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mtN1nsZODHRe/nLTk623KTUcpLxSUl/SSxReLGuqHbyLeDPnDWOxdR2Iy31rcV+uWgMfIHl07FstaCY5d+9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:59.291233Z"},"content_sha256":"a6b4265f7af7e7801328d91e07daf4809234f89864f138df6a1bf955b905d5ba","schema_version":"1.0","event_id":"sha256:a6b4265f7af7e7801328d91e07daf4809234f89864f138df6a1bf955b905d5ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/bundle.json","state_url":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T10:21:59Z","links":{"resolver":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW","bundle":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/bundle.json","state":"https://pith.science/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JD3OE2NLDNIIRIU2LPZZ4G3YSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JD3OE2NLDNIIRIU2LPZZ4G3YSW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"46e17ff0391bdfb08d0e578569c6077d4dea1e67b1ce8ce7c3a85d97e8c663e8","cross_cats_sorted":["cs.DC","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-25T00:10:12Z","title_canon_sha256":"419d76482bb035ce41522ef0a5c44c944a2d66ca3395102434e7780efe219f12"},"schema_version":"1.0","source":{"id":"1710.09025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09025","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09025v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09025","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"JD3OE2NLDNII","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JD3OE2NLDNIIRIU2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JD3OE2NL","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a6b4265f7af7e7801328d91e07daf4809234f89864f138df6a1bf955b905d5ba","target":"graph","created_at":"2026-05-18T00:00:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amin Barzegar, Christopher Pattison, Helmut G. Katzgraber, Wenlong Wang","cross_cats":["cs.DC","physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-25T00:10:12Z","title":"Optimization of population annealing Monte Carlo for large-scale spin-glass simulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09025","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7366daa64041af3bcb5f3e2e4f91f7fad739b3db01d87f8fd47649266f4c30ad","target":"record","created_at":"2026-05-18T00:00:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"46e17ff0391bdfb08d0e578569c6077d4dea1e67b1ce8ce7c3a85d97e8c663e8","cross_cats_sorted":["cs.DC","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-25T00:10:12Z","title_canon_sha256":"419d76482bb035ce41522ef0a5c44c944a2d66ca3395102434e7780efe219f12"},"schema_version":"1.0","source":{"id":"1710.09025","kind":"arxiv","version":3}},"canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48f6e269ab1b5088a29a5bf39e1b7895924fa1bbf7b005f36958ee094bf33cbd","first_computed_at":"2026-05-18T00:00:09.067902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.067902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xw1bgampSAHjqfubakQfuJMVOwJS8KNj1yOV3x4DBND1L6wzbkP1+DpGSze3BSs+F35LcREpLn9AVCaRE7CmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.068348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7366daa64041af3bcb5f3e2e4f91f7fad739b3db01d87f8fd47649266f4c30ad","sha256:a6b4265f7af7e7801328d91e07daf4809234f89864f138df6a1bf955b905d5ba"],"state_sha256":"a782e137aec022fc733c3450cbaa70658ad6823a5b9ab85679b36d34d0389fec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLTZz6/+tGYyEIqF8r145KTRrVN2et204utBzaIk7it7IBKTdUQ9767KFOQZOFk4fSGirhUk0QPTwfWOiL64Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:21:59.293347Z","bundle_sha256":"b4feaf78833f0e9cc201099510b68a55ed23d8da365306bbc551729c6889309e"}}