{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FX222MDNIWQB355F7UPQEPYX6L","short_pith_number":"pith:FX222MDN","schema_version":"1.0","canonical_sha256":"2df5ad306d45a01df7a5fd1f023f17f2c0553e5234295ed312af5832bcda7828","source":{"kind":"arxiv","id":"2205.07000","version":1},"attestation_state":"computed","paper":{"title":"PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Bryan Catanzaro, Ilyas Elkin, Jonathan Raiman, Michael Siu, Neel Kant, Rajarshi Roy, Robert Kirby, Saad Godil, Stuart Oberman","submitted_at":"2022-05-14T08:06:55Z","abstract_excerpt":"In this work, we present a reinforcement learning (RL) based approach to designing parallel prefix circuits such as adders or priority encoders that are fundamental to high-performance digital design. Unlike prior methods, our approach designs solutions tabula rasa purely through learning with synthesis in the loop. We design a grid-based state-action representation and an RL environment for constructing legal prefix circuits. Deep Convolutional RL agents trained on this environment produce prefix adder circuits that Pareto-dominate existing baselines with up to 16.0% and 30.2% lower area for "},"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":"2205.07000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-14T08:06:55Z","cross_cats_sorted":["cs.AI","cs.AR"],"title_canon_sha256":"31db07206bafcc65b489b350b8e32dd4a98bebe85923b6d2c2feff3ae3a88d94","abstract_canon_sha256":"2bf10b00d973d97f7584ca1cc716176a8a98ed2df9314b4d0e91ae58030942b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:10.919275Z","signature_b64":"fLzx4BIcFciH+Hh97tjCDvgJj6BCpUkK6H4k+w370rXxpN9igushwDyNb8eAbyc1jzZ85+fgpJzlaU72LJioCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df5ad306d45a01df7a5fd1f023f17f2c0553e5234295ed312af5832bcda7828","last_reissued_at":"2026-07-05T04:23:10.918857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:10.918857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Bryan Catanzaro, Ilyas Elkin, Jonathan Raiman, Michael Siu, Neel Kant, Rajarshi Roy, Robert Kirby, Saad Godil, Stuart Oberman","submitted_at":"2022-05-14T08:06:55Z","abstract_excerpt":"In this work, we present a reinforcement learning (RL) based approach to designing parallel prefix circuits such as adders or priority encoders that are fundamental to high-performance digital design. Unlike prior methods, our approach designs solutions tabula rasa purely through learning with synthesis in the loop. We design a grid-based state-action representation and an RL environment for constructing legal prefix circuits. Deep Convolutional RL agents trained on this environment produce prefix adder circuits that Pareto-dominate existing baselines with up to 16.0% and 30.2% lower area for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07000","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/2205.07000/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":"2205.07000","created_at":"2026-07-05T04:23:10.918921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.07000v1","created_at":"2026-07-05T04:23:10.918921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07000","created_at":"2026-07-05T04:23:10.918921+00:00"},{"alias_kind":"pith_short_12","alias_value":"FX222MDNIWQB","created_at":"2026-07-05T04:23:10.918921+00:00"},{"alias_kind":"pith_short_16","alias_value":"FX222MDNIWQB355F","created_at":"2026-07-05T04:23:10.918921+00:00"},{"alias_kind":"pith_short_8","alias_value":"FX222MDN","created_at":"2026-07-05T04:23:10.918921+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/FX222MDNIWQB355F7UPQEPYX6L","json":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L.json","graph_json":"https://pith.science/api/pith-number/FX222MDNIWQB355F7UPQEPYX6L/graph.json","events_json":"https://pith.science/api/pith-number/FX222MDNIWQB355F7UPQEPYX6L/events.json","paper":"https://pith.science/paper/FX222MDN"},"agent_actions":{"view_html":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L","download_json":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L.json","view_paper":"https://pith.science/paper/FX222MDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.07000&json=true","fetch_graph":"https://pith.science/api/pith-number/FX222MDNIWQB355F7UPQEPYX6L/graph.json","fetch_events":"https://pith.science/api/pith-number/FX222MDNIWQB355F7UPQEPYX6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L/action/storage_attestation","attest_author":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L/action/author_attestation","sign_citation":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L/action/citation_signature","submit_replication":"https://pith.science/pith/FX222MDNIWQB355F7UPQEPYX6L/action/replication_record"}},"created_at":"2026-07-05T04:23:10.918921+00:00","updated_at":"2026-07-05T04:23:10.918921+00:00"}