{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AHXSJDQKANLRBKLHQ3LTNLZ22L","short_pith_number":"pith:AHXSJDQK","schema_version":"1.0","canonical_sha256":"01ef248e0a035710a96786d736af3ad2facac6464db86677c1a1ed8ed294cb77","source":{"kind":"arxiv","id":"2109.08231","version":1},"attestation_state":"computed","paper":{"title":"RAPID-RL: A Reconfigurable Architecture with Preemptive-Exits for Efficient Deep-Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adarsh Kumar Kosta, Arijit Raychowdhury, Kaushik Roy, Malik Aqeel Anwar, Priyadarshini Panda","submitted_at":"2021-09-16T21:30:40Z","abstract_excerpt":"Present-day Deep Reinforcement Learning (RL) systems show great promise towards building intelligent agents surpassing human-level performance. However, the computational complexity associated with the underlying deep neural networks (DNNs) leads to power-hungry implementations. This makes deep RL systems unsuitable for deployment on resource-constrained edge devices. To address this challenge, we propose a reconfigurable architecture with preemptive exits for efficient deep RL (RAPID-RL). RAPID-RL enables conditional activation of DNN layers based on the difficulty level of inputs. This allow"},"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":"2109.08231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-16T21:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"486e921cbbb264959d1dd497e69a4b1d05a2065edc16da6309daa324ed5d46a4","abstract_canon_sha256":"e8c6bcb13d8664063d9809732501fa60a5217324ccae06fd0a8885d52fbbc15e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:13.363678Z","signature_b64":"qGTn160GMzLl1J8+V4JqNG3g86ncK3vp1+r6qT0/XJh4n6VPH6Npsa+xJkf53vO8DH1o55Hnzbq8xZghvd2MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ef248e0a035710a96786d736af3ad2facac6464db86677c1a1ed8ed294cb77","last_reissued_at":"2026-07-05T03:15:13.363325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:13.363325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RAPID-RL: A Reconfigurable Architecture with Preemptive-Exits for Efficient Deep-Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adarsh Kumar Kosta, Arijit Raychowdhury, Kaushik Roy, Malik Aqeel Anwar, Priyadarshini Panda","submitted_at":"2021-09-16T21:30:40Z","abstract_excerpt":"Present-day Deep Reinforcement Learning (RL) systems show great promise towards building intelligent agents surpassing human-level performance. However, the computational complexity associated with the underlying deep neural networks (DNNs) leads to power-hungry implementations. This makes deep RL systems unsuitable for deployment on resource-constrained edge devices. To address this challenge, we propose a reconfigurable architecture with preemptive exits for efficient deep RL (RAPID-RL). RAPID-RL enables conditional activation of DNN layers based on the difficulty level of inputs. This allow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.08231","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/2109.08231/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":"2109.08231","created_at":"2026-07-05T03:15:13.363391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.08231v1","created_at":"2026-07-05T03:15:13.363391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.08231","created_at":"2026-07-05T03:15:13.363391+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHXSJDQKANLR","created_at":"2026-07-05T03:15:13.363391+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHXSJDQKANLRBKLH","created_at":"2026-07-05T03:15:13.363391+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHXSJDQK","created_at":"2026-07-05T03:15:13.363391+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/AHXSJDQKANLRBKLHQ3LTNLZ22L","json":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L.json","graph_json":"https://pith.science/api/pith-number/AHXSJDQKANLRBKLHQ3LTNLZ22L/graph.json","events_json":"https://pith.science/api/pith-number/AHXSJDQKANLRBKLHQ3LTNLZ22L/events.json","paper":"https://pith.science/paper/AHXSJDQK"},"agent_actions":{"view_html":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L","download_json":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L.json","view_paper":"https://pith.science/paper/AHXSJDQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.08231&json=true","fetch_graph":"https://pith.science/api/pith-number/AHXSJDQKANLRBKLHQ3LTNLZ22L/graph.json","fetch_events":"https://pith.science/api/pith-number/AHXSJDQKANLRBKLHQ3LTNLZ22L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L/action/storage_attestation","attest_author":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L/action/author_attestation","sign_citation":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L/action/citation_signature","submit_replication":"https://pith.science/pith/AHXSJDQKANLRBKLHQ3LTNLZ22L/action/replication_record"}},"created_at":"2026-07-05T03:15:13.363391+00:00","updated_at":"2026-07-05T03:15:13.363391+00:00"}