{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A556H2ZNINAUAILCBL46NRURVT","short_pith_number":"pith:A556H2ZN","canonical_record":{"source":{"id":"1907.05124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T11:50:21Z","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"title_canon_sha256":"71db30d91a831bd2a82f358b4cc1cbe0da1c7d0def5eb35b551ba3aa26e1f35d","abstract_canon_sha256":"6801c65db7c82ef7f370afc060149e0ae471c4b2f5dda0e085ce47a7c9c75413"},"schema_version":"1.0"},"canonical_sha256":"077be3eb2d43414021620af9e6c691acda061c33b35e7d933bca5558ca6d94fb","source":{"kind":"arxiv","id":"1907.05124","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05124","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05124v2","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05124","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"A556H2ZNINAU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A556H2ZNINAUAILC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A556H2ZN","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A556H2ZNINAUAILCBL46NRURVT","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T11:50:21Z","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"title_canon_sha256":"71db30d91a831bd2a82f358b4cc1cbe0da1c7d0def5eb35b551ba3aa26e1f35d","abstract_canon_sha256":"6801c65db7c82ef7f370afc060149e0ae471c4b2f5dda0e085ce47a7c9c75413"},"schema_version":"1.0"},"canonical_sha256":"077be3eb2d43414021620af9e6c691acda061c33b35e7d933bca5558ca6d94fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:29.595480Z","signature_b64":"e0J/FmOLkFXcPSrDd8dxS3dOk5zV495yDAEpsGIFfuQ3JKv1pIVx3nptYGZEJrJmjD9rdJd2JWxPp1KKiSZABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077be3eb2d43414021620af9e6c691acda061c33b35e7d933bca5558ca6d94fb","last_reissued_at":"2026-05-17T23:40:29.593682Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:29.593682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05124","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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2giD3Q21Jb7MkaCTGQ+3IxHf6rdfzP4j4r1gmW+d/hiIQg/b2yuuQSOdGCBuZA953IcONUxcOmArtEmAJr3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:38:55.930228Z"},"content_sha256":"3925cc6d75fc2e573e157a64f6d5815d6877c778098d38001707ce19ee5760b1","schema_version":"1.0","event_id":"sha256:3925cc6d75fc2e573e157a64f6d5815d6877c778098d38001707ce19ee5760b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A556H2ZNINAUAILCBL46NRURVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Highly parallel algorithm for the Ising ground state searching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","stat.ML"],"primary_cat":"quant-ph","authors_text":"A.N. Rubtsov, A. Yavorsky, E.A. Polyakov, L.A. Markovich","submitted_at":"2019-07-11T11:50:21Z","abstract_excerpt":"Finding an energy minimum in the Ising model is an exemplar objective, associated with many combinatorial optimization problems, that is computationally hard in general, but occurs in all areas of modern science. There are several numerical methods, providing solution for the medium size Ising spin systems. However, they are either computationally slow and badly parallelized, or do not give sufficiently good results for the large systems. In this paper, we present a highly parallel algorithm, called Mean-field Annealing from a Random State (MARS), incorporating the best features of the classic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05124","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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaT2p2A0Yk9ALwvYLT4xxOiUR6DQtiAuqXcWmIxmtycCtQi92Rsmpn9wpiqDOdovpp84P5rcQHujhSj4BkRoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:38:55.930872Z"},"content_sha256":"675344e8c48484fef19a08edd8751968f1db1fd5c84705179692b998e3427dc4","schema_version":"1.0","event_id":"sha256:675344e8c48484fef19a08edd8751968f1db1fd5c84705179692b998e3427dc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A556H2ZNINAUAILCBL46NRURVT/bundle.json","state_url":"https://pith.science/pith/A556H2ZNINAUAILCBL46NRURVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A556H2ZNINAUAILCBL46NRURVT/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-26T05:38:55Z","links":{"resolver":"https://pith.science/pith/A556H2ZNINAUAILCBL46NRURVT","bundle":"https://pith.science/pith/A556H2ZNINAUAILCBL46NRURVT/bundle.json","state":"https://pith.science/pith/A556H2ZNINAUAILCBL46NRURVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A556H2ZNINAUAILCBL46NRURVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A556H2ZNINAUAILCBL46NRURVT","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":"6801c65db7c82ef7f370afc060149e0ae471c4b2f5dda0e085ce47a7c9c75413","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T11:50:21Z","title_canon_sha256":"71db30d91a831bd2a82f358b4cc1cbe0da1c7d0def5eb35b551ba3aa26e1f35d"},"schema_version":"1.0","source":{"id":"1907.05124","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05124","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05124v2","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05124","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"A556H2ZNINAU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A556H2ZNINAUAILC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A556H2ZN","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:675344e8c48484fef19a08edd8751968f1db1fd5c84705179692b998e3427dc4","target":"graph","created_at":"2026-05-17T23:40:29Z","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":"Finding an energy minimum in the Ising model is an exemplar objective, associated with many combinatorial optimization problems, that is computationally hard in general, but occurs in all areas of modern science. There are several numerical methods, providing solution for the medium size Ising spin systems. However, they are either computationally slow and badly parallelized, or do not give sufficiently good results for the large systems. In this paper, we present a highly parallel algorithm, called Mean-field Annealing from a Random State (MARS), incorporating the best features of the classic","authors_text":"A.N. Rubtsov, A. Yavorsky, E.A. Polyakov, L.A. Markovich","cross_cats":["cond-mat.stat-mech","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T11:50:21Z","title":"Highly parallel algorithm for the Ising ground state searching problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05124","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:3925cc6d75fc2e573e157a64f6d5815d6877c778098d38001707ce19ee5760b1","target":"record","created_at":"2026-05-17T23:40:29Z","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":"6801c65db7c82ef7f370afc060149e0ae471c4b2f5dda0e085ce47a7c9c75413","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T11:50:21Z","title_canon_sha256":"71db30d91a831bd2a82f358b4cc1cbe0da1c7d0def5eb35b551ba3aa26e1f35d"},"schema_version":"1.0","source":{"id":"1907.05124","kind":"arxiv","version":2}},"canonical_sha256":"077be3eb2d43414021620af9e6c691acda061c33b35e7d933bca5558ca6d94fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"077be3eb2d43414021620af9e6c691acda061c33b35e7d933bca5558ca6d94fb","first_computed_at":"2026-05-17T23:40:29.593682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:29.593682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e0J/FmOLkFXcPSrDd8dxS3dOk5zV495yDAEpsGIFfuQ3JKv1pIVx3nptYGZEJrJmjD9rdJd2JWxPp1KKiSZABA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:29.595480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05124","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3925cc6d75fc2e573e157a64f6d5815d6877c778098d38001707ce19ee5760b1","sha256:675344e8c48484fef19a08edd8751968f1db1fd5c84705179692b998e3427dc4"],"state_sha256":"e45dd8d21f94dff8f2a01bebe13cbfd306308b08a3b7cd8b8fea89d627dfbca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DV8AIc+EbS2FcewSVV/fA+365Jezu4QZ1DWZSU2KTqgnqpK9NEo2uXJi37o1LD0xjxbIdNYcCv4KvqzW8anIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:38:55.934258Z","bundle_sha256":"805637ac6684dbdf9614f85a14c685380a0a60eaa27269aaf744cb8cb6384a7c"}}