{"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":"/method/gts","slug":"gts","name":"GTS","full_name":"Goal-Driven Tree-Structured Neural Model","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"A Goal-Driven Tree-Structured Neural Model for Math Word Problems","paper":"/paper/a-goal-driven-tree-structured-neural-model","first_author":"Zhipeng Xie and Shichao Sun","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/a-goal-driven-tree-structured-neural-model"},"source":{"url":"https://www.ijcai.org/Proceedings/2019/736","title":"A Goal-Driven Tree-Structured Neural Model for Math Word Problems","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Sequence To Sequence Models","url":"/methods/category/sequence-to-sequence-models","pwc_aliases":[]}],"n_papers_tagged":46,"archive_num_papers":46,"papers_newest_first":[{"paper":null,"slug":"sim3d-single-instance-multiview-multimodal","title":"SiM3D: Single-instance Multiview Multimodal and Multisetup 3D Anomaly Detection Benchmark","date":"2025-06-26","arxiv_id":"2506.21549","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-graph-transformer-out-of","title":"Exploring Graph-Transformer Out-of-Distribution Generalization Abilities","date":"2025-06-25","arxiv_id":"2506.20575","n_code_links":0,"syntology":null},{"paper":"/paper/opengt-a-comprehensive-benchmark-for-graph","slug":"opengt-a-comprehensive-benchmark-for-graph","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","date":"2025-06-05","arxiv_id":"2506.04765","n_code_links":1,"syntology":null},{"paper":"/paper/gt-svq-a-linear-time-graph-transformer-for","slug":"gt-svq-a-linear-time-graph-transformer-for","title":"GT-SVQ: A Linear-Time Graph Transformer for Node Classification Using Spiking Vector Quantization","date":"2025-04-16","arxiv_id":"2504.11840","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-image-evaluation-in-super","title":"Rethinking Image Evaluation in Super-Resolution","date":"2025-03-17","arxiv_id":"2503.13074","n_code_links":0,"syntology":null},{"paper":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","n_code_links":1,"syntology":{"ran":7,"of":12,"n_ran_checked":3,"n_instrument":4,"unverified":5,"pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"rethinking-tokenized-graph-transformers-for","title":"Rethinking Tokenized Graph Transformers for Node Classification","date":"2025-02-12","arxiv_id":"2502.08101","n_code_links":0,"syntology":null},{"paper":null,"slug":"insecticide-treated-bed-net-use-and","title":"Insecticide treated bed net use and elimination of malaria in Sub-Saharan African countries: Assessing the Global Technical Strategy (GTS) using an evolutionary game approach","date":"2024-12-17","arxiv_id":"2412.13336","n_code_links":0,"syntology":null},{"paper":"/paper/fairgp-a-scalable-and-fair-graph-transformer","slug":"fairgp-a-scalable-and-fair-graph-transformer","title":"FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning","date":"2024-12-14","arxiv_id":"2412.10669","n_code_links":1,"syntology":null},{"paper":null,"slug":"gqwformer-a-quantum-based-transformer-for","title":"GQWformer: A Quantum-based Transformer for Graph Representation Learning","date":"2024-12-03","arxiv_id":"2412.02285","n_code_links":0,"syntology":null},{"paper":"/paper/grokformer-graph-fourier-kolmogorov-arnold","slug":"grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","arxiv_id":"2411.17296","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["GGA23/GrokFormer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/benchmarking-positional-encodings-for-gnns","slug":"benchmarking-positional-encodings-for-gnns","title":"Benchmarking Positional Encodings for GNNs and Graph Transformers","date":"2024-11-19","arxiv_id":"2411.12732","n_code_links":1,"syntology":{"ran":3,"of":7,"n_ran_checked":1,"n_instrument":2,"unverified":4,"pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["ETH-DISCO/Benchmarking-PEs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fitting-the-seven-parameter-generalized","title":"Fitting the seven-parameter Generalized Tempered Stable distribution to the financial data","date":"2024-10-10","arxiv_id":"2410.19751","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-benchmark-on-directed-graph-representation","title":"A Benchmark on Directed Graph Representation Learning in Hardware Designs","date":"2024-10-09","arxiv_id":"2410.06460","n_code_links":0,"syntology":null},{"paper":"/paper/relaxing-graph-transformers-for-adversarial","slug":"relaxing-graph-transformers-for-adversarial","title":"Relaxing Graph Transformers for Adversarial Attacks","date":"2024-07-16","arxiv_id":"2407.11764","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"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","official":null}},{"paper":null,"slug":"a-scalable-and-effective-alternative-to-graph","title":"A Scalable and Effective Alternative to Graph Transformers","date":"2024-06-17","arxiv_id":"2406.12059","n_code_links":0,"syntology":null},{"paper":"/paper/distinguished-in-uniform-self-attention-vs","slug":"distinguished-in-uniform-self-attention-vs","title":"Distinguished In Uniform: Self Attention Vs. Virtual Nodes","date":"2024-05-20","arxiv_id":"2405.11951","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":3,"n_instrument":2,"unverified":3,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["toenshoff/vn-vs-gt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"anchorgt-efficient-and-flexible-attention","title":"AnchorGT: Efficient and Flexible Attention Architecture for Scalable Graph Transformers","date":"2024-05-06","arxiv_id":"2405.03481","n_code_links":0,"syntology":null},{"paper":"/paper/fairgt-a-fairness-aware-graph-transformer","slug":"fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","arxiv_id":"2404.17169","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["yushuowiki/fairgt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/gradformer-graph-transformer-with-exponential","slug":"gradformer-graph-transformer-with-exponential","title":"Gradformer: Graph Transformer with Exponential Decay","date":"2024-04-24","arxiv_id":"2404.15729","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":4,"n_instrument":2,"unverified":3,"pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["liuchuang0059/gradformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/seeing-motion-at-nighttime-with-an-event","slug":"seeing-motion-at-nighttime-with-an-event","title":"Seeing Motion at Nighttime with an Event Camera","date":"2024-04-18","arxiv_id":"2404.11884","n_code_links":1,"syntology":null},{"paper":null,"slug":"complementarity-constrained-predictive","title":"Complementarity-constrained predictive control for efficient gas-balanced hybrid power systems","date":"2024-04-10","arxiv_id":"2404.06813","n_code_links":0,"syntology":null},{"paper":"/paper/sghormer-an-energy-saving-graph-transformer","slug":"sghormer-an-energy-saving-graph-transformer","title":"SGHormer: An Energy-Saving Graph Transformer Driven by Spikes","date":"2024-03-26","arxiv_id":"2403.17656","n_code_links":1,"syntology":null},{"paper":null,"slug":"vlm-pl-advanced-pseudo-labeling-approach","title":"VLM-PL: Advanced Pseudo Labeling Approach for Class Incremental Object Detection via Vision-Language Model","date":"2024-03-08","arxiv_id":"2403.05346","n_code_links":0,"syntology":null},{"paper":null,"slug":"unsupervised-deep-unrolling-networks-for","title":"Unsupervised Deep Unrolling Networks for Phase Unwrapping","date":"2024-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-sparsity-in-graph-transformers","title":"Exploring Sparsity in Graph Transformers","date":"2023-12-09","arxiv_id":"2312.05479","n_code_links":0,"syntology":null},{"paper":"/paper/skeleton-ground-truth-extraction-methodology","slug":"skeleton-ground-truth-extraction-methodology","title":"Skeleton Ground Truth Extraction: Methodology, Annotation Tool and Benchmarks","date":"2023-10-10","arxiv_id":"2310.06437","n_code_links":1,"syntology":null},{"paper":null,"slug":"bitcoin-versus-s-p-500-index-return-and-risk","title":"Bitcoin versus S&P 500 Index: Return and Risk Analysis","date":"2023-10-03","arxiv_id":"2310.02436","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-economic-gas-turbine-dispatch-with","title":"Optimal Economic Gas Turbine Dispatch with Deep Reinforcement Learning","date":"2023-08-28","arxiv_id":"2308.14924","n_code_links":0,"syntology":null},{"paper":null,"slug":"european-option-pricing-under-generalized-1","title":"European Option Pricing Under Generalized Tempered Stable Process: Empirical Analysis","date":"2023-04-12","arxiv_id":"2304.06060","n_code_links":0,"syntology":null},{"paper":"/paper/human-guided-ground-truth-generation-for","slug":"human-guided-ground-truth-generation-for","title":"Human Guided Ground-truth Generation for Realistic Image Super-resolution","date":"2023-03-23","arxiv_id":"2303.13069","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":2,"n_instrument":4,"unverified":1,"pointer_only":2,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","official":{"repos":["chrisdud0257/hggt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/hinormer-representation-learning-on","slug":"hinormer-representation-learning-on","title":"HINormer: Representation Learning On Heterogeneous Information Networks with Graph Transformer","date":"2023-02-22","arxiv_id":"2302.11329","n_code_links":1,"syntology":null},{"paper":"/paper/conquer-query-contrast-voxel-detr-for-3d","slug":"conquer-query-contrast-voxel-detr-for-3d","title":"ConQueR: Query Contrast Voxel-DETR for 3D Object Detection","date":"2022-12-14","arxiv_id":"2212.07289","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["poodarchu/ConQueR"],"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"]}}},{"paper":null,"slug":"truth-and-preferences-a-game-approach-for","title":"Truth and Preferences -- A Game Approach for Qualitative Choice Logic","date":"2022-09-26","arxiv_id":"2209.12777","n_code_links":0,"syntology":null},{"paper":null,"slug":"mmtm-multi-tasking-multi-decoder-transformer","title":"MMTM: Multi-Tasking Multi-Decoder Transformer for Math Word Problems","date":"2022-06-02","arxiv_id":"2206.01268","n_code_links":0,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","n_code_links":4,"syntology":{"ran":3,"of":21,"n_ran_checked":1,"n_instrument":2,"unverified":18,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"fitting-generalized-tempered-stable","title":"Fitting Generalized Tempered Stable distribution: Fractional Fourier Transform (FRFT) Approach","date":"2022-05-02","arxiv_id":"2205.00586","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-trees-adversarial-and-copycat","title":"Generative Trees: Adversarial and Copycat","date":"2022-01-26","arxiv_id":"2201.11205","n_code_links":0,"syntology":null},{"paper":null,"slug":"expert-human-level-driving-in-gran-turismo","title":"Expert Human-Level Driving in Gran Turismo Sport Using Deep Reinforcement Learning with Image-based Representation","date":"2021-11-11","arxiv_id":"2111.06449","n_code_links":0,"syntology":null},{"paper":"/paper/from-semantic-categories-to-fixations-a-novel","slug":"from-semantic-categories-to-fixations-a-novel","title":"From Semantic Categories to Fixations: A Novel Weakly-Supervised Visual-Auditory Saliency Detection Approach","date":"2021-06-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/are-nlp-models-really-able-to-solve-simple","slug":"are-nlp-models-really-able-to-solve-simple","title":"Are NLP Models really able to Solve Simple Math Word Problems?","date":"2021-03-12","arxiv_id":"2103.07191","n_code_links":3,"syntology":null},{"paper":"/paper/grid-tagging-scheme-for-aspect-oriented-fine","slug":"grid-tagging-scheme-for-aspect-oriented-fine","title":"Grid Tagging Scheme for Aspect-oriented Fine-grained Opinion Extraction","date":"2020-10-09","arxiv_id":"2010.04640","n_code_links":3,"syntology":null},{"paper":null,"slug":"a-reinforcement-learning-application-of","title":"A reinforcement learning application of guided Monte Carlo Tree Search algorithm for beam orientation selection in radiation therapy","date":"2020-04-14","arxiv_id":"2004.06244","n_code_links":0,"syntology":null},{"paper":null,"slug":"crackgan-a-labor-light-crack-detection","title":"CrackGAN: Pavement Crack Detection Using Partially Accurate Ground Truths Based on Generative Adversarial Learning","date":"2019-09-18","arxiv_id":"1909.08216","n_code_links":0,"syntology":null},{"paper":null,"slug":"comparing-linear-structure-based-and-data","title":"Comparing linear structure-based and data-driven latent spatial representations for sequence prediction","date":"2019-08-19","arxiv_id":"1908.06868","n_code_links":0,"syntology":null},{"paper":"/paper/a-goal-driven-tree-structured-neural-model","slug":"a-goal-driven-tree-structured-neural-model","title":"A Goal-Driven Tree-Structured Neural Model for Math Word Problems","date":"2019-08-10","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":46,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":46,"with_a_code_link":20,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":46,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"papers_where_code_ran":10,"papers_where_code_ran_first_page":"/method/gts/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/gts/papers/ran/1","json":"/method/gts/papers/ran/1.json","rows":10}],"tasks":[{"task":"/task/representation-learning","name":"Representation Learning","papers":10},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":7},{"task":"/task/graph-classification","name":"Graph Classification","papers":6},{"task":"/task/node-classification","name":"Node Classification","papers":6},{"task":"/task/graph-learning","name":"Graph Learning","papers":4},{"task":"/task/fairness","name":"Fairness","papers":3},{"task":"/task/math","name":"Math","papers":3},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":2},{"task":"/task/graph-property-prediction","name":"Graph Property Prediction","papers":2},{"task":"/task/graph-regression","name":"Graph Regression","papers":2},{"task":"/task/image-super-resolution","name":"Image Super-Resolution","papers":2},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":2},{"task":"/task/math-word-problem-solving","name":"Math Word Problem Solving","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":2},{"task":"/task/super-resolution","name":"Super-Resolution","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":2},{"task":"/task/3d-anomaly-detection","name":"3D Anomaly Detection","papers":1},{"task":"/task/3d-anomaly-detection-and-segmentation","name":"3D Anomaly Detection and Segmentation","papers":1}],"tasks_shown":20,"n_tasks":60,"usage_by_year":[{"year":"2019","papers":3},{"year":"2020","papers":2},{"year":"2021","papers":3},{"year":"2022","papers":6},{"year":"2023","papers":7},{"year":"2024","papers":18},{"year":"2025","papers":7}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/gts"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=GTS","read_at":"2026-10-05T00:57:22+00:00","query":"GTS","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2602.14077"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2602.14077","citations":0},"leading_other_bearer":{"arxiv_id":"2505.13881","title":"TranSUN: A Preemptive Paradigm to Eradicate Retransformation Bias Intrinsically from Regression Models in Recommender Systems","citations":6,"named_by":["acronym_expansion"],"bearer_name":"Generalized TranSUN (GTS)","ask_with":"have('2505.13881')"},"n_other_bearers_listed":1,"note":"'GTS' is ALSO the name of 'Generalized TranSUN (GTS)', a method in 'TranSUN: A Preemptive Paradigm to Eradicate Retransformation Bias Intrinsically from Regression Models in Recommender Systems' (arXiv:2505.13881, 6 citations), which is cited more than the paper this answer is about (0). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2602.14077","page":null,"syntology_url":"https://syntology.ai/paper/2602.14077","in_graph_layer":false,"samples":0},"line":"the paper matched by title, arXiv:2602.14077, held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2602.14077, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2602.14077) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"d88a87a18f3994ea9446b46657500620b8392809877458acfb264859eae6547a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}