{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2K7N3VV6MGQVFA4RDGQ7KF3FWR","short_pith_number":"pith:2K7N3VV6","schema_version":"1.0","canonical_sha256":"d2beddd6be61a152839119a1f51765b458217f24d699005d0d78d817d5b37305","source":{"kind":"arxiv","id":"2411.13890","version":2},"attestation_state":"computed","paper":{"title":"GraCo -- A Graph Composer for Integrated Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Ali Momeni, Andrea Bonetti, Arun Venkitaraman, Chia-Yu Hsieh, Eisaku Ohbuchi, Lorenzo Servadei, Ryoga Matsuo, Stefan Uhlich","submitted_at":"2024-11-21T07:08:48Z","abstract_excerpt":"Designing integrated circuits involves substantial complexity, posing challenges in revealing its potential applications - from custom digital cells to analog circuits. Despite extensive research over the past decades in building versatile and automated frameworks, there remains open room to explore more computationally efficient AI-based solutions. This paper introduces the graph composer GraCo, a novel method for synthesizing integrated circuits using reinforcement learning (RL). GraCo learns to construct a graph step-by-step, which is then converted into a netlist and simulated with SPICE. "},"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":"2411.13890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-21T07:08:48Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"469d9bb3c4846feb2fa54dca02ad8f101de14e3f08dc77f88fc9030382b8c955","abstract_canon_sha256":"8ad029d7c13265a60be25d2ecc1885f22a4a6142ec472f2ff6248c4f2d6adad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:58.210583Z","signature_b64":"EjsqCupySe/dMYAUe//Q9c3ZmXQVZokH4Fn47qecLE5lavu6PK8B7EQgRk+7u9d7A81PspS3b4JsBwuw5UcfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2beddd6be61a152839119a1f51765b458217f24d699005d0d78d817d5b37305","last_reissued_at":"2026-07-05T10:30:58.210084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:58.210084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraCo -- A Graph Composer for Integrated Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Ali Momeni, Andrea Bonetti, Arun Venkitaraman, Chia-Yu Hsieh, Eisaku Ohbuchi, Lorenzo Servadei, Ryoga Matsuo, Stefan Uhlich","submitted_at":"2024-11-21T07:08:48Z","abstract_excerpt":"Designing integrated circuits involves substantial complexity, posing challenges in revealing its potential applications - from custom digital cells to analog circuits. Despite extensive research over the past decades in building versatile and automated frameworks, there remains open room to explore more computationally efficient AI-based solutions. This paper introduces the graph composer GraCo, a novel method for synthesizing integrated circuits using reinforcement learning (RL). GraCo learns to construct a graph step-by-step, which is then converted into a netlist and simulated with SPICE. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13890","kind":"arxiv","version":2},"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/2411.13890/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":"2411.13890","created_at":"2026-07-05T10:30:58.210149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13890v2","created_at":"2026-07-05T10:30:58.210149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13890","created_at":"2026-07-05T10:30:58.210149+00:00"},{"alias_kind":"pith_short_12","alias_value":"2K7N3VV6MGQV","created_at":"2026-07-05T10:30:58.210149+00:00"},{"alias_kind":"pith_short_16","alias_value":"2K7N3VV6MGQVFA4R","created_at":"2026-07-05T10:30:58.210149+00:00"},{"alias_kind":"pith_short_8","alias_value":"2K7N3VV6","created_at":"2026-07-05T10:30:58.210149+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13899","citing_title":"Schemato -- An LLM for Netlist-to-Schematic Conversion","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR","json":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR.json","graph_json":"https://pith.science/api/pith-number/2K7N3VV6MGQVFA4RDGQ7KF3FWR/graph.json","events_json":"https://pith.science/api/pith-number/2K7N3VV6MGQVFA4RDGQ7KF3FWR/events.json","paper":"https://pith.science/paper/2K7N3VV6"},"agent_actions":{"view_html":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR","download_json":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR.json","view_paper":"https://pith.science/paper/2K7N3VV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13890&json=true","fetch_graph":"https://pith.science/api/pith-number/2K7N3VV6MGQVFA4RDGQ7KF3FWR/graph.json","fetch_events":"https://pith.science/api/pith-number/2K7N3VV6MGQVFA4RDGQ7KF3FWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR/action/storage_attestation","attest_author":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR/action/author_attestation","sign_citation":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR/action/citation_signature","submit_replication":"https://pith.science/pith/2K7N3VV6MGQVFA4RDGQ7KF3FWR/action/replication_record"}},"created_at":"2026-07-05T10:30:58.210149+00:00","updated_at":"2026-07-05T10:30:58.210149+00:00"}