{"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":"/task/computational-efficiency/papers/14","list_of":"/task/computational-efficiency","task":"Computational Efficiency","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":14,"pages_in_order":49,"rows_per_page":100,"rows":[1301,1400],"of":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/computational-efficiency","prev":"/task/computational-efficiency/papers/13","next":"/task/computational-efficiency/papers/15","papers":[{"url":"/paper/approximate-message-passing-with-parameter","slug":"approximate-message-passing-with-parameter","title":"Approximate Message Passing with Parameter Estimation for Heavily Quantized Measurements","date":"2022-05-20","arxiv_id":"2205.10448","repositories_listed":1,"syntology":null},{"url":"/paper/certified-error-control-of-candidate-set","slug":"certified-error-control-of-candidate-set","title":"Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking","date":"2022-05-19","arxiv_id":"2205.09638","repositories_listed":1,"syntology":null},{"url":"/paper/two-step-question-retrieval-for-open-domain-1","slug":"two-step-question-retrieval-for-open-domain-1","title":"Two-Step Question Retrieval for Open-Domain QA","date":"2022-05-19","arxiv_id":"2205.09393","repositories_listed":1,"syntology":null},{"url":"/paper/perfect-spectral-clustering-with-discrete","slug":"perfect-spectral-clustering-with-discrete","title":"Perfect Spectral Clustering with Discrete Covariates","date":"2022-05-17","arxiv_id":"2205.08047","repositories_listed":1,"syntology":null},{"url":"/paper/transkimmer-transformer-learns-to-layer-wise-1","slug":"transkimmer-transformer-learns-to-layer-wise-1","title":"Transkimmer: Transformer Learns to Layer-wise Skim","date":"2022-05-15","arxiv_id":"2205.07324","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/transkimmer-transformer-learns-to-layer-wise-1#ran","syntology_url":"https://syntology.ai/paper/2205.07324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07324"}},"official":{"repos":["chandlerguan/transkimmer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/feedback-gradient-descent-efficient-and","slug":"feedback-gradient-descent-efficient-and","title":"Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs","date":"2022-05-12","arxiv_id":"2205.08385","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/feedback-gradient-descent-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2205.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08385"}},"official":{"repos":["bokveizen/Feedback-Gradient-Descent"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/view-synthesis-with-sculpted-neural-points","slug":"view-synthesis-with-sculpted-neural-points","title":"View Synthesis with Sculpted Neural Points","date":"2022-05-12","arxiv_id":"2205.05869","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-regularised-joint-mixture-models","slug":"scalable-regularised-joint-mixture-models","title":"Scalable Regularised Joint Mixture Models","date":"2022-05-03","arxiv_id":"2205.01486","repositories_listed":1,"syntology":null},{"url":"/paper/dfc-anatomically-informed-fiber-clustering","slug":"dfc-anatomically-informed-fiber-clustering","title":"Deep fiber clustering: Anatomically informed fiber clustering with self-supervised deep learning for fast and effective tractography parcellation","date":"2022-05-02","arxiv_id":"2205.00627","repositories_listed":1,"syntology":null},{"url":"/paper/rang-a-residual-based-adaptive-node","slug":"rang-a-residual-based-adaptive-node","title":"RANG: A Residual-based Adaptive Node Generation Method for Physics-Informed Neural Networks","date":"2022-05-02","arxiv_id":"2205.01051","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rang-a-residual-based-adaptive-node#ran","syntology_url":"https://syntology.ai/paper/2205.01051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01051"}},"official":{"repos":["weipengoo98/rang_pinn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/novel-optimized-crow-search-algorithm-for","slug":"novel-optimized-crow-search-algorithm-for","title":"Novel optimized crow search algorithm for feature selection","date":"2022-04-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/swinfuse-a-residual-swin-transformer-fusion","slug":"swinfuse-a-residual-swin-transformer-fusion","title":"SwinFuse: A Residual Swin Transformer Fusion Network for Infrared and Visible Images","date":"2022-04-25","arxiv_id":"2204.11436","repositories_listed":1,"syntology":null},{"url":"/paper/toward-fast-flexible-and-robust-low-light","slug":"toward-fast-flexible-and-robust-low-light","title":"Toward Fast, Flexible, and Robust Low-Light Image Enhancement","date":"2022-04-21","arxiv_id":"2204.10137","repositories_listed":1,"syntology":null},{"url":"/paper/working-memory-inspired-hierarchical-video","slug":"working-memory-inspired-hierarchical-video","title":"Working memory inspired hierarchical video decomposition with transformative representations","date":"2022-04-21","arxiv_id":"2204.10105","repositories_listed":1,"syntology":null},{"url":"/paper/fast-multi-grid-methods-for-minimizing","slug":"fast-multi-grid-methods-for-minimizing","title":"Fast Multi-grid Methods for Minimizing Curvature Energy","date":"2022-04-17","arxiv_id":"2204.07921","repositories_listed":1,"syntology":null},{"url":"/paper/fastervideo-efficient-online-joint-object","slug":"fastervideo-efficient-online-joint-object","title":"FasterVideo: Efficient Online Joint Object Detection And Tracking","date":"2022-04-15","arxiv_id":"2204.07394","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-modulate-random-weights-can","slug":"learning-to-modulate-random-weights-can","title":"Learning to Modulate Random Weights: Neuromodulation-inspired Neural Networks For Efficient Continual Learning","date":"2022-04-08","arxiv_id":"2204.04297","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-multimodal-fusion","slug":"dynamic-multimodal-fusion","title":"Dynamic Multimodal Fusion","date":"2022-03-31","arxiv_id":"2204.00102","repositories_listed":1,"syntology":null},{"url":"/paper/meta-sampler-almost-universal-yet-task","slug":"meta-sampler-almost-universal-yet-task","title":"Meta-Sampler: Almost-Universal yet Task-Oriented Sampling for Point Clouds","date":"2022-03-30","arxiv_id":"2203.16001","repositories_listed":1,"syntology":null},{"url":"/paper/cryoai-amortized-inference-of-poses-for-ab","slug":"cryoai-amortized-inference-of-poses-for-ab","title":"CryoAI: Amortized Inference of Poses for Ab Initio Reconstruction of 3D Molecular Volumes from Real Cryo-EM Images","date":"2022-03-15","arxiv_id":"2203.08138","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cryoai-amortized-inference-of-poses-for-ab#ran","syntology_url":"https://syntology.ai/paper/2203.08138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08138"}},"official":{"repos":["compspi/cryoai"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/e-detectors-a-nonparametric-framework-for","slug":"e-detectors-a-nonparametric-framework-for","title":"E-detectors: a nonparametric framework for sequential change detection","date":"2022-03-07","arxiv_id":"2203.03532","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-document-coverage-reward-for-relaxed-1","slug":"a-multi-document-coverage-reward-for-relaxed-1","title":"A Multi-Document Coverage Reward for RELAXed Multi-Document Summarization","date":"2022-03-06","arxiv_id":"2203.02894","repositories_listed":1,"syntology":null},{"url":"/paper/faith-shap-the-faithful-shapley-shapley","slug":"faith-shap-the-faithful-shapley-shapley","title":"Faith-Shap: The Faithful Shapley Interaction Index","date":"2022-03-02","arxiv_id":"2203.00870","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/faith-shap-the-faithful-shapley-shapley#ran","syntology_url":"https://syntology.ai/paper/2203.00870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00870"}},"official":null}},{"url":"/paper/learning-stochastic-parametric-differentiable","slug":"learning-stochastic-parametric-differentiable","title":"Learning Stochastic Parametric Differentiable Predictive Control Policies","date":"2022-03-02","arxiv_id":"2203.01447","repositories_listed":1,"syntology":null},{"url":"/paper/blazeneo-blazing-fast-polyp-segmentation-and","slug":"blazeneo-blazing-fast-polyp-segmentation-and","title":"BlazeNeo: Blazing fast polyp segmentation and neoplasm detection","date":"2022-02-28","arxiv_id":"2203.00129","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-hate-speech-detection-a","slug":"deep-learning-for-hate-speech-detection-a","title":"Deep Learning for Hate Speech Detection: A Comparative Study","date":"2022-02-19","arxiv_id":"2202.09517","repositories_listed":1,"syntology":null},{"url":"/paper/finnet-solving-time-independent-differential","slug":"finnet-solving-time-independent-differential","title":"FinNet: Solving Time-Independent Differential Equations with Finite Difference Neural Network","date":"2022-02-18","arxiv_id":"2202.09282","repositories_listed":1,"syntology":null},{"url":"/paper/guidelines-and-evaluation-for-clinical","slug":"guidelines-and-evaluation-for-clinical","title":"Guidelines and Evaluation of Clinical Explainable AI in Medical Image Analysis","date":"2022-02-16","arxiv_id":"2202.10553","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/guidelines-and-evaluation-for-clinical#ran","syntology_url":"https://syntology.ai/paper/2202.10553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.10553"}},"official":{"repos":["weinajin/multimodal_explanation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-kernel-ucb-for-contextual-bandits","slug":"efficient-kernel-ucb-for-contextual-bandits","title":"Efficient Kernel UCB for Contextual Bandits","date":"2022-02-11","arxiv_id":"2202.05638","repositories_listed":1,"syntology":null},{"url":"/paper/evoprunedeeptl-an-evolutionary-pruning-model","slug":"evoprunedeeptl-an-evolutionary-pruning-model","title":"EvoPruneDeepTL: An Evolutionary Pruning Model for Transfer Learning based Deep Neural Networks","date":"2022-02-08","arxiv_id":"2202.03844","repositories_listed":1,"syntology":null},{"url":"/paper/b2ea-an-evolutionary-algorithm-assisted-by","slug":"b2ea-an-evolutionary-algorithm-assisted-by","title":"B2EA: An Evolutionary Algorithm Assisted by Two Bayesian Optimization Modules for Neural Architecture Search","date":"2022-02-07","arxiv_id":"2202.03005","repositories_listed":1,"syntology":null},{"url":"/paper/torchmd-net-equivariant-transformers-for","slug":"torchmd-net-equivariant-transformers-for","title":"TorchMD-NET: Equivariant Transformers for Neural Network based Molecular Potentials","date":"2022-02-05","arxiv_id":"2202.02541","repositories_listed":1,"syntology":null},{"url":"/paper/cross-modality-multi-atlas-segmentation-using-1","slug":"cross-modality-multi-atlas-segmentation-using-1","title":"Cross-Modality Multi-Atlas Segmentation via Deep Registration and Label Fusion","date":"2022-02-04","arxiv_id":"2202.02000","repositories_listed":1,"syntology":null},{"url":"/paper/mold-into-a-graph-efficient-bayesian","slug":"mold-into-a-graph-efficient-bayesian","title":"Mold into a Graph: Efficient Bayesian Optimization over Mixed-Spaces","date":"2022-02-02","arxiv_id":"2202.00893","repositories_listed":1,"syntology":null},{"url":"/paper/adaann-adaptive-annealing-scheduler-for","slug":"adaann-adaptive-annealing-scheduler-for","title":"AdaAnn: Adaptive Annealing Scheduler for Probability Density Approximation","date":"2022-02-01","arxiv_id":"2202.00792","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-infinite-spectral-and","slug":"weisfeiler-and-leman-go-infinite-spectral-and","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","date":"2022-01-31","arxiv_id":"2201.13410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/weisfeiler-and-leman-go-infinite-spectral-and#ran","syntology_url":"https://syntology.ai/paper/2201.13410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.13410"}},"official":{"repos":["tpfi22/spectral-and-combinatorial"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/event-based-video-reconstruction-via","slug":"event-based-video-reconstruction-via","title":"Event-based Video Reconstruction via Potential-assisted Spiking Neural Network","date":"2022-01-25","arxiv_id":"2201.10943","repositories_listed":1,"syntology":null},{"url":"/paper/segmentation-based-vs-regression-based","slug":"segmentation-based-vs-regression-based","title":"Segmentation-Based vs. Regression-Based Biomarker Estimation: A Case Study of Fetus Head Circumference Assessment from Ultrasound Images","date":"2022-01-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-evaluation-metrics-for-graph-generative-1","slug":"on-evaluation-metrics-for-graph-generative-1","title":"On Evaluation Metrics for Graph Generative Models","date":"2022-01-24","arxiv_id":"2201.09871","repositories_listed":1,"syntology":null},{"url":"/paper/sketch-and-lift-scalable-subsampled","slug":"sketch-and-lift-scalable-subsampled","title":"Sketch-and-Lift: Scalable Subsampled Semidefinite Program for $K$-means Clustering","date":"2022-01-20","arxiv_id":"2201.08226","repositories_listed":1,"syntology":null},{"url":"/paper/deep-convolutional-neural-network-for-shape","slug":"deep-convolutional-neural-network-for-shape","title":"Deep convolutional neural network for shape optimization using level-set approach","date":"2022-01-17","arxiv_id":"2201.06210","repositories_listed":1,"syntology":null},{"url":"/paper/s-walk-accurate-and-scalable-session-based","slug":"s-walk-accurate-and-scalable-session-based","title":"S-Walk: Accurate and Scalable Session-based Recommendationwith Random Walks","date":"2022-01-04","arxiv_id":"2201.01091","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-lookup-table-for-neural-network","slug":"learnable-lookup-table-for-neural-network","title":"Learnable Lookup Table for Neural Network Quantization","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/electric-field-models-of-transcranial","slug":"electric-field-models-of-transcranial","title":"Electric Field Models of Transcranial Magnetic Stimulation Coils with Arbitrary Geometries: Reconstruction from Incomplete Magnetic Field Measurements","date":"2021-12-29","arxiv_id":"2112.14548","repositories_listed":1,"syntology":null},{"url":"/paper/prime-a-few-primitives-can-boost-robustness","slug":"prime-a-few-primitives-can-boost-robustness","title":"PRIME: A few primitives can boost robustness to common corruptions","date":"2021-12-27","arxiv_id":"2112.13547","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prime-a-few-primitives-can-boost-robustness#ran","syntology_url":"https://syntology.ai/paper/2112.13547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13547"}},"official":{"repos":["amodas/PRIME-augmentations"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reconstructing-compact-building-models-from","slug":"reconstructing-compact-building-models-from","title":"Reconstructing Compact Building Models from Point Clouds Using Deep Implicit Fields","date":"2021-12-24","arxiv_id":"2112.13142","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-reinforcement-learning-approach-for-11","slug":"a-deep-reinforcement-learning-approach-for-11","title":"A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone","date":"2021-12-22","arxiv_id":"2112.12545","repositories_listed":1,"syntology":null},{"url":"/paper/styleswin-transformer-based-gan-for-high-1","slug":"styleswin-transformer-based-gan-for-high-1","title":"StyleSwin: Transformer-based GAN for High-resolution Image Generation","date":"2021-12-20","arxiv_id":"2112.10762","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/styleswin-transformer-based-gan-for-high-1#ran","syntology_url":"https://syntology.ai/paper/2112.10762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10762"}},"official":{"repos":["microsoft/StyleSwin"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/gpu-optimization-of-the-3d-scale-invariant","slug":"gpu-optimization-of-the-3d-scale-invariant","title":"GPU optimization of the 3D Scale-invariant Feature Transform Algorithm and a Novel BRIEF-inspired 3D Fast Descriptor","date":"2021-12-19","arxiv_id":"2112.10258","repositories_listed":1,"syntology":null},{"url":"/paper/dynamics-aware-adversarial-attack-of-3d","slug":"dynamics-aware-adversarial-attack-of-3d","title":"Dynamics-aware Adversarial Attack of 3D Sparse Convolution Network","date":"2021-12-17","arxiv_id":"2112.09428","repositories_listed":1,"syntology":null},{"url":"/paper/stable-long-term-recurrent-video-super","slug":"stable-long-term-recurrent-video-super","title":"Stable Long-Term Recurrent Video Super-Resolution","date":"2021-12-16","arxiv_id":"2112.08950","repositories_listed":1,"syntology":null},{"url":"/paper/tracer-extreme-attention-guided-salient","slug":"tracer-extreme-attention-guided-salient","title":"TRACER: Extreme Attention Guided Salient Object Tracing Network","date":"2021-12-14","arxiv_id":"2112.07380","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tracer-extreme-attention-guided-salient#ran","syntology_url":"https://syntology.ai/paper/2112.07380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07380"}},"official":{"repos":["Karel911/TRACER"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/st-mtl-spatio-temporal-multitask-learning","slug":"st-mtl-spatio-temporal-multitask-learning","title":"ST-MTL: Spatio-Temporal Multitask Learning Model to Predict Scanpath While Tracking Instruments in Robotic Surgery","date":"2021-12-10","arxiv_id":"2112.08189","repositories_listed":1,"syntology":null},{"url":"/paper/fast-point-transformer","slug":"fast-point-transformer","title":"Fast Point Transformer","date":"2021-12-09","arxiv_id":"2112.04702","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-point-transformer#ran","syntology_url":"https://syntology.ai/paper/2112.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04702"}},"official":{"repos":["POSTECH-CVLab/FastPointTransformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fully-attentional-network-for-semantic","slug":"fully-attentional-network-for-semantic","title":"Fully Attentional Network for Semantic Segmentation","date":"2021-12-08","arxiv_id":"2112.04108","repositories_listed":1,"syntology":null},{"url":"/paper/self-organized-polynomial-time-coordination-1","slug":"self-organized-polynomial-time-coordination-1","title":"Self-Organized Polynomial-Time Coordination Graphs","date":"2021-12-07","arxiv_id":"2112.03547","repositories_listed":1,"syntology":null},{"url":"/paper/shrimp-sparser-random-feature-models-via","slug":"shrimp-sparser-random-feature-models-via","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","date":"2021-12-07","arxiv_id":"2112.04002","repositories_listed":1,"syntology":null},{"url":"/paper/mt-transunet-mediating-multi-task-tokens-in","slug":"mt-transunet-mediating-multi-task-tokens-in","title":"MT-TransUNet: Mediating Multi-Task Tokens in Transformers for Skin Lesion Segmentation and Classification","date":"2021-12-03","arxiv_id":"2112.01767","repositories_listed":1,"syntology":null},{"url":"/paper/condensenext-an-ultra-efficient-deep-neural","slug":"condensenext-an-ultra-efficient-deep-neural","title":"CondenseNeXt: An Ultra-Efficient Deep Neural Network for Embedded Systems","date":"2021-12-01","arxiv_id":"2112.00698","repositories_listed":1,"syntology":null},{"url":"/paper/simigrad-fine-grained-adaptive-batching-for","slug":"simigrad-fine-grained-adaptive-batching-for","title":"SimiGrad: Fine-Grained Adaptive Batching for Large Scale Training using Gradient Similarity Measurement","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-detr-efficient-end-to-end-object-1","slug":"sparse-detr-efficient-end-to-end-object-1","title":"Sparse DETR: Efficient End-to-End Object Detection with Learnable Sparsity","date":"2021-11-29","arxiv_id":"2111.14330","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-detr-efficient-end-to-end-object-1#ran","syntology_url":"https://syntology.ai/paper/2111.14330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14330"}},"official":{"repos":["kakaobrain/sparse-detr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-fourier-neural-operators-efficient","slug":"adaptive-fourier-neural-operators-efficient","title":"Adaptive Fourier Neural Operators: Efficient Token Mixers for Transformers","date":"2021-11-24","arxiv_id":"2111.13587","repositories_listed":1,"syntology":null},{"url":"/paper/morocco-model-resource-comparison-framework-1","slug":"morocco-model-resource-comparison-framework-1","title":"MOROCCO: Model Resource Comparison Framework","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fully-linear-graph-convolutional-networks-for","slug":"fully-linear-graph-convolutional-networks-for","title":"Fully Linear Graph Convolutional Networks for Semi-Supervised Learning and Clustering","date":"2021-11-15","arxiv_id":"2111.07942","repositories_listed":1,"syntology":null},{"url":"/paper/learning-an-adaptive-meta-model-generator-for","slug":"learning-an-adaptive-meta-model-generator-for","title":"Learning an Adaptive Meta Model-Generator for Incrementally Updating Recommender Systems","date":"2021-11-08","arxiv_id":"2111.04282","repositories_listed":1,"syntology":null},{"url":"/paper/dual-parameterization-of-sparse-variational","slug":"dual-parameterization-of-sparse-variational","title":"Dual Parameterization of Sparse Variational Gaussian Processes","date":"2021-11-05","arxiv_id":"2111.03412","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dual-parameterization-of-sparse-variational#ran","syntology_url":"https://syntology.ai/paper/2111.03412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03412"}},"official":{"repos":["AaltoML/t-SVGP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gaussian-kernel-mixture-network-for-single","slug":"gaussian-kernel-mixture-network-for-single","title":"Gaussian Kernel Mixture Network for Single Image Defocus Deblurring","date":"2021-10-31","arxiv_id":"2111.00454","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-vector-field-network-for-many-1","slug":"equivariant-vector-field-network-for-many-1","title":"SE(3) Equivariant Graph Neural Networks with Complete Local Frames","date":"2021-10-26","arxiv_id":"2110.14811","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/equivariant-vector-field-network-for-many-1#ran","syntology_url":"https://syntology.ai/paper/2110.14811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14811"}},"official":{"repos":["mouthful/ClofNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/exploiting-redundancy-separable-group-1","slug":"exploiting-redundancy-separable-group-1","title":"Exploiting Redundancy: Separable Group Convolutional Networks on Lie Groups","date":"2021-10-25","arxiv_id":"2110.13059","repositories_listed":1,"syntology":null},{"url":"/paper/neural-flows-efficient-alternative-to-neural","slug":"neural-flows-efficient-alternative-to-neural","title":"Neural Flows: Efficient Alternative to Neural ODEs","date":"2021-10-25","arxiv_id":"2110.13040","repositories_listed":1,"syntology":null},{"url":"/paper/cvt-assd-convolutional-vision-transformer","slug":"cvt-assd-convolutional-vision-transformer","title":"CvT-ASSD: Convolutional vision-Transformer Based Attentive Single Shot MultiBox Detector","date":"2021-10-24","arxiv_id":"2110.12364","repositories_listed":1,"syntology":null},{"url":"/paper/sin-superpixel-interpolation-network","slug":"sin-superpixel-interpolation-network","title":"SIN:Superpixel Interpolation Network","date":"2021-10-17","arxiv_id":"2110.08702","repositories_listed":1,"syntology":null},{"url":"/paper/on-learning-the-transformer-kernel-1","slug":"on-learning-the-transformer-kernel-1","title":"On Learning the Transformer Kernel","date":"2021-10-15","arxiv_id":"2110.08323","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-the-robustness-of-spatial","slug":"benchmarking-the-robustness-of-spatial","title":"Benchmarking the Robustness of Spatial-Temporal Models Against Corruptions","date":"2021-10-13","arxiv_id":"2110.06513","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/benchmarking-the-robustness-of-spatial#ran","syntology_url":"https://syntology.ai/paper/2110.06513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06513"}},"official":{"repos":["newbeeyoung/video-corruption-robustness"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/semi-supervised-graph-prototypical-networks","slug":"semi-supervised-graph-prototypical-networks","title":"Semi-Supervised Graph Prototypical Networks for Hyperspectral Image Classification","date":"2021-10-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-transfer-learning-for-land-use-land","slug":"deep-transfer-learning-for-land-use-land","title":"Deep Transfer Learning for Land Use and Land Cover Classification: A Comparative Study","date":"2021-10-06","arxiv_id":"2110.02580","repositories_listed":1,"syntology":null},{"url":"/paper/robust-peak-detection-for-holter-ecgs-by-self","slug":"robust-peak-detection-for-holter-ecgs-by-self","title":"Robust Peak Detection for Holter ECGs by Self-Organized Operational Neural Networks","date":"2021-09-30","arxiv_id":"2110.02381","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-networks-with-controlled-variable","slug":"deep-neural-networks-with-controlled-variable","title":"Deep neural networks with controlled variable selection for the identification of putative causal genetic variants","date":"2021-09-29","arxiv_id":"2109.14719","repositories_listed":1,"syntology":null},{"url":"/paper/confusion-based-rank-similarity-filters-for","slug":"confusion-based-rank-similarity-filters-for","title":"Confusion-based rank similarity filters for computationally-efficient machine learning on high dimensional data","date":"2021-09-28","arxiv_id":"2109.13610","repositories_listed":1,"syntology":null},{"url":"/paper/fast-treeshap-accelerating-shap-value","slug":"fast-treeshap-accelerating-shap-value","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","date":"2021-09-20","arxiv_id":"2109.09847","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/fast-treeshap-accelerating-shap-value#ran","syntology_url":"https://syntology.ai/paper/2109.09847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.09847"}},"official":null}},{"url":"/paper/ai-accelerator-survey-and-trends","slug":"ai-accelerator-survey-and-trends","title":"AI Accelerator Survey and Trends","date":"2021-09-18","arxiv_id":"2109.08957","repositories_listed":1,"syntology":null},{"url":"/paper/an-mrc-framework-for-semantic-role-labeling","slug":"an-mrc-framework-for-semantic-role-labeling","title":"An MRC Framework for Semantic Role Labeling","date":"2021-09-14","arxiv_id":"2109.06660","repositories_listed":1,"syntology":null},{"url":"/paper/robust-predictable-control","slug":"robust-predictable-control","title":"Robust Predictable Control","date":"2021-09-07","arxiv_id":"2109.03214","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-predictable-control#ran","syntology_url":"https://syntology.ai/paper/2109.03214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03214"}},"official":{"repos":["eleurent/highway-env"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/voxel-transformer-for-3d-object-detection","slug":"voxel-transformer-for-3d-object-detection","title":"Voxel Transformer for 3D Object Detection","date":"2021-09-06","arxiv_id":"2109.02497","repositories_listed":1,"syntology":{"n":7,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"0 ran · 7 unverified","sample_list":"/paper/voxel-transformer-for-3d-object-detection#ran","syntology_url":"https://syntology.ai/paper/2109.02497","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.02497"}},"official":null}},{"url":"/paper/gtg-shapley-efficient-and-accurate","slug":"gtg-shapley-efficient-and-accurate","title":"GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learning","date":"2021-09-05","arxiv_id":"2109.02053","repositories_listed":1,"syntology":null},{"url":"/paper/cmml-contextual-modulation-meta-learning-for","slug":"cmml-contextual-modulation-meta-learning-for","title":"CMML: Contextual Modulation Meta Learning for Cold-Start Recommendation","date":"2021-08-24","arxiv_id":"2108.10511","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-backbone-for-hyperspectral-image","slug":"a-new-backbone-for-hyperspectral-image","title":"A Simple and Efficient Reconstruction Backbone for Snapshot Compressive Imaging","date":"2021-08-17","arxiv_id":"2108.07739","repositories_listed":1,"syntology":null},{"url":"/paper/an-extensible-benchmark-suite-for-learning-to","slug":"an-extensible-benchmark-suite-for-learning-to","title":"An Extensible Benchmark Suite for Learning to Simulate Physical Systems","date":"2021-08-09","arxiv_id":"2108.07799","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-extensible-benchmark-suite-for-learning-to#ran","syntology_url":"https://syntology.ai/paper/2108.07799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07799"}},"official":{"repos":["karlotness/nn-benchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-sentence-level-end-to-end-speech","slug":"beyond-sentence-level-end-to-end-speech","title":"Beyond Sentence-Level End-to-End Speech Translation: Context Helps","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-matching-networks-for-semantic","slug":"multi-scale-matching-networks-for-semantic","title":"Multi-scale Matching Networks for Semantic Correspondence","date":"2021-07-31","arxiv_id":"2108.00211","repositories_listed":1,"syntology":null},{"url":"/paper/dissecting-flops-along-input-dimensions-for","slug":"dissecting-flops-along-input-dimensions-for","title":"Dissecting FLOPs along input dimensions for GreenAI cost estimations","date":"2021-07-26","arxiv_id":"2107.11949","repositories_listed":1,"syntology":null},{"url":"/paper/data-based-stochastic-modeling-reveals","slug":"data-based-stochastic-modeling-reveals","title":"Data-based stochastic modeling reveals sources of activity bursts in single-cell TGF-$β$ signaling","date":"2021-07-25","arxiv_id":"2107.11770","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-for-offline-reinforcement","slug":"model-selection-for-offline-reinforcement","title":"Model Selection for Offline Reinforcement Learning: Practical Considerations for Healthcare Settings","date":"2021-07-23","arxiv_id":"2107.11003","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-based-machine-learning-for-fast","slug":"transformer-based-machine-learning-for-fast","title":"Transformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis","date":"2021-07-15","arxiv_id":"2107.07116","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-vs-discrete-optimization-of-deep","slug":"continuous-vs-discrete-optimization-of-deep","title":"Continuous vs. Discrete Optimization of Deep Neural Networks","date":"2021-07-14","arxiv_id":"2107.06608","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-spherical-k-means","slug":"accelerating-spherical-k-means","title":"Accelerating Spherical k-Means","date":"2021-07-08","arxiv_id":"2107.04074","repositories_listed":1,"syntology":null},{"url":"/paper/training-adaptive-computation-for-open-domain","slug":"training-adaptive-computation-for-open-domain","title":"Training Adaptive Computation for Open-Domain Question Answering with Computational Constraints","date":"2021-07-05","arxiv_id":"2107.02102","repositories_listed":1,"syntology":null},{"url":"/paper/image-classification-with-condensenext-for","slug":"image-classification-with-condensenext-for","title":"Image Classification with CondenseNeXt for ARM-Based Computing Platforms","date":"2021-06-26","arxiv_id":"2106.14102","repositories_listed":1,"syntology":null},{"url":"/paper/dns-distill-and-select-for-efficient-and","slug":"dns-distill-and-select-for-efficient-and","title":"DnS: Distill-and-Select for Efficient and Accurate Video Indexing and Retrieval","date":"2021-06-24","arxiv_id":"2106.13266","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dns-distill-and-select-for-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2106.13266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13266"}},"official":{"repos":["mever-team/distill-and-select"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/boundary-graph-neural-networks-for-3d","slug":"boundary-graph-neural-networks-for-3d","title":"Boundary Graph Neural Networks for 3D Simulations","date":"2021-06-21","arxiv_id":"2106.11299","repositories_listed":1,"syntology":null}],"record_sha256":"d3080190178bb87c15c7f890d3e9a13193d2e40cf3c311e1b7ddd7c278850b67","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}