{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZVJPL2JB5D5H2ZVKVNNCVTALXV","short_pith_number":"pith:ZVJPL2JB","canonical_record":{"source":{"id":"1808.09870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-29T15:04:58Z","cross_cats_sorted":[],"title_canon_sha256":"49f77fa4dcfe075975b731e2c5ca75cb5cc1c29e73f92f0c8843d8fa940df266","abstract_canon_sha256":"05c919d819febea7884ecee8c608e8f8607ed9df884e8506b1cf39e111f1e353"},"schema_version":"1.0"},"canonical_sha256":"cd52f5e921e8fa7d66aaab5a2acc0bbd61cce8a56cd62073603276955d0dc497","source":{"kind":"arxiv","id":"1808.09870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09870","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09870v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09870","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZVJPL2JB5D5H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZVJPL2JB5D5H2ZVK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZVJPL2JB","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZVJPL2JB5D5H2ZVKVNNCVTALXV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-29T15:04:58Z","cross_cats_sorted":[],"title_canon_sha256":"49f77fa4dcfe075975b731e2c5ca75cb5cc1c29e73f92f0c8843d8fa940df266","abstract_canon_sha256":"05c919d819febea7884ecee8c608e8f8607ed9df884e8506b1cf39e111f1e353"},"schema_version":"1.0"},"canonical_sha256":"cd52f5e921e8fa7d66aaab5a2acc0bbd61cce8a56cd62073603276955d0dc497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.154942Z","signature_b64":"ZblSyX+ICd4sCtWMxT8xWIP4N+RaHrpRPaIuvjA2XRrx8rDNZaU+Nk5YlQhNm+Vuo57AXphsl5A8lPoV9OV5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd52f5e921e8fa7d66aaab5a2acc0bbd61cce8a56cd62073603276955d0dc497","last_reissued_at":"2026-05-18T00:06:54.154301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.154301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09870","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DL4ZcX0/DOUOWb777OXVxLlaPqR9sC7pk/PqqB4+g9WJrT2CtLsnnBEC0//7t3DYyvhbc3LqMFDnYf9oCReCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:43:47.902445Z"},"content_sha256":"eec734bd40d2cd72576967f020d52511150fb738ef2bd9a164b29b7045f39cf1","schema_version":"1.0","event_id":"sha256:eec734bd40d2cd72576967f020d52511150fb738ef2bd9a164b29b7045f39cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZVJPL2JB5D5H2ZVKVNNCVTALXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Consistency Models using Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"\\\"Ozg\\\"ur Akg\\\"un, Ruth Hoffmann, Susmit Sarkar","submitted_at":"2018-08-29T15:04:58Z","abstract_excerpt":"Memory consistency models (MCMs) are at the heart of concurrent programming. They represent the behaviour of concurrent programs at the chip level. To test these models small program snippets called litmus test are generated, which show allowed or forbidden behaviour of different MCMs. This paper is showcasing the use of constraint programming to automate the generation and testing of litmus tests for memory consistency models. We produce a few exemplary case studies for two MCMs, namely Sequential Consistency and Total Store Order. These studies demonstrate the flexibility of constrains progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09870","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0gZlK6F9539hzFrx4qjsY89JaRyRR7RGrwzTjJLWXGy2SphWcC2IavlTp4cQ+teTmKTDI7UKU67jTM/fSifCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:43:47.902804Z"},"content_sha256":"05dfa9f4423f7274afa89e8f30854c40be3a9b90251a25da56d3e553d918af1a","schema_version":"1.0","event_id":"sha256:05dfa9f4423f7274afa89e8f30854c40be3a9b90251a25da56d3e553d918af1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/bundle.json","state_url":"https://pith.science/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/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-22T09:43:47Z","links":{"resolver":"https://pith.science/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV","bundle":"https://pith.science/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/bundle.json","state":"https://pith.science/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVJPL2JB5D5H2ZVKVNNCVTALXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZVJPL2JB5D5H2ZVKVNNCVTALXV","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":"05c919d819febea7884ecee8c608e8f8607ed9df884e8506b1cf39e111f1e353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-29T15:04:58Z","title_canon_sha256":"49f77fa4dcfe075975b731e2c5ca75cb5cc1c29e73f92f0c8843d8fa940df266"},"schema_version":"1.0","source":{"id":"1808.09870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09870","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09870v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09870","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZVJPL2JB5D5H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZVJPL2JB5D5H2ZVK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZVJPL2JB","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:05dfa9f4423f7274afa89e8f30854c40be3a9b90251a25da56d3e553d918af1a","target":"graph","created_at":"2026-05-18T00:06:54Z","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":"Memory consistency models (MCMs) are at the heart of concurrent programming. They represent the behaviour of concurrent programs at the chip level. To test these models small program snippets called litmus test are generated, which show allowed or forbidden behaviour of different MCMs. This paper is showcasing the use of constraint programming to automate the generation and testing of litmus tests for memory consistency models. We produce a few exemplary case studies for two MCMs, namely Sequential Consistency and Total Store Order. These studies demonstrate the flexibility of constrains progr","authors_text":"\\\"Ozg\\\"ur Akg\\\"un, Ruth Hoffmann, Susmit Sarkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-29T15:04:58Z","title":"Memory Consistency Models using Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09870","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:eec734bd40d2cd72576967f020d52511150fb738ef2bd9a164b29b7045f39cf1","target":"record","created_at":"2026-05-18T00:06:54Z","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":"05c919d819febea7884ecee8c608e8f8607ed9df884e8506b1cf39e111f1e353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-29T15:04:58Z","title_canon_sha256":"49f77fa4dcfe075975b731e2c5ca75cb5cc1c29e73f92f0c8843d8fa940df266"},"schema_version":"1.0","source":{"id":"1808.09870","kind":"arxiv","version":1}},"canonical_sha256":"cd52f5e921e8fa7d66aaab5a2acc0bbd61cce8a56cd62073603276955d0dc497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd52f5e921e8fa7d66aaab5a2acc0bbd61cce8a56cd62073603276955d0dc497","first_computed_at":"2026-05-18T00:06:54.154301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.154301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZblSyX+ICd4sCtWMxT8xWIP4N+RaHrpRPaIuvjA2XRrx8rDNZaU+Nk5YlQhNm+Vuo57AXphsl5A8lPoV9OV5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.154942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eec734bd40d2cd72576967f020d52511150fb738ef2bd9a164b29b7045f39cf1","sha256:05dfa9f4423f7274afa89e8f30854c40be3a9b90251a25da56d3e553d918af1a"],"state_sha256":"7a1ae9a08a4a8919df4cbc80b5a7082b34cb0983d25f8074a6e2c13b70badf74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOu328WVTPrLyrUkoDaUl3qFiAeqVNBU7Y18BafHIOiB0QDq/lXYV6MBXxmDC7hDl2xJmvNx6WuVLC2PsmTHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:43:47.904926Z","bundle_sha256":"499f54e14b873e8dacc42a5779a05ba6d9f04fcedeee4bd775e5a00e8498a019"}}