{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZX2FM4LPXMT54URDCE3UDV6K6L","short_pith_number":"pith:ZX2FM4LP","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"},"canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","source":{"kind":"arxiv","id":"2406.09535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.09535","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"2406.09535v1","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09535","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZX2FM4LPXMT5","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZX2FM4LPXMT54URD","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZX2FM4LP","created_at":"2026-07-05T08:31:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZX2FM4LPXMT54URDCE3UDV6K6L","target":"record","payload":{"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"},"canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","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"},"source_kind":"arxiv","source_id":"2406.09535","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxaEgQY0qRFafP1vJyV3aM4LBK9wozccW1BVTn+A9SKcqzTIKlDOHao6myUbuH7O43w05dNKASqfCr6rbe7pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:25:50.924492Z"},"content_sha256":"7fba01e30d15751db008dae442af3937e9d97cd7d7ab64437d09eef9055f8205","schema_version":"1.0","event_id":"sha256:7fba01e30d15751db008dae442af3937e9d97cd7d7ab64437d09eef9055f8205"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZX2FM4LPXMT54URDCE3UDV6K6L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZyavqrBTNKcMrmkCQFitnUhy1wHfYouS0v+UOdCzP9gzspXzHKOPHhLJ6FnVMHa3RSeK14lCo+V70EViUvYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:25:50.925101Z"},"content_sha256":"deb5d00ae968999fc3362b93fb281be23b19202bc444d563e469f22febc14831","schema_version":"1.0","event_id":"sha256:deb5d00ae968999fc3362b93fb281be23b19202bc444d563e469f22febc14831"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/bundle.json","state_url":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-01T17:25:50Z","links":{"resolver":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L","bundle":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/bundle.json","state":"https://pith.science/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZX2FM4LPXMT54URDCE3UDV6K6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZX2FM4LPXMT54URDCE3UDV6K6L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"055db57b492e2f0dde338c5dd534236b6a521d5487bc8c647d3546366bfee78e","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-13T18:47:52Z","title_canon_sha256":"2ac3abcf6ea1a0b3b9a284fe3f55c3056fd2fb87ecc5c6b668c87547ba670eeb"},"schema_version":"1.0","source":{"id":"2406.09535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.09535","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"2406.09535v1","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09535","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZX2FM4LPXMT5","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZX2FM4LPXMT54URD","created_at":"2026-07-05T08:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZX2FM4LP","created_at":"2026-07-05T08:31:55Z"}],"graph_snapshots":[{"event_id":"sha256:deb5d00ae968999fc3362b93fb281be23b19202bc444d563e469f22febc14831","target":"graph","created_at":"2026-07-05T08:31:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.09535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Aidan Swope, Bryan Catanzaro, Jialin Song, Jonathan Raiman, Rajarshi Roy, Robert Kirby, Saad Godil","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-13T18:47:52Z","title":"CircuitVAE: Efficient and Scalable Latent Circuit Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09535","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7fba01e30d15751db008dae442af3937e9d97cd7d7ab64437d09eef9055f8205","target":"record","created_at":"2026-07-05T08:31:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"055db57b492e2f0dde338c5dd534236b6a521d5487bc8c647d3546366bfee78e","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-13T18:47:52Z","title_canon_sha256":"2ac3abcf6ea1a0b3b9a284fe3f55c3056fd2fb87ecc5c6b668c87547ba670eeb"},"schema_version":"1.0","source":{"id":"2406.09535","kind":"arxiv","version":1}},"canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdf456716fbb27de5223113741d7caf2ee61e0ce5bb8bb08857a1beb1e6c2cfa","first_computed_at":"2026-07-05T08:31:55.563408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:31:55.563408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+xz1vzl5jPqYl9M3lvMq40It+nSpgqs2dAAi5g/baMhFKC5tgSKEoJ8SvPoUSzBRAxpR8AoqCK6SfOxsYXFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:31:55.563872Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.09535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fba01e30d15751db008dae442af3937e9d97cd7d7ab64437d09eef9055f8205","sha256:deb5d00ae968999fc3362b93fb281be23b19202bc444d563e469f22febc14831"],"state_sha256":"46f2211d00a638e02489b073399615ffc88198d1f020a140429a8e5e7c59dbb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVColIZjf+BOyqrdboMeV0utqhMICQ1ejtk/rXgK9rECcCyi8c72bRCfHGnFJYu2aTBLP8wHI4wBdYkcTmGcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T17:25:50.928601Z","bundle_sha256":"842d4b059d5b3d327f0230cedcf1563ffd5c858ddfdda496bce049faa0849808"}}