{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CKPVHYXCGU7TYXO5DHD77HAOPE","short_pith_number":"pith:CKPVHYXC","canonical_record":{"source":{"id":"1602.08321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-26T13:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"a7ca7bd18fad228b5d22d727682ca3541f134024e7ce6959663a2dd914428f8e","abstract_canon_sha256":"252ca849701424845e3fdd7291440cb25fbde9f360d8ab7aeeb3e9d346943bb4"},"schema_version":"1.0"},"canonical_sha256":"129f53e2e2353f3c5ddd19c7ff9c0e79307792d73d59c47b35419e128f670e92","source":{"kind":"arxiv","id":"1602.08321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08321","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08321v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08321","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"CKPVHYXCGU7T","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CKPVHYXCGU7TYXO5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CKPVHYXC","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CKPVHYXCGU7TYXO5DHD77HAOPE","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-26T13:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"a7ca7bd18fad228b5d22d727682ca3541f134024e7ce6959663a2dd914428f8e","abstract_canon_sha256":"252ca849701424845e3fdd7291440cb25fbde9f360d8ab7aeeb3e9d346943bb4"},"schema_version":"1.0"},"canonical_sha256":"129f53e2e2353f3c5ddd19c7ff9c0e79307792d73d59c47b35419e128f670e92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.350209Z","signature_b64":"IGYVVOiJo3xvNwgy4YB1Ggvrglk+Z3qVQkpt+fhYe/KYC7EFlbQpHH85t8b7Gc7928IRrGUuGIz/rcVnvq2LDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"129f53e2e2353f3c5ddd19c7ff9c0e79307792d73d59c47b35419e128f670e92","last_reissued_at":"2026-05-18T01:19:56.349802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.349802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08321","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-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMc93UxuSuXdF8XbCdlmRM9uHr6sMBGrsNiZ/gvmbwy8Vp32fgdpW1kx5Lyxi7fs7ylxoRskrhq4EPGXQnw5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:07:56.242823Z"},"content_sha256":"5a68cbcff355bcb708cfb1c9493140b2cb6bad55a4a2fec17961bb62a33e39bb","schema_version":"1.0","event_id":"sha256:5a68cbcff355bcb708cfb1c9493140b2cb6bad55a4a2fec17961bb62a33e39bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CKPVHYXCGU7TYXO5DHD77HAOPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Virtues of Conflict: Analyzing Modern Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Daniel Kroening, Ganesh Narayanaswamy, Saurabh Joshi","submitted_at":"2016-02-26T13:48:49Z","abstract_excerpt":"Modern shared memory multiprocessors permit reordering of memory operations for performance reasons. These reorderings are often a source of subtle bugs in programs written for such architectures. Traditional approaches to verify weak memory programs often rely on interleaving semantics, which is prone to state space explosion, and thus severely limits the scalability of the analysis. In recent times, there has been a renewed interest in modelling dynamic executions of weak memory programs using partial orders. However, such an approach typically requires ad-hoc mechanisms to correctly capture"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08321","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-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04UU9n6AVhKw5QctdP27ec/fD12/GLD6mo1OHQCjg/H3JmQkHL8/D+xOkeaykyqxTHXqacHHWSAGDKOp0J7gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:07:56.243166Z"},"content_sha256":"cb59746a5a18d1cf5efb7748a3a29612492bbe7c76955195fd2ac20565cba537","schema_version":"1.0","event_id":"sha256:cb59746a5a18d1cf5efb7748a3a29612492bbe7c76955195fd2ac20565cba537"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/bundle.json","state_url":"https://pith.science/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/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-20T22:07:56Z","links":{"resolver":"https://pith.science/pith/CKPVHYXCGU7TYXO5DHD77HAOPE","bundle":"https://pith.science/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/bundle.json","state":"https://pith.science/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKPVHYXCGU7TYXO5DHD77HAOPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CKPVHYXCGU7TYXO5DHD77HAOPE","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":"252ca849701424845e3fdd7291440cb25fbde9f360d8ab7aeeb3e9d346943bb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-26T13:48:49Z","title_canon_sha256":"a7ca7bd18fad228b5d22d727682ca3541f134024e7ce6959663a2dd914428f8e"},"schema_version":"1.0","source":{"id":"1602.08321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08321","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08321v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08321","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"CKPVHYXCGU7T","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CKPVHYXCGU7TYXO5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CKPVHYXC","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cb59746a5a18d1cf5efb7748a3a29612492bbe7c76955195fd2ac20565cba537","target":"graph","created_at":"2026-05-18T01:19:56Z","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":"Modern shared memory multiprocessors permit reordering of memory operations for performance reasons. These reorderings are often a source of subtle bugs in programs written for such architectures. Traditional approaches to verify weak memory programs often rely on interleaving semantics, which is prone to state space explosion, and thus severely limits the scalability of the analysis. In recent times, there has been a renewed interest in modelling dynamic executions of weak memory programs using partial orders. However, such an approach typically requires ad-hoc mechanisms to correctly capture","authors_text":"Daniel Kroening, Ganesh Narayanaswamy, Saurabh Joshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-26T13:48:49Z","title":"The Virtues of Conflict: Analyzing Modern Concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08321","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:5a68cbcff355bcb708cfb1c9493140b2cb6bad55a4a2fec17961bb62a33e39bb","target":"record","created_at":"2026-05-18T01:19:56Z","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":"252ca849701424845e3fdd7291440cb25fbde9f360d8ab7aeeb3e9d346943bb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-26T13:48:49Z","title_canon_sha256":"a7ca7bd18fad228b5d22d727682ca3541f134024e7ce6959663a2dd914428f8e"},"schema_version":"1.0","source":{"id":"1602.08321","kind":"arxiv","version":1}},"canonical_sha256":"129f53e2e2353f3c5ddd19c7ff9c0e79307792d73d59c47b35419e128f670e92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"129f53e2e2353f3c5ddd19c7ff9c0e79307792d73d59c47b35419e128f670e92","first_computed_at":"2026-05-18T01:19:56.349802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.349802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGYVVOiJo3xvNwgy4YB1Ggvrglk+Z3qVQkpt+fhYe/KYC7EFlbQpHH85t8b7Gc7928IRrGUuGIz/rcVnvq2LDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.350209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a68cbcff355bcb708cfb1c9493140b2cb6bad55a4a2fec17961bb62a33e39bb","sha256:cb59746a5a18d1cf5efb7748a3a29612492bbe7c76955195fd2ac20565cba537"],"state_sha256":"aa48d080637c68b2fe8afdc8dfea1e79bf509ea04b77f099689dbcdfab6baca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/w45/lapQmKGf8naz1g8aiboi4xd4sDCVePm2KlRFWK/NfRsr8fleyO0Ywc48TKN49GUOkFZF7GRBcPxDdVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:07:56.245115Z","bundle_sha256":"460e793dbf099e0829b87d403e782ad009cbe27b3fe83d4bd13de2a733c99c79"}}