{"work":{"id":"4d10e31a-35b2-4722-bebb-c8eae9be3c28","openalex_id":"https://openalex.org/W2024060531","doi":"10.1126/science.220.4598.671","arxiv_id":"gov/1781386","raw_key":null,"title":"Optimization by Simulated Annealing,","authors":[{"given":"S.","family":"Kirkpatrick","sequence":"first","affiliation":[{"name":"Research staff members at IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598"}]},{"given":"C. D.","family":"Gelatt","suffix":"Jr.","sequence":"additional","affiliation":[{"name":"Research staff members at IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598"}]},{"given":"M. P.","family":"Vecchi","sequence":"additional","affiliation":[{"name":"Instituto Venezolano de Investigaciones Cientificas, Caracas 1010A, Venezuela"}]}],"authors_text":"S","year":1983,"venue":"Science","abstract":null,"external_url":"https://doi.org/10.1126/science.220.4598.671","cited_by_count":33503,"metadata_source":"doi_reference","metadata_fetched_at":"2026-05-22T14:14:55.404105+00:00","pith_arxiv_id":null,"created_at":"2026-05-08T17:18:40.823539+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":false,"display_title":"Optimization by Simulated Annealing","render_title":"Optimization by Simulated Annealing"},"hub":{"state":{"work_id":"4d10e31a-35b2-4722-bebb-c8eae9be3c28","tier":"super_hub","tier_reason":"100+ Pith inbound or 10,000+ external citations","pith_inbound_count":18,"external_cited_by_count":33503,"distinct_field_count":13,"first_pith_cited_at":"2025-05-22T09:33:29+00:00","last_pith_cited_at":"2026-05-15T13:52:08+00:00","author_build_status":"needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-11T10:47:54.535921+00:00","tier_text":"super_hub"},"tier":"super_hub","role_counts":[{"context_role":"background","n":5},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":4},{"context_polarity":"support","n":1},{"context_polarity":"use_method","n":1}],"runs":{"ask_index":{"job_type":"ask_index","status":"succeeded","result":{"title":"Optimization by Simulated Annealing","claims":[{"claim_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream r","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"space of combinatorial optimization problems (COPs) can grow faster than exponentially in the number of objects, making exhaustive search impractical [ 6]. As a result, several algorithms and hardware accelerators have been developed over the years which aim to provide high-quality solutions with minimal consumption of resources such as time and energy [7, 8]. Ising machines (IMs) [9, 10, 11, 8] are hardware accelera- tors designed to find low-energy states of theIsing model of statistical mecha","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"Classical simulations and hybrid classical-quantum algorithms can be a useful approach to overcome the physical limitations of current Noisy Intermediate-Scale Quantum (NISQ) [38] devices. Our technique to solve the TSP is based on the classical sim- ulation of Quantum Annealing (QA) [ 29] via the Path Integral Monte Carlo (PIMC) method [34]. In particular, Martoňák et al. [35] proposed a PIMC quantum annealing scheme based on a highly constrained Ising-like representation of the TSP. While thei","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"straints into molecular binding and then letting the sys- tem settle [24]. In engineered hardware, analogous solver behavior appears in systems whose dynamics minimize an implicit cost function, such as spin glasses or elastic networks that relax to reduce frustration or stress. The connection between annealing in statistical physics and combinatorial optimization was formalized by Kirkpatrick et al. [25]. Conceptually, these systems admit a scalar \"energy\" (or Hamiltonian) that acts as a Lyapun","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"softx.2022.101109. [100] X. Wang, C. Han, R. Leus, Scheduling multiple agile earth observation satellites with multiple observations, Advances in Space Research (2025). doi: 10.1016/j.asr.2025.10. 042. [101] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680. doi: 10.1126/science.220.4598.671. [102] G. Wu, H. Wang, W. Pedrycz, et al., Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task cl","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"Journal of the Physical Society of Japan, 5(6): 435-439, 1950.doi:10.1143/JPSJ.5.435. [46] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Quantum computation by adiabatic evolution, 2000. [47] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671-680, 1983.doi:10.1126/science.220.4598.671. [48] D. R. Hartree. The wave mechanics of an atom with a non-coulomb central field. part ii. some results and discussion.Mathematica","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks Optimization by Simulated Annealing because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (5 contexts).","role_counts":[{"n":5,"context_role":"background"},{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:20:32.330216+00:00"},"author_expand":{"job_type":"author_expand","status":"succeeded","result":{"authors_linked":[{"id":"952ccc5b-cbf2-4d40-bb5b-970229a5eecd","orcid":null,"display_name":"S. Kirkpatrick"},{"id":"38699bf2-e6bf-4f50-aed1-5f747bd4563d","orcid":null,"display_name":"C. D. Gelatt"},{"id":"a7dc82d7-b794-4109-889e-05303fad6375","orcid":null,"display_name":"M. P. Vecchi"}]},"error":null,"updated_at":"2026-06-05T22:20:32.305151+00:00"},"context_extract":{"job_type":"context_extract","status":"succeeded","result":{"enqueued_papers":25},"error":null,"updated_at":"2026-06-05T22:19:58.543243+00:00"},"graph_features":{"job_type":"graph_features","status":"succeeded","result":{"co_cited":[{"title":"doi:10.1109/ICNN.1995.488968 Scott Kirkpatrick, C","work_id":"02993872-cd4f-4580-8414-ebd3b9024885","shared_citers":3},{"title":"Lucas, Frontiers in Physics2 (2014), 10.3389/fphy.2014.00005","work_id":"f037aee6-2950-4c1f-a042-66162f9e5d4a","shared_citers":3},{"title":"Masset, R","work_id":"238df2e4-a3e5-46f3-860e-3ae2b0094b97","shared_citers":3},{"title":"doi:10.1287/ijoc.1.3.190 Fred Glover","work_id":"10fa330b-fe02-4fc2-b3c7-75826fc8eec7","shared_citers":2},{"title":"doi:10.1287/ijoc.2.1.4 David E","work_id":"56c648a2-ad02-4fbe-8188-95951ca48b81","shared_citers":2},{"title":"Life and death of colloidal bonds control the rate-dependent rheology of gels","work_id":"4674af27-aa38-4811-8ecb-3914cf084b37","shared_citers":2},{"title":"Phys- ical Review Applied 18(5) (2022) https://doi.org/10.1103/PhysRevApplied.18","work_id":"07ffc2ab-7c1f-4011-a984-0dc519c173a3","shared_citers":2},{"title":"Quantum bridge analytics I : a tutorial on formulating and using QUBO models","work_id":"26863de5-59db-418c-92b1-434c6b6a9734","shared_citers":2},{"title":"Synthesis Lectures on Quantum Computing","work_id":"203428d3-5608-4bb9-a272-f961e8f0d570","shared_citers":2},{"title":"","work_id":"77084b6f-c6b4-4632-bd17-bae0c711871a","shared_citers":1},{"title":"11240788","work_id":"992c7739-ee00-46ec-8de0-196298e30d59","shared_citers":1},{"title":"1938.Statistical tables for biological, agricultural and medical research","work_id":"9fd51350-c54b-4c36-baa9-070880cbcb23","shared_citers":1},{"title":"2011 , publisher=","work_id":"bd7f236c-df99-4738-ba01-f33446301c53","shared_citers":1},{"title":"2012 , publisher=","work_id":"53ab931a-f498-4ebf-8c29-c49088e29448","shared_citers":1},{"title":"2014.00005","work_id":"4c9bf8c0-8ff7-4f97-9742-2d7b97d663cb","shared_citers":1},{"title":"2018 , month =","work_id":"80a01651-ca79-4838-8a0a-f2c1d51bcc27","shared_citers":1},{"title":"2019 , publisher=","work_id":"25beed5a-b9c4-428a-8e61-32d3766f13dc","shared_citers":1},{"title":"2020 , organization=","work_id":"b5baedce-9694-4085-8def-6f9b1a4cb319","shared_citers":1},{"title":"2021 , issue_date =","work_id":"86d0085c-93e8-4b48-b31e-982b55ae3806","shared_citers":1},{"title":"2021 , publisher=","work_id":"7d0a8599-39ad-4b94-bab9-81988a83b5eb","shared_citers":1},{"title":"2022 , publisher=","work_id":"8d0a58eb-172f-4304-991b-caf3d18ecc4c","shared_citers":1},{"title":"2022 , publisher=","work_id":"68d7b1e1-3d53-4e8f-a79f-fbd9f9e96b28","shared_citers":1},{"title":"2023 , publisher=","work_id":"91c8890e-78e8-4bcc-b029-bbaed283bf95","shared_citers":1},{"title":"2024 , url =","work_id":"6ffe1ec9-4af3-4757-93c9-72761f949e91","shared_citers":1}],"time_series":[{"n":4,"year":2025},{"n":14,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Simultaneous Fragment Docking for Geometrically Linkable Pose Pairs","primary_cat":"q-bio.BM","context_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream reconstruction to exploit solution diversity, which is especially useful when objective optimality does not uniquely determine geometric feasibility. Exact reference (IBM CPLEX). To separate formulation effects from solver effects, we additionally solved the same","citing_arxiv_id":"2604.24773"}]},"error":null,"updated_at":"2026-06-05T22:20:32.323790+00:00"},"identity_refresh":{"job_type":"identity_refresh","status":"succeeded","result":{"items":[{"title":"Qwen3 Technical Report","outcome":"unchanged","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","resolver":"local_arxiv","confidence":0.98,"old_work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e"}],"counts":{"fixed":0,"merged":0,"unchanged":1,"quarantined":0,"needs_external_resolution":0},"errors":[],"attempted":1},"error":null,"updated_at":"2026-06-05T22:20:30.859101+00:00"},"role_polarity":{"job_type":"role_polarity","status":"succeeded","result":{"title":"Optimization by Simulated Annealing","claims":[{"claim_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream r","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"space of combinatorial optimization problems (COPs) can grow faster than exponentially in the number of objects, making exhaustive search impractical [ 6]. As a result, several algorithms and hardware accelerators have been developed over the years which aim to provide high-quality solutions with minimal consumption of resources such as time and energy [7, 8]. Ising machines (IMs) [9, 10, 11, 8] are hardware accelera- tors designed to find low-energy states of theIsing model of statistical mecha","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"Classical simulations and hybrid classical-quantum algorithms can be a useful approach to overcome the physical limitations of current Noisy Intermediate-Scale Quantum (NISQ) [38] devices. Our technique to solve the TSP is based on the classical sim- ulation of Quantum Annealing (QA) [ 29] via the Path Integral Monte Carlo (PIMC) method [34]. In particular, Martoňák et al. [35] proposed a PIMC quantum annealing scheme based on a highly constrained Ising-like representation of the TSP. While thei","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"straints into molecular binding and then letting the sys- tem settle [24]. In engineered hardware, analogous solver behavior appears in systems whose dynamics minimize an implicit cost function, such as spin glasses or elastic networks that relax to reduce frustration or stress. The connection between annealing in statistical physics and combinatorial optimization was formalized by Kirkpatrick et al. [25]. Conceptually, these systems admit a scalar \"energy\" (or Hamiltonian) that acts as a Lyapun","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"softx.2022.101109. [100] X. Wang, C. Han, R. Leus, Scheduling multiple agile earth observation satellites with multiple observations, Advances in Space Research (2025). doi: 10.1016/j.asr.2025.10. 042. [101] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680. doi: 10.1126/science.220.4598.671. [102] G. Wu, H. Wang, W. Pedrycz, et al., Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task cl","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"Journal of the Physical Society of Japan, 5(6): 435-439, 1950.doi:10.1143/JPSJ.5.435. [46] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Quantum computation by adiabatic evolution, 2000. [47] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671-680, 1983.doi:10.1126/science.220.4598.671. [48] D. R. Hartree. The wave mechanics of an atom with a non-coulomb central field. part ii. some results and discussion.Mathematica","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks Optimization by Simulated Annealing because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (5 contexts).","role_counts":[{"n":5,"context_role":"background"},{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:20:32.327755+00:00"},"summary_claims":{"job_type":"summary_claims","status":"succeeded","result":{"title":"Optimization by Simulated Annealing","claims":[{"claim_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream r","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"space of combinatorial optimization problems (COPs) can grow faster than exponentially in the number of objects, making exhaustive search impractical [ 6]. As a result, several algorithms and hardware accelerators have been developed over the years which aim to provide high-quality solutions with minimal consumption of resources such as time and energy [7, 8]. Ising machines (IMs) [9, 10, 11, 8] are hardware accelera- tors designed to find low-energy states of theIsing model of statistical mecha","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"Classical simulations and hybrid classical-quantum algorithms can be a useful approach to overcome the physical limitations of current Noisy Intermediate-Scale Quantum (NISQ) [38] devices. Our technique to solve the TSP is based on the classical sim- ulation of Quantum Annealing (QA) [ 29] via the Path Integral Monte Carlo (PIMC) method [34]. In particular, Martoňák et al. [35] proposed a PIMC quantum annealing scheme based on a highly constrained Ising-like representation of the TSP. While thei","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"straints into molecular binding and then letting the sys- tem settle [24]. In engineered hardware, analogous solver behavior appears in systems whose dynamics minimize an implicit cost function, such as spin glasses or elastic networks that relax to reduce frustration or stress. The connection between annealing in statistical physics and combinatorial optimization was formalized by Kirkpatrick et al. [25]. Conceptually, these systems admit a scalar \"energy\" (or Hamiltonian) that acts as a Lyapun","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"softx.2022.101109. [100] X. Wang, C. Han, R. Leus, Scheduling multiple agile earth observation satellites with multiple observations, Advances in Space Research (2025). doi: 10.1016/j.asr.2025.10. 042. [101] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680. doi: 10.1126/science.220.4598.671. [102] G. Wu, H. Wang, W. Pedrycz, et al., Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task cl","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"Journal of the Physical Society of Japan, 5(6): 435-439, 1950.doi:10.1143/JPSJ.5.435. [46] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Quantum computation by adiabatic evolution, 2000. [47] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671-680, 1983.doi:10.1126/science.220.4598.671. [48] D. R. Hartree. The wave mechanics of an atom with a non-coulomb central field. part ii. some results and discussion.Mathematica","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks Optimization by Simulated Annealing because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (5 contexts).","role_counts":[{"n":5,"context_role":"background"},{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:19:51.589302+00:00"}},"summary":{"title":"Optimization by Simulated Annealing","claims":[{"claim_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream r","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"space of combinatorial optimization problems (COPs) can grow faster than exponentially in the number of objects, making exhaustive search impractical [ 6]. As a result, several algorithms and hardware accelerators have been developed over the years which aim to provide high-quality solutions with minimal consumption of resources such as time and energy [7, 8]. Ising machines (IMs) [9, 10, 11, 8] are hardware accelera- tors designed to find low-energy states of theIsing model of statistical mecha","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"Classical simulations and hybrid classical-quantum algorithms can be a useful approach to overcome the physical limitations of current Noisy Intermediate-Scale Quantum (NISQ) [38] devices. Our technique to solve the TSP is based on the classical sim- ulation of Quantum Annealing (QA) [ 29] via the Path Integral Monte Carlo (PIMC) method [34]. In particular, Martoňák et al. [35] proposed a PIMC quantum annealing scheme based on a highly constrained Ising-like representation of the TSP. While thei","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"straints into molecular binding and then letting the sys- tem settle [24]. In engineered hardware, analogous solver behavior appears in systems whose dynamics minimize an implicit cost function, such as spin glasses or elastic networks that relax to reduce frustration or stress. The connection between annealing in statistical physics and combinatorial optimization was formalized by Kirkpatrick et al. [25]. Conceptually, these systems admit a scalar \"energy\" (or Hamiltonian) that acts as a Lyapun","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"softx.2022.101109. [100] X. Wang, C. Han, R. Leus, Scheduling multiple agile earth observation satellites with multiple observations, Advances in Space Research (2025). doi: 10.1016/j.asr.2025.10. 042. [101] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680. doi: 10.1126/science.220.4598.671. [102] G. Wu, H. Wang, W. Pedrycz, et al., Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task cl","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"Journal of the Physical Society of Japan, 5(6): 435-439, 1950.doi:10.1143/JPSJ.5.435. [46] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Quantum computation by adiabatic evolution, 2000. [47] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671-680, 1983.doi:10.1126/science.220.4598.671. [48] D. R. Hartree. The wave mechanics of an atom with a non-coulomb central field. part ii. some results and discussion.Mathematica","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks Optimization by Simulated Annealing because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (5 contexts).","role_counts":[{"n":5,"context_role":"background"},{"n":1,"context_role":"method"}]},"graph":{"co_cited":[{"title":"doi:10.1109/ICNN.1995.488968 Scott Kirkpatrick, C","work_id":"02993872-cd4f-4580-8414-ebd3b9024885","shared_citers":3},{"title":"Lucas, Frontiers in Physics2 (2014), 10.3389/fphy.2014.00005","work_id":"f037aee6-2950-4c1f-a042-66162f9e5d4a","shared_citers":3},{"title":"Masset, R","work_id":"238df2e4-a3e5-46f3-860e-3ae2b0094b97","shared_citers":3},{"title":"doi:10.1287/ijoc.1.3.190 Fred Glover","work_id":"10fa330b-fe02-4fc2-b3c7-75826fc8eec7","shared_citers":2},{"title":"doi:10.1287/ijoc.2.1.4 David E","work_id":"56c648a2-ad02-4fbe-8188-95951ca48b81","shared_citers":2},{"title":"Life and death of colloidal bonds control the rate-dependent rheology of gels","work_id":"4674af27-aa38-4811-8ecb-3914cf084b37","shared_citers":2},{"title":"Phys- ical Review Applied 18(5) (2022) https://doi.org/10.1103/PhysRevApplied.18","work_id":"07ffc2ab-7c1f-4011-a984-0dc519c173a3","shared_citers":2},{"title":"Quantum bridge analytics I : a tutorial on formulating and using QUBO models","work_id":"26863de5-59db-418c-92b1-434c6b6a9734","shared_citers":2},{"title":"Synthesis Lectures on Quantum Computing","work_id":"203428d3-5608-4bb9-a272-f961e8f0d570","shared_citers":2},{"title":"","work_id":"77084b6f-c6b4-4632-bd17-bae0c711871a","shared_citers":1},{"title":"11240788","work_id":"992c7739-ee00-46ec-8de0-196298e30d59","shared_citers":1},{"title":"1938.Statistical tables for biological, agricultural and medical research","work_id":"9fd51350-c54b-4c36-baa9-070880cbcb23","shared_citers":1},{"title":"2011 , publisher=","work_id":"bd7f236c-df99-4738-ba01-f33446301c53","shared_citers":1},{"title":"2012 , publisher=","work_id":"53ab931a-f498-4ebf-8c29-c49088e29448","shared_citers":1},{"title":"2014.00005","work_id":"4c9bf8c0-8ff7-4f97-9742-2d7b97d663cb","shared_citers":1},{"title":"2018 , month =","work_id":"80a01651-ca79-4838-8a0a-f2c1d51bcc27","shared_citers":1},{"title":"2019 , publisher=","work_id":"25beed5a-b9c4-428a-8e61-32d3766f13dc","shared_citers":1},{"title":"2020 , organization=","work_id":"b5baedce-9694-4085-8def-6f9b1a4cb319","shared_citers":1},{"title":"2021 , issue_date =","work_id":"86d0085c-93e8-4b48-b31e-982b55ae3806","shared_citers":1},{"title":"2021 , publisher=","work_id":"7d0a8599-39ad-4b94-bab9-81988a83b5eb","shared_citers":1},{"title":"2022 , publisher=","work_id":"8d0a58eb-172f-4304-991b-caf3d18ecc4c","shared_citers":1},{"title":"2022 , publisher=","work_id":"68d7b1e1-3d53-4e8f-a79f-fbd9f9e96b28","shared_citers":1},{"title":"2023 , publisher=","work_id":"91c8890e-78e8-4bcc-b029-bbaed283bf95","shared_citers":1},{"title":"2024 , url =","work_id":"6ffe1ec9-4af3-4757-93c9-72761f949e91","shared_citers":1}],"time_series":[{"n":4,"year":2025},{"n":14,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Simultaneous Fragment Docking for Geometrically Linkable Pose Pairs","primary_cat":"q-bio.BM","context_text":"distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream reconstruction to exploit solution diversity, which is especially useful when objective optimality does not uniquely determine geometric feasibility. Exact reference (IBM CPLEX). To separate formulation effects from solver effects, we additionally solved the same","citing_arxiv_id":"2604.24773"}]},"authors":[{"id":"38699bf2-e6bf-4f50-aed1-5f747bd4563d","orcid":null,"display_name":"C. D. Gelatt","source":"manual","import_confidence":0.72},{"id":"a7dc82d7-b794-4109-889e-05303fad6375","orcid":null,"display_name":"M. P. Vecchi","source":"manual","import_confidence":0.72},{"id":"952ccc5b-cbf2-4d40-bb5b-970229a5eecd","orcid":null,"display_name":"S. Kirkpatrick","source":"manual","import_confidence":0.72}]}}