{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2GAZH6JNDUDM2B2COL43PS6PMA","short_pith_number":"pith:2GAZH6JN","canonical_record":{"source":{"id":"1501.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"a9e60b06cacdd87f5ade5dc065c9c31cdbecc939e95b60bfc1466303e5b09277","abstract_canon_sha256":"12609f724df1ea5e98555533a9217519f6bd480a8e54f750b62c76fe3ffe27e8"},"schema_version":"1.0"},"canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","source":{"kind":"arxiv","id":"1501.02683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02683","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02683v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02683","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"2GAZH6JNDUDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2GAZH6JNDUDM2B2C","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2GAZH6JN","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2GAZH6JNDUDM2B2COL43PS6PMA","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"a9e60b06cacdd87f5ade5dc065c9c31cdbecc939e95b60bfc1466303e5b09277","abstract_canon_sha256":"12609f724df1ea5e98555533a9217519f6bd480a8e54f750b62c76fe3ffe27e8"},"schema_version":"1.0"},"canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.487394Z","signature_b64":"svw9Ej19FN5tOGxt43LtYCio4CnCkJ1B7binvjPEzFB38qVDbnjW5djdWQSwGOqxrQcgITWTfnk/IwaOYDj9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","last_reissued_at":"2026-05-18T02:29:37.486986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.486986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02683","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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOgYDyGu+QLMNbHPmWGv69PzZLE2CG6jwhWYEWY3DBAnZOmnGuKTrpx+EvfhtZfTpnGueL2MVi4TSXY0pOKyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:53.102816Z"},"content_sha256":"b0d3c8b921e777caa03848a7d9ff7c0cc62486a140efc2827e0818bda50fe12f","schema_version":"1.0","event_id":"sha256:b0d3c8b921e777caa03848a7d9ff7c0cc62486a140efc2827e0818bda50fe12f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2GAZH6JNDUDM2B2COL43PS6PMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy TSO Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Georgel Calin, Roland Meyer","submitted_at":"2015-01-12T15:50:07Z","abstract_excerpt":"We address the problem of checking state reachability for programs running under Total Store Order (TSO). The problem has been shown to be decidable but the cost is prohibitive, namely non-primitive recursive. We propose here to give up completeness. Our contribution is a new algorithm for TSO reachability: it uses the standard SC semantics and introduces the TSO semantics lazily and only where needed. At the heart of our algorithm is an iterative refinement of the program of interest. If the program's goal state is SC-reachable, we are done. If the goal state is not SC-reachable, this may be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02683","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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcxSxDP2S4orXQaxb1wEhw+7/o4gOP2joDk85CrTilRl2UZoHcadZ3TfocMSxbjxMweMvbfOjwesK/5ffidLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:13:53.103473Z"},"content_sha256":"207554f19af1db1aa60af184cd4db04a7762f891756fe7787b009b7106438831","schema_version":"1.0","event_id":"sha256:207554f19af1db1aa60af184cd4db04a7762f891756fe7787b009b7106438831"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/bundle.json","state_url":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GAZH6JNDUDM2B2COL43PS6PMA/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-05-25T03:13:53Z","links":{"resolver":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA","bundle":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/bundle.json","state":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GAZH6JNDUDM2B2COL43PS6PMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2GAZH6JNDUDM2B2COL43PS6PMA","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":"12609f724df1ea5e98555533a9217519f6bd480a8e54f750b62c76fe3ffe27e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","title_canon_sha256":"a9e60b06cacdd87f5ade5dc065c9c31cdbecc939e95b60bfc1466303e5b09277"},"schema_version":"1.0","source":{"id":"1501.02683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02683","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02683v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02683","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"2GAZH6JNDUDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2GAZH6JNDUDM2B2C","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2GAZH6JN","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:207554f19af1db1aa60af184cd4db04a7762f891756fe7787b009b7106438831","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"We address the problem of checking state reachability for programs running under Total Store Order (TSO). The problem has been shown to be decidable but the cost is prohibitive, namely non-primitive recursive. We propose here to give up completeness. Our contribution is a new algorithm for TSO reachability: it uses the standard SC semantics and introduces the TSO semantics lazily and only where needed. At the heart of our algorithm is an iterative refinement of the program of interest. If the program's goal state is SC-reachable, we are done. If the goal state is not SC-reachable, this may be ","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Georgel Calin, Roland Meyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","title":"Lazy TSO Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02683","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:b0d3c8b921e777caa03848a7d9ff7c0cc62486a140efc2827e0818bda50fe12f","target":"record","created_at":"2026-05-18T02:29:37Z","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":"12609f724df1ea5e98555533a9217519f6bd480a8e54f750b62c76fe3ffe27e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","title_canon_sha256":"a9e60b06cacdd87f5ade5dc065c9c31cdbecc939e95b60bfc1466303e5b09277"},"schema_version":"1.0","source":{"id":"1501.02683","kind":"arxiv","version":1}},"canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","first_computed_at":"2026-05-18T02:29:37.486986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.486986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svw9Ej19FN5tOGxt43LtYCio4CnCkJ1B7binvjPEzFB38qVDbnjW5djdWQSwGOqxrQcgITWTfnk/IwaOYDj9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.487394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d3c8b921e777caa03848a7d9ff7c0cc62486a140efc2827e0818bda50fe12f","sha256:207554f19af1db1aa60af184cd4db04a7762f891756fe7787b009b7106438831"],"state_sha256":"82344a9ef1413455e530c8c61f76ab6fa4b599571e3684b77f4c92d3e66b0ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hs/YqJCPP2Jk7DAtnparOktqJywa8tOm7Ir6i+jljRCNIKSyUIKlDhYz3CviD5HtIaXQLhJmirc7hq21/UEjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:13:53.106176Z","bundle_sha256":"530ae3fc120bf976d09a29b952b95df82dde180da66910c2e3073a34261d1100"}}