{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XMCPDUGOQQYPH5GQIZLVQVDV3P","short_pith_number":"pith:XMCPDUGO","schema_version":"1.0","canonical_sha256":"bb04f1d0ce8430f3f4d04657585475dbd69a76b5e727f1f764feaf1024e96dd7","source":{"kind":"arxiv","id":"2502.12732","version":1},"attestation_state":"computed","paper":{"title":"Circuit Representation Learning with Masked Gate Modeling and Verilog-AIG Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bei Yu, Haisheng Zheng, Haoyuan Wu, Yuan Pu","submitted_at":"2025-02-18T10:48:16Z","abstract_excerpt":"Understanding the structure and function of circuits is crucial for electronic design automation (EDA). Circuits can be formulated as And-Inverter graphs (AIGs), enabling efficient implementation of representation learning through graph neural networks (GNNs). Masked modeling paradigms have been proven effective in graph representation learning. However, masking augmentation to original circuits will destroy their logical equivalence, which is unsuitable for circuit representation learning. Moreover, existing masked modeling paradigms often prioritize structural information at the expense of a"},"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.12732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T10:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"da320cf3767f8a3e123b07a625ccab53cbcbea2652fc9986ed670ed296469c0a","abstract_canon_sha256":"ebaa70b47a8944f5cc8db49902c4263c8bd8ca03d74832c1c51841a71c301bbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:23.395590Z","signature_b64":"wb1gHrKyseuGojJLGXP1cO3Y5X8upShG0gF5gxp6UtMvMpCcmUq0wMyj9fLHNrtQxUPh4sVo/bRGBagjxPYUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb04f1d0ce8430f3f4d04657585475dbd69a76b5e727f1f764feaf1024e96dd7","last_reissued_at":"2026-07-05T10:16:23.395104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:23.395104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit Representation Learning with Masked Gate Modeling and Verilog-AIG Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bei Yu, Haisheng Zheng, Haoyuan Wu, Yuan Pu","submitted_at":"2025-02-18T10:48:16Z","abstract_excerpt":"Understanding the structure and function of circuits is crucial for electronic design automation (EDA). Circuits can be formulated as And-Inverter graphs (AIGs), enabling efficient implementation of representation learning through graph neural networks (GNNs). Masked modeling paradigms have been proven effective in graph representation learning. However, masking augmentation to original circuits will destroy their logical equivalence, which is unsuitable for circuit representation learning. Moreover, existing masked modeling paradigms often prioritize structural information at the expense of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12732","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/2502.12732/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.12732","created_at":"2026-07-05T10:16:23.395167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12732v1","created_at":"2026-07-05T10:16:23.395167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12732","created_at":"2026-07-05T10:16:23.395167+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMCPDUGOQQYP","created_at":"2026-07-05T10:16:23.395167+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMCPDUGOQQYPH5GQ","created_at":"2026-07-05T10:16:23.395167+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMCPDUGO","created_at":"2026-07-05T10:16:23.395167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.21886","citing_title":"TRACE: Learning to Compute on Circuit Graphs","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P","json":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P.json","graph_json":"https://pith.science/api/pith-number/XMCPDUGOQQYPH5GQIZLVQVDV3P/graph.json","events_json":"https://pith.science/api/pith-number/XMCPDUGOQQYPH5GQIZLVQVDV3P/events.json","paper":"https://pith.science/paper/XMCPDUGO"},"agent_actions":{"view_html":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P","download_json":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P.json","view_paper":"https://pith.science/paper/XMCPDUGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12732&json=true","fetch_graph":"https://pith.science/api/pith-number/XMCPDUGOQQYPH5GQIZLVQVDV3P/graph.json","fetch_events":"https://pith.science/api/pith-number/XMCPDUGOQQYPH5GQIZLVQVDV3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P/action/storage_attestation","attest_author":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P/action/author_attestation","sign_citation":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P/action/citation_signature","submit_replication":"https://pith.science/pith/XMCPDUGOQQYPH5GQIZLVQVDV3P/action/replication_record"}},"created_at":"2026-07-05T10:16:23.395167+00:00","updated_at":"2026-07-05T10:16:23.395167+00:00"}