{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7TCGL6OQQM2V6VS3RYZJHIB2GK","short_pith_number":"pith:7TCGL6OQ","schema_version":"1.0","canonical_sha256":"fcc465f9d083355f565b8e3293a03a32bf5e95b996fc0ee5ae0241631315d7cf","source":{"kind":"arxiv","id":"2603.11075","version":2},"attestation_state":"computed","paper":{"title":"VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingzhe Li, Bo Fang, Runbang Hu, Yuede Ji","submitted_at":"2026-03-10T20:39:48Z","abstract_excerpt":"As Very Large Scale Integration (VLSI) designs continue to scale in size and complexity, layout verification has become a central challenge in modern Electronic Design Automation (EDA) workflows. In practice, congestion can only be accurately identified after detailed routing, making traditional verification both time-consuming and costly. Learning-based approaches have therefore been explored to enable early-stage congestion prediction and reduce routing iterations. However, although prior methods incorporate both netlist connectivity and layout features, they often model the two in a loosely"},"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":"2603.11075","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-03-10T20:39:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ef4700c43bcce6e2f6d790e8e9b185a94cdb0a1e29b67b562dcea860bb37c4ed","abstract_canon_sha256":"d46f712326455b2fd28e7a053e9dcee9dbdf66dce1daecf2b42b351693464819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:43.137445Z","signature_b64":"6uVuASYzJrBnBPCP8BWEiwS+Ne+6YqPsQ2W+vZj2ZbjBWTzKHLFy31zwZCC7YcHxjC/mFT9ZLaq5LYmYqnCBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcc465f9d083355f565b8e3293a03a32bf5e95b996fc0ee5ae0241631315d7cf","last_reissued_at":"2026-05-20T00:05:43.136923Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:43.136923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.AR","authors_text":"Bingzhe Li, Bo Fang, Runbang Hu, Yuede Ji","submitted_at":"2026-03-10T20:39:48Z","abstract_excerpt":"As Very Large Scale Integration (VLSI) designs continue to scale in size and complexity, layout verification has become a central challenge in modern Electronic Design Automation (EDA) workflows. In practice, congestion can only be accurately identified after detailed routing, making traditional verification both time-consuming and costly. Learning-based approaches have therefore been explored to enable early-stage congestion prediction and reduce routing iterations. However, although prior methods incorporate both netlist connectivity and layout features, they often model the two in a loosely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11075","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/2603.11075/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":"2603.11075","created_at":"2026-05-20T00:05:43.136997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.11075v2","created_at":"2026-05-20T00:05:43.136997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11075","created_at":"2026-05-20T00:05:43.136997+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TCGL6OQQM2V","created_at":"2026-05-20T00:05:43.136997+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TCGL6OQQM2V6VS3","created_at":"2026-05-20T00:05:43.136997+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TCGL6OQ","created_at":"2026-05-20T00:05:43.136997+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/7TCGL6OQQM2V6VS3RYZJHIB2GK","json":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK.json","graph_json":"https://pith.science/api/pith-number/7TCGL6OQQM2V6VS3RYZJHIB2GK/graph.json","events_json":"https://pith.science/api/pith-number/7TCGL6OQQM2V6VS3RYZJHIB2GK/events.json","paper":"https://pith.science/paper/7TCGL6OQ"},"agent_actions":{"view_html":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK","download_json":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK.json","view_paper":"https://pith.science/paper/7TCGL6OQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.11075&json=true","fetch_graph":"https://pith.science/api/pith-number/7TCGL6OQQM2V6VS3RYZJHIB2GK/graph.json","fetch_events":"https://pith.science/api/pith-number/7TCGL6OQQM2V6VS3RYZJHIB2GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK/action/storage_attestation","attest_author":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK/action/author_attestation","sign_citation":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK/action/citation_signature","submit_replication":"https://pith.science/pith/7TCGL6OQQM2V6VS3RYZJHIB2GK/action/replication_record"}},"created_at":"2026-05-20T00:05:43.136997+00:00","updated_at":"2026-05-20T00:05:43.136997+00:00"}