<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep Data Flow Analysis · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.01470/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2012.01470/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deep Data Flow Analysis — mentioned by igorkraw</title><link>https://news.ycombinator.com/item?id=42469251</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.01470:42469251</guid><pubDate>Fri, 20 Dec 2024 08:24:57 GMT</pubDate><description>&lt;p&gt;The whole point of GNNs is that they generalize to arbitrary topologies by explicitly conditioning the idea of &amp;quot;neighbours&amp;quot; on the graph specifying the topology. Graph layout has been tried here https://github.com/limbo018/DREAMPlace to great fanfare although there is recent drama about it https://www.semanticscholar.org/paper/The-False-Dawn%3A-Reev... . Graph transformations are a thing as well https://arxiv.org/abs/2012.01470 but it&amp;#x27;s a tricky problem because you implicitly need to solve the graph matching problem&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.01470/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
