{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QX6Z24KWFRRGDNLR2YXY2AUPCF","short_pith_number":"pith:QX6Z24KW","schema_version":"1.0","canonical_sha256":"85fd9d71562c6261b571d62f8d028f11614aa53a0c45c2fc9c89d0b1613b85c7","source":{"kind":"arxiv","id":"1006.1696","version":1},"attestation_state":"computed","paper":{"title":"Quantum annealing: An introduction and new developments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hidetoshi Nishimori, Masayuki Ohzeki","submitted_at":"2010-06-09T03:20:15Z","abstract_excerpt":"Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics."},"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":"1006.1696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-06-09T03:20:15Z","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"title_canon_sha256":"f3250ae48be44225fc407294b1f5a5bfd85956a2ed301c631419b4e9ca8418c2","abstract_canon_sha256":"6ec0a416f3626a514ac56e42bf409993448e013efd0a826ab6ed7406f8e3ec73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:30:17.004347Z","signature_b64":"CPK7Tifeueyggy8IlH7c9sIzS98udVbGL81kj/Zn8xliqq43/w+ZFxdC30bET8e77kaYJvWVi+ELp0m9KA1jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85fd9d71562c6261b571d62f8d028f11614aa53a0c45c2fc9c89d0b1613b85c7","last_reissued_at":"2026-07-04T17:30:17.003930Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:30:17.003930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum annealing: An introduction and new developments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hidetoshi Nishimori, Masayuki Ohzeki","submitted_at":"2010-06-09T03:20:15Z","abstract_excerpt":"Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1696","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1006.1696/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1006.1696","created_at":"2026-07-04T17:30:17.003993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1696v1","created_at":"2026-07-04T17:30:17.003993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1696","created_at":"2026-07-04T17:30:17.003993+00:00"},{"alias_kind":"pith_short_12","alias_value":"QX6Z24KWFRRG","created_at":"2026-07-04T17:30:17.003993+00:00"},{"alias_kind":"pith_short_16","alias_value":"QX6Z24KWFRRGDNLR","created_at":"2026-07-04T17:30:17.003993+00:00"},{"alias_kind":"pith_short_8","alias_value":"QX6Z24KW","created_at":"2026-07-04T17:30:17.003993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.26233","citing_title":"A fidelity metric for quantum annealing benchmarked by extreme scaling quantum Monte-Carlo simulations","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF","json":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF.json","graph_json":"https://pith.science/api/pith-number/QX6Z24KWFRRGDNLR2YXY2AUPCF/graph.json","events_json":"https://pith.science/api/pith-number/QX6Z24KWFRRGDNLR2YXY2AUPCF/events.json","paper":"https://pith.science/paper/QX6Z24KW"},"agent_actions":{"view_html":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF","download_json":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF.json","view_paper":"https://pith.science/paper/QX6Z24KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1696&json=true","fetch_graph":"https://pith.science/api/pith-number/QX6Z24KWFRRGDNLR2YXY2AUPCF/graph.json","fetch_events":"https://pith.science/api/pith-number/QX6Z24KWFRRGDNLR2YXY2AUPCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF/action/storage_attestation","attest_author":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF/action/author_attestation","sign_citation":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF/action/citation_signature","submit_replication":"https://pith.science/pith/QX6Z24KWFRRGDNLR2YXY2AUPCF/action/replication_record"}},"created_at":"2026-07-04T17:30:17.003993+00:00","updated_at":"2026-07-04T17:30:17.003993+00:00"}