{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RN7WOJJKCBAHR6YXAZYXAY3C65","short_pith_number":"pith:RN7WOJJK","schema_version":"1.0","canonical_sha256":"8b7f67252a104078fb170671706362f744caf831a185cb03a0237ebec17911db","source":{"kind":"arxiv","id":"2405.16951","version":1},"attestation_state":"computed","paper":{"title":"Fast ML-driven Analog Circuit Layout using Reinforcement Learning and Steiner Trees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Davide Basso, Husni Habal, Luca Bortolussi, Mirjana Videnovic-Misic","submitted_at":"2024-05-27T08:42:42Z","abstract_excerpt":"This paper presents an artificial intelligence driven methodology to reduce the bottleneck often encountered in the analog ICs layout phase. We frame the floorplanning problem as a Markov Decision Process and leverage reinforcement learning for automatic placement generation under established topological constraints. Consequently, we introduce Steiner tree-based methods for the global routing step and generate guiding paths to be used to connect every circuit block. Finally, by integrating these solutions into a procedural generation framework, we present a unified pipeline that bridges the di"},"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":"2405.16951","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-27T08:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"db02670131ca0646cbad967e4d01e744b724639d91356bccf3a0b08f245aac73","abstract_canon_sha256":"02cb29ced8519bafe493b9e8cf555b4080d584a9f698d371726a1b057b5d7036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:37.925460Z","signature_b64":"Xv4KBWTPndHmu8XW5Ro/2I37Ed3rdt+NOFRBoQdXrPZJT7wPiw5BrWSlNox0OFKoAXdf1SkKvxRQsm2LgCikAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7f67252a104078fb170671706362f744caf831a185cb03a0237ebec17911db","last_reissued_at":"2026-07-05T08:23:37.925008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:37.925008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast ML-driven Analog Circuit Layout using Reinforcement Learning and Steiner Trees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Davide Basso, Husni Habal, Luca Bortolussi, Mirjana Videnovic-Misic","submitted_at":"2024-05-27T08:42:42Z","abstract_excerpt":"This paper presents an artificial intelligence driven methodology to reduce the bottleneck often encountered in the analog ICs layout phase. We frame the floorplanning problem as a Markov Decision Process and leverage reinforcement learning for automatic placement generation under established topological constraints. Consequently, we introduce Steiner tree-based methods for the global routing step and generate guiding paths to be used to connect every circuit block. Finally, by integrating these solutions into a procedural generation framework, we present a unified pipeline that bridges the di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16951","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/2405.16951/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":"2405.16951","created_at":"2026-07-05T08:23:37.925065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16951v1","created_at":"2026-07-05T08:23:37.925065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16951","created_at":"2026-07-05T08:23:37.925065+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN7WOJJKCBAH","created_at":"2026-07-05T08:23:37.925065+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN7WOJJKCBAHR6YX","created_at":"2026-07-05T08:23:37.925065+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN7WOJJK","created_at":"2026-07-05T08:23:37.925065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15212","citing_title":"Effective Analog ICs Floorplanning with Relational Graph Neural Networks and Reinforcement Learning","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65","json":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65.json","graph_json":"https://pith.science/api/pith-number/RN7WOJJKCBAHR6YXAZYXAY3C65/graph.json","events_json":"https://pith.science/api/pith-number/RN7WOJJKCBAHR6YXAZYXAY3C65/events.json","paper":"https://pith.science/paper/RN7WOJJK"},"agent_actions":{"view_html":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65","download_json":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65.json","view_paper":"https://pith.science/paper/RN7WOJJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16951&json=true","fetch_graph":"https://pith.science/api/pith-number/RN7WOJJKCBAHR6YXAZYXAY3C65/graph.json","fetch_events":"https://pith.science/api/pith-number/RN7WOJJKCBAHR6YXAZYXAY3C65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65/action/storage_attestation","attest_author":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65/action/author_attestation","sign_citation":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65/action/citation_signature","submit_replication":"https://pith.science/pith/RN7WOJJKCBAHR6YXAZYXAY3C65/action/replication_record"}},"created_at":"2026-07-05T08:23:37.925065+00:00","updated_at":"2026-07-05T08:23:37.925065+00:00"}