{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZTVWCD43GUJ3ELPPMNUNDLAH4F","short_pith_number":"pith:ZTVWCD43","canonical_record":{"source":{"id":"1504.00037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-31T21:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"0bb425ebfc535edadcf7839e2f9ff14f1cbbb41e33df0f6057e2897cf45843dd","abstract_canon_sha256":"0fd8203a996538d9893167ff55b1c62b256412ee9b9bc9805250a99e53e1ec1c"},"schema_version":"1.0"},"canonical_sha256":"cceb610f9b3513b22def6368d1ac07e15acfe693858175414a6d0c6cadd8a82b","source":{"kind":"arxiv","id":"1504.00037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00037","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00037v1","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00037","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVWCD43GUJ3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVWCD43GUJ3ELPP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVWCD43","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZTVWCD43GUJ3ELPPMNUNDLAH4F","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-31T21:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"0bb425ebfc535edadcf7839e2f9ff14f1cbbb41e33df0f6057e2897cf45843dd","abstract_canon_sha256":"0fd8203a996538d9893167ff55b1c62b256412ee9b9bc9805250a99e53e1ec1c"},"schema_version":"1.0"},"canonical_sha256":"cceb610f9b3513b22def6368d1ac07e15acfe693858175414a6d0c6cadd8a82b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:49.919720Z","signature_b64":"kvtXk6EIlpLU718VllgFTldFj2kfAXGLQUaORNYYXGRQXrUOEB6tjKqgdJGwIL8BxxeDRhvmsbhfIernbPOYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cceb610f9b3513b22def6368d1ac07e15acfe693858175414a6d0c6cadd8a82b","last_reissued_at":"2026-05-18T02:19:49.919131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:49.919131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00037","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-18T02:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKcbYKyMGi/4QPskL6VJZKmm/YSzC7AXZ8Kd1xoxz9kzX2ZeHAwsxf3C+zh+UZpccBHV4oF58MzhTj1vgPKPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:03:30.962773Z"},"content_sha256":"64f0e035c453e5decc88b4311812e0449a5d2d2efd5da790d2830f3370476bcf","schema_version":"1.0","event_id":"sha256:64f0e035c453e5decc88b4311812e0449a5d2d2efd5da790d2830f3370476bcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZTVWCD43GUJ3ELPPMNUNDLAH4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alex Horn, Daniel Kroening","submitted_at":"2015-03-31T21:03:30Z","abstract_excerpt":"Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal verification techniques. Among these, symbolic techniques have been shown to be particularly effective at finding concurrency-related bugs because they can leverage highly optimized decision procedures such as SAT/SMT solvers. This paper gives new fundamental results on partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00037","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-18T02:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+xSULd0Qe3u/7WXHXPsUX31anqz/8yK1ho2Wo3JsRV8aolHRX8pYkOmv6XS5CygXq1nax+Sd2HtsS6emrmSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:03:30.963157Z"},"content_sha256":"60b373d3f0cd505df8f70925c94c57d9659b188bb43b53a902d5c05bb7fb4c23","schema_version":"1.0","event_id":"sha256:60b373d3f0cd505df8f70925c94c57d9659b188bb43b53a902d5c05bb7fb4c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/bundle.json","state_url":"https://pith.science/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/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-09T19:03:30Z","links":{"resolver":"https://pith.science/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F","bundle":"https://pith.science/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/bundle.json","state":"https://pith.science/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTVWCD43GUJ3ELPPMNUNDLAH4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZTVWCD43GUJ3ELPPMNUNDLAH4F","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":"0fd8203a996538d9893167ff55b1c62b256412ee9b9bc9805250a99e53e1ec1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-31T21:03:30Z","title_canon_sha256":"0bb425ebfc535edadcf7839e2f9ff14f1cbbb41e33df0f6057e2897cf45843dd"},"schema_version":"1.0","source":{"id":"1504.00037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00037","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00037v1","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00037","created_at":"2026-05-18T02:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVWCD43GUJ3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVWCD43GUJ3ELPP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVWCD43","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:60b373d3f0cd505df8f70925c94c57d9659b188bb43b53a902d5c05bb7fb4c23","target":"graph","created_at":"2026-05-18T02:19: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal verification techniques. Among these, symbolic techniques have been shown to be particularly effective at finding concurrency-related bugs because they can leverage highly optimized decision procedures such as SAT/SMT solvers. This paper gives new fundamental results on partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency.","authors_text":"Alex Horn, Daniel Kroening","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-31T21:03:30Z","title":"On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00037","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:64f0e035c453e5decc88b4311812e0449a5d2d2efd5da790d2830f3370476bcf","target":"record","created_at":"2026-05-18T02:19: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":"0fd8203a996538d9893167ff55b1c62b256412ee9b9bc9805250a99e53e1ec1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-31T21:03:30Z","title_canon_sha256":"0bb425ebfc535edadcf7839e2f9ff14f1cbbb41e33df0f6057e2897cf45843dd"},"schema_version":"1.0","source":{"id":"1504.00037","kind":"arxiv","version":1}},"canonical_sha256":"cceb610f9b3513b22def6368d1ac07e15acfe693858175414a6d0c6cadd8a82b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cceb610f9b3513b22def6368d1ac07e15acfe693858175414a6d0c6cadd8a82b","first_computed_at":"2026-05-18T02:19:49.919131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:49.919131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvtXk6EIlpLU718VllgFTldFj2kfAXGLQUaORNYYXGRQXrUOEB6tjKqgdJGwIL8BxxeDRhvmsbhfIernbPOYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:49.919720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64f0e035c453e5decc88b4311812e0449a5d2d2efd5da790d2830f3370476bcf","sha256:60b373d3f0cd505df8f70925c94c57d9659b188bb43b53a902d5c05bb7fb4c23"],"state_sha256":"f40a1ddc0769566ce5451eae8bb68c5f34255c96d50aa37370ce12bc1b4a88f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N78PENlT86UCSdGM3H8eiYczMNxeNOdlhI04OXvgcFaSzhzw48YyEFofDiM5hj3oaKmYQMspRwrV6/84tR/rBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:03:30.965464Z","bundle_sha256":"e88bfa05cbf1df2bffa06ffe2b58b088f3ffc9340e31de1304c2b199d8de52f9"}}