{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YK3KJGRVMCQFH6AOVJ5ISLYPDH","short_pith_number":"pith:YK3KJGRV","canonical_record":{"source":{"id":"2111.09449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-17T23:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"08031f92818387c18041373f1233b58952e965d638147b8618a8f1c487c64c14","abstract_canon_sha256":"2b9bacc6cc90feb6f1d743c01c09d6077cf91f45393e8e83c62a38f78a167861"},"schema_version":"1.0"},"canonical_sha256":"c2b6a49a3560a053f80eaa7a892f0f19eec8da8ecbf74c7c7343b517f5c603c1","source":{"kind":"arxiv","id":"2111.09449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09449","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09449v2","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09449","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"YK3KJGRVMCQF","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"YK3KJGRVMCQFH6AO","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"YK3KJGRV","created_at":"2026-06-03T02:05:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YK3KJGRVMCQFH6AOVJ5ISLYPDH","target":"record","payload":{"canonical_record":{"source":{"id":"2111.09449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-17T23:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"08031f92818387c18041373f1233b58952e965d638147b8618a8f1c487c64c14","abstract_canon_sha256":"2b9bacc6cc90feb6f1d743c01c09d6077cf91f45393e8e83c62a38f78a167861"},"schema_version":"1.0"},"canonical_sha256":"c2b6a49a3560a053f80eaa7a892f0f19eec8da8ecbf74c7c7343b517f5c603c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:05:38.531114Z","signature_b64":"bJOkzmsoUaHVru6w+JvIhPLSVvfpJ2EbVcNhN3maFb79ytTpq3adp7wlUhcCcPciJo+A3y/jGex/7hiFQsrMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b6a49a3560a053f80eaa7a892f0f19eec8da8ecbf74c7c7343b517f5c603c1","last_reissued_at":"2026-06-03T02:05:38.530642Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:05:38.530642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.09449","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-06-03T02:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUKqM4+BSr9trrJN1VXQEvmIug6bJBy9oP6VXXtSzwWlb/MNZl6U7UqDRd9KdvOSuoEFVibbMaYR+hgKYmVgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:25:39.772288Z"},"content_sha256":"1437704fe8405e5642c902a7ac037ff755ad5752032bcb404fb7f23e8f6d91cb","schema_version":"1.0","event_id":"sha256:1437704fe8405e5642c902a7ac037ff755ad5752032bcb404fb7f23e8f6d91cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YK3KJGRVMCQFH6AOVJ5ISLYPDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andr\\'ea W. Richa, Christian Scheideler, Joshua J. Daymude","submitted_at":"2021-11-17T23:46:21Z","abstract_excerpt":"Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. Inspired by algorithmic research on distributed systems of weakly capable entities whose connections change over time, we address the local mutual exclusion problem that tasks each node with acquiring exclusive locks for itself and the maximal subset of its \"persistent\" neighbors that remain connected to it over the time interval of the lock request. Using the established time-varying graphs model to capture adversaria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09449","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.09449/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-03T02:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADpjZ7XgpDbpL8paGBt632DRpXLuUcTVemz/E7uPutyU3rkVv51ypiNbd3/sMzjUSZtZ1JQyosc/XdCwCiX/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:25:39.772714Z"},"content_sha256":"5dfeeeebae755539ae94454bb23a45fc4c7196c2d5b15909b054de74d00cbe7b","schema_version":"1.0","event_id":"sha256:5dfeeeebae755539ae94454bb23a45fc4c7196c2d5b15909b054de74d00cbe7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/bundle.json","state_url":"https://pith.science/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/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-05T05:25:39Z","links":{"resolver":"https://pith.science/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH","bundle":"https://pith.science/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/bundle.json","state":"https://pith.science/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YK3KJGRVMCQFH6AOVJ5ISLYPDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YK3KJGRVMCQFH6AOVJ5ISLYPDH","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":"2b9bacc6cc90feb6f1d743c01c09d6077cf91f45393e8e83c62a38f78a167861","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-17T23:46:21Z","title_canon_sha256":"08031f92818387c18041373f1233b58952e965d638147b8618a8f1c487c64c14"},"schema_version":"1.0","source":{"id":"2111.09449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09449","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09449v2","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09449","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"YK3KJGRVMCQF","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"YK3KJGRVMCQFH6AO","created_at":"2026-06-03T02:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"YK3KJGRV","created_at":"2026-06-03T02:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:5dfeeeebae755539ae94454bb23a45fc4c7196c2d5b15909b054de74d00cbe7b","target":"graph","created_at":"2026-06-03T02:05:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.09449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. Inspired by algorithmic research on distributed systems of weakly capable entities whose connections change over time, we address the local mutual exclusion problem that tasks each node with acquiring exclusive locks for itself and the maximal subset of its \"persistent\" neighbors that remain connected to it over the time interval of the lock request. Using the established time-varying graphs model to capture adversaria","authors_text":"Andr\\'ea W. Richa, Christian Scheideler, Joshua J. Daymude","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-17T23:46:21Z","title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09449","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:1437704fe8405e5642c902a7ac037ff755ad5752032bcb404fb7f23e8f6d91cb","target":"record","created_at":"2026-06-03T02:05:38Z","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":"2b9bacc6cc90feb6f1d743c01c09d6077cf91f45393e8e83c62a38f78a167861","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-11-17T23:46:21Z","title_canon_sha256":"08031f92818387c18041373f1233b58952e965d638147b8618a8f1c487c64c14"},"schema_version":"1.0","source":{"id":"2111.09449","kind":"arxiv","version":2}},"canonical_sha256":"c2b6a49a3560a053f80eaa7a892f0f19eec8da8ecbf74c7c7343b517f5c603c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2b6a49a3560a053f80eaa7a892f0f19eec8da8ecbf74c7c7343b517f5c603c1","first_computed_at":"2026-06-03T02:05:38.530642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:05:38.530642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bJOkzmsoUaHVru6w+JvIhPLSVvfpJ2EbVcNhN3maFb79ytTpq3adp7wlUhcCcPciJo+A3y/jGex/7hiFQsrMDQ==","signature_status":"signed_v1","signed_at":"2026-06-03T02:05:38.531114Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.09449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1437704fe8405e5642c902a7ac037ff755ad5752032bcb404fb7f23e8f6d91cb","sha256:5dfeeeebae755539ae94454bb23a45fc4c7196c2d5b15909b054de74d00cbe7b"],"state_sha256":"ded0ea39c89da6d15648ec74df5d292628eeb350ec985e2d2945369b5921068c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwKjY1R2MqiXCvUIfTrEi50XQV5ipMcfjDFiESBr87q105G1kS+T+zD7ICui/ek+uSjT47R1Q9cDpU79l1ONBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:25:39.775693Z","bundle_sha256":"8288713e5f3176e1dacba28ff654640fc4e018b548c6f9a236f6309f899216a2"}}