{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RALQ7EE36X7NWVTUUX6CTONQ5J","short_pith_number":"pith:RALQ7EE3","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"},"canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","source":{"kind":"arxiv","id":"1703.03676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03676","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03676v2","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03676","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"pith_short_12","alias_value":"RALQ7EE36X7N","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RALQ7EE36X7NWVTU","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RALQ7EE3","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RALQ7EE36X7NWVTUUX6CTONQ5J","target":"record","payload":{"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"},"canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","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"},"source_kind":"arxiv","source_id":"1703.03676","source_version":2,"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:35:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6FE4+nQuE+xmxq7NaqgaJ/Gk5oiiyq4ngMyOTn/T1vOjKB8tb5Y7JTH5k87cYXmNTTj232vPm1UjJcPVaW7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:38:51.287413Z"},"content_sha256":"9d83b1fe12869f51b25e453ee4e3e2c8642e3ae2d78002576a93c369a66a37f3","schema_version":"1.0","event_id":"sha256:9d83b1fe12869f51b25e453ee4e3e2c8642e3ae2d78002576a93c369a66a37f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RALQ7EE36X7NWVTUUX6CTONQ5J","target":"graph","payload":{"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"},"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:35:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmBZE76Q5oNiQ3Xlzv1qoh6nDlSxdI8PXZrOPRAht1QcTNPoGPvXiAv116oaCb0G/cny/4fnKPnV26DFzW71BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:38:51.287771Z"},"content_sha256":"e3bca5cb37c44ffc35099e0bd1397adc15631b8265960fc4a693b073f773efdd","schema_version":"1.0","event_id":"sha256:e3bca5cb37c44ffc35099e0bd1397adc15631b8265960fc4a693b073f773efdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/bundle.json","state_url":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/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-27T11:38:51Z","links":{"resolver":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J","bundle":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/bundle.json","state":"https://pith.science/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RALQ7EE36X7NWVTUUX6CTONQ5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RALQ7EE36X7NWVTUUX6CTONQ5J","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":"fce13e7a46a85e6d55152e21b23f32aa49203c5506e13683c3653a4ba889f748","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2017-03-10T13:27:33Z","title_canon_sha256":"be81a857c8a0ab231e938012644e1aa204476fd5cdea8f5804586b0b36283528"},"schema_version":"1.0","source":{"id":"1703.03676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03676","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03676v2","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03676","created_at":"2026-05-18T00:35:16Z"},{"alias_kind":"pith_short_12","alias_value":"RALQ7EE36X7N","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RALQ7EE36X7NWVTU","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RALQ7EE3","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e3bca5cb37c44ffc35099e0bd1397adc15631b8265960fc4a693b073f773efdd","target":"graph","created_at":"2026-05-18T00:35:16Z","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 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","authors_text":"Lev N. Shchur, Lev Yu. Barash, Martin Weigel, Michal Borovsk\\'y, Wolfhard Janke","cross_cats":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2017-03-10T13:27:33Z","title":"GPU accelerated population annealing algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03676","kind":"arxiv","version":2},"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:9d83b1fe12869f51b25e453ee4e3e2c8642e3ae2d78002576a93c369a66a37f3","target":"record","created_at":"2026-05-18T00:35:16Z","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":"fce13e7a46a85e6d55152e21b23f32aa49203c5506e13683c3653a4ba889f748","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.soft","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2017-03-10T13:27:33Z","title_canon_sha256":"be81a857c8a0ab231e938012644e1aa204476fd5cdea8f5804586b0b36283528"},"schema_version":"1.0","source":{"id":"1703.03676","kind":"arxiv","version":2}},"canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88170f909bf5fedb5674a5fc29b9b0ea783590a71c4cf85e00a05782e47f290e","first_computed_at":"2026-05-18T00:35:16.386979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:16.386979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qz72kW/B3lXHXOfou9jikH0z606EUlxYBQbCnFHSNCf4X+GAGdlqoeI0uabD9sEi+OJgP1XV2naieCzI5QNKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:16.387604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d83b1fe12869f51b25e453ee4e3e2c8642e3ae2d78002576a93c369a66a37f3","sha256:e3bca5cb37c44ffc35099e0bd1397adc15631b8265960fc4a693b073f773efdd"],"state_sha256":"6f1e69c0cd977ba3c5500360b230efd2d9a6b95f16f681533b8f5e53a7f6497c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8dyzP7lXMNsNnvVTvtJniYl8LRgmzq8kDMVWYlDHivrr1Uzu4hx64OkNI3Qi/oa2HVG+e3Nyo/vbbpOI3zMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:38:51.289880Z","bundle_sha256":"c5aabac785f0bfa630725ed7ba2dceaceea9424d33420a39aa86c029de540d9b"}}