{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6C7U32D3PZGYFZYIYNZWRSDMLZ","short_pith_number":"pith:6C7U32D3","schema_version":"1.0","canonical_sha256":"f0bf4de87b7e4d82e708c37368c86c5e709483937932e542b2f437406f45f878","source":{"kind":"arxiv","id":"1805.01681","version":1},"attestation_state":"computed","paper":{"title":"Encoding fairness in a synchronous concurrent program algebra: extended version with proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Ian J. Hayes, Larissa A. Meinicke","submitted_at":"2018-05-04T09:35:41Z","abstract_excerpt":"Concurrent program refinement algebra provides a suitable basis for supporting mechanised reasoning about shared-memory concurrent programs in a compositional manner, for example, it supports the rely/guarantee approach of Jones. The algebra makes use of a synchronous parallel operator motivated by Aczel's trace model of concurrency and with similarities to Milner's SCCS. This paper looks at defining a form of fairness within the program algebra. The encoding allows one to reason about the fair execution of a single process in isolation as well as define fair-parallel in terms of a base parall"},"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":"1805.01681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T09:35:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"83c61a9c682b570c51175c632b8ddcee0522e88925012172d8cc7fbbe5d5e3b4","abstract_canon_sha256":"84fe0b9b11987a72a666f2d6886449e5a8de34e22595d274f48c2388ba9dd259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.964024Z","signature_b64":"noxFLF2J7ndl1ej08HsB+jJ7OvPrRtHZcNiFg7e4NLWyRuqz2xdmjDKudvClQEiSHVcIwJ4n3t5r6FMCocg+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0bf4de87b7e4d82e708c37368c86c5e709483937932e542b2f437406f45f878","last_reissued_at":"2026-05-18T00:14:43.963582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.963582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding fairness in a synchronous concurrent program algebra: extended version with proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Ian J. Hayes, Larissa A. Meinicke","submitted_at":"2018-05-04T09:35:41Z","abstract_excerpt":"Concurrent program refinement algebra provides a suitable basis for supporting mechanised reasoning about shared-memory concurrent programs in a compositional manner, for example, it supports the rely/guarantee approach of Jones. The algebra makes use of a synchronous parallel operator motivated by Aczel's trace model of concurrency and with similarities to Milner's SCCS. This paper looks at defining a form of fairness within the program algebra. The encoding allows one to reason about the fair execution of a single process in isolation as well as define fair-parallel in terms of a base parall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01681","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01681","created_at":"2026-05-18T00:14:43.963656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01681v1","created_at":"2026-05-18T00:14:43.963656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01681","created_at":"2026-05-18T00:14:43.963656+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C7U32D3PZGY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C7U32D3PZGYFZYI","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C7U32D3","created_at":"2026-05-18T12:32:08.215937+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/6C7U32D3PZGYFZYIYNZWRSDMLZ","json":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ.json","graph_json":"https://pith.science/api/pith-number/6C7U32D3PZGYFZYIYNZWRSDMLZ/graph.json","events_json":"https://pith.science/api/pith-number/6C7U32D3PZGYFZYIYNZWRSDMLZ/events.json","paper":"https://pith.science/paper/6C7U32D3"},"agent_actions":{"view_html":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ","download_json":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ.json","view_paper":"https://pith.science/paper/6C7U32D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01681&json=true","fetch_graph":"https://pith.science/api/pith-number/6C7U32D3PZGYFZYIYNZWRSDMLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6C7U32D3PZGYFZYIYNZWRSDMLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ/action/storage_attestation","attest_author":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ/action/author_attestation","sign_citation":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ/action/citation_signature","submit_replication":"https://pith.science/pith/6C7U32D3PZGYFZYIYNZWRSDMLZ/action/replication_record"}},"created_at":"2026-05-18T00:14:43.963656+00:00","updated_at":"2026-05-18T00:14:43.963656+00:00"}