{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E3TZ27H4KLZW73HAEXA6EC6YP7","short_pith_number":"pith:E3TZ27H4","schema_version":"1.0","canonical_sha256":"26e79d7cfc52f36fece025c1e20bd87ff0fb628854b19b67076016f1841cb51f","source":{"kind":"arxiv","id":"1906.08809","version":1},"attestation_state":"computed","paper":{"title":"A Deep Reinforcement Learning Approach for Global Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Barnabas Poczos, Haiguang Liao, Kenji Shimada, Levent Burak Kara, Wentai Zhang, Xuliang Dong","submitted_at":"2019-06-20T19:07:01Z","abstract_excerpt":"Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the design of complex hydraulic systems, pipe systems and logistic networks. Existing solutions typically consist of greedy algorithms and hard-coded heuristics. As such, existing approaches suffer from a lack of model flexibility and non-optimum solutions. As an alternative approach, "},"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":"1906.08809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T19:07:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d80a839bc4b2f493a524e392857943e42ffd1925ec2f23f857d11f033948f370","abstract_canon_sha256":"34786067309f471775a14acf54418df9631fca18b49f30281a5ec2141db1fda7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:47.855868Z","signature_b64":"KkZUNY5lqgptMDJOp7BTw6DtwOWwdPL1iGV1Av4vOtWjquoX4e4g5nsX5JJfXfN7mBIRzQWHRDw0JUo5cs/QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26e79d7cfc52f36fece025c1e20bd87ff0fb628854b19b67076016f1841cb51f","last_reissued_at":"2026-05-17T23:42:47.855268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:47.855268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deep Reinforcement Learning Approach for Global Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Barnabas Poczos, Haiguang Liao, Kenji Shimada, Levent Burak Kara, Wentai Zhang, Xuliang Dong","submitted_at":"2019-06-20T19:07:01Z","abstract_excerpt":"Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the design of complex hydraulic systems, pipe systems and logistic networks. Existing solutions typically consist of greedy algorithms and hard-coded heuristics. As such, existing approaches suffer from a lack of model flexibility and non-optimum solutions. As an alternative approach, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08809","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1906.08809","created_at":"2026-05-17T23:42:47.855382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08809v1","created_at":"2026-05-17T23:42:47.855382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08809","created_at":"2026-05-17T23:42:47.855382+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3TZ27H4KLZW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3TZ27H4KLZW73HA","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3TZ27H4","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7","json":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7.json","graph_json":"https://pith.science/api/pith-number/E3TZ27H4KLZW73HAEXA6EC6YP7/graph.json","events_json":"https://pith.science/api/pith-number/E3TZ27H4KLZW73HAEXA6EC6YP7/events.json","paper":"https://pith.science/paper/E3TZ27H4"},"agent_actions":{"view_html":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7","download_json":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7.json","view_paper":"https://pith.science/paper/E3TZ27H4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08809&json=true","fetch_graph":"https://pith.science/api/pith-number/E3TZ27H4KLZW73HAEXA6EC6YP7/graph.json","fetch_events":"https://pith.science/api/pith-number/E3TZ27H4KLZW73HAEXA6EC6YP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7/action/storage_attestation","attest_author":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7/action/author_attestation","sign_citation":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7/action/citation_signature","submit_replication":"https://pith.science/pith/E3TZ27H4KLZW73HAEXA6EC6YP7/action/replication_record"}},"created_at":"2026-05-17T23:42:47.855382+00:00","updated_at":"2026-05-17T23:42:47.855382+00:00"}