{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3TXHQKIZ5R6AKGNNCDWSCKDYS4","short_pith_number":"pith:3TXHQKIZ","schema_version":"1.0","canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","source":{"kind":"arxiv","id":"1805.04819","version":3},"attestation_state":"computed","paper":{"title":"Fast and Scalable Group Mutual Exclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Neeraj Mittal, Shreyas Gokhale","submitted_at":"2018-05-13T04:48:42Z","abstract_excerpt":"The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be executed serially. The well-known read-write mutual exclusion problem is a special case of the group mutual exclusion problem. In this work, we present a novel GME algorithm for an asynchronous shared-memory system that, in addition to satisfying lockout freedom, bounded exit and concur"},"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.04819","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T04:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"0260928cbd83d594d2234e004117a3c932a26464034c40ffcfc8ba5218dae691","abstract_canon_sha256":"3fbc65c41d153cc88fcc75cd833780e2e0789c633afca12310f59ac84d66ee23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.082863Z","signature_b64":"4460utYI8XkYNKhLuGvUH0IBWb1Xzw11jqu8ZN4hBub2S/ba6Upe1BVSgEWcKMzTpS6qtoHTFLy1LJ3ZIJTcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","last_reissued_at":"2026-05-17T23:41:18.082458Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.082458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Scalable Group Mutual Exclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Neeraj Mittal, Shreyas Gokhale","submitted_at":"2018-05-13T04:48:42Z","abstract_excerpt":"The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be executed serially. The well-known read-write mutual exclusion problem is a special case of the group mutual exclusion problem. In this work, we present a novel GME algorithm for an asynchronous shared-memory system that, in addition to satisfying lockout freedom, bounded exit and concur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04819","kind":"arxiv","version":3},"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.04819","created_at":"2026-05-17T23:41:18.082514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04819v3","created_at":"2026-05-17T23:41:18.082514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04819","created_at":"2026-05-17T23:41:18.082514+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TXHQKIZ5R6A","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TXHQKIZ5R6AKGNN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TXHQKIZ","created_at":"2026-05-18T12:32:05.422762+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/3TXHQKIZ5R6AKGNNCDWSCKDYS4","json":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4.json","graph_json":"https://pith.science/api/pith-number/3TXHQKIZ5R6AKGNNCDWSCKDYS4/graph.json","events_json":"https://pith.science/api/pith-number/3TXHQKIZ5R6AKGNNCDWSCKDYS4/events.json","paper":"https://pith.science/paper/3TXHQKIZ"},"agent_actions":{"view_html":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4","download_json":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4.json","view_paper":"https://pith.science/paper/3TXHQKIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04819&json=true","fetch_graph":"https://pith.science/api/pith-number/3TXHQKIZ5R6AKGNNCDWSCKDYS4/graph.json","fetch_events":"https://pith.science/api/pith-number/3TXHQKIZ5R6AKGNNCDWSCKDYS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/action/storage_attestation","attest_author":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/action/author_attestation","sign_citation":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/action/citation_signature","submit_replication":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/action/replication_record"}},"created_at":"2026-05-17T23:41:18.082514+00:00","updated_at":"2026-05-17T23:41:18.082514+00:00"}