{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7SOFEXFUQOU7SAKGSWBHKWQLLC","short_pith_number":"pith:7SOFEXFU","canonical_record":{"source":{"id":"1303.7379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-03-29T12:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"ac5790e4b577de6abe4a5d486bfe211410a7437f882952eaa17bcf8bcc5ccce9","abstract_canon_sha256":"b125c477e7cc3d2bc5f23a77fb2cbb733327397e99a5125caba0a135ef2c98f9"},"schema_version":"1.0"},"canonical_sha256":"fc9c525cb483a9f901469582755a0b58996d3fe7f4d4bcfadac4b75126f07140","source":{"kind":"arxiv","id":"1303.7379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7379","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7379v1","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7379","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"7SOFEXFUQOU7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SOFEXFUQOU7SAKG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SOFEXFU","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7SOFEXFUQOU7SAKGSWBHKWQLLC","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-03-29T12:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"ac5790e4b577de6abe4a5d486bfe211410a7437f882952eaa17bcf8bcc5ccce9","abstract_canon_sha256":"b125c477e7cc3d2bc5f23a77fb2cbb733327397e99a5125caba0a135ef2c98f9"},"schema_version":"1.0"},"canonical_sha256":"fc9c525cb483a9f901469582755a0b58996d3fe7f4d4bcfadac4b75126f07140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:28.632670Z","signature_b64":"lF0xGX+HQAQYpaCJcGzI5DQB3WGxsYFpFv0VPoMq3Oq8cZPQX9HRm8j/VAYA5Hn0YGIw0eqrn9zPjeqGLjPDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc9c525cb483a9f901469582755a0b58996d3fe7f4d4bcfadac4b75126f07140","last_reissued_at":"2026-05-18T03:29:28.632108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:28.632108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7379","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-05-18T03:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lahfO1gHNhwUDBqOSjxgo25lh2PQtpcXq9/1so90ODpdg6e6tvFgxAb5YtwoxCI10JjtAT9ijQKOJWaJguAcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:33:01.453719Z"},"content_sha256":"5b81b4340d9290c235c3bcf5a43247e18d751c5bb4dbcd97642ba727d15094a1","schema_version":"1.0","event_id":"sha256:5b81b4340d9290c235c3bcf5a43247e18d751c5bb4dbcd97642ba727d15094a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7SOFEXFUQOU7SAKGSWBHKWQLLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Control Explicit---Data Symbolic Model Checking: An Introduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jiri Barnat, Petr Bauch","submitted_at":"2013-03-29T12:40:54Z","abstract_excerpt":"A comprehensive verification of parallel software imposes three crucial requirements on the procedure that implements it. Apart from accepting real code as program input and temporal formulae as specification input, the verification should be exhaustive, with respect to both control and data flows. This paper is concerned with the third requirement, proposing to combine explicit model checking to handle the control with symbolic set representations to handle the data. The combination of explicit and symbolic approaches is first investigated theoretically and we report the requirements on the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7379","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":""},"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-18T03:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUgj0vUqDHjt4pq7j03VGEKJHBBXMk7CqpqmxarLP7uk8IvnkWoKvHpyqbImYum9kmw9/1/eoTp+3WztnvHwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:33:01.454083Z"},"content_sha256":"b720d6b929e02c4cbb9daefc9c5e6cbcb351d5a549f9ae21e10a106baea8cebf","schema_version":"1.0","event_id":"sha256:b720d6b929e02c4cbb9daefc9c5e6cbcb351d5a549f9ae21e10a106baea8cebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/bundle.json","state_url":"https://pith.science/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/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-09T14:33:01Z","links":{"resolver":"https://pith.science/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC","bundle":"https://pith.science/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/bundle.json","state":"https://pith.science/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SOFEXFUQOU7SAKGSWBHKWQLLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7SOFEXFUQOU7SAKGSWBHKWQLLC","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":"b125c477e7cc3d2bc5f23a77fb2cbb733327397e99a5125caba0a135ef2c98f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-03-29T12:40:54Z","title_canon_sha256":"ac5790e4b577de6abe4a5d486bfe211410a7437f882952eaa17bcf8bcc5ccce9"},"schema_version":"1.0","source":{"id":"1303.7379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7379","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7379v1","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7379","created_at":"2026-05-18T03:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"7SOFEXFUQOU7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7SOFEXFUQOU7SAKG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7SOFEXFU","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:b720d6b929e02c4cbb9daefc9c5e6cbcb351d5a549f9ae21e10a106baea8cebf","target":"graph","created_at":"2026-05-18T03:29:28Z","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":"A comprehensive verification of parallel software imposes three crucial requirements on the procedure that implements it. Apart from accepting real code as program input and temporal formulae as specification input, the verification should be exhaustive, with respect to both control and data flows. This paper is concerned with the third requirement, proposing to combine explicit model checking to handle the control with symbolic set representations to handle the data. The combination of explicit and symbolic approaches is first investigated theoretically and we report the requirements on the s","authors_text":"Jiri Barnat, Petr Bauch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-03-29T12:40:54Z","title":"Control Explicit---Data Symbolic Model Checking: An Introduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7379","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:5b81b4340d9290c235c3bcf5a43247e18d751c5bb4dbcd97642ba727d15094a1","target":"record","created_at":"2026-05-18T03:29:28Z","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":"b125c477e7cc3d2bc5f23a77fb2cbb733327397e99a5125caba0a135ef2c98f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-03-29T12:40:54Z","title_canon_sha256":"ac5790e4b577de6abe4a5d486bfe211410a7437f882952eaa17bcf8bcc5ccce9"},"schema_version":"1.0","source":{"id":"1303.7379","kind":"arxiv","version":1}},"canonical_sha256":"fc9c525cb483a9f901469582755a0b58996d3fe7f4d4bcfadac4b75126f07140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc9c525cb483a9f901469582755a0b58996d3fe7f4d4bcfadac4b75126f07140","first_computed_at":"2026-05-18T03:29:28.632108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:28.632108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lF0xGX+HQAQYpaCJcGzI5DQB3WGxsYFpFv0VPoMq3Oq8cZPQX9HRm8j/VAYA5Hn0YGIw0eqrn9zPjeqGLjPDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:28.632670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b81b4340d9290c235c3bcf5a43247e18d751c5bb4dbcd97642ba727d15094a1","sha256:b720d6b929e02c4cbb9daefc9c5e6cbcb351d5a549f9ae21e10a106baea8cebf"],"state_sha256":"5fb4a4b728ffd4e3142cd63bfb3c20b8bfb0e438d94b0001375ec085e6843f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B52NootEtlW0tsqYLvZg1OfIs4VZi6+r4gUlIgLwihlBakqoTHZxBVnohW13nXGuSzn1KijuSvzJ4IIWhjKWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:33:01.456041Z","bundle_sha256":"ae49e9c86e3c3c4d37374c2d0a29e3f9df588b134c225b012d69c42d79c83ce3"}}