{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:66C3CF7D2IACPMS37WLA3VZCA6","short_pith_number":"pith:66C3CF7D","canonical_record":{"source":{"id":"1703.05341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"336f1894c5188295ebf43e05ee25450264989726ae4da1902b2ca3bf5a6a0ca6","abstract_canon_sha256":"fc2093cb3053fee7100fbf1655d5e9c39308581e98743d9ba15af317c1c0f8f0"},"schema_version":"1.0"},"canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","source":{"kind":"arxiv","id":"1703.05341","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05341","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05341v3","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05341","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"66C3CF7D2IAC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66C3CF7D2IACPMS3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66C3CF7D","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:66C3CF7D2IACPMS37WLA3VZCA6","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"336f1894c5188295ebf43e05ee25450264989726ae4da1902b2ca3bf5a6a0ca6","abstract_canon_sha256":"fc2093cb3053fee7100fbf1655d5e9c39308581e98743d9ba15af317c1c0f8f0"},"schema_version":"1.0"},"canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:13.585677Z","signature_b64":"HcxxcxWljzqNWVfLMmOn4PFOUrbfHmCzl5JORSHN9xi+nrwDvxMiADA+X02SGr66Att1/y8pV0Irp9c+M5CuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","last_reissued_at":"2026-05-17T23:41:13.585178Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:13.585178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05341","source_version":3,"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-05-17T23:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOC1GeWDTLk3TAiniudicxlMMx0Iu83eVgLtSfqESFB6jPvIPRArDTe0zgPzaGaWy/vxtg+DVYWaQ1hHNp8sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:28.862629Z"},"content_sha256":"9c110ff7c4bfd2affedfe7a7e15721c00dd6cca5559cf5671629262347fe9342","schema_version":"1.0","event_id":"sha256:9c110ff7c4bfd2affedfe7a7e15721c00dd6cca5559cf5671629262347fe9342"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:66C3CF7D2IACPMS37WLA3VZCA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DiVM: Model Checking with LLVM and Graph Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Petr Ro\\v{c}kai, Vladim\\'ir \\v{S}till","submitted_at":"2017-03-15T18:29:50Z","abstract_excerpt":"In this paper, we introduce the concept of a virtual machine with graph-organised memory as a versatile backend for both explicit-state and abstraction-driven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hypercalls are sufficient to implement a small operating system, which can then be linked with applications to provide a POSIX-compatible verification environment. Finally, we demonstrate the viability of the approach through a comparison with a more traditionally-designed LLVM model ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05341","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggSG32dCHgVuZXtAKnQyEq7i+SSt8QTyCsISzZ1ADasRHN8gpcIkPss5GcVqJWEn3tBglBlK8BgZwNINYSo6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:28.863445Z"},"content_sha256":"79e4eaee445cb974b2b9b1d532cafa9935053be6722b213d3ee1d7474c5078ca","schema_version":"1.0","event_id":"sha256:79e4eaee445cb974b2b9b1d532cafa9935053be6722b213d3ee1d7474c5078ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/bundle.json","state_url":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66C3CF7D2IACPMS37WLA3VZCA6/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-05-31T01:18:28Z","links":{"resolver":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6","bundle":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/bundle.json","state":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66C3CF7D2IACPMS37WLA3VZCA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:66C3CF7D2IACPMS37WLA3VZCA6","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":"fc2093cb3053fee7100fbf1655d5e9c39308581e98743d9ba15af317c1c0f8f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","title_canon_sha256":"336f1894c5188295ebf43e05ee25450264989726ae4da1902b2ca3bf5a6a0ca6"},"schema_version":"1.0","source":{"id":"1703.05341","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05341","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05341v3","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05341","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"66C3CF7D2IAC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66C3CF7D2IACPMS3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66C3CF7D","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:79e4eaee445cb974b2b9b1d532cafa9935053be6722b213d3ee1d7474c5078ca","target":"graph","created_at":"2026-05-17T23:41:13Z","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"},"paper":{"abstract_excerpt":"In this paper, we introduce the concept of a virtual machine with graph-organised memory as a versatile backend for both explicit-state and abstraction-driven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hypercalls are sufficient to implement a small operating system, which can then be linked with applications to provide a POSIX-compatible verification environment. Finally, we demonstrate the viability of the approach through a comparison with a more traditionally-designed LLVM model ch","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Petr Ro\\v{c}kai, Vladim\\'ir \\v{S}till","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","title":"DiVM: Model Checking with LLVM and Graph Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05341","kind":"arxiv","version":3},"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:9c110ff7c4bfd2affedfe7a7e15721c00dd6cca5559cf5671629262347fe9342","target":"record","created_at":"2026-05-17T23:41:13Z","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":"fc2093cb3053fee7100fbf1655d5e9c39308581e98743d9ba15af317c1c0f8f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","title_canon_sha256":"336f1894c5188295ebf43e05ee25450264989726ae4da1902b2ca3bf5a6a0ca6"},"schema_version":"1.0","source":{"id":"1703.05341","kind":"arxiv","version":3}},"canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","first_computed_at":"2026-05-17T23:41:13.585178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:13.585178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcxxcxWljzqNWVfLMmOn4PFOUrbfHmCzl5JORSHN9xi+nrwDvxMiADA+X02SGr66Att1/y8pV0Irp9c+M5CuBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:13.585677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05341","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c110ff7c4bfd2affedfe7a7e15721c00dd6cca5559cf5671629262347fe9342","sha256:79e4eaee445cb974b2b9b1d532cafa9935053be6722b213d3ee1d7474c5078ca"],"state_sha256":"b5c33feb6fb329831ffc88750f4a3592ff56edc5386b9b11f178132b4b8b9f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyVoYvY98DzDUVzcBgE+v0CqrvsESJ4XkF6xRjbYYBsP+580roUryOeMFx+b6V6d+AbxJt/2ZpQo6+wmlDJkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:18:28.870258Z","bundle_sha256":"934ae21a523cd24578ab4b35d537b2d15477eaa3f8b0089fa49cbfd88c1db687"}}