{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4LMJSIBJBKDUICYQJTWRGWNG4J","short_pith_number":"pith:4LMJSIBJ","schema_version":"1.0","canonical_sha256":"e2d89920290a87440b104ced1359a6e26a7838800a7ff4cf8b21c05eefaf83e0","source":{"kind":"arxiv","id":"2502.17936","version":3},"attestation_state":"computed","paper":{"title":"The Art of Beating the Odds with Predictor-Guided Random Design Space Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Felix Arnold, Lukas Cavigelli, Maxence Bouvier, Renzo Andri, Ryan Amaudruz","submitted_at":"2025-02-25T07:56:25Z","abstract_excerpt":"This work introduces an innovative method for improving combinational digital circuits through random exploration in MIG-based synthesis. High-quality circuits are crucial for performance, power, and cost, making this a critical area of active research. Our approach incorporates next-state prediction and iterative selection, significantly accelerating the synthesis process. This novel method achieves up to 14x synthesis speedup and up to 20.94% better MIG minimization on the EPFL Combinational Benchmark Suite compared to state-of-the-art techniques. We further explore various predictor models "},"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":"2502.17936","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-25T07:56:25Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"4727ea2e1d017726e76d2a8a962190767692c3ebdd57516a98877825f6b83ca1","abstract_canon_sha256":"db5bfbee9d4545caedfb3a93311c9ca306ab535dc1eb486bf926192c242c4f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:00.877235Z","signature_b64":"kg56PY9KMJoVNeMvYjK5ve1PRdcTs/J0eJC1SyH4nYDK9RhRjRz5U4ZeCrNBqsrBTyIhAbt5W/SfKhf+F2mlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d89920290a87440b104ced1359a6e26a7838800a7ff4cf8b21c05eefaf83e0","last_reissued_at":"2026-07-05T10:46:00.876695Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:00.876695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Art of Beating the Odds with Predictor-Guided Random Design Space Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Felix Arnold, Lukas Cavigelli, Maxence Bouvier, Renzo Andri, Ryan Amaudruz","submitted_at":"2025-02-25T07:56:25Z","abstract_excerpt":"This work introduces an innovative method for improving combinational digital circuits through random exploration in MIG-based synthesis. High-quality circuits are crucial for performance, power, and cost, making this a critical area of active research. Our approach incorporates next-state prediction and iterative selection, significantly accelerating the synthesis process. This novel method achieves up to 14x synthesis speedup and up to 20.94% better MIG minimization on the EPFL Combinational Benchmark Suite compared to state-of-the-art techniques. We further explore various predictor models "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17936","kind":"arxiv","version":3},"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/2502.17936/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":"2502.17936","created_at":"2026-07-05T10:46:00.876753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.17936v3","created_at":"2026-07-05T10:46:00.876753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17936","created_at":"2026-07-05T10:46:00.876753+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LMJSIBJBKDU","created_at":"2026-07-05T10:46:00.876753+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LMJSIBJBKDUICYQ","created_at":"2026-07-05T10:46:00.876753+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LMJSIBJ","created_at":"2026-07-05T10:46:00.876753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06530","citing_title":"RTLScout: Joint Agentic Code and Synthesis Optimization for Efficient Digital Circuits","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J","json":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J.json","graph_json":"https://pith.science/api/pith-number/4LMJSIBJBKDUICYQJTWRGWNG4J/graph.json","events_json":"https://pith.science/api/pith-number/4LMJSIBJBKDUICYQJTWRGWNG4J/events.json","paper":"https://pith.science/paper/4LMJSIBJ"},"agent_actions":{"view_html":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J","download_json":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J.json","view_paper":"https://pith.science/paper/4LMJSIBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.17936&json=true","fetch_graph":"https://pith.science/api/pith-number/4LMJSIBJBKDUICYQJTWRGWNG4J/graph.json","fetch_events":"https://pith.science/api/pith-number/4LMJSIBJBKDUICYQJTWRGWNG4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J/action/storage_attestation","attest_author":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J/action/author_attestation","sign_citation":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J/action/citation_signature","submit_replication":"https://pith.science/pith/4LMJSIBJBKDUICYQJTWRGWNG4J/action/replication_record"}},"created_at":"2026-07-05T10:46:00.876753+00:00","updated_at":"2026-07-05T10:46:00.876753+00:00"}