{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:28:21Z","timestamp":1763036901619},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>Our news are saturated with claims of \"facts\" made from data. Database research has in the past focused on how to answer queries, but has not devoted much attention to discerning more subtle qualities of the resulting claims, e.g., is a claim \"cherry-picking\"? This paper proposes a framework that models claims based on structured data as parameterized queries. A key insight is that we can learn a lot about a claim by perturbing its parameters and seeing how its conclusion changes. This framework lets us formulate practical fact-checking tasks---reverse-engineering (often intentionally) vague claims, and countering questionable claims---as computational problems. Along with the modeling framework, we develop an algorithmic framework that enables efficient instantiations of \"meta\" algorithms by supplying appropriate algorithmic building blocks. We present real-world examples and experiments that demonstrate the power of our model, efficiency of our algorithms, and usefulness of their results.<\/jats:p>","DOI":"10.14778\/2732286.2732295","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"589-600","source":"Crossref","is-referenced-by-count":92,"title":["Toward computational fact-checking"],"prefix":"10.14778","volume":"7","author":[{"given":"You","family":"Wu","sequence":"first","affiliation":[{"name":"Duke University"}]},{"given":"Pankaj K.","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Duke University"}]},{"given":"Chengkai","family":"Li","sequence":"additional","affiliation":[{"name":"University of Texas, at Arlington"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[{"name":"Duke University"}]},{"given":"Cong","family":"Yu","sequence":"additional","affiliation":[{"name":"Google Research"}]}],"member":"320","published-online":{"date-parts":[[2014,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1513922"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.141"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90072-3"},{"key":"e_1_2_1_4_1","first-page":"94","volume":"88","author":"Bender M. A.","year":"2000","unstructured":"M. A. Bender and M. Farach-Colton . The LCA problem revisited. LATIN , 2000 , 88 -- 94 . M. A. Bender and M. Farach-Colton. The LCA problem revisited. LATIN, 2000, 88--94.","journal-title":"LATIN"},{"key":"e_1_2_1_5_1","first-page":"430","volume":"421","author":"B\u00f6rzs\u00f6nyi S.","year":"2001","unstructured":"S. B\u00f6rzs\u00f6nyi , D. Kossmann , and K. Stocker . The skyline operator. ICDE , 2001 , 421 -- 430 . S. B\u00f6rzs\u00f6nyi, D. Kossmann, and K. Stocker. The skyline operator. ICDE, 2001, 421--430.","journal-title":"The skyline operator. ICDE"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001269.2001288"},{"key":"e_1_2_1_7_1","volume-title":"CIDR","author":"Cohen S.","year":"2011","unstructured":"S. Cohen , C. Li , J. Yang , and C. Yu . Computational journalism: A call to arms to database researchers . CIDR , 2011 . S. Cohen, C. Li, J. Yang, and C. Yu. Computational journalism: A call to arms to database researchers. CIDR, 2011."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453976"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538810"},{"key":"e_1_2_1_10_1","first-page":"470","volume":"459","author":"Fischer J.","year":"2007","unstructured":"J. Fischer and V. Heun . A new succinct representation of rmq-information and improvements in the enhanced suffix array. ESCAPE , 2007 , 459 -- 470 . J. Fischer and V. Heun. A new succinct representation of rmq-information and improvements in the enhanced suffix array. ESCAPE, 2007, 459--470.","journal-title":"ESCAPE"},{"key":"e_1_2_1_11_1","first-page":"238","volume":"228","author":"Ganguly S.","year":"1998","unstructured":"S. Ganguly . Design and analysis of parametric query optimization algorithms. VLDB , 1998 , 228 -- 238 . S. Ganguly. Design and analysis of parametric query optimization algorithms. VLDB, 1998, 228--238.","journal-title":"VLDB"},{"key":"e_1_2_1_12_1","first-page":"159","volume":"152","author":"Gray J.","year":"1996","unstructured":"J. Gray , A. Bosworth , A. Layman , and H. Pirahesh . Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. ICDE , 1996 , 152 -- 159 . J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. ICDE, 1996, 152--159.","journal-title":"ICDE"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.8"},{"key":"e_1_2_1_15_1","first-page":"777","volume":"766","author":"Hulgeri A.","year":"2003","unstructured":"A. Hulgeri and S. Sudarshan . AniPQO: Almost non-intrusive parametric query optimization for nonlinear cost functions. VLDB , 2003 , 766 -- 777 . A. Hulgeri and S. Sudarshan. AniPQO: Almost non-intrusive parametric query optimization for nonlinear cost functions. VLDB, 2003, 766--777.","journal-title":"VLDB"},{"key":"e_1_2_1_16_1","first-page":"114","volume":"103","author":"Ioannidis Y. E.","year":"1992","unstructured":"Y. E. Ioannidis , R. T. Ng , K. Shim , and T. K. Sellis . Parametric query optimization. VLDB , 1992 , 103 -- 114 . Y. E. Ioannidis, R. T. Ng, K. Shim, and T. K. Sellis. Parametric query optimization. VLDB, 1992, 103--114.","journal-title":"Parametric query optimization. VLDB"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000828"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448953"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247495"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448941"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804683"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989408"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807172"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559902"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_2_1_28_1","volume-title":"Toward computational fact-checking. Technical report","author":"Wu Y.","year":"2013","unstructured":"Y. Wu , P. K. Agarwal , C. Li , J. Yang , and C. Yu . Toward computational fact-checking. Technical report , Duke University , 2013 . http:\/\/www.cs.duke.edu\/dbgroup\/papers\/WuAgarwalEtAl-13-fact_check.pdf. Y. Wu, P. K. Agarwal, C. Li, J. Yang, and C. Yu. Toward computational fact-checking. Technical report, Duke University, 2013. http:\/\/www.cs.duke.edu\/dbgroup\/papers\/WuAgarwalEtAl-13-fact_check.pdf."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213882"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732286.2732295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:01:37Z","timestamp":1672225297000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732286.2732295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":29,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.14778\/2732286.2732295"],"URL":"https:\/\/doi.org\/10.14778\/2732286.2732295","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}