{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R3IGKW4GB4NA2HGNNCKSV77NTM","short_pith_number":"pith:R3IGKW4G","schema_version":"1.0","canonical_sha256":"8ed0655b860f1a0d1ccd68952affed9b0da45831b169f1d156342aef75c6f2b7","source":{"kind":"arxiv","id":"2606.08944","version":1},"attestation_state":"computed","paper":{"title":"LongRTL: Graph-Similarity-Guided LLM-driven Long Context RTL Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AR","authors_text":"Bei Yu, Che-Kuan Shen, Shuo Yin, Tsung-Yi Ho, Xiangfei Hu, Xufeng Yao, Yuchen Liu, Yuyang Ye","submitted_at":"2026-06-08T02:41:20Z","abstract_excerpt":"Large Language Models (LLMs) show great promise in RTL code generation and optimization. However, real-world RTL designs are typically long, entangled, and poorly modularized, posing a major challenge due to context-length limitations and lack of structure. To overcome these obstacles, we propose a scalable LLM-based RTL optimization framework guided by graph similarity. Our method introduces three collaborative agents: (1) a Partition Agent that decomposes RTL designs into semantically meaningful AST subtrees, guided by AST graph similarity to reusable design templates; (2) an Optimization Ag"},"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":"2606.08944","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-06-08T02:41:20Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"24b24691762f55618a4cab9d8dba430f3d66252c4cac4566f2b9aa458a7f7c36","abstract_canon_sha256":"670eb928856e8e2e0dcc210cb2f9a56ed41eb2fc36357bd9a4a7497de458767c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:49.219126Z","signature_b64":"N8f6RVUthv+4VKZpOPSWhAqgfO318t3Rw5uRXt+L+VFtLfOUIp+fqlpcsLir0mFwVR5xH8wk45Ek8vmVEt8zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed0655b860f1a0d1ccd68952affed9b0da45831b169f1d156342aef75c6f2b7","last_reissued_at":"2026-06-09T02:07:49.218294Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:49.218294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LongRTL: Graph-Similarity-Guided LLM-driven Long Context RTL Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AR","authors_text":"Bei Yu, Che-Kuan Shen, Shuo Yin, Tsung-Yi Ho, Xiangfei Hu, Xufeng Yao, Yuchen Liu, Yuyang Ye","submitted_at":"2026-06-08T02:41:20Z","abstract_excerpt":"Large Language Models (LLMs) show great promise in RTL code generation and optimization. However, real-world RTL designs are typically long, entangled, and poorly modularized, posing a major challenge due to context-length limitations and lack of structure. To overcome these obstacles, we propose a scalable LLM-based RTL optimization framework guided by graph similarity. Our method introduces three collaborative agents: (1) a Partition Agent that decomposes RTL designs into semantically meaningful AST subtrees, guided by AST graph similarity to reusable design templates; (2) an Optimization Ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08944","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/2606.08944/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":"2606.08944","created_at":"2026-06-09T02:07:49.218442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08944v1","created_at":"2026-06-09T02:07:49.218442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08944","created_at":"2026-06-09T02:07:49.218442+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3IGKW4GB4NA","created_at":"2026-06-09T02:07:49.218442+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3IGKW4GB4NA2HGN","created_at":"2026-06-09T02:07:49.218442+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3IGKW4G","created_at":"2026-06-09T02:07:49.218442+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/R3IGKW4GB4NA2HGNNCKSV77NTM","json":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM.json","graph_json":"https://pith.science/api/pith-number/R3IGKW4GB4NA2HGNNCKSV77NTM/graph.json","events_json":"https://pith.science/api/pith-number/R3IGKW4GB4NA2HGNNCKSV77NTM/events.json","paper":"https://pith.science/paper/R3IGKW4G"},"agent_actions":{"view_html":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM","download_json":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM.json","view_paper":"https://pith.science/paper/R3IGKW4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08944&json=true","fetch_graph":"https://pith.science/api/pith-number/R3IGKW4GB4NA2HGNNCKSV77NTM/graph.json","fetch_events":"https://pith.science/api/pith-number/R3IGKW4GB4NA2HGNNCKSV77NTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM/action/storage_attestation","attest_author":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM/action/author_attestation","sign_citation":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM/action/citation_signature","submit_replication":"https://pith.science/pith/R3IGKW4GB4NA2HGNNCKSV77NTM/action/replication_record"}},"created_at":"2026-06-09T02:07:49.218442+00:00","updated_at":"2026-06-09T02:07:49.218442+00:00"}