{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TCTZPJB3GPJJX2QJIGDNAZ362K","short_pith_number":"pith:TCTZPJB3","canonical_record":{"source":{"id":"1111.5775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-24T14:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"94862a2f970f8e2c4331b18919ea43ea0041200226e2d559c3dc7e1ac40bad31","abstract_canon_sha256":"0454e4892dd271ea1c0a2785477d8ca2b484ec5d327352dd3c2c11382d4d9a50"},"schema_version":"1.0"},"canonical_sha256":"98a797a43b33d29bea094186d0677ed2802eabb531e04e47601f1c41a26952ed","source":{"kind":"arxiv","id":"1111.5775","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5775","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5775v2","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5775","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"TCTZPJB3GPJJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCTZPJB3GPJJX2QJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCTZPJB3","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TCTZPJB3GPJJX2QJIGDNAZ362K","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-24T14:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"94862a2f970f8e2c4331b18919ea43ea0041200226e2d559c3dc7e1ac40bad31","abstract_canon_sha256":"0454e4892dd271ea1c0a2785477d8ca2b484ec5d327352dd3c2c11382d4d9a50"},"schema_version":"1.0"},"canonical_sha256":"98a797a43b33d29bea094186d0677ed2802eabb531e04e47601f1c41a26952ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:56.476258Z","signature_b64":"BBY5EnnBbjVgKMz/COTmiL3PU+OdU4kh6W3aR1+T3iI1OdYvTQn1uZ7I1Gqp4N4BcMJp0aNcQRg9bUac/En2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a797a43b33d29bea094186d0677ed2802eabb531e04e47601f1c41a26952ed","last_reissued_at":"2026-05-18T04:06:56.475444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:56.475444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5775","source_version":2,"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-18T04:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Krf8hoUPmu2DGOj8OBGtw9QjtlDex5czUcYfcP85LLGMttgrG5qG5IRJOMxv40ertHCOW0kHwH+UWBBvMDtqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:27:14.655985Z"},"content_sha256":"0e0c4f63efb866e1cfcfb93d7b88b1bafaf4aa495ccc47f676dedc4705f7a616","schema_version":"1.0","event_id":"sha256:0e0c4f63efb866e1cfcfb93d7b88b1bafaf4aa495ccc47f676dedc4705f7a616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TCTZPJB3GPJJX2QJIGDNAZ362K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial mutual exclusion for infinitely many processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Wim H. Hesselink","submitted_at":"2011-11-24T14:17:05Z","abstract_excerpt":"Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical sections. For each execution of CS, the set nbh can be given by the environment. We present a starvation free solution of this problem in a setting with infinitely many processes, each with finite memory, that communicate by asynchronous messages. The solution has the property of first-come first-served, in so far as this can be guaranteed by asynchronous message"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5775","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":""},"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-18T04:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHsiR5lqdg9yQu5UjDWhjcc7sGRAWcfEemqQHlFPyWU/cEfSsMe7Hmdhu2ESoSR7ku5z6MVGAwc3y+fPCPliCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:27:14.656338Z"},"content_sha256":"94cd00e40a16d6eb9bd97bae7d7a9814c99abb8ffd66b6403a190cb0ae41e44b","schema_version":"1.0","event_id":"sha256:94cd00e40a16d6eb9bd97bae7d7a9814c99abb8ffd66b6403a190cb0ae41e44b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/bundle.json","state_url":"https://pith.science/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/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-08T14:27:14Z","links":{"resolver":"https://pith.science/pith/TCTZPJB3GPJJX2QJIGDNAZ362K","bundle":"https://pith.science/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/bundle.json","state":"https://pith.science/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCTZPJB3GPJJX2QJIGDNAZ362K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TCTZPJB3GPJJX2QJIGDNAZ362K","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":"0454e4892dd271ea1c0a2785477d8ca2b484ec5d327352dd3c2c11382d4d9a50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-24T14:17:05Z","title_canon_sha256":"94862a2f970f8e2c4331b18919ea43ea0041200226e2d559c3dc7e1ac40bad31"},"schema_version":"1.0","source":{"id":"1111.5775","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5775","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5775v2","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5775","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"TCTZPJB3GPJJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCTZPJB3GPJJX2QJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCTZPJB3","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:94cd00e40a16d6eb9bd97bae7d7a9814c99abb8ffd66b6403a190cb0ae41e44b","target":"graph","created_at":"2026-05-18T04:06:56Z","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":"Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical sections. For each execution of CS, the set nbh can be given by the environment. We present a starvation free solution of this problem in a setting with infinitely many processes, each with finite memory, that communicate by asynchronous messages. The solution has the property of first-come first-served, in so far as this can be guaranteed by asynchronous message","authors_text":"Wim H. Hesselink","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-24T14:17:05Z","title":"Partial mutual exclusion for infinitely many processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5775","kind":"arxiv","version":2},"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:0e0c4f63efb866e1cfcfb93d7b88b1bafaf4aa495ccc47f676dedc4705f7a616","target":"record","created_at":"2026-05-18T04:06:56Z","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":"0454e4892dd271ea1c0a2785477d8ca2b484ec5d327352dd3c2c11382d4d9a50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-24T14:17:05Z","title_canon_sha256":"94862a2f970f8e2c4331b18919ea43ea0041200226e2d559c3dc7e1ac40bad31"},"schema_version":"1.0","source":{"id":"1111.5775","kind":"arxiv","version":2}},"canonical_sha256":"98a797a43b33d29bea094186d0677ed2802eabb531e04e47601f1c41a26952ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98a797a43b33d29bea094186d0677ed2802eabb531e04e47601f1c41a26952ed","first_computed_at":"2026-05-18T04:06:56.475444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:56.475444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBY5EnnBbjVgKMz/COTmiL3PU+OdU4kh6W3aR1+T3iI1OdYvTQn1uZ7I1Gqp4N4BcMJp0aNcQRg9bUac/En2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:56.476258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5775","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e0c4f63efb866e1cfcfb93d7b88b1bafaf4aa495ccc47f676dedc4705f7a616","sha256:94cd00e40a16d6eb9bd97bae7d7a9814c99abb8ffd66b6403a190cb0ae41e44b"],"state_sha256":"173ae7b9aa988f448dd13a40858b0d083cd4329c8e1a60e3a8cb2f5588d467b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IaWnNCPqCuWSmh2bQgJr0fAaD5h1OQr8AUX+ypA05c1hMcb3waIG1Re1MSMXxNFqIdIA7Qc21jjRlLf7V1hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:27:14.658521Z","bundle_sha256":"d36937ff682eefbe1aff0044e3590bf384780db61bbd8feeaf17c8176cb0af25"}}