{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KQRBOAUI6ZKV2L75VSPCROPEIJ","short_pith_number":"pith:KQRBOAUI","canonical_record":{"source":{"id":"2605.31040","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T09:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"5c08532df7f33290b623b6ecdd7972449792ae36c94647242b98bfb1ea65c92e","abstract_canon_sha256":"3b3e0159476e9df7ee5f06d91a3ba9dc24df787a934f324df82f59b92122969e"},"schema_version":"1.0"},"canonical_sha256":"5422170288f6555d2ffdac9e28b9e442567fc0189d278bdf604ff53e61c71e69","source":{"kind":"arxiv","id":"2605.31040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31040","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31040v1","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31040","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"KQRBOAUI6ZKV","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"KQRBOAUI6ZKV2L75","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"KQRBOAUI","created_at":"2026-06-01T01:03:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KQRBOAUI6ZKV2L75VSPCROPEIJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.31040","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T09:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"5c08532df7f33290b623b6ecdd7972449792ae36c94647242b98bfb1ea65c92e","abstract_canon_sha256":"3b3e0159476e9df7ee5f06d91a3ba9dc24df787a934f324df82f59b92122969e"},"schema_version":"1.0"},"canonical_sha256":"5422170288f6555d2ffdac9e28b9e442567fc0189d278bdf604ff53e61c71e69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:32.263844Z","signature_b64":"wIoir4R0PjgfX5e16m3HuazDotWFv+rYPwuMsfky6gIXNZpkdwFZbUbBHdMuuXCu+2nM0+Vds9xexiu5GtAuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5422170288f6555d2ffdac9e28b9e442567fc0189d278bdf604ff53e61c71e69","last_reissued_at":"2026-06-01T01:03:32.263088Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:32.263088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.31040","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0g7w+S3OiJo8+msIeo3UWWjhfmhRZmqDas0EdfqdquRbgoMEbQW9cPWpDXsRFFXcT7eOnXjQltwb+HyewsXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:52:24.363286Z"},"content_sha256":"cc97d185e4a9d9e11384fd43474e60da40cc323a883b418b366ad8906c3f184c","schema_version":"1.0","event_id":"sha256:cc97d185e4a9d9e11384fd43474e60da40cc323a883b418b366ad8906c3f184c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KQRBOAUI6ZKV2L75VSPCROPEIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UniRTL: Unifying Code and Graph for Robust RTL Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongji Zhang, Lei Chen, Mingxuan Yuan, Qiang Xu, Yi Liu","submitted_at":"2026-05-29T09:18:23Z","abstract_excerpt":"Developing effective representations for register transfer level (RTL) designs is crucial for accelerating the hardware design workflow. Existing approaches, however, typically rely on a single data modality, either the RTL code or its associated graph-based representation, limiting the expressiveness and generalization ability of the learned representations. For RTL, the control data flow graph (CDFG) offers a comprehensive structural representation that preserves complete information, while the code modality explicitly encodes semantic and functional information. We argue that integrating th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31040","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/2605.31040/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDyyWHest7AQUULf5c+pa+U3DUmNKDiLOZghHSPEB4GAZNtM74h0Lhw8C9+K/DU8L/6MbnrYCMP0w0Dlist5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:52:24.363681Z"},"content_sha256":"6f3ab373ba7c3f590d8c7c311a977332f5aeefebc2152d0061c8b7270b0b4b7b","schema_version":"1.0","event_id":"sha256:6f3ab373ba7c3f590d8c7c311a977332f5aeefebc2152d0061c8b7270b0b4b7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/bundle.json","state_url":"https://pith.science/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T10:52:24Z","links":{"resolver":"https://pith.science/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ","bundle":"https://pith.science/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/bundle.json","state":"https://pith.science/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQRBOAUI6ZKV2L75VSPCROPEIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KQRBOAUI6ZKV2L75VSPCROPEIJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b3e0159476e9df7ee5f06d91a3ba9dc24df787a934f324df82f59b92122969e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T09:18:23Z","title_canon_sha256":"5c08532df7f33290b623b6ecdd7972449792ae36c94647242b98bfb1ea65c92e"},"schema_version":"1.0","source":{"id":"2605.31040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31040","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31040v1","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31040","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"KQRBOAUI6ZKV","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"KQRBOAUI6ZKV2L75","created_at":"2026-06-01T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"KQRBOAUI","created_at":"2026-06-01T01:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:6f3ab373ba7c3f590d8c7c311a977332f5aeefebc2152d0061c8b7270b0b4b7b","target":"graph","created_at":"2026-06-01T01:03:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.31040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Developing effective representations for register transfer level (RTL) designs is crucial for accelerating the hardware design workflow. Existing approaches, however, typically rely on a single data modality, either the RTL code or its associated graph-based representation, limiting the expressiveness and generalization ability of the learned representations. For RTL, the control data flow graph (CDFG) offers a comprehensive structural representation that preserves complete information, while the code modality explicitly encodes semantic and functional information. We argue that integrating th","authors_text":"Hongji Zhang, Lei Chen, Mingxuan Yuan, Qiang Xu, Yi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T09:18:23Z","title":"UniRTL: Unifying Code and Graph for Robust RTL Representation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31040","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc97d185e4a9d9e11384fd43474e60da40cc323a883b418b366ad8906c3f184c","target":"record","created_at":"2026-06-01T01:03:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b3e0159476e9df7ee5f06d91a3ba9dc24df787a934f324df82f59b92122969e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T09:18:23Z","title_canon_sha256":"5c08532df7f33290b623b6ecdd7972449792ae36c94647242b98bfb1ea65c92e"},"schema_version":"1.0","source":{"id":"2605.31040","kind":"arxiv","version":1}},"canonical_sha256":"5422170288f6555d2ffdac9e28b9e442567fc0189d278bdf604ff53e61c71e69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5422170288f6555d2ffdac9e28b9e442567fc0189d278bdf604ff53e61c71e69","first_computed_at":"2026-06-01T01:03:32.263088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:32.263088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIoir4R0PjgfX5e16m3HuazDotWFv+rYPwuMsfky6gIXNZpkdwFZbUbBHdMuuXCu+2nM0+Vds9xexiu5GtAuBA==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:32.263844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.31040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc97d185e4a9d9e11384fd43474e60da40cc323a883b418b366ad8906c3f184c","sha256:6f3ab373ba7c3f590d8c7c311a977332f5aeefebc2152d0061c8b7270b0b4b7b"],"state_sha256":"96011443a14d89e8aa39d3a67912fa8a58eebeeef7e675a6396ccee5c73a9c54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHtthOkFcRudeoQXu219PLGztb0FEpMRZDwkqyrmQp/D3++lv4l+78KjZoyI9wxWZe9x+Y2tLT9gDEIdA4RQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T10:52:24.365649Z","bundle_sha256":"d85056ba0a1b6336aa0c1f11a38e5a094feab255f68052108b695632c0151fda"}}