{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KGXJUE6XJGCR4TF4ZPO7SBUOQ3","short_pith_number":"pith:KGXJUE6X","canonical_record":{"source":{"id":"2605.03822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-05T14:50:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"08e9fdaffc954c60654c3fa4e17ac4c2b8fc2505dc3a4072d1712e42486f26cc","abstract_canon_sha256":"20de92cb59911c2cd4f0e7256f2819e1550d6bbe2c2c21ad005e20525518f832"},"schema_version":"1.0"},"canonical_sha256":"51ae9a13d749851e4cbccbddf9068e86eb8e497e077b3c3d04e2e481e2cb3e7e","source":{"kind":"arxiv","id":"2605.03822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03822","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03822v2","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03822","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"KGXJUE6XJGCR","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_16","alias_value":"KGXJUE6XJGCR4TF4","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_8","alias_value":"KGXJUE6X","created_at":"2026-08-04T01:52:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KGXJUE6XJGCR4TF4ZPO7SBUOQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.03822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-05T14:50:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"08e9fdaffc954c60654c3fa4e17ac4c2b8fc2505dc3a4072d1712e42486f26cc","abstract_canon_sha256":"20de92cb59911c2cd4f0e7256f2819e1550d6bbe2c2c21ad005e20525518f832"},"schema_version":"1.0"},"canonical_sha256":"51ae9a13d749851e4cbccbddf9068e86eb8e497e077b3c3d04e2e481e2cb3e7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:52:49.006294Z","signature_b64":"wIFu4tor2gycymsr2kmIOfvvQR/l3K8UAb/CyV3XQ+sq5B9FeOaBH8r5eBFm+J0QNdM5Q3PpWMsNDLMjz3ShBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ae9a13d749851e4cbccbddf9068e86eb8e497e077b3c3d04e2e481e2cb3e7e","last_reissued_at":"2026-08-04T01:52:49.004699Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:52:49.004699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.03822","source_version":2,"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-08-04T01:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTEjVZe3PmhC1WZ39rxUcaI/E5/QFnkHYlx6gxNUnWKqv14UvAP5R7F4dQ38nmrt31LaA1Yf0RFKVH9LKf4+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:37:00.873409Z"},"content_sha256":"3383dc266ebdcf3a152b18ca8681046840c915ce68084b646252ca848f00272a","schema_version":"1.0","event_id":"sha256:3383dc266ebdcf3a152b18ca8681046840c915ce68084b646252ca848f00272a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KGXJUE6XJGCR4TF4ZPO7SBUOQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KVerus: Scalable and Resilient Formal Verification Proof Generation for Rust Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains.","cross_cats":["cs.CR"],"primary_cat":"cs.SE","authors_text":"Lin Huang, Minghua Wang, Tao Wei, Xinyi Wan, Yanhao Wang, Yuwei Liu","submitted_at":"2026-05-05T14:50:24Z","abstract_excerpt":"Formal verification provides the highest assurance of software correctness and security, but its application to large-scale, evolving systems remains a major challenge. While large language models (LLMs) have shown promise in automating proof generation, they often fail in real-world settings due to their inability to handle complex cross-module dependencies or changes in the codebase or the verification toolchain. We identify the fundamental problem as the Semantic-Structural Gap: LLMs operate on semantic code patterns, whereas formal verification is governed by rigid structural dependencies,"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"KVerus verifies 80.2% of tasks on three single-file benchmarks (vs. 56.9% for AutoVerus), 51.0% on three repository-level benchmarks with cross-file dependencies (vs. 4.5% for multi-round prompting), and produces upstream-accepted proofs for 23 previously unverified functions (21.0% of proof code) in the Asterinas memory-management module.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a dynamic knowledge base built from dependency analysis, semantic indexing, and error-driven refinement will reliably bridge the Semantic-Structural Gap for arbitrary cross-module changes and toolchain updates without requiring substantial manual lemma engineering or human proof repair.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"KVerus combines dependency-aware analysis, semantic indexing, and self-refinement to verify 80% of single-file Rust tasks and 51% of repository-level tasks, including 23 new functions in a real OS kernel.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ea40e1104c47710604ce579f01f02c87a2807682fc5d4575e527ddd0c3831362"},"source":{"id":"2605.03822","kind":"arxiv","version":2},"verdict":{"id":"9ee8f7c7-4826-40ea-948e-25c2c4fb51cf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:47:44.743899Z","strongest_claim":"KVerus verifies 80.2% of tasks on three single-file benchmarks (vs. 56.9% for AutoVerus), 51.0% on three repository-level benchmarks with cross-file dependencies (vs. 4.5% for multi-round prompting), and produces upstream-accepted proofs for 23 previously unverified functions (21.0% of proof code) in the Asterinas memory-management module.","one_line_summary":"KVerus combines dependency-aware analysis, semantic indexing, and self-refinement to verify 80% of single-file Rust tasks and 51% of repository-level tasks, including 23 new functions in a real OS kernel.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a dynamic knowledge base built from dependency analysis, semantic indexing, and error-driven refinement will reliably bridge the Semantic-Structural Gap for arbitrary cross-module changes and toolchain updates without requiring substantial manual lemma engineering or human proof repair.","pith_extraction_headline":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03822/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:33:37.198109Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:20.927296Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:01:52.702497Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ac15012fcf665fb02adfa7a98a870392a7a4327809379fe660f1a6f0be485074"},"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":"9ee8f7c7-4826-40ea-948e-25c2c4fb51cf"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-04T01:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ny8k5bJBNIxpBOfTyKnin+eciBqBjycLKYekVPstlMLaQpooQzWkDINt3oSUsjRgKLxvj0mlhvD6cbG7HRQgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:37:00.875296Z"},"content_sha256":"d2b68068a761169a5604e07e838c4d55731f6222713ca2b969dd0b3b02c4076a","schema_version":"1.0","event_id":"sha256:d2b68068a761169a5604e07e838c4d55731f6222713ca2b969dd0b3b02c4076a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/bundle.json","state_url":"https://pith.science/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/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-08-22T04:37:00Z","links":{"resolver":"https://pith.science/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3","bundle":"https://pith.science/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/bundle.json","state":"https://pith.science/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGXJUE6XJGCR4TF4ZPO7SBUOQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KGXJUE6XJGCR4TF4ZPO7SBUOQ3","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":"20de92cb59911c2cd4f0e7256f2819e1550d6bbe2c2c21ad005e20525518f832","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-05T14:50:24Z","title_canon_sha256":"08e9fdaffc954c60654c3fa4e17ac4c2b8fc2505dc3a4072d1712e42486f26cc"},"schema_version":"1.0","source":{"id":"2605.03822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03822","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03822v2","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03822","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"KGXJUE6XJGCR","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_16","alias_value":"KGXJUE6XJGCR4TF4","created_at":"2026-08-04T01:52:49Z"},{"alias_kind":"pith_short_8","alias_value":"KGXJUE6X","created_at":"2026-08-04T01:52:49Z"}],"graph_snapshots":[{"event_id":"sha256:d2b68068a761169a5604e07e838c4d55731f6222713ca2b969dd0b3b02c4076a","target":"graph","created_at":"2026-08-04T01:52:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"KVerus verifies 80.2% of tasks on three single-file benchmarks (vs. 56.9% for AutoVerus), 51.0% on three repository-level benchmarks with cross-file dependencies (vs. 4.5% for multi-round prompting), and produces upstream-accepted proofs for 23 previously unverified functions (21.0% of proof code) in the Asterinas memory-management module."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that a dynamic knowledge base built from dependency analysis, semantic indexing, and error-driven refinement will reliably bridge the Semantic-Structural Gap for arbitrary cross-module changes and toolchain updates without requiring substantial manual lemma engineering or human proof repair."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"KVerus combines dependency-aware analysis, semantic indexing, and self-refinement to verify 80% of single-file Rust tasks and 51% of repository-level tasks, including 23 new functions in a real OS kernel."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains."}],"snapshot_sha256":"ea40e1104c47710604ce579f01f02c87a2807682fc5d4575e527ddd0c3831362"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T13:33:37.198109Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:20.927296Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:01:52.702497Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03822/integrity.json","findings":[],"snapshot_sha256":"ac15012fcf665fb02adfa7a98a870392a7a4327809379fe660f1a6f0be485074","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Formal verification provides the highest assurance of software correctness and security, but its application to large-scale, evolving systems remains a major challenge. While large language models (LLMs) have shown promise in automating proof generation, they often fail in real-world settings due to their inability to handle complex cross-module dependencies or changes in the codebase or the verification toolchain. We identify the fundamental problem as the Semantic-Structural Gap: LLMs operate on semantic code patterns, whereas formal verification is governed by rigid structural dependencies,","authors_text":"Lin Huang, Minghua Wang, Tao Wei, Xinyi Wan, Yanhao Wang, Yuwei Liu","cross_cats":["cs.CR"],"headline":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-05T14:50:24Z","title":"KVerus: Scalable and Resilient Formal Verification Proof Generation for Rust Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03822","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T15:47:44.743899Z","id":"9ee8f7c7-4826-40ea-948e-25c2c4fb51cf","model_set":{"reader":"grok-4.3"},"one_line_summary":"KVerus combines dependency-aware analysis, semantic indexing, and self-refinement to verify 80% of single-file Rust tasks and 51% of repository-level tasks, including 23 new functions in a real OS kernel.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"KVerus builds a dynamic knowledge base to generate and repair formal proofs for Rust code across changing dependencies and toolchains.","strongest_claim":"KVerus verifies 80.2% of tasks on three single-file benchmarks (vs. 56.9% for AutoVerus), 51.0% on three repository-level benchmarks with cross-file dependencies (vs. 4.5% for multi-round prompting), and produces upstream-accepted proofs for 23 previously unverified functions (21.0% of proof code) in the Asterinas memory-management module.","weakest_assumption":"The assumption that a dynamic knowledge base built from dependency analysis, semantic indexing, and error-driven refinement will reliably bridge the Semantic-Structural Gap for arbitrary cross-module changes and toolchain updates without requiring substantial manual lemma engineering or human proof repair."}},"verdict_id":"9ee8f7c7-4826-40ea-948e-25c2c4fb51cf"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3383dc266ebdcf3a152b18ca8681046840c915ce68084b646252ca848f00272a","target":"record","created_at":"2026-08-04T01:52:49Z","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":"20de92cb59911c2cd4f0e7256f2819e1550d6bbe2c2c21ad005e20525518f832","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-05T14:50:24Z","title_canon_sha256":"08e9fdaffc954c60654c3fa4e17ac4c2b8fc2505dc3a4072d1712e42486f26cc"},"schema_version":"1.0","source":{"id":"2605.03822","kind":"arxiv","version":2}},"canonical_sha256":"51ae9a13d749851e4cbccbddf9068e86eb8e497e077b3c3d04e2e481e2cb3e7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51ae9a13d749851e4cbccbddf9068e86eb8e497e077b3c3d04e2e481e2cb3e7e","first_computed_at":"2026-08-04T01:52:49.004699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T01:52:49.004699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIFu4tor2gycymsr2kmIOfvvQR/l3K8UAb/CyV3XQ+sq5B9FeOaBH8r5eBFm+J0QNdM5Q3PpWMsNDLMjz3ShBw==","signature_status":"signed_v1","signed_at":"2026-08-04T01:52:49.006294Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3383dc266ebdcf3a152b18ca8681046840c915ce68084b646252ca848f00272a","sha256:d2b68068a761169a5604e07e838c4d55731f6222713ca2b969dd0b3b02c4076a"],"state_sha256":"510e1c64a7d24159325825e1dcc21769b896ec8114b7c07fa9f542fdfe1ccf99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTMkrm2VtLJgJ0znsUsqyeKLbWlPPmmAValQUK7PIW4qv6db84vnGzQduAOFUo7AtHIsAuwlYGq3bYvFt09VBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:37:00.897393Z","bundle_sha256":"3a7b5ad659d5d21dff7afb9cdd877f96d6565a0b3a37a8265d93d303ce8c7801"}}