{"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":"/paper/training-a-fully-convolutional-neural-network","title":"Training a Fully Convolutional Neural Network to Route Integrated Circuits","arxiv_id":"1706.08948","date":"2017-06-27","proceeding":null,"authors":["Sambhav R. Jain","Kye Okabe"],"abstract":"We present a deep, fully convolutional neural network that learns to route a\ncircuit layout net with appropriate choice of metal tracks and wire class\ncombinations. Inputs to the network are the encoded layouts containing spatial\nlocation of pins to be routed. After 15 fully convolutional stages followed by\na score comparator, the network outputs 8 layout layers (corresponding to 4\nroute layers, 3 via layers and an identity-mapped pin layer) which are then\ndecoded to obtain the routed layouts. We formulate this as a binary\nsegmentation problem on a per-pixel per-layer basis, where the network is\ntrained to correctly classify pixels in each layout layer to be 'on' or 'off'.\nTo demonstrate learnability of layout design rules, we train the network on a\ndataset of 50,000 train and 10,000 validation samples that we generate based on\ncertain pre-defined layout constraints. Precision, recall and $F_1$ score\nmetrics are used to track the training progress. Our network achieves\n$F_1\\approx97\\%$ on the train set and $F_1\\approx92\\%$ on the validation set.\nWe use PyTorch for implementing our model. Code is made publicly available at\nhttps://github.com/sjain-stanford/deep-route .","url_abs":"http://arxiv.org/abs/1706.08948v2","url_pdf":"http://arxiv.org/pdf/1706.08948v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"training-a-fully-convolutional-neural-network","repo_url":"https://github.com/sjain-stanford/deep-route","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"layout-design","task_name":"Layout Design"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sjain-stanford/deep-route","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2d6001a069ad537ea4e60bb4235f2a30088d20d398595de65273ab2da81cab06","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}