{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZX2FM4LPXMT54URDCE3UDV6K6L","short_pith_number":"pith:ZX2FM4LP","schema_version":"1.0","canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","source":{"kind":"arxiv","id":"2406.09535","version":1},"attestation_state":"computed","paper":{"title":"CircuitVAE: Efficient and Scalable Latent Circuit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Aidan Swope, Bryan Catanzaro, Jialin Song, Jonathan Raiman, Rajarshi Roy, Robert Kirby, Saad Godil","submitted_at":"2024-06-13T18:47:52Z","abstract_excerpt":"Automatically designing fast and space-efficient digital circuits is challenging because circuits are discrete, must exactly implement the desired logic, and are costly to simulate. We address these challenges with CircuitVAE, a search algorithm that embeds computation graphs in a continuous space and optimizes a learned surrogate of physical simulation by gradient descent. By carefully controlling overfitting of the simulation surrogate and ensuring diverse exploration, our algorithm is highly sample-efficient, yet gracefully scales to large problem instances and high sample budgets. We test "},"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":"2406.09535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-13T18:47:52Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"2ac3abcf6ea1a0b3b9a284fe3f55c3056fd2fb87ecc5c6b668c87547ba670eeb","abstract_canon_sha256":"055db57b492e2f0dde338c5dd534236b6a521d5487bc8c647d3546366bfee78e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:55.563872Z","signature_b64":"x+xz1vzl5jPqYl9M3lvMq40It+nSpgqs2dAAi5g/baMhFKC5tgSKEoJ8SvPoUSzBRAxpR8AoqCK6SfOxsYXFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","last_reissued_at":"2026-07-05T08:31:55.563408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:55.563408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CircuitVAE: Efficient and Scalable Latent Circuit Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Aidan Swope, Bryan Catanzaro, Jialin Song, Jonathan Raiman, Rajarshi Roy, Robert Kirby, Saad Godil","submitted_at":"2024-06-13T18:47:52Z","abstract_excerpt":"Automatically designing fast and space-efficient digital circuits is challenging because circuits are discrete, must exactly implement the desired logic, and are costly to simulate. We address these challenges with CircuitVAE, a search algorithm that embeds computation graphs in a continuous space and optimizes a learned surrogate of physical simulation by gradient descent. By carefully controlling overfitting of the simulation surrogate and ensuring diverse exploration, our algorithm is highly sample-efficient, yet gracefully scales to large problem instances and high sample budgets. We test "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09535","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/2406.09535/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":"2406.09535","created_at":"2026-07-05T08:31:55.563468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09535v1","created_at":"2026-07-05T08:31:55.563468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09535","created_at":"2026-07-05T08:31:55.563468+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZX2FM4LPXMT5","created_at":"2026-07-05T08:31:55.563468+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZX2FM4LPXMT54URD","created_at":"2026-07-05T08:31:55.563468+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZX2FM4LP","created_at":"2026-07-05T08:31:55.563468+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/ZX2FM4LPXMT54URDCE3UDV6K6L","json":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L.json","graph_json":"https://pith.science/api/pith-number/ZX2FM4LPXMT54URDCE3UDV6K6L/graph.json","events_json":"https://pith.science/api/pith-number/ZX2FM4LPXMT54URDCE3UDV6K6L/events.json","paper":"https://pith.science/paper/ZX2FM4LP"},"agent_actions":{"view_html":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L","download_json":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L.json","view_paper":"https://pith.science/paper/ZX2FM4LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09535&json=true","fetch_graph":"https://pith.science/api/pith-number/ZX2FM4LPXMT54URDCE3UDV6K6L/graph.json","fetch_events":"https://pith.science/api/pith-number/ZX2FM4LPXMT54URDCE3UDV6K6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/action/storage_attestation","attest_author":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/action/author_attestation","sign_citation":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/action/citation_signature","submit_replication":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/action/replication_record"}},"created_at":"2026-07-05T08:31:55.563468+00:00","updated_at":"2026-07-05T08:31:55.563468+00:00"}