{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A6GHARGAE7ETOVQ6RXV3NMAQZ6","short_pith_number":"pith:A6GHARGA","schema_version":"1.0","canonical_sha256":"078c7044c027c937561e8debb6b010cf8069969d1b0b9f806ad631e29609abc2","source":{"kind":"arxiv","id":"2506.08238","version":2},"attestation_state":"computed","paper":{"title":"Verification of the Release-Acquire Semantics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Elli Anastasiadi, L\\'eo Exibard, Mohamed Faouzi Atig, Parosh Abdulla, Samuel Grahn","submitted_at":"2025-06-09T21:15:18Z","abstract_excerpt":"The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed systems. Several steps have been taken in the direction of testing such semantics, where one is interested in whether a single program execution is consistent with a memory model. The more general verification problem, i.e., checking whether any allowed program run is consistent with a memory model, has still not been studied as much. The purpose of this work is to bridge this gap. We tackle the verification problem, where"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.08238","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-09T21:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"76871b4105800b09eacaed51b3990e426b9b664a1d801a7d84bec9bb5f17d0eb","abstract_canon_sha256":"98de4e1684010c5d8a4f2678335aa2c49206341427d64664beeaea2233710424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:30.915043Z","signature_b64":"AgpA6CtGKlBEtF71S9oqhk64zQ49C/JTeOW8+KIXVmAHeTV1VaUv29ThyColp03treNUkp8AHCqXI/665HuIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078c7044c027c937561e8debb6b010cf8069969d1b0b9f806ad631e29609abc2","last_reissued_at":"2026-06-09T02:08:30.913894Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:30.913894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of the Release-Acquire Semantics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Elli Anastasiadi, L\\'eo Exibard, Mohamed Faouzi Atig, Parosh Abdulla, Samuel Grahn","submitted_at":"2025-06-09T21:15:18Z","abstract_excerpt":"The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed systems. Several steps have been taken in the direction of testing such semantics, where one is interested in whether a single program execution is consistent with a memory model. The more general verification problem, i.e., checking whether any allowed program run is consistent with a memory model, has still not been studied as much. The purpose of this work is to bridge this gap. We tackle the verification problem, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08238","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.08238/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.08238","created_at":"2026-06-09T02:08:30.914073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08238v2","created_at":"2026-06-09T02:08:30.914073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08238","created_at":"2026-06-09T02:08:30.914073+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6GHARGAE7ET","created_at":"2026-06-09T02:08:30.914073+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6GHARGAE7ETOVQ6","created_at":"2026-06-09T02:08:30.914073+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6GHARGA","created_at":"2026-06-09T02:08:30.914073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6","json":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6.json","graph_json":"https://pith.science/api/pith-number/A6GHARGAE7ETOVQ6RXV3NMAQZ6/graph.json","events_json":"https://pith.science/api/pith-number/A6GHARGAE7ETOVQ6RXV3NMAQZ6/events.json","paper":"https://pith.science/paper/A6GHARGA"},"agent_actions":{"view_html":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6","download_json":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6.json","view_paper":"https://pith.science/paper/A6GHARGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08238&json=true","fetch_graph":"https://pith.science/api/pith-number/A6GHARGAE7ETOVQ6RXV3NMAQZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/A6GHARGAE7ETOVQ6RXV3NMAQZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6/action/storage_attestation","attest_author":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6/action/author_attestation","sign_citation":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6/action/citation_signature","submit_replication":"https://pith.science/pith/A6GHARGAE7ETOVQ6RXV3NMAQZ6/action/replication_record"}},"created_at":"2026-06-09T02:08:30.914073+00:00","updated_at":"2026-06-09T02:08:30.914073+00:00"}