{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HOD5CWYOAPQ3RP6CQDUGY5O2EC","short_pith_number":"pith:HOD5CWYO","schema_version":"1.0","canonical_sha256":"3b87d15b0e03e1b8bfc280e86c75da20b1179c5bcb20a599161441b01e19fd82","source":{"kind":"arxiv","id":"2403.01317","version":4},"attestation_state":"computed","paper":{"title":"Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Chenhui Deng, Cunxi Yu, Gokce Sarar, Rajeev Jain, Ryan Carey, Zhiru Zhang, Zichao Yue","submitted_at":"2024-03-02T21:33:23Z","abstract_excerpt":"While graph neural networks (GNNs) have gained popularity for learning circuit representations in various electronic design automation (EDA) tasks, they face challenges in scalability when applied to large graphs and exhibit limited generalizability to new designs. These limitations make them less practical for addressing large-scale, complex circuit problems. In this work we propose HOGA, a novel attention-based model for learning circuit representations in a scalable and generalizable manner. HOGA first computes hop-wise features per node prior to model training. Subsequently, the hop-wise f"},"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":"2403.01317","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-02T21:33:23Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"67d094dc577534cf826ec32bdda1dc7caa68c2983d4540feac497ef3d0242c40","abstract_canon_sha256":"3af2a9525ce6311b5a6d3d33c023ac270dce2792133cbbfec5490ba5acfd68d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:47.049565Z","signature_b64":"Zo9aAGQNM3TiSxSed9/yvBiCQ+0cR/2He1itj4islEK4yfMW4/ySwYGX1RTDwuksJ/4iFvGzSWh2w7EmpVDzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b87d15b0e03e1b8bfc280e86c75da20b1179c5bcb20a599161441b01e19fd82","last_reissued_at":"2026-07-05T08:06:47.049080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:47.049080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Chenhui Deng, Cunxi Yu, Gokce Sarar, Rajeev Jain, Ryan Carey, Zhiru Zhang, Zichao Yue","submitted_at":"2024-03-02T21:33:23Z","abstract_excerpt":"While graph neural networks (GNNs) have gained popularity for learning circuit representations in various electronic design automation (EDA) tasks, they face challenges in scalability when applied to large graphs and exhibit limited generalizability to new designs. These limitations make them less practical for addressing large-scale, complex circuit problems. In this work we propose HOGA, a novel attention-based model for learning circuit representations in a scalable and generalizable manner. HOGA first computes hop-wise features per node prior to model training. Subsequently, the hop-wise f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01317","kind":"arxiv","version":4},"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/2403.01317/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":"2403.01317","created_at":"2026-07-05T08:06:47.049132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01317v4","created_at":"2026-07-05T08:06:47.049132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01317","created_at":"2026-07-05T08:06:47.049132+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOD5CWYOAPQ3","created_at":"2026-07-05T08:06:47.049132+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOD5CWYOAPQ3RP6C","created_at":"2026-07-05T08:06:47.049132+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOD5CWYO","created_at":"2026-07-05T08:06:47.049132+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/HOD5CWYOAPQ3RP6CQDUGY5O2EC","json":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC.json","graph_json":"https://pith.science/api/pith-number/HOD5CWYOAPQ3RP6CQDUGY5O2EC/graph.json","events_json":"https://pith.science/api/pith-number/HOD5CWYOAPQ3RP6CQDUGY5O2EC/events.json","paper":"https://pith.science/paper/HOD5CWYO"},"agent_actions":{"view_html":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC","download_json":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC.json","view_paper":"https://pith.science/paper/HOD5CWYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01317&json=true","fetch_graph":"https://pith.science/api/pith-number/HOD5CWYOAPQ3RP6CQDUGY5O2EC/graph.json","fetch_events":"https://pith.science/api/pith-number/HOD5CWYOAPQ3RP6CQDUGY5O2EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC/action/storage_attestation","attest_author":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC/action/author_attestation","sign_citation":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC/action/citation_signature","submit_replication":"https://pith.science/pith/HOD5CWYOAPQ3RP6CQDUGY5O2EC/action/replication_record"}},"created_at":"2026-07-05T08:06:47.049132+00:00","updated_at":"2026-07-05T08:06:47.049132+00:00"}