{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/efficient-approximations-of-complete","title":"Efficient Approximations of Complete Interatomic Potentials for Crystal Property Prediction","arxiv_id":"2306.10045","date":"2023-06-12","proceeding":null,"authors":["Yuchao Lin","Keqiang Yan","Youzhi Luo","Yi Liu","Xiaoning Qian","Shuiwang Ji"],"abstract":"We study property prediction for crystal materials. A crystal structure consists of a minimal unit cell that is repeated infinitely in 3D space. How to accurately represent such repetitive structures in machine learning models remains unresolved. Current methods construct graphs by establishing edges only between nearby nodes, thereby failing to faithfully capture infinite repeating patterns and distant interatomic interactions. In this work, we propose several innovations to overcome these limitations. First, we propose to model physics-principled interatomic potentials directly instead of only using distances as in many existing methods. These potentials include the Coulomb potential, London dispersion potential, and Pauli repulsion potential. Second, we model the complete set of potentials among all atoms, instead of only between nearby atoms as in existing methods. This is enabled by our approximations of infinite potential summations, where we extend the Ewald summation for several potential series approximations with provable error bounds. Finally, we propose to incorporate our computations of complete interatomic potentials into message passing neural networks for representation learning. We perform experiments on the JARVIS and Materials Project benchmarks for evaluation. Results show that the use of interatomic potentials and complete interatomic potentials leads to consistent performance improvements with reasonable computational costs. Our code is publicly available as part of the AIRS library (https://github.com/divelab/AIRS/tree/main/OpenMat/PotNet).","url_abs":"https://arxiv.org/abs/2306.10045v9","url_pdf":"https://arxiv.org/pdf/2306.10045v9.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"efficient-approximations-of-complete","repo_url":"https://github.com/divelab/AIRS/tree/main/OpenMat/PotNet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"band-gap","task_name":"Band Gap"},{"task_slug":"formation-energy","task_name":"Formation Energy"},{"task_slug":"property-prediction","task_name":"Property Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":null,"method_name":"Library"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/formation-energy-on-jarvis-dft-formation","task":"Formation Energy","dataset":"JARVIS-DFT","model":"PotNet","rank_in_archive_order":2,"of":6,"metrics":{"MAE":"0.0294"},"uses_additional_data":false},{"leaderboard":"/sota/formation-energy-on-materials-project","task":"Formation Energy","dataset":"Materials Project","model":"PotNet","rank_in_archive_order":2,"of":9,"metrics":{"MAE":"18.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2306.10045","atlas_url":"https://app.syntology.ai/?focus=2306.10045","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2306.10045"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2306.10045\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2306.10045"},"call":"get_concepts_for_paper(arxiv_id=\"2306.10045\")"}],"by_repo":[{"repo":"divelab/AIRS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2305.04120","2306.09549","2307.08423","2412.09399"],"harvested_for_calls":[{"arxiv_id":"2305.04120","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.04120"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.04120\")"},{"arxiv_id":"2306.09549","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.09549"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.09549\")"},{"arxiv_id":"2307.08423","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.08423"},"call":"get_harvested_code_for_paper(arxiv_id=\"2307.08423\")"},{"arxiv_id":"2412.09399","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.09399"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.09399\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1801c4fd7816c33b814dbb426f8db4798629e4edcd4ffc6da96b0453fcaceb22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}