{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_c90c453f8ab5febc34f56ac1f71b555a8cca59245c50ffe27cdf1901d74ac729","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_c90c453f8ab5febc34f56ac1f71b555a8cca59245c50ffe27cdf1901d74ac729","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"6ae92e59ec877d7f6afba694213c31445287205d3a9d5a6f580057c80ab5d342","published":"Mon, 08 Jun 2026 00:00:00 -0400","receipt_hash":"6ae92e59ec877d7f6afba694213c31445287205d3a9d5a6f580057c80ab5d342","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"6ae92e59ec877d7f6afba694213c31445287205d3a9d5a6f580057c80ab5d342","observed_at":"2026-06-08T04:44:02.392073Z","parent_run_hash":"4b9e67a023632e16a32d228bb97fee209911f388e0a8dbf20b5a4ec02729c20f","published":"Mon, 08 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2603.11075v3 Announce Type: replace-cross \nAbstract: 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 coupled manner and primarily produce numerical congestion estimates. We propose VeriHGN, a verification framework built on an enhanced heterogeneous graph that unifies circuit components and spatial grids into a single relational representation, enabling more faithful modeling of the interaction between logical intent and physical realiza","title":"VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification","url":"https://arxiv.org/abs/2603.11075","vendor":"arxiv_cs_ai"},"summary":"arXiv:2603.11075v3 Announce Type: replace-cross \nAbstract: 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 coupled manner and primarily produce numerical congestion estimates. We propose VeriHGN, a verification framework built on an enhanced heterogeneous graph that unifies circuit components and spatial grids into a single relational representation, enabling more faithful modeling of the interaction between logical intent and physical realiza","title":"VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-08T04:44:02Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2603.11075"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:a0306b6a538f1ea55a2caf6fef3f6451944ca846442c8c56b6fb0e62323da824ebf6cabbd62d5270f016868e0b2aa221fa58818b2b3f4ffb2c8125ba7370ce0f","signer":"crovia.substrate","subject":{"observed_at":"2026-06-08T04:44:02Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2603.11075"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"98ae90c792d788203ee5687cd41782f6a983364ef862cb264d3e67f62ec5874b","leaf_index":223879,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"d61631bd9c76f827b2f3051192a6a30c889690b4b0742390c715dc5ddeed7092","side":"left"},{"sibling":"a50a5398d9a7512a37736d2025fcfc367c3528be1e1652d15dbcf38ea0cac8f9","side":"left"},{"sibling":"598e01d397659df8c6772413a0693ae3e13470f9ba0ce21e7557f2fcc23fe7d5","side":"left"},{"sibling":"137c2b9819d380ad5369a946c83c65a64bac8dfebc9eccec1b840c657d7e6ba4","side":"right"},{"sibling":"dd42295995afdfc41ea68d1a94b312610b27faac4e158080459345f952b6753e","side":"right"},{"sibling":"7a3fd3b100f030f34dd146a0f7e7ff612e24a350629d2c6d2ccd949dabb576c8","side":"right"},{"sibling":"d9e96a026bf19228243264aa70a028a48f8a58ae04caab8ebd434847bf9e27ac","side":"right"},{"sibling":"e9e4595b6d3a8db8d409d92f766595bee2c79e9389fc033969243fd816d368c5","side":"left"},{"sibling":"fad4d9627e4b025e7840b4e896082fb8291cbf1a4c05653b3a789c8a4205d4b5","side":"right"},{"sibling":"e8dcea313a54920d83e4f72d5a4223f986c719f264241d171c4712efaaf1fc54","side":"left"},{"sibling":"5480e1ea31f4744f9bd7c4261771fe51f2cdb01e705cc17320bfc202d935ca12","side":"right"},{"sibling":"24fdc29d461691aedb6fa920758206b5bb43851f477ef7a04c34aaed84b8971b","side":"left"},{"sibling":"036922da4e1e2c46d948f070454bfad299b7406fb00735ea9d8bd1e687f5f445","side":"right"},{"sibling":"533d82482604463aa4a281b9d8b85917b383b7c5f924b2b494039524c55e8797","side":"left"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"87c6b850dfec08ac35a693d9db3a3315250a68adb1cfab9b1015f212b63b15bd","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":224761,"merkle_root":"e9f7b49b652e869ab97ffba9c5a31356b2d0e3dc5d00bb28944adf737c46b1e7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260609T103805Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-09T14:15:34Z","sig_algorithm":"ed25519","signature":"8ad8076fb12c8e486ae1d1559a9a7ba8e2ee996a9ad3d8ba7bcdbdbd88ab3a15bcb429707aca6d3e9d8b97e2ba755b3dcc77b1abb6601ccb829842719a6fb30d","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_c90c453f8ab5febc34f56ac1f71b555a8cca59245c50ffe27cdf1901d74ac729"}}