{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6FMWYVM2JN6ZQ3GLH62GSSZHBQ","short_pith_number":"pith:6FMWYVM2","canonical_record":{"source":{"id":"1705.08262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","cross_cats_sorted":[],"title_canon_sha256":"f48b057b657a4f028184e08ab062990e85af4e4f4a2ae4816f955ed3563e7841","abstract_canon_sha256":"518a98769bb8a27d0727ad3c20dfd2df5b0e7befc6bc51df640f284d6615623b"},"schema_version":"1.0"},"canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","source":{"kind":"arxiv","id":"1705.08262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08262","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08262v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08262","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"6FMWYVM2JN6Z","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6FMWYVM2JN6ZQ3GL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6FMWYVM2","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6FMWYVM2JN6ZQ3GLH62GSSZHBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","cross_cats_sorted":[],"title_canon_sha256":"f48b057b657a4f028184e08ab062990e85af4e4f4a2ae4816f955ed3563e7841","abstract_canon_sha256":"518a98769bb8a27d0727ad3c20dfd2df5b0e7befc6bc51df640f284d6615623b"},"schema_version":"1.0"},"canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.873168Z","signature_b64":"+RF7rVB3GjVA6mj2dU9dfRaeJuls0blwFVBTigyrpsqqefn4AgCKQn+1TaTxEay5s6bnLMO2U9zz36WYQZqDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","last_reissued_at":"2026-05-18T00:43:48.872504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.872504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08262","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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JCsiVLHDpt3elCVq73tLME1jMmT80AYkvfxIOgxmDuITaq1qN11TvdHtRVwxgQ3ajbIL1reFYFmMaO0ycQpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:29:09.848443Z"},"content_sha256":"ac87fdb08f8fd57665ed100d49f7b871c66231586997777b23d4b21363e7425b","schema_version":"1.0","event_id":"sha256:ac87fdb08f8fd57665ed100d49f7b871c66231586997777b23d4b21363e7425b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6FMWYVM2JN6ZQ3GLH62GSSZHBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of a lazy cache coherence protocol against a weak memory model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christopher J. Banks, Marco Elver, Paul Jackson, Ruth Hoffmann, Susmit Sarkar, Vijay Nagarajan","submitted_at":"2017-05-18T23:25:00Z","abstract_excerpt":"In this paper we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unlimited number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of forma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08262","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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doKRkgGNncjCDb3Mctmd7XLl8IqSJ5a+i0Niwhjk6HygNezzvmk/9PRyXwupUKN3aClalWGutXT/hIVSUsP5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:29:09.848797Z"},"content_sha256":"6dc39cf30525400713d07b8749e069c079574b6a16c5c9c659d300d8c9ec3821","schema_version":"1.0","event_id":"sha256:6dc39cf30525400713d07b8749e069c079574b6a16c5c9c659d300d8c9ec3821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/bundle.json","state_url":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/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-22T08:29:09Z","links":{"resolver":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ","bundle":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/bundle.json","state":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6FMWYVM2JN6ZQ3GLH62GSSZHBQ","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":"518a98769bb8a27d0727ad3c20dfd2df5b0e7befc6bc51df640f284d6615623b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","title_canon_sha256":"f48b057b657a4f028184e08ab062990e85af4e4f4a2ae4816f955ed3563e7841"},"schema_version":"1.0","source":{"id":"1705.08262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08262","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08262v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08262","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"6FMWYVM2JN6Z","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6FMWYVM2JN6ZQ3GL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6FMWYVM2","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6dc39cf30525400713d07b8749e069c079574b6a16c5c9c659d300d8c9ec3821","target":"graph","created_at":"2026-05-18T00:43:48Z","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 verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unlimited number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of forma","authors_text":"Christopher J. Banks, Marco Elver, Paul Jackson, Ruth Hoffmann, Susmit Sarkar, Vijay Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","title":"Verification of a lazy cache coherence protocol against a weak memory model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08262","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:ac87fdb08f8fd57665ed100d49f7b871c66231586997777b23d4b21363e7425b","target":"record","created_at":"2026-05-18T00:43:48Z","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":"518a98769bb8a27d0727ad3c20dfd2df5b0e7befc6bc51df640f284d6615623b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","title_canon_sha256":"f48b057b657a4f028184e08ab062990e85af4e4f4a2ae4816f955ed3563e7841"},"schema_version":"1.0","source":{"id":"1705.08262","kind":"arxiv","version":1}},"canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","first_computed_at":"2026-05-18T00:43:48.872504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.872504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RF7rVB3GjVA6mj2dU9dfRaeJuls0blwFVBTigyrpsqqefn4AgCKQn+1TaTxEay5s6bnLMO2U9zz36WYQZqDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.873168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac87fdb08f8fd57665ed100d49f7b871c66231586997777b23d4b21363e7425b","sha256:6dc39cf30525400713d07b8749e069c079574b6a16c5c9c659d300d8c9ec3821"],"state_sha256":"4650c2b986b69a9190a689bf725f3959a347398fdd5795ca88f5395dbeced126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qio+35qh2Z76/sH1SXNq6E4Khmbi27p5jk+Jf/0fxSjyt4fO/u+IM1HxU8gQdIbbLL6hX8Gn8CbPwGpEXVx4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T08:29:09.850780Z","bundle_sha256":"bab29fa36be6768f122258954854987688ec5d547fb04a86222708e8957fc732"}}