{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NOFLFDVORZQBKOV4KNZMQQMMWA","short_pith_number":"pith:NOFLFDVO","schema_version":"1.0","canonical_sha256":"6b8ab28eae8e60153abc5372c8418cb02115eabb6d13b3e34fe70f21f58cb4df","source":{"kind":"arxiv","id":"2404.14101","version":1},"attestation_state":"computed","paper":{"title":"Efficient molecular conformation generation with quantum-inspired algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bi-Ying Wang, Bowen Liu, Huangjun Zhu, Man-Hong Yung, Nan Qiao, Runqiu Shu, Xiaopeng Cui, Yunting Li, Zhaoping Xiong, Zuoheng Zou","submitted_at":"2024-04-22T11:40:08Z","abstract_excerpt":"Conformation generation, also known as molecular unfolding (MU), is a crucial step in structure-based drug design, remaining a challenging combinatorial optimization problem. Quantum annealing (QA) has shown great potential for solving certain combinatorial optimization problems over traditional classical methods such as simulated annealing (SA). However, a recent study showed that a 2000-qubit QA hardware was still unable to outperform SA for the MU problem. Here, we propose the use of quantum-inspired algorithm to solve the MU problem, in order to go beyond traditional SA. We introduce a hig"},"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":"2404.14101","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-22T11:40:08Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"eefd38e62a6afe0d7c96afe7cbe0cfe251cd6b35af178a0ef538fff6b67a8aa1","abstract_canon_sha256":"eeef3716d6263a1d0aff237fb42de9927520b31a885bde55cf3631f34dbf2fbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:41.817450Z","signature_b64":"n7r4exMlVUiW2KviKPqkMAjeouTaw63I9PBbB4s1fs2Q4mUa+3BqVwEZA1rrdr3PRZ7A6Ol+PebiXOFRe6RDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b8ab28eae8e60153abc5372c8418cb02115eabb6d13b3e34fe70f21f58cb4df","last_reissued_at":"2026-07-05T08:10:41.816894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:41.816894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient molecular conformation generation with quantum-inspired algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bi-Ying Wang, Bowen Liu, Huangjun Zhu, Man-Hong Yung, Nan Qiao, Runqiu Shu, Xiaopeng Cui, Yunting Li, Zhaoping Xiong, Zuoheng Zou","submitted_at":"2024-04-22T11:40:08Z","abstract_excerpt":"Conformation generation, also known as molecular unfolding (MU), is a crucial step in structure-based drug design, remaining a challenging combinatorial optimization problem. Quantum annealing (QA) has shown great potential for solving certain combinatorial optimization problems over traditional classical methods such as simulated annealing (SA). However, a recent study showed that a 2000-qubit QA hardware was still unable to outperform SA for the MU problem. Here, we propose the use of quantum-inspired algorithm to solve the MU problem, in order to go beyond traditional SA. We introduce a hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14101","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/2404.14101/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":"2404.14101","created_at":"2026-07-05T08:10:41.816968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14101v1","created_at":"2026-07-05T08:10:41.816968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14101","created_at":"2026-07-05T08:10:41.816968+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOFLFDVORZQB","created_at":"2026-07-05T08:10:41.816968+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOFLFDVORZQBKOV4","created_at":"2026-07-05T08:10:41.816968+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOFLFDVO","created_at":"2026-07-05T08:10:41.816968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA","json":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA.json","graph_json":"https://pith.science/api/pith-number/NOFLFDVORZQBKOV4KNZMQQMMWA/graph.json","events_json":"https://pith.science/api/pith-number/NOFLFDVORZQBKOV4KNZMQQMMWA/events.json","paper":"https://pith.science/paper/NOFLFDVO"},"agent_actions":{"view_html":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA","download_json":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA.json","view_paper":"https://pith.science/paper/NOFLFDVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14101&json=true","fetch_graph":"https://pith.science/api/pith-number/NOFLFDVORZQBKOV4KNZMQQMMWA/graph.json","fetch_events":"https://pith.science/api/pith-number/NOFLFDVORZQBKOV4KNZMQQMMWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA/action/storage_attestation","attest_author":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA/action/author_attestation","sign_citation":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA/action/citation_signature","submit_replication":"https://pith.science/pith/NOFLFDVORZQBKOV4KNZMQQMMWA/action/replication_record"}},"created_at":"2026-07-05T08:10:41.816968+00:00","updated_at":"2026-07-05T08:10:41.816968+00:00"}