{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:56BRZ2R6MJSFHSKPAF2PJFV22B","short_pith_number":"pith:56BRZ2R6","schema_version":"1.0","canonical_sha256":"ef831cea3e626453c94f0174f496bad052510f9e05f93c2245034e26e7bf63db","source":{"kind":"arxiv","id":"2507.06127","version":1},"attestation_state":"computed","paper":{"title":"PrefixAgent: An LLM-Powered Design Framework for Efficient Prefix Adder Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Dongsheng Zuo, Jiadong Zhu, Yang Luo, Yuzhe Ma","submitted_at":"2025-07-08T16:14:17Z","abstract_excerpt":"Prefix adders are fundamental arithmetic circuits, but their design space grows exponentially with bit-width, posing significant optimization challenges. Previous works face limitations in performance, generalization, and scalability. To address these challenges, we propose PrefixAgent, a large language model (LLM)-powered framework that enables efficient prefix adder optimization. Specifically, PrefixAgent reformulates the problem into subtasks including backbone synthesis and structure refinement, which effectively reduces the search space. More importantly, this new design perspective enabl"},"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":"2507.06127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-07-08T16:14:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d03e100f22969a335ac59b9e2d08205f46df5a28e489237441f64587146b5b22","abstract_canon_sha256":"d225dc43c9c1d83467e555a791d7d7d2ae19fbdcf079f5e4bebc4905f5689be5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:41.598396Z","signature_b64":"BbO4H0PENePePBxymmXfAech0T4/P2ERfykCdfO/qHcveenXg1BsVn9/c5XyEM/MWYbtT8Hgcz14ry6XI2sxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef831cea3e626453c94f0174f496bad052510f9e05f93c2245034e26e7bf63db","last_reissued_at":"2026-07-05T11:33:41.597909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:41.597909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PrefixAgent: An LLM-Powered Design Framework for Efficient Prefix Adder Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Dongsheng Zuo, Jiadong Zhu, Yang Luo, Yuzhe Ma","submitted_at":"2025-07-08T16:14:17Z","abstract_excerpt":"Prefix adders are fundamental arithmetic circuits, but their design space grows exponentially with bit-width, posing significant optimization challenges. Previous works face limitations in performance, generalization, and scalability. To address these challenges, we propose PrefixAgent, a large language model (LLM)-powered framework that enables efficient prefix adder optimization. Specifically, PrefixAgent reformulates the problem into subtasks including backbone synthesis and structure refinement, which effectively reduces the search space. More importantly, this new design perspective enabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06127","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/2507.06127/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":"2507.06127","created_at":"2026-07-05T11:33:41.597966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06127v1","created_at":"2026-07-05T11:33:41.597966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06127","created_at":"2026-07-05T11:33:41.597966+00:00"},{"alias_kind":"pith_short_12","alias_value":"56BRZ2R6MJSF","created_at":"2026-07-05T11:33:41.597966+00:00"},{"alias_kind":"pith_short_16","alias_value":"56BRZ2R6MJSFHSKP","created_at":"2026-07-05T11:33:41.597966+00:00"},{"alias_kind":"pith_short_8","alias_value":"56BRZ2R6","created_at":"2026-07-05T11:33:41.597966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06530","citing_title":"RTLScout: Joint Agentic Code and Synthesis Optimization for Efficient Digital Circuits","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B","json":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B.json","graph_json":"https://pith.science/api/pith-number/56BRZ2R6MJSFHSKPAF2PJFV22B/graph.json","events_json":"https://pith.science/api/pith-number/56BRZ2R6MJSFHSKPAF2PJFV22B/events.json","paper":"https://pith.science/paper/56BRZ2R6"},"agent_actions":{"view_html":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B","download_json":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B.json","view_paper":"https://pith.science/paper/56BRZ2R6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06127&json=true","fetch_graph":"https://pith.science/api/pith-number/56BRZ2R6MJSFHSKPAF2PJFV22B/graph.json","fetch_events":"https://pith.science/api/pith-number/56BRZ2R6MJSFHSKPAF2PJFV22B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B/action/storage_attestation","attest_author":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B/action/author_attestation","sign_citation":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B/action/citation_signature","submit_replication":"https://pith.science/pith/56BRZ2R6MJSFHSKPAF2PJFV22B/action/replication_record"}},"created_at":"2026-07-05T11:33:41.597966+00:00","updated_at":"2026-07-05T11:33:41.597966+00:00"}