{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AWKG7OGZ6I24A52CF35F5Q5WZC","short_pith_number":"pith:AWKG7OGZ","schema_version":"1.0","canonical_sha256":"05946fb8d9f235c077422efa5ec3b6c8b1050a155171d2be442ac2b5737d528e","source":{"kind":"arxiv","id":"2106.03238","version":1},"attestation_state":"computed","paper":{"title":"Mean Field Approximation for solving QUBO problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"G\\'abor Vattay, M\\'at\\'e Tibor Veszeli","submitted_at":"2021-06-06T20:35:28Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently. There are exact methods like the Branch-and-Bound algorithm for smaller problems, and for larger ones, many good approximations like stochastic simulated annealing for discrete variables or the mean field annealing for continuous variables. This paper will show that the statistical physics approach and the quantum mechanical approach in the mean field annealing give the same result. We examined the Ising problem, which is an alternative formulation of th"},"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":"2106.03238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-06T20:35:28Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"44e34b7dd814d45b74db30f44c504d74d5c66c0a61daa368cb125e6836dc51b9","abstract_canon_sha256":"4e9d3d3ace9e25fb44023e6b8fb6e2ba5b3265032625a982c19fd62fff6c12d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:47.605825Z","signature_b64":"+BDbT+a+WckXi6dxSranrzncD6AK62+LjAsstMa9G6nLgJ/v6xPJHdSfbyjCxHeAIkludCDVh/gpniD5JVejDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05946fb8d9f235c077422efa5ec3b6c8b1050a155171d2be442ac2b5737d528e","last_reissued_at":"2026-07-05T02:46:47.605399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:47.605399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean Field Approximation for solving QUBO problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"G\\'abor Vattay, M\\'at\\'e Tibor Veszeli","submitted_at":"2021-06-06T20:35:28Z","abstract_excerpt":"The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently. There are exact methods like the Branch-and-Bound algorithm for smaller problems, and for larger ones, many good approximations like stochastic simulated annealing for discrete variables or the mean field annealing for continuous variables. This paper will show that the statistical physics approach and the quantum mechanical approach in the mean field annealing give the same result. We examined the Ising problem, which is an alternative formulation of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03238","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/2106.03238/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":"2106.03238","created_at":"2026-07-05T02:46:47.605457+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03238v1","created_at":"2026-07-05T02:46:47.605457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03238","created_at":"2026-07-05T02:46:47.605457+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWKG7OGZ6I24","created_at":"2026-07-05T02:46:47.605457+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWKG7OGZ6I24A52C","created_at":"2026-07-05T02:46:47.605457+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWKG7OGZ","created_at":"2026-07-05T02:46:47.605457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02540","citing_title":"Adaptive Enhanced Quantum-inspired Simulated Bifurcation Algorithm for Population State Perception","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC","json":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC.json","graph_json":"https://pith.science/api/pith-number/AWKG7OGZ6I24A52CF35F5Q5WZC/graph.json","events_json":"https://pith.science/api/pith-number/AWKG7OGZ6I24A52CF35F5Q5WZC/events.json","paper":"https://pith.science/paper/AWKG7OGZ"},"agent_actions":{"view_html":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC","download_json":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC.json","view_paper":"https://pith.science/paper/AWKG7OGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03238&json=true","fetch_graph":"https://pith.science/api/pith-number/AWKG7OGZ6I24A52CF35F5Q5WZC/graph.json","fetch_events":"https://pith.science/api/pith-number/AWKG7OGZ6I24A52CF35F5Q5WZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC/action/storage_attestation","attest_author":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC/action/author_attestation","sign_citation":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC/action/citation_signature","submit_replication":"https://pith.science/pith/AWKG7OGZ6I24A52CF35F5Q5WZC/action/replication_record"}},"created_at":"2026-07-05T02:46:47.605457+00:00","updated_at":"2026-07-05T02:46:47.605457+00:00"}