{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RMIDFDLANS2MWWLOZ3KFNUAO57","short_pith_number":"pith:RMIDFDLA","schema_version":"1.0","canonical_sha256":"8b10328d606cb4cb596eced456d00eefe1cd21a7f427c1c70a0ab1f3df84c882","source":{"kind":"arxiv","id":"2401.12205","version":1},"attestation_state":"computed","paper":{"title":"Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Animesh Basak Chowdhury, Benjamin Tan, Marco Romanelli, Ramesh Karri, Siddharth Garg","submitted_at":"2024-01-22T18:46:30Z","abstract_excerpt":"Logic synthesis, a pivotal stage in chip design, entails optimizing chip specifications encoded in hardware description languages like Verilog into highly efficient implementations using Boolean logic gates. The process involves a sequential application of logic minimization heuristics (``synthesis recipe\"), with their arrangement significantly impacting crucial metrics such as area and delay. Addressing the challenge posed by the broad spectrum of design complexities - from variations of past designs (e.g., adders and multipliers) to entirely novel configurations (e.g., innovative processor i"},"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":"2401.12205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-22T18:46:30Z","cross_cats_sorted":["cs.AI","cs.AR"],"title_canon_sha256":"3519b503ffab924466279a76c558033b4cea185a10829ea7159e40f2d337766b","abstract_canon_sha256":"bcc68f1c0cbd18f5cbd148e5e06f72d7e4955b9d1abf565585b0cceac2da9e17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:16.938593Z","signature_b64":"hpe91aUvzBFsIFdUxT3K9g1UDmW3PLRc9lS365AD555+5Nkr1Cv7JutkbHhi18l4Nq4JRtWBwPjTQh864YzhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b10328d606cb4cb596eced456d00eefe1cd21a7f427c1c70a0ab1f3df84c882","last_reissued_at":"2026-07-05T07:36:16.938118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:16.938118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Animesh Basak Chowdhury, Benjamin Tan, Marco Romanelli, Ramesh Karri, Siddharth Garg","submitted_at":"2024-01-22T18:46:30Z","abstract_excerpt":"Logic synthesis, a pivotal stage in chip design, entails optimizing chip specifications encoded in hardware description languages like Verilog into highly efficient implementations using Boolean logic gates. The process involves a sequential application of logic minimization heuristics (``synthesis recipe\"), with their arrangement significantly impacting crucial metrics such as area and delay. Addressing the challenge posed by the broad spectrum of design complexities - from variations of past designs (e.g., adders and multipliers) to entirely novel configurations (e.g., innovative processor i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12205","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/2401.12205/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":"2401.12205","created_at":"2026-07-05T07:36:16.938175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.12205v1","created_at":"2026-07-05T07:36:16.938175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12205","created_at":"2026-07-05T07:36:16.938175+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMIDFDLANS2M","created_at":"2026-07-05T07:36:16.938175+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMIDFDLANS2MWWLO","created_at":"2026-07-05T07:36:16.938175+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMIDFDLA","created_at":"2026-07-05T07:36:16.938175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07239","citing_title":"VeriLoC: Line-of-Code Level Prediction of Hardware Design Quality from Verilog Code","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57","json":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57.json","graph_json":"https://pith.science/api/pith-number/RMIDFDLANS2MWWLOZ3KFNUAO57/graph.json","events_json":"https://pith.science/api/pith-number/RMIDFDLANS2MWWLOZ3KFNUAO57/events.json","paper":"https://pith.science/paper/RMIDFDLA"},"agent_actions":{"view_html":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57","download_json":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57.json","view_paper":"https://pith.science/paper/RMIDFDLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.12205&json=true","fetch_graph":"https://pith.science/api/pith-number/RMIDFDLANS2MWWLOZ3KFNUAO57/graph.json","fetch_events":"https://pith.science/api/pith-number/RMIDFDLANS2MWWLOZ3KFNUAO57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57/action/storage_attestation","attest_author":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57/action/author_attestation","sign_citation":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57/action/citation_signature","submit_replication":"https://pith.science/pith/RMIDFDLANS2MWWLOZ3KFNUAO57/action/replication_record"}},"created_at":"2026-07-05T07:36:16.938175+00:00","updated_at":"2026-07-05T07:36:16.938175+00:00"}