{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MNJVZQBD4O3DDYX4UGE3Q6AAQB","short_pith_number":"pith:MNJVZQBD","schema_version":"1.0","canonical_sha256":"63535cc023e3b631e2fca189b8780080700b03ad0f40106cadca6f98c84bb409","source":{"kind":"arxiv","id":"1705.05896","version":1},"attestation_state":"computed","paper":{"title":"Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Struth, Michael R Laurence","submitted_at":"2017-05-16T20:02:17Z","abstract_excerpt":"Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using the bi-Kleene operations $0,1, +, \\cdot\\, ,^*, \\parallel, ^{(*)}$ defines a language $ \\mathopen{[\\![ } t \\mathclose{]\\!] } $ of pomsets in a natural way.\n  We prove that every valid universal equality over pomset languages using these operations is a consequence of the equational theory of regular languages (in which parallel multiplication and iteration are undefined) plus that of the commutative-regular languages ("},"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":"1705.05896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-16T20:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"ecc95bfd6f448e1845592f80913d8dd513912530c7405ac9bf9e11586a6aaf62","abstract_canon_sha256":"09c471fc2cff741860ce1a04b532ad32548e399970a49ca29a405aae955ce46b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.451210Z","signature_b64":"8BSNiYrKfN2qUs8wLNFQEH7eKkTiMGUVyPiaJ+jg2KrfrYTwp5sqarGe53BWGhO+89eYr+zwh2kqOSHuLrgFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63535cc023e3b631e2fca189b8780080700b03ad0f40106cadca6f98c84bb409","last_reissued_at":"2026-05-18T00:44:19.450746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.450746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Struth, Michael R Laurence","submitted_at":"2017-05-16T20:02:17Z","abstract_excerpt":"Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using the bi-Kleene operations $0,1, +, \\cdot\\, ,^*, \\parallel, ^{(*)}$ defines a language $ \\mathopen{[\\![ } t \\mathclose{]\\!] } $ of pomsets in a natural way.\n  We prove that every valid universal equality over pomset languages using these operations is a consequence of the equational theory of regular languages (in which parallel multiplication and iteration are undefined) plus that of the commutative-regular languages ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05896","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":"1705.05896","created_at":"2026-05-18T00:44:19.450819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05896v1","created_at":"2026-05-18T00:44:19.450819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05896","created_at":"2026-05-18T00:44:19.450819+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNJVZQBD4O3D","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNJVZQBD4O3DDYX4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNJVZQBD","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.02595","citing_title":"Computation and Concurrency","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07373","citing_title":"Finitary Truly Concurrent Bisimulations","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB","json":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB.json","graph_json":"https://pith.science/api/pith-number/MNJVZQBD4O3DDYX4UGE3Q6AAQB/graph.json","events_json":"https://pith.science/api/pith-number/MNJVZQBD4O3DDYX4UGE3Q6AAQB/events.json","paper":"https://pith.science/paper/MNJVZQBD"},"agent_actions":{"view_html":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB","download_json":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB.json","view_paper":"https://pith.science/paper/MNJVZQBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/MNJVZQBD4O3DDYX4UGE3Q6AAQB/graph.json","fetch_events":"https://pith.science/api/pith-number/MNJVZQBD4O3DDYX4UGE3Q6AAQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB/action/storage_attestation","attest_author":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB/action/author_attestation","sign_citation":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB/action/citation_signature","submit_replication":"https://pith.science/pith/MNJVZQBD4O3DDYX4UGE3Q6AAQB/action/replication_record"}},"created_at":"2026-05-18T00:44:19.450819+00:00","updated_at":"2026-05-18T00:44:19.450819+00:00"}