{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3Q5S4L6TVCUAMPQ7BRRF226ESE","short_pith_number":"pith:3Q5S4L6T","schema_version":"1.0","canonical_sha256":"dc3b2e2fd3a8a8063e1f0c625d6bc491322fdd8fde3199949bf468148069b894","source":{"kind":"arxiv","id":"2004.09473","version":2},"attestation_state":"computed","paper":{"title":"Attention Routing: track-assignment detailed routing using attention-based reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elias Fallon, Haiguang Liao, Levent Burak Kara, Qingyi Dong, Wangyang Zhang, Weiyi Qi, Wentai Zhang, Xuliang Dong","submitted_at":"2020-04-20T17:50:13Z","abstract_excerpt":"In the physical design of integrated circuits, global and detailed routing are critical stages involving the determination of the interconnected paths of each net on a circuit while satisfying the design constraints. Existing actual routers as well as routability predictors either have to resort to expensive approaches that lead to high computational times, or use heuristics that do not generalize well. Even though new, learning-based routing methods have been proposed to address this need, requirements on labelled data and difficulties in addressing complex design rule constraints have limite"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2004.09473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-20T17:50:13Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8b549d8c0350db693f415ac8c6ecf949396a842f8821026b3fcb825651e9442c","abstract_canon_sha256":"a14cc922a0c3f0c1590c2b104e1bc37b6fd9b9bdb67cec71c12f5c8871137658"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:33.961056Z","signature_b64":"6EWZcpHQpo3WiiGoPbsi4wGD8xuPVgd6EqMqodJ0A8fOh3TrNsDZMKV+EUGkjCY34Aqq9g6H6AfDtRV0YGoWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc3b2e2fd3a8a8063e1f0c625d6bc491322fdd8fde3199949bf468148069b894","last_reissued_at":"2026-07-05T01:06:33.960505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:33.960505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attention Routing: track-assignment detailed routing using attention-based reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elias Fallon, Haiguang Liao, Levent Burak Kara, Qingyi Dong, Wangyang Zhang, Weiyi Qi, Wentai Zhang, Xuliang Dong","submitted_at":"2020-04-20T17:50:13Z","abstract_excerpt":"In the physical design of integrated circuits, global and detailed routing are critical stages involving the determination of the interconnected paths of each net on a circuit while satisfying the design constraints. Existing actual routers as well as routability predictors either have to resort to expensive approaches that lead to high computational times, or use heuristics that do not generalize well. Even though new, learning-based routing methods have been proposed to address this need, requirements on labelled data and difficulties in addressing complex design rule constraints have limite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.09473","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.09473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.09473","created_at":"2026-07-05T01:06:33.960566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.09473v2","created_at":"2026-07-05T01:06:33.960566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.09473","created_at":"2026-07-05T01:06:33.960566+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Q5S4L6TVCUA","created_at":"2026-07-05T01:06:33.960566+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Q5S4L6TVCUAMPQ7","created_at":"2026-07-05T01:06:33.960566+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Q5S4L6T","created_at":"2026-07-05T01:06:33.960566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05915","citing_title":"PCBWorld: A Benchmark Environment for Engine-Grounded PCB Design Automation","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE","json":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE.json","graph_json":"https://pith.science/api/pith-number/3Q5S4L6TVCUAMPQ7BRRF226ESE/graph.json","events_json":"https://pith.science/api/pith-number/3Q5S4L6TVCUAMPQ7BRRF226ESE/events.json","paper":"https://pith.science/paper/3Q5S4L6T"},"agent_actions":{"view_html":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE","download_json":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE.json","view_paper":"https://pith.science/paper/3Q5S4L6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.09473&json=true","fetch_graph":"https://pith.science/api/pith-number/3Q5S4L6TVCUAMPQ7BRRF226ESE/graph.json","fetch_events":"https://pith.science/api/pith-number/3Q5S4L6TVCUAMPQ7BRRF226ESE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE/action/storage_attestation","attest_author":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE/action/author_attestation","sign_citation":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE/action/citation_signature","submit_replication":"https://pith.science/pith/3Q5S4L6TVCUAMPQ7BRRF226ESE/action/replication_record"}},"created_at":"2026-07-05T01:06:33.960566+00:00","updated_at":"2026-07-05T01:06:33.960566+00:00"}