{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E2EW676UOCZETXTV3D5V4JIT5N","short_pith_number":"pith:E2EW676U","canonical_record":{"source":{"id":"1510.07171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-24T18:22:05Z","cross_cats_sorted":[],"title_canon_sha256":"4f44d264298f8314672be2fd2f43749ff977923dbd218717ce124e13f83c1f34","abstract_canon_sha256":"16557f71d9c050452fe5eac99f6595fc494a1ba850cfd39c18e86544229298c6"},"schema_version":"1.0"},"canonical_sha256":"26896f7fd470b249de75d8fb5e2513eb67e17732cca639fe25c8ab245fe95706","source":{"kind":"arxiv","id":"1510.07171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07171","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07171v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07171","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"E2EW676UOCZE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2EW676UOCZETXTV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2EW676U","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E2EW676UOCZETXTV3D5V4JIT5N","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-24T18:22:05Z","cross_cats_sorted":[],"title_canon_sha256":"4f44d264298f8314672be2fd2f43749ff977923dbd218717ce124e13f83c1f34","abstract_canon_sha256":"16557f71d9c050452fe5eac99f6595fc494a1ba850cfd39c18e86544229298c6"},"schema_version":"1.0"},"canonical_sha256":"26896f7fd470b249de75d8fb5e2513eb67e17732cca639fe25c8ab245fe95706","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:19.817348Z","signature_b64":"y2rFTRtgQcOVDARiGlfaOcJV7xuIunZT5Kjx308g3ktR67cNO+sTSmVwR0MB36E9AvGo0htr1hdqYmouUu8xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26896f7fd470b249de75d8fb5e2513eb67e17732cca639fe25c8ab245fe95706","last_reissued_at":"2026-05-18T01:29:19.816647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:19.816647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07171","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:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UM/j9K5+ZRdPoKJ0JmGfDtn1g3Nis9Wl9hy0kJWqlb8/kpjpyRT7Dkdxk7yJQUTjuvV/kblqFLNQ4tc+yI7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:58:31.016910Z"},"content_sha256":"25e6220db702299ba836422fb24f90d024c5055e1bce3a8f778386b03b5d6e3f","schema_version":"1.0","event_id":"sha256:25e6220db702299ba836422fb24f90d024c5055e1bce3a8f778386b03b5d6e3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E2EW676UOCZETXTV3D5V4JIT5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Daniel Kroening, Daniel Poetzl","submitted_at":"2015-10-24T18:22:05Z","abstract_excerpt":"When optimizing a thread in a concurrent program (either done manually or by the compiler), it must be guaranteed that the resulting thread is a refinement of the original thread. Most theories of valid optimizations are formulated in terms of valid syntactic transformations on the program code, or in terms of valid transformations on thread execution traces. We present a new theory formulated instead in terms of the state of threads at synchronization operations, and show that it provides several advantages: it supports more optimizations, and leads to more efficient and simpler procedures fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07171","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:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVkkecKVW0AogncYFyaET/TSHSE8w1mieLW6zzS0a04HIghgSAlJOoIewzHaw2lGZYs+0XHULh+EXxOTJeWkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:58:31.017358Z"},"content_sha256":"ea4e4a0fb792bf4c750965c742e1565e96e6bb17f343cd760e3dfa3552e887d7","schema_version":"1.0","event_id":"sha256:ea4e4a0fb792bf4c750965c742e1565e96e6bb17f343cd760e3dfa3552e887d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2EW676UOCZETXTV3D5V4JIT5N/bundle.json","state_url":"https://pith.science/pith/E2EW676UOCZETXTV3D5V4JIT5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2EW676UOCZETXTV3D5V4JIT5N/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-09T13:58:31Z","links":{"resolver":"https://pith.science/pith/E2EW676UOCZETXTV3D5V4JIT5N","bundle":"https://pith.science/pith/E2EW676UOCZETXTV3D5V4JIT5N/bundle.json","state":"https://pith.science/pith/E2EW676UOCZETXTV3D5V4JIT5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2EW676UOCZETXTV3D5V4JIT5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E2EW676UOCZETXTV3D5V4JIT5N","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":"16557f71d9c050452fe5eac99f6595fc494a1ba850cfd39c18e86544229298c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-24T18:22:05Z","title_canon_sha256":"4f44d264298f8314672be2fd2f43749ff977923dbd218717ce124e13f83c1f34"},"schema_version":"1.0","source":{"id":"1510.07171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07171","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07171v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07171","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"E2EW676UOCZE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2EW676UOCZETXTV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2EW676U","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:ea4e4a0fb792bf4c750965c742e1565e96e6bb17f343cd760e3dfa3552e887d7","target":"graph","created_at":"2026-05-18T01:29:19Z","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":"When optimizing a thread in a concurrent program (either done manually or by the compiler), it must be guaranteed that the resulting thread is a refinement of the original thread. Most theories of valid optimizations are formulated in terms of valid syntactic transformations on the program code, or in terms of valid transformations on thread execution traces. We present a new theory formulated instead in terms of the state of threads at synchronization operations, and show that it provides several advantages: it supports more optimizations, and leads to more efficient and simpler procedures fo","authors_text":"Daniel Kroening, Daniel Poetzl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-24T18:22:05Z","title":"Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07171","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:25e6220db702299ba836422fb24f90d024c5055e1bce3a8f778386b03b5d6e3f","target":"record","created_at":"2026-05-18T01:29:19Z","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":"16557f71d9c050452fe5eac99f6595fc494a1ba850cfd39c18e86544229298c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-24T18:22:05Z","title_canon_sha256":"4f44d264298f8314672be2fd2f43749ff977923dbd218717ce124e13f83c1f34"},"schema_version":"1.0","source":{"id":"1510.07171","kind":"arxiv","version":1}},"canonical_sha256":"26896f7fd470b249de75d8fb5e2513eb67e17732cca639fe25c8ab245fe95706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26896f7fd470b249de75d8fb5e2513eb67e17732cca639fe25c8ab245fe95706","first_computed_at":"2026-05-18T01:29:19.816647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:19.816647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2rFTRtgQcOVDARiGlfaOcJV7xuIunZT5Kjx308g3ktR67cNO+sTSmVwR0MB36E9AvGo0htr1hdqYmouUu8xAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:19.817348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25e6220db702299ba836422fb24f90d024c5055e1bce3a8f778386b03b5d6e3f","sha256:ea4e4a0fb792bf4c750965c742e1565e96e6bb17f343cd760e3dfa3552e887d7"],"state_sha256":"2b4a90fd25d9645c64dfb848597f690a72edeaa077048cde7b37a4e5bf4ef406"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nLfeXQ+2RTAUaYpsAOrrO+/hV4fUW2sgNO5YDuzVea8Zqw8+nhW5O6DUGGLXgvdQe0Zp0TeecrAAmkkJ95MAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:58:31.019749Z","bundle_sha256":"d04b7f9c052fdebb448b34d25c8d97f153e0b81bc021cf8f0ac3ad38795bd1bb"}}