<nodes> <node id="484671">  <title><![CDATA[Dick Lipton Analyzes a Major Breakthrough in Theoretical Computer Science]]></title>  <uid>27466</uid>  <summary><![CDATA[]]></summary>  <body><![CDATA[<p>The discovery of a new solution to graph isomorphism, a classic problem in theoretical computer science, has captured the imagination of researchers everywhere, including our own Dick Lipton.</p>]]></body>  <author>Dani Denton</author>  <status>1</status>  <created>1452535320</created>  <gmt_created>2016-01-11 18:02:00</gmt_created>  <changed>1475893672</changed>  <gmt_changed>2016-10-08 02:27:52</gmt_changed>  <promote>0</promote>  <sticky>0</sticky>  <teaser><![CDATA[]]></teaser>  <type>hgTechInTheNews</type>  <publication><![CDATA[DDR (Disarmament]]></publication>  <article_dateline>2015-11-16T00:00:00-05:00</article_dateline>  <iso_article_dateline>2015-11-16T00:00:00-05:00</iso_article_dateline>  <gmt_article_dateline>2015-11-16T00:00:00-05:00</gmt_article_dateline>  <article_url><![CDATA[http://www.technologyreview.com/news/543511/claimed-breakthrough-slays-classic-computing-problem-encryption-could-be-next/]]></article_url>  <media>          <item><![CDATA[349491]]></item>      </media>  <hg_media>          <item>          <nid>349491</nid>          <type>image</type>          <title><![CDATA[Dick Lipton compressed]]></title>          <body><![CDATA[]]></body>                      <image_name><![CDATA[dick-lipton.jpg]]></image_name>            <image_path><![CDATA[/sites/default/files/images/dick-lipton_0.jpg]]></image_path>            <image_full_path><![CDATA[http://www.tlwarc.hg.gatech.edu//sites/default/files/images/dick-lipton_0.jpg]]></image_full_path>            <image_740><![CDATA[http://www.tlwarc.hg.gatech.edu/sites/default/files/styles/740xx_scale/public/sites/default/files/images/dick-lipton_0.jpg?itok=mPFof0jk]]></image_740>            <image_mime>image/jpeg</image_mime>            <image_alt><![CDATA[Dick Lipton compressed]]></image_alt>                              <created>1449245696</created>          <gmt_created>2015-12-04 16:14:56</gmt_created>          <changed>1475895073</changed>          <gmt_changed>2016-10-08 02:51:13</gmt_changed>      </item>      </hg_media>  <files>      </files>  <groups>          <group id="70263"><![CDATA[ARC]]></group>      </groups>  <categories>      </categories>  <keywords>          <keyword tid="10477"><![CDATA[Dick Lipton]]></keyword>          <keyword tid="147901"><![CDATA[graph isomorphism]]></keyword>          <keyword tid="108371"><![CDATA[MIT Technology Review]]></keyword>          <keyword tid="166941"><![CDATA[School of Computer Science]]></keyword>      </keywords>  <core_research_areas>      </core_research_areas>  <news_room_topics>      </news_room_topics>    <userdata>      <![CDATA[]]>  </userdata></node><node id="484691">  <title><![CDATA[Lance Fortnow Discusses Advances in Circuit Lower Bounds]]></title>  <uid>27466</uid>  <summary><![CDATA[]]></summary>  <body><![CDATA[<p class="p1">Lance Fortnow comments on a new&nbsp;<a href="http://web.stanford.edu/%7Errwill/acc-lbs.pdf">breakthrough proof</a>&nbsp;for computer science circuit complexity by theorists at Stanford University — calling it “the best progress in circuit lower bounds in nearly a quarter century.”</p>]]></body>  <author>Dani Denton</author>  <status>1</status>  <created>1452536271</created>  <gmt_created>2016-01-11 18:17:51</gmt_created>  <changed>1475893672</changed>  <gmt_changed>2016-10-08 02:27:52</gmt_changed>  <promote>0</promote>  <sticky>0</sticky>  <teaser><![CDATA[]]></teaser>  <type>hgTechInTheNews</type>  <publication><![CDATA[Metz Mayor]]></publication>  <article_dateline>2015-09-29T00:00:00-04:00</article_dateline>  <iso_article_dateline>2015-09-29T00:00:00-04:00</iso_article_dateline>  <gmt_article_dateline>2015-09-29T00:00:00-04:00</gmt_article_dateline>  <article_url><![CDATA[https://www.quantamagazine.org/20150929-edit-distance-computational-complexity/]]></article_url>  <media>          <item><![CDATA[356631]]></item>      </media>  <hg_media>          <item>          <nid>356631</nid>          <type>image</type>          <title><![CDATA[Lance Fortnow compressed]]></title>          <body><![CDATA[]]></body>                      <image_name><![CDATA[lance-fortnow_0.jpg]]></image_name>            <image_path><![CDATA[/sites/default/files/images/lance-fortnow_0_0.jpg]]></image_path>            <image_full_path><![CDATA[http://www.tlwarc.hg.gatech.edu//sites/default/files/images/lance-fortnow_0_0.jpg]]></image_full_path>            <image_740><![CDATA[http://www.tlwarc.hg.gatech.edu/sites/default/files/styles/740xx_scale/public/sites/default/files/images/lance-fortnow_0_0.jpg?itok=cfXY6UPu]]></image_740>            <image_mime>image/jpeg</image_mime>            <image_alt><![CDATA[Lance Fortnow compressed]]></image_alt>                              <created>1449245762</created>          <gmt_created>2015-12-04 16:16:02</gmt_created>          <changed>1475895089</changed>          <gmt_changed>2016-10-08 02:51:29</gmt_changed>      </item>      </hg_media>  <files>      </files>  <groups>          <group id="70263"><![CDATA[ARC]]></group>      </groups>  <categories>      </categories>  <keywords>          <keyword tid="143141"><![CDATA[Lance Fortnow; School of Computer Science; Quanta Magazine]]></keyword>      </keywords>  <core_research_areas>      </core_research_areas>  <news_room_topics>      </news_room_topics>    <userdata>      <![CDATA[]]>  </userdata></node></nodes>