{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VUZ47TPT7FLNAVL3ID73MJ5U3R","short_pith_number":"pith:VUZ47TPT","schema_version":"1.0","canonical_sha256":"ad33cfcdf3f956d0557b40ffb627b4dc4620fc4b04f75021d7632e6ae70a161e","source":{"kind":"arxiv","id":"2409.06077","version":2},"attestation_state":"computed","paper":{"title":"MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Faezeh Faez, Lei Chen, Mahdi Biparva, Mingxuan Yuan, Raika Karimi, Xing Li, Yingxue Zhang","submitted_at":"2024-09-09T21:20:36Z","abstract_excerpt":"Electronic Design Automation (EDA) is essential for IC design and has recently benefited from AI-based techniques to improve efficiency. Logic synthesis, a key EDA stage, transforms high-level hardware descriptions into optimized netlists. Recent research has employed machine learning to predict Quality of Results (QoR) for pairs of And-Inverter Graphs (AIGs) and synthesis recipes. However, the severe scarcity of data due to a very limited number of available AIGs results in overfitting, significantly hindering performance. Additionally, the complexity and large number of nodes in AIGs make pl"},"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":"2409.06077","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-09T21:20:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"171a230f2e61735917d779167ee8c1e6d132fb60564fda73ded24f19b3ad63a2","abstract_canon_sha256":"90b8101b681dd8c6a36b0586ac0b31f89b20242c32d9ac3367f72d6183c8e565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:33.088785Z","signature_b64":"eyy4o8FHYsKMXXLqHPza1Bor8ZNP/ZDyQAlJOoOSrrqS9ZoBrhlPxKQIEvE01KWrrm8l/e3LWhpuosXlWMjYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad33cfcdf3f956d0557b40ffb627b4dc4620fc4b04f75021d7632e6ae70a161e","last_reissued_at":"2026-07-05T09:29:33.088298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:33.088298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Faezeh Faez, Lei Chen, Mahdi Biparva, Mingxuan Yuan, Raika Karimi, Xing Li, Yingxue Zhang","submitted_at":"2024-09-09T21:20:36Z","abstract_excerpt":"Electronic Design Automation (EDA) is essential for IC design and has recently benefited from AI-based techniques to improve efficiency. Logic synthesis, a key EDA stage, transforms high-level hardware descriptions into optimized netlists. Recent research has employed machine learning to predict Quality of Results (QoR) for pairs of And-Inverter Graphs (AIGs) and synthesis recipes. However, the severe scarcity of data due to a very limited number of available AIGs results in overfitting, significantly hindering performance. Additionally, the complexity and large number of nodes in AIGs make pl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06077","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/2409.06077/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":"2409.06077","created_at":"2026-07-05T09:29:33.088367+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06077v2","created_at":"2026-07-05T09:29:33.088367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06077","created_at":"2026-07-05T09:29:33.088367+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUZ47TPT7FLN","created_at":"2026-07-05T09:29:33.088367+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUZ47TPT7FLNAVL3","created_at":"2026-07-05T09:29:33.088367+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUZ47TPT","created_at":"2026-07-05T09:29:33.088367+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/VUZ47TPT7FLNAVL3ID73MJ5U3R","json":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R.json","graph_json":"https://pith.science/api/pith-number/VUZ47TPT7FLNAVL3ID73MJ5U3R/graph.json","events_json":"https://pith.science/api/pith-number/VUZ47TPT7FLNAVL3ID73MJ5U3R/events.json","paper":"https://pith.science/paper/VUZ47TPT"},"agent_actions":{"view_html":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R","download_json":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R.json","view_paper":"https://pith.science/paper/VUZ47TPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06077&json=true","fetch_graph":"https://pith.science/api/pith-number/VUZ47TPT7FLNAVL3ID73MJ5U3R/graph.json","fetch_events":"https://pith.science/api/pith-number/VUZ47TPT7FLNAVL3ID73MJ5U3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R/action/storage_attestation","attest_author":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R/action/author_attestation","sign_citation":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R/action/citation_signature","submit_replication":"https://pith.science/pith/VUZ47TPT7FLNAVL3ID73MJ5U3R/action/replication_record"}},"created_at":"2026-07-05T09:29:33.088367+00:00","updated_at":"2026-07-05T09:29:33.088367+00:00"}