{"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":"/code/get-edges","entry":"get_edges","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":20,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":3,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":20,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":7,"unverified":4},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2605.01625","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01625","title":"PRIME: Protein Representation via Physics-Informed Multiscale Equivariant Hierarchies","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HySonLab/PRIME","path":"models/egnn.py","file_url":"https://github.com/HySonLab/PRIME/blob/HEAD/models/egnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"2407.05680","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-multi-view-hand-reconstruction","title":"Fine-Grained Multi-View Hand Reconstruction Using Inverse Rendering","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agnjason/fmhr","path":"mano_optim.py","file_url":"https://github.com/agnjason/fmhr/blob/HEAD/mano_optim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a84f1093efd108a8","code_sha256_prefix":"a84f1093efd108a8","mcp_get_code":{"code_sha256":"a84f1093efd108a8"}},{"arxiv_id":"2407.01648","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-target-aware-molecule-diffusion","title":"Aligning Target-Aware Molecule Diffusion Models with Exact Energy Optimization","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/alidiff","path":"graphbap/bapnet.py","file_url":"https://github.com/minkaixu/alidiff/blob/HEAD/graphbap/bapnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, minkaixu/alidiff when it was checked","code_sha256":"e50eb08b9688b3cb","code_sha256_prefix":"e50eb08b9688b3cb","mcp_get_code":{"code_sha256":"e50eb08b9688b3cb"}},{"arxiv_id":"2404.12141","arxiv_id_is_arxiv":true,"paper":"/paper/molcraft-structure-based-drug-design-in","title":"MolCRAFT: Structure-Based Drug Design in Continuous Parameter Space","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlgoMole/GeoBFN","path":"core/module/egnn_clean.py","file_url":"https://github.com/AlgoMole/GeoBFN/blob/HEAD/core/module/egnn_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AlgoMole/GeoBFN when it was checked","code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"2309.16342","arxiv_id_is_arxiv":true,"paper":"/paper/lagrangebench-a-lagrangian-fluid-mechanics-1","title":"LagrangeBench: A Lagrangian Fluid Mechanics Benchmarking Suite","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vgsatorras/egnn","path":"models/egnn_clean/egnn_clean.py","file_url":"https://github.com/vgsatorras/egnn/blob/HEAD/models/egnn_clean/egnn_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"2308.10832","arxiv_id_is_arxiv":true,"paper":"/paper/eigenplaces-training-viewpoint-robust-models","title":"EigenPlaces: Training Viewpoint Robust Models for Visual Place Recognition","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmberton/eigenplaces","path":"datasets/map_utils.py","file_url":"https://github.com/gmberton/eigenplaces/blob/HEAD/datasets/map_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c494b746f3224d0","code_sha256_prefix":"5c494b746f3224d0","mcp_get_code":{"code_sha256":"5c494b746f3224d0"}},{"arxiv_id":"2306.04321","arxiv_id_is_arxiv":true,"paper":"/paper/generative-semantic-communication-diffusion","title":"Generative Semantic Communication: Diffusion Models Beyond Bit Recovery","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/gesco","path":"image_sample.py","file_url":"https://github.com/ispamm/gesco/blob/HEAD/image_sample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from weilunwang/semantic-diffusion-model, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1a99e2092dd2b01","code_sha256_prefix":"a1a99e2092dd2b01","mcp_get_code":{"code_sha256":"a1a99e2092dd2b01"}},{"arxiv_id":"2207.08824","arxiv_id_is_arxiv":true,"paper":"/paper/3d-equivariant-molecular-graph-pretraining","title":"Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaor17/3D-MGP","path":"mgp/layers/egnn_clean.py","file_url":"https://github.com/jiaor17/3D-MGP/blob/HEAD/mgp/layers/egnn_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"2207.00050","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-image-synthesis-via-diffusion-models","title":"Semantic Image Synthesis via Diffusion Models","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weilunwang/semantic-diffusion-model","path":"image_sample.py","file_url":"https://github.com/weilunwang/semantic-diffusion-model/blob/HEAD/image_sample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, weilunwang/semantic-diffusion-model when it was checked","code_sha256":"a1a99e2092dd2b01","code_sha256_prefix":"a1a99e2092dd2b01","mcp_get_code":{"code_sha256":"a1a99e2092dd2b01"}},{"arxiv_id":"2206.00668","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-untangle-genome-assembly-with","title":"Learning to Untangle Genome Assembly with Graph Convolutional Networks","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvrcek/gnnome-assembly","path":"graph_parser.py","file_url":"https://github.com/lvrcek/gnnome-assembly/blob/HEAD/graph_parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"089336c8dc1a6008","code_sha256_prefix":"089336c8dc1a6008","mcp_get_code":{"code_sha256":"089336c8dc1a6008"}},{"arxiv_id":"2204.13713","arxiv_id_is_arxiv":true,"paper":"/paper/learning-cosmology-and-clustering-with-cosmic","title":"Learning cosmology and clustering with cosmic graphs","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PabloVD/CosmoGraphNet","path":"Source/load_data.py","file_url":"https://github.com/PabloVD/CosmoGraphNet/blob/HEAD/Source/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4999020ad90ea459","code_sha256_prefix":"4999020ad90ea459","mcp_get_code":{"code_sha256":"4999020ad90ea459"}},{"arxiv_id":"2106.01474","arxiv_id_is_arxiv":true,"paper":"/paper/testing-directed-acyclic-graph-via-structural","title":"Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunzhe-zhou/sugar","path":"SUGAR/sim_gen.py","file_url":"https://github.com/yunzhe-zhou/sugar/blob/HEAD/SUGAR/sim_gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2af3fa1a257acf4d","code_sha256_prefix":"2af3fa1a257acf4d","mcp_get_code":{"code_sha256":"2af3fa1a257acf4d"}},{"arxiv_id":"2007.04238","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-the-accuracy-of-a-few-shot","title":"Predicting the Accuracy of a Few-Shot Classifier","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbonto/fewshot_generalization","path":"dot_correlation.py","file_url":"https://github.com/mbonto/fewshot_generalization/blob/HEAD/dot_correlation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7938ba61451c14fc","code_sha256_prefix":"7938ba61451c14fc","mcp_get_code":{"code_sha256":"7938ba61451c14fc"}},{"arxiv_id":"1909.00321","arxiv_id_is_arxiv":true,"paper":"/paper/deep-mesh-reconstruction-from-single-rgb","title":"Deep Mesh Reconstruction from Single RGB Images via Topology Modification Networks","date":"2019-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jnypan/TMNet","path":"auxiliary/utils.py","file_url":"https://github.com/jnypan/TMNet/blob/HEAD/auxiliary/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d7d10d13d91d0c7","code_sha256_prefix":"2d7d10d13d91d0c7","mcp_get_code":{"code_sha256":"2d7d10d13d91d0c7"}},{"arxiv_id":"1905.05460","arxiv_id_is_arxiv":true,"paper":"/paper/cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/CogQA","path":"read_fullwiki.py","file_url":"https://github.com/THUDM/CogQA/blob/HEAD/read_fullwiki.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"04d7749f0d53e657","code_sha256_prefix":"04d7749f0d53e657","mcp_get_code":{"code_sha256":"04d7749f0d53e657"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anton-bushuiev/ppiformer","path":"ppiformer/model/egnn_clean.py","file_url":"https://github.com/anton-bushuiev/ppiformer/blob/HEAD/ppiformer/model/egnn_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"ijcai2024_0712","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0712","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nyh-a/CoSTC","path":"data_loader/dataset.py","file_url":"https://github.com/nyh-a/CoSTC/blob/HEAD/data_loader/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"009909c6fa91cc8d","code_sha256_prefix":"009909c6fa91cc8d","mcp_get_code":{"code_sha256":"009909c6fa91cc8d"}},{"arxiv_id":"aaai_25978","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25978","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiaor17/3D-EMGP","path":"mgp/layers/egnn_clean.py","file_url":"https://github.com/jiaor17/3D-EMGP/blob/HEAD/mgp/layers/egnn_clean.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f9c401f5379aac","code_sha256_prefix":"c2f9c401f5379aac","mcp_get_code":{"code_sha256":"c2f9c401f5379aac"}},{"arxiv_id":"2023.emnlp-main.979","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.979","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cyclexu/TacoPrompt","path":"TacoPrompt/data_loader/dataset.py","file_url":"https://github.com/cyclexu/TacoPrompt/blob/HEAD/TacoPrompt/data_loader/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"392c9d545575f06c","code_sha256_prefix":"392c9d545575f06c","mcp_get_code":{"code_sha256":"392c9d545575f06c"}},{"arxiv_id":"2021.emnlp-main.93","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.93","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"leonweber/extend","path":"extend/eval/predict_extend.py","file_url":"https://github.com/leonweber/extend/blob/HEAD/extend/eval/predict_extend.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"234f29b97b401c94","code_sha256_prefix":"234f29b97b401c94","mcp_get_code":{"code_sha256":"234f29b97b401c94"}}],"record_sha256":"5325d9df4fda8649bea590c8061fbf6847d84cbfbcf2de30c6b1f9ca520c8a74","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}