{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LTRESBWWOCXEUBCGFKVQ2UL7LF","short_pith_number":"pith:LTRESBWW","schema_version":"1.0","canonical_sha256":"5ce24906d670ae4a04462aab0d517f59567d8c367f927136980b153ee0ffe5ea","source":{"kind":"arxiv","id":"1908.04484","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning based Interconnection Routing for Adaptive Traffic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR","cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Chao-Han Huck Yang, Pin-Yu Chen, Sheng-Chun Kao, Tushar Krishna, Xiaoli Ma","submitted_at":"2019-08-13T04:35:40Z","abstract_excerpt":"Applying Machine Learning (ML) techniques to design and optimize computer architectures is a promising research direction. Optimizing the runtime performance of a Network-on-Chip (NoC) necessitates a continuous learning framework. In this work, we demonstrate the promise of applying reinforcement learning (RL) to optimize NoC runtime performance. We present three RL-based methods for learning optimal routing algorithms. The experimental results show the algorithms can successfully learn a near-optimal solution across different environment states. Reproducible Code: github.com/huckiyang/interco"},"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":"1908.04484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-08-13T04:35:40Z","cross_cats_sorted":["cs.AI","cs.AR","cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"074963f50a8a1898603ae25621f4210cc81351d382f3571c31895ef66ecbd1a1","abstract_canon_sha256":"79196dc7852d6c01838fc776791eb705e5c2c91ca106d879f30144a3d0fd4dbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:14.043613Z","signature_b64":"eAs4bULnQaCCMAhM8ZO2BqCoc1k8eo63yQZN1X+rHtROeq/khN2Q788QRfh1dseQMl2H7fXT/C4abYWCOeOfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce24906d670ae4a04462aab0d517f59567d8c367f927136980b153ee0ffe5ea","last_reissued_at":"2026-07-04T23:55:14.043146Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:14.043146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning based Interconnection Routing for Adaptive Traffic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR","cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Chao-Han Huck Yang, Pin-Yu Chen, Sheng-Chun Kao, Tushar Krishna, Xiaoli Ma","submitted_at":"2019-08-13T04:35:40Z","abstract_excerpt":"Applying Machine Learning (ML) techniques to design and optimize computer architectures is a promising research direction. Optimizing the runtime performance of a Network-on-Chip (NoC) necessitates a continuous learning framework. In this work, we demonstrate the promise of applying reinforcement learning (RL) to optimize NoC runtime performance. We present three RL-based methods for learning optimal routing algorithms. The experimental results show the algorithms can successfully learn a near-optimal solution across different environment states. Reproducible Code: github.com/huckiyang/interco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04484","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04484/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":"1908.04484","created_at":"2026-07-04T23:55:14.043213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04484v1","created_at":"2026-07-04T23:55:14.043213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04484","created_at":"2026-07-04T23:55:14.043213+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTRESBWWOCXE","created_at":"2026-07-04T23:55:14.043213+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTRESBWWOCXEUBCG","created_at":"2026-07-04T23:55:14.043213+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTRESBWW","created_at":"2026-07-04T23:55:14.043213+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/LTRESBWWOCXEUBCGFKVQ2UL7LF","json":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF.json","graph_json":"https://pith.science/api/pith-number/LTRESBWWOCXEUBCGFKVQ2UL7LF/graph.json","events_json":"https://pith.science/api/pith-number/LTRESBWWOCXEUBCGFKVQ2UL7LF/events.json","paper":"https://pith.science/paper/LTRESBWW"},"agent_actions":{"view_html":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF","download_json":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF.json","view_paper":"https://pith.science/paper/LTRESBWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04484&json=true","fetch_graph":"https://pith.science/api/pith-number/LTRESBWWOCXEUBCGFKVQ2UL7LF/graph.json","fetch_events":"https://pith.science/api/pith-number/LTRESBWWOCXEUBCGFKVQ2UL7LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF/action/storage_attestation","attest_author":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF/action/author_attestation","sign_citation":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF/action/citation_signature","submit_replication":"https://pith.science/pith/LTRESBWWOCXEUBCGFKVQ2UL7LF/action/replication_record"}},"created_at":"2026-07-04T23:55:14.043213+00:00","updated_at":"2026-07-04T23:55:14.043213+00:00"}