Fetching the paper…
Reading the bibliography…
A graph is a fundamental data model to represent various entities and their complex relationships in society and nature, such as social networks, transportation networks, and financial networks.
R. Ye, C. Zhang, R. Wang, S. Xu, and Y. Zhang, “Language is all a graph needs,” in Findings of EACL , 2024, pp. 1955–1973
1973
Earlier work this paper cites.
A. K. Debnath et al. , “Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity,” Journal of Medicinal Chemistry , vol. 34, no. 2, pp. 786–797, 1991
1991
Earlier work this paper cites.
D. Eppstein, “Finding the k shortest paths,” SIAM Journal on computing , vol. 28, no. 2, pp. 652–673, 1998
1998
Earlier work this paper cites.
C. L. Giles, K. D. Bollacker, and S. Lawrence, “Citeseer: An automatic citation indexing system,” in Proceedings of the third ACM conference on Digital libraries , 1998, pp. 89–98
1998
Earlier work this paper cites.
J. M. Kleinberg, R. Kumar et al. , “The web as a graph: Measurements, models, and methods,” in COCOON , 1999, pp. 1–17
1999
Earlier work this paper cites.
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, “Graph structure in the web,” Computer networks , vol. 33, no. 1-6, pp. 309–320, 2000
2000
Earlier work this paper cites.
A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, pp. 127–163, 2000
2000
Earlier work this paper cites.
K. Papineni, S. Roukos et al. , “Bleu: a method for automatic evaluation of machine translation,” in ACL , 2002, pp. 311–318
2002
Earlier work this paper cites.
H. Toivonen, A. Srinivasan, R. D. King, S. Kramer, and C. Helma, “Statistical evaluation of the predictive toxicology challenge 2000–2001,” Bioinformatics , vol. 19, no. 10, pp. 1183–1193, 2003
2003
Earlier work this paper cites.
C.-Y. Lin, “Rouge: A package for automatic evaluation of summaries,” in Text summarization branches out , 2004, pp. 74–81
2004
Earlier work this paper cites.
K. M. Borgwardt, C. S. Ong, S. Schönauer, S. Vishwanathan, A. J. Smola, and H.-P. Kriegel, “Protein function prediction via graph kernels,” Bioinformatics , vol. 21, no. suppl_1, pp. i47–i56, 2005
2005
Earlier work this paper cites.
C. Goutte et al. , “A probabilistic interpretation of precision, recall and f-score, with implication for evaluation,” in ECIR , 2005, pp. 345–359
2005
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao et al. , “Arnetminer: extraction and mining of academic social networks,” in SIGKDD , 2008, pp. 990–998
2008
Earlier work this paper cites.
N. Wale, I. A. Watson, and G. Karypis, “Comparison of descriptor spaces for chemical compound retrieval and classification,” Knowledge and Information Systems , vol. 14, pp. 347–375, 2008
2008
Earlier work this paper cites.
K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, “Freebase: a collaboratively created graph database for structuring human knowledge,” in SIGMOD , 2008, pp. 1247–1250
2008
Earlier work this paper cites.
Y. Hong, J. W. Lam, and B. Z. Tang, “Aggregation-induced emission: phenomenon, mechanism and applications,” Chemical communications , no. 29, pp. 4332–4353, 2009
2009
Earlier work this paper cites.
J. Pérez, M. Arenas, and C. Gutierrez, “Semantics and complexity of sparql,” TODS , vol. 34, no. 3, pp. 1–45, 2009
2009
Earlier work this paper cites.
S. M. Iacus, G. King et al. , “Causal inference without balance checking: Coarsened exact matching,” Political analysis , vol. 20, pp. 1–24, 2012
2012
Earlier work this paper cites.
W. M. Campbell, C. K. Dagli, and C. J. Weinstein, “Social network analysis with content and graphs,” Lincoln Laboratory Journal , vol. 20, no. 1, pp. 61–81, 2013
2013
Earlier work this paper cites.
X. Kong, J. Zhang, and P. S. Yu, “Inferring anchor links across multiple heterogeneous social networks,” in CIKM , 2013, pp. 179–188
2013
Earlier work this paper cites.
M. A. Rodriguez, “The gremlin graph traversal machine and language (invited talk),” in DBPL , 2015, pp. 1–10
2015
Earlier work this paper cites.
R. Rossi and N. Ahmed, “The network data repository with interactive graph analytics and visualization,” in AAAI , vol. 29, no. 1, 2015
2015
Earlier work this paper cites.
M. Scutari et al. , “Bayesian networks with examples in r,” 2015
2015
Earlier work this paper cites.
K. Toutanova and D. Chen, “Observed versus latent features for knowledge base and text inference,” in ACL Workshop , 2015, pp. 57–66
2015
Earlier work this paper cites.
W.-t. Yih, M. Richardson et al. , “The value of semantic parse labeling for knowledge base question answering,” in ACL , 2016, pp. 201–206
2016
Earlier work this paper cites.
A. E. Johnson, T. J. Pollard, L. Shen et al. , “Mimic-iii, a freely accessible critical care database,” Scientific data , vol. 3, no. 1, pp. 1–9, 2016
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” NeurIPS , vol. 30, 2017
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero et al. , “Graph attention networks,” stat , vol. 1050, no. 20, pp. 10–48 550, 2017
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley et al. , “Neural message passing for quantum chemistry,” in ICML , 2017, pp. 1263–1272
2017
Earlier work this paper cites.
E. Choi, M. T. Bahadori et al. , “Gram: graph-based attention model for healthcare representation learning,” in SIGKDD , 2017, pp. 787–795
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Z. Wu, B. Ramsundar, E. N. Feinberg, J. Gomes, C. Geniesse, A. S. Pappu, K. Leswing, and V. Pande, “Moleculenet: a benchmark for molecular machine learning,” Chemical science , vol. 9, no. 2, pp. 513–530, 2018
2018
Earlier work this paper cites.
L. Liao, X. He, H. Zhang, and T.-S. Chua, “Attributed social network embedding,” TKDE , vol. 30, no. 12, pp. 2257–2270, 2018
2018
Earlier work this paper cites.
N. Francis, A. Green, and P. e. a. Guagliardo, “Cypher: An evolving query language for property graphs,” in SIGMOD , 2018, pp. 1433–1445
2018
Earlier work this paper cites.
Y. Zhang, H. Dai, Z. Kozareva et al. , “Variational reasoning for question answering with knowledge graph,” in AAAI , vol. 32, no. 1, 2018
2018
Earlier work this paper cites.
A. Talmor and J. Berant, “The web as a knowledge-base for answering complex questions,” in NAACL , 2018, pp. 641–651
2018
Earlier work this paper cites.
M. Wan and J. McAuley, “Item recommendation on monotonic behavior chains,” in RecSys , 2018, pp. 86–94
2018
Earlier work this paper cites.
A. Bojchevski and S. Günnemann, “Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking,” in ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
J. Ni, J. Li et al. , “Justifying recommendations using distantly-labeled reviews and fine-grained aspects,” in EMNLP , 2019, pp. 188–197
2019
Earlier work this paper cites.
Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, and X. Lin, “A survey of community search over big graphs,” VLDB Journal , vol. 29, pp. 353–392, 2020
2020
Earlier work this paper cites.
Z. Wu, S. Pan, F. Chen et al. , “A comprehensive survey on graph neural networks,” TNNLS , vol. 32, no. 1, pp. 4–24, 2020
2020
Earlier work this paper cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang et al. , “Graph neural networks: A review of methods and applications,” AI open , vol. 1, pp. 57–81, 2020
2020
Earlier work this paper cites.
B. Wang, R. Shin et al. , “Rat-sql: Relation-aware schema encoding and linking for text-to-sql parsers,” in ACL , 2020, pp. 7567–7578
2020
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” NeurIPS , vol. 33, pp. 22 118–22 133, 2020
2020
Earlier work this paper cites.
H. Huang et al. , “An analysis framework of research frontiers based on the large-scale open academic graph,” ASIST , vol. 57, p. e307, 2020
2020
Earlier work this paper cites.
W. Cong, M. Ramezani, and M. Mahdavi, “On provable benefits of depth in training graph convolutional networks,” NeurIPS , vol. 34, pp. 9936–9949, 2021
2021
Earlier work this paper cites.
B. Wang and A. Komatsuzaki, “Gpt-j-6b: A 6 billion parameter autoregressive language model,” 2021
2021
Earlier work this paper cites.
X. Wang, T. Gao, Z. Zhu, Z. Zhang, Z. Liu, J. Li, and J. Tang, “Kepler: A unified model for knowledge embedding and pre-trained language representation,” ACL , vol. 9, pp. 176–194, 2021
2021
Earlier work this paper cites.
Y. Gu, S. Kase, M. Vanni, B. Sadler, P. Liang, X. Yan, and Y. Su, “Beyond iid: three levels of generalization for question answering on knowledge bases,” in WWW . ACM, 2021, pp. 3477–3488
2021
Earlier work this paper cites.
2021
Earlier work this paper cites.
J. Wei, M. Bosma, V. Zhao, K. Guu, A. W. Yu, B. Lester et al. , “Finetuned language models are zero-shot learners,” in ICLR , 2022
2022
Earlier work this paper cites.
L. Ouyang, J. Wu, X. Jiang, D. Almeida, C. Wainwright et al. , “Training language models to follow instructions with human feedback,” NeurIPS , vol. 35, pp. 27 730–27 744, 2022
2022
Earlier work this paper cites.
M. M. Li, K. Huang, and M. Zitnik, “Graph representation learning in biomedicine and healthcare,” Nature Biomedical Engineering , vol. 6, no. 12, pp. 1353–1369, 2022
2022
Earlier work this paper cites.
S. Wu, F. Sun et al. , “Graph neural networks in recommender systems: a survey,” ACM Computing Surveys , vol. 55, no. 5, pp. 1–37, 2022
2022
Earlier work this paper cites.
J. Wei, X. Wang, D. Schuurmans, M. Bosma, F. Xia, E. Chi, Q. V. Le, D. Zhou et al. , “Chain-of-thought prompting elicits reasoning in large language models,” NeurIPS , vol. 35, pp. 24 824–24 837, 2022
2022
Earlier work this paper cites.
A. Perevalov, D. Diefenbach, R. Usbeck, and A. Both, “Qald-9-plus: A multilingual dataset for question answering over dbpedia and wikidata translated by native speakers,” in ICSC , 2022, pp. 229–234
2022
Earlier work this paper cites.
F. Xia, B. Li et al. , “MedConQA: Medical conversational question answering system based on knowledge graphs,” in EMNLP , 2022
2022
Earlier work this paper cites.
2023
Earlier work this paper cites.
Y. Zhuang, Y. Yu et al. , “Toolqa: A dataset for llm question answering with external tools,” NeurIPS , vol. 36, pp. 50 117–50 143, 2023
2023
Earlier work this paper cites.
B. Zhang, B. Haddow et al. , “Prompting large language model for machine translation: A case study,” in ICML , 2023, pp. 41 092–41 110
2023
Cited alongside, same era.
A. Ni, S. Iyer, D. Radev, V. Stoyanov, W.-t. Yih, S. Wang, and X. V. Lin, “Lever: Learning to verify language-to-code generation with execution,” in ICML , 2023, pp. 26 106–26 128
2023
Cited alongside, same era.
S. Fan, X. Wang, C. Shi, P. Cui, and B. Wang, “Generalizing graph neural networks on out-of-distribution graphs,” TPAMI , 2023
2023
Cited alongside, same era.
H. Yan, C. Li, R. Long, C. Yan, J. Zhao, W. Zhuang, J. Yin, P. Zhang et al. , “A comprehensive study on text-attributed graphs: Benchmarking and rethinking,” NeurIPS , vol. 36, pp. 17 238–17 264, 2023
2023
Cited alongside, same era.
J. Zhao, M. Qu, C. Li, H. Yan, Q. Liu et al. , “Learning on large-scale text-attributed graphs via variational inference,” in ICLR , 2023
W. Wei, X. Ren, J. Tang, Q. Wang, L. Su, S. Cheng, J. Wang, D. Yin, and C. Huang, “Llmrec: Large language models with graph augmentation for recommendation,” in WSDM , 2024, pp. 806–815
2024
Closest in time.
L. Wu, Z. Qiu, Z. Zheng, H. Zhu, and E. Chen, “Exploring large language model for graph data understanding in online job recommendations,” in AAAI , vol. 38, no. 8, 2024, pp. 9178–9186
2024
Closest in time.
Y. Zhang, H. Wang et al. , “Can llm graph reasoning generalize beyond pattern memorization?” in Findings of EMNLP , 2024, pp. 2289–2305
2024
Closest in time.
2024
Closest in time.
B. Fatemi, J. Halcrow, and B. Perozzi, “Talk like a graph: Encoding graphs for large language models,” in ICLR , 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2024
Closest in time.
S. G. Patil, T. Zhang et al. , “Gorilla: Large language model connected with massive apis,” NeurIPS , vol. 37, pp. 126 544–126 565, 2024
2024
Closest in time.
X. Huang, K. Han, Y. Yang, D. Bao, Q. Tao, Z. Chai, and Q. Zhu, “Can gnn be good adapter for llms?” in WWW , 2024, pp. 893–904
2024
Closest in time.
Z. Chen, H. Mao, H. Wen, H. Han, W. Jin, H. Zhang, H. Liu, and J. Tang, “Label-free node classification on graphs with large language models (llms),” in ICLR , 2024
2024
Closest in time.
Z. Chen, H. Mao, H. Li, W. Jin, H. Wen, X. Wei, S. Wang, D. Yin, W. Fan, H. Liu et al. , “Exploring the potential of large language models (llms) in learning on graphs,” SIGKDD , vol. 25, no. 2, pp. 42–61, 2024
2024
Closest in time.
D. Shu, T. Chen, M. Jin, C. Zhang, M. Du et al. , “Knowledge graph large language model (kg-llm) for link prediction,” in ACML , 2024
2024
Closest in time.
B. Bi, S. Liu, Y. Wang et al. , “Lpnl: Scalable link prediction with large language models,” in Findings of ACL , 2024, pp. 3615–3625
2024
Closest in time.
R. Chen, T. Zhao, A. K. JAISWAL, N. Shah, and Z. Wang, “Llaga: Large language and graph assistant,” in ICML , 2024
2024
Closest in time.
M. Zhang, M. Sun, P. Wang, S. Fan, Y. Mo, X. Xu, H. Liu, C. Yang, and C. Shi, “Graphtranslator: Aligning graph model to large language model for open-ended tasks,” in WWW , 2024, pp. 1003–1014
2024
Closest in time.
Y. Zhu, Y. Wang et al. , “Efficient tuning and inference for large language models on textual graphs,” in IJCAI , 2024, pp. 5734–5742
2024
Closest in time.
J. Han, N. Collier, W. Buntine, and E. Shareghi, “PiVe: Prompting with iterative verification improving graph-based generative capability of LLMs,” in Findings of ACL , Aug. 2024
2024
Closest in time.
B. Zhang et al. , “Extract, define, canonicalize: An llm-based framework for knowledge graph construction,” in EMNLP , 2024, pp. 9820–9836
2024
Closest in time.
Y. Wen, Z. Wang, and J. Sun, “MindMap: Knowledge graph prompting sparks graph of thoughts in large language models,” in ACL , Aug. 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
D. Das, I. Gupta, J. Srivastava, and D. Kang, “Which modality should i use-text, motif, or image?: Understanding graphs with large language models,” in Findings of NAACL , 2024, pp. 503–519
2024
Closest in time.
K. Sun, Y. Xu, H. Zha, Y. Liu, and X. L. Dong, “Head-to-tail: How knowledgeable are large language models (llms)? aka will llms replace knowledge graphs?” in NAACL , 2024, pp. 311–325
2024
Closest in time.
X. He, Y. Tian, Y. Sun, N. Chawla, T. Laurent et al. , “G-retriever: Retrieval-augmented generation for textual graph understanding and question answering,” NeurIPS , vol. 37, pp. 132 876–132 907, 2024
2024
Closest in time.
L. Yang, H. Chen, Z. Li, X. Ding, and X. Wu, “Give us the facts: Enhancing large language models with knowledge graphs for fact-aware language modeling,” TKDE , 2024
2024
Closest in time.
2024
Closest in time.
S. Ma, C. Xu, X. Jiang et al. , “Think-on-graph 2.0: Deep and interpretable large language model reasoning with knowledge graph-guided retrieval,” arXiv e-prints , pp. arXiv–2407, 2024
2024
Closest in time.
2024
Closest in time.
Q. Li, Z. Chen, C. Ji, S. Jiang, and J. Li, “Llm-based multi-level knowledge generation for few-shot knowledge graph completion,” in IJCAI , vol. 271494703, 2024
2024
Closest in time.
Y. Wang, N. Lipka, R. A. Rossi, A. Siu, R. Zhang, and T. Derr, “Knowledge graph prompting for multi-document question answering,” in AAAI , vol. 38, no. 17, 2024, pp. 19 206–19 214
2024
Closest in time.
M. Shah and J. Tian, “Improving llm-based kgqa for multi-hop question answering with implicit reasoning in few-shot examples,” in ACL KaLLM 2024 , 2024, pp. 125–135
2024
Closest in time.
U. M. Sehwag, K. Papasotiriou, J. Vann, and S. Ganesh, “In-context learning with topological information for llm-based knowledge graph completion,” in ICML Workshop , 2024
2024
Closest in time.
N. Giarelis, C. Mastrokostas, and N. Karacapilidis, “A unified llm-kg framework to assist fact-checking in public deliberation,” in LREC-COLING Workshop , 2024, pp. 13–19
2024
Closest in time.
Z. Li, Y. Xie, R. Shao, G. Chen, D. Jiang, and L. Nie, “Optimus-1: Hybrid multimodal memory empowered agents excel in long-horizon tasks,” in NeurIPS , 2024
2024
Closest in time.
2024
Closest in time.
H. Abu-Rasheed, C. Weber, and M. Fathi, “Knowledge graphs as context sources for llm-based explanations of learning recommendations,” in EDUCON , 2024, pp. 1–5
2024
Closest in time.
K. Ouyang, Y. Liu, S. Li et al. , “Modal-adaptive knowledge-enhanced graph-based financial prediction from monetary policy conference calls with llm,” in COLING Workshop , 2024, pp. 59–69
2024
Closest in time.
G. Lu, X. Ju, X. Chen, W. Pei, and Z. Cai, “Grace: Empowering llm-based software vulnerability detection with graph structure and in-context learning,” JSS , vol. 212, p. 112031, 2024
2024
Closest in time.
W. Li, Z. Yu, Q. She et al. , “Llm-enhanced scene graph learning for household rearrangement,” in SIGGRAPH , 2024, pp. 1–11
2024
Closest in time.
J. Yang, H. Jin, R. Tang, X. Han, Q. Feng, H. Jiang, S. Zhong, B. Yin, and X. Hu, “Harnessing the power of llms in practice: A survey on chatgpt and beyond,” TKDD , vol. 18, no. 6, pp. 1–32, 2024
2024
Closest in time.
2024
Closest in time.
T. Schick, J. Dwivedi-Yu, R. Dessì et al. , “Toolformer: Language models can teach themselves to use tools,” NeurIPS , vol. 36, 2024
2024
Closest in time.
Q. Dong, L. Li, D. Dai et al. , “A survey on in-context learning,” in EMNLP , 2024, pp. 1107–1128
2024
Closest in time.
F. Song, B. Yu, M. Li, H. Yu, F. Huang, Y. Li, and H. Wang, “Preference ranking optimization for human alignment,” in AAAI , vol. 38, no. 17, 2024, pp. 18 990–18 998
2024
Closest in time.
S. Pan, L. Luo, Y. Wang, C. Chen, J. Wang, and X. Wu, “Unifying large language models and knowledge graphs: A roadmap,” TKDE , 2024
2024
Closest in time.
Y. Zhu, X. Wang, and J. e. a. Chen, “Llms for knowledge graph construction and reasoning: Recent capabilities and future opportunities,” World Wide Web , vol. 27, no. 5, p. 58, 2024
2024
Closest in time.
J. Tang, Y. Yang, W. Wei, L. Shi, L. Su, S. Cheng, D. Yin, and C. Huang, “Graphgpt: Graph instruction tuning for large language models,” in SIGIR , 2024, pp. 491–500
2024
Closest in time.
X. Wu, Y. Shen, C. Shan, K. Song, S. Wang, B. Zhang, J. Feng, H. Cheng, W. Chen, Y. Xiong et al. , “Can graph learning improve planning in llm-based agents?” in NeurIPS , 2024
2024
Closest in time.
Y. Peng, S. Lin, Q. Chen, S. Wang, L. Xu, X. Ren, Y. Li, and J. Xu, “Chatgraph: Chat with your graphs,” in ICDE , 2024, pp. 5445–5448
2024
Closest in time.
S. Han, H. Schoelkopf, Y. Zhao et al. , “Folio: Natural language reasoning with first-order logic,” in EMNLP , 2024, pp. 22 017–22 031
2024
Closest in time.
H. Mao, Z. Chen, and W. e. a. Tang, “Position: Graph foundation models are already here,” in ICML , 2024
2024
Closest in time.
2024
Closest in time.
F. Guan, T. Zhu, W. Zhou, and K.-K. R. Choo, “Graph neural networks: a survey on the links between privacy and security,” Artificial Intelligence Review , vol. 57, no. 2, p. 40, 2024
2024
Closest in time.
2025
Closest in time.
J. Liu, C. Yang, Z. Lu, J. Chen, Y. Li, M. Zhang, T. Bai, Y. Fang, L. Sun, P. S. Yu et al. , “Graph foundation models: Concepts, opportunities and challenges,” TPAMI , 2025
2025
Closest in time.
2025
Closest in time.
E. Lavrinovics, R. Biswas, J. Bjerva, and K. Hose, “Knowledge graphs, large language models, and hallucinations: An nlp perspective,” Journal of Web Semantics , vol. 85, p. 100844, 2025
2025
Closest in time.
J. Tang, Q. Zhang, Y. Li, and J. Li, “Grapharena: Benchmarking large language models on graph computational problems,” ICLR , 2025
2025
Closest in time.
S. Zhang, P. Sun, S. Chen, M. Xiao, W. Shao, W. Zhang, Y. Liu, K. Chen, and P. Luo, “Gpt4roi: Instruction tuning large language model on region-of-interest,” in ECCV , 2025, pp. 52–70
2025
Closest in time.
S. Liu, Z. Zeng, L. Chen et al. , “Tigervector: Supporting vector search in graph databases for advanced rags,” in ICMD , 2025, pp. 553–565
2025
Closest in time.
2025
Closest in time.
Q. Li, X. Li, L. Chen, and D. Wu, “Distilling knowledge on text graph for social media attribute inference,” in SIGIR , 2022, pp. 2024–2028
2028
Closest in time.
A. Patel, S. Bhattamishra, and N. Goyal, “Are nlp models really able to solve simple math word problems?” in NAACL , 2021, pp. 2080–2094
2094
Closest in time.