{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3TXHQKIZ5R6AKGNNCDWSCKDYS4","short_pith_number":"pith:3TXHQKIZ","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"},"canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","source":{"kind":"arxiv","id":"1805.04819","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04819","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04819v3","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04819","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"3TXHQKIZ5R6A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3TXHQKIZ5R6AKGNN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3TXHQKIZ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3TXHQKIZ5R6AKGNNCDWSCKDYS4","target":"record","payload":{"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"},"canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","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"},"source_kind":"arxiv","source_id":"1805.04819","source_version":3,"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45jVT0Lk8h2CPIUjjskRWKgGsYP7Fkw9iDWimMbUsHPXYg4u0fmAU4I0BFGd3RSQoYqHIPxOHhIiGVDiXD3jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:35:20.180724Z"},"content_sha256":"dd86b2591545ee8190301f47aec15c1d4ef08d60c7497e4263fc4f14113eaf69","schema_version":"1.0","event_id":"sha256:dd86b2591545ee8190301f47aec15c1d4ef08d60c7497e4263fc4f14113eaf69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3TXHQKIZ5R6AKGNNCDWSCKDYS4","target":"graph","payload":{"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"},"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlxXBc8qzjypnZXpxSjrme5yUp6oxHKivrR1GFFO8Sgc/CXlmKx+lDrlmOPp8hcC3psruCck8SCp+pBYAylcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:35:20.181074Z"},"content_sha256":"cb6b7bc2da83baedd41d90a3816323f7d9f1e2f4fb2778ebe6ee02c3f29dc396","schema_version":"1.0","event_id":"sha256:cb6b7bc2da83baedd41d90a3816323f7d9f1e2f4fb2778ebe6ee02c3f29dc396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/bundle.json","state_url":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/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-06-23T21:35:20Z","links":{"resolver":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4","bundle":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/bundle.json","state":"https://pith.science/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TXHQKIZ5R6AKGNNCDWSCKDYS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3TXHQKIZ5R6AKGNNCDWSCKDYS4","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":"3fbc65c41d153cc88fcc75cd833780e2e0789c633afca12310f59ac84d66ee23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T04:48:42Z","title_canon_sha256":"0260928cbd83d594d2234e004117a3c932a26464034c40ffcfc8ba5218dae691"},"schema_version":"1.0","source":{"id":"1805.04819","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04819","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04819v3","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04819","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"3TXHQKIZ5R6A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3TXHQKIZ5R6AKGNN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3TXHQKIZ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:cb6b7bc2da83baedd41d90a3816323f7d9f1e2f4fb2778ebe6ee02c3f29dc396","target":"graph","created_at":"2026-05-17T23:41:18Z","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":"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","authors_text":"Neeraj Mittal, Shreyas Gokhale","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T04:48:42Z","title":"Fast and Scalable Group Mutual Exclusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04819","kind":"arxiv","version":3},"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:dd86b2591545ee8190301f47aec15c1d4ef08d60c7497e4263fc4f14113eaf69","target":"record","created_at":"2026-05-17T23:41:18Z","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":"3fbc65c41d153cc88fcc75cd833780e2e0789c633afca12310f59ac84d66ee23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T04:48:42Z","title_canon_sha256":"0260928cbd83d594d2234e004117a3c932a26464034c40ffcfc8ba5218dae691"},"schema_version":"1.0","source":{"id":"1805.04819","kind":"arxiv","version":3}},"canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcee782919ec7c0519ad10ed212878972739b8bf69481e1331dcd2a0038d2e23","first_computed_at":"2026-05-17T23:41:18.082458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.082458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4460utYI8XkYNKhLuGvUH0IBWb1Xzw11jqu8ZN4hBub2S/ba6Upe1BVSgEWcKMzTpS6qtoHTFLy1LJ3ZIJTcDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.082863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04819","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd86b2591545ee8190301f47aec15c1d4ef08d60c7497e4263fc4f14113eaf69","sha256:cb6b7bc2da83baedd41d90a3816323f7d9f1e2f4fb2778ebe6ee02c3f29dc396"],"state_sha256":"92adb6b922f8f7db0d29b88032600737a784387b6cfa78a284e64749225d5262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEsS2tZVVOBaarEFz5ZWzKbzxrf8krxvg7cMOHVGFfONHstJkm90IR45LLTxW+sgV6rf5Mvl3po1mPk0k9HXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:35:20.182998Z","bundle_sha256":"3ffae957aa586d8eae17670c298d5db05d8654eb83c325c7f2a87aceeaa7e072"}}