{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JXWXJ7VNJ2R2FAVTNEFGWJXS7N","short_pith_number":"pith:JXWXJ7VN","canonical_record":{"source":{"id":"2505.16139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-22T02:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"86b157de32c51104c41a2d784f9c4aa06dcdc128dc2bb6317731c52f9a7a1836","abstract_canon_sha256":"dc49b8cda21d928017df338574c2a43ff6e6f9dcaef3e614aefa63e393b0c8ec"},"schema_version":"1.0"},"canonical_sha256":"4ded74fead4ea3a282b3690a6b26f2fb599b3cb8fe2d62493359142baaf59a9b","source":{"kind":"arxiv","id":"2505.16139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.16139","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.16139v1","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16139","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"JXWXJ7VNJ2R2","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_16","alias_value":"JXWXJ7VNJ2R2FAVT","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_8","alias_value":"JXWXJ7VN","created_at":"2026-06-03T02:05:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JXWXJ7VNJ2R2FAVTNEFGWJXS7N","target":"record","payload":{"canonical_record":{"source":{"id":"2505.16139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-22T02:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"86b157de32c51104c41a2d784f9c4aa06dcdc128dc2bb6317731c52f9a7a1836","abstract_canon_sha256":"dc49b8cda21d928017df338574c2a43ff6e6f9dcaef3e614aefa63e393b0c8ec"},"schema_version":"1.0"},"canonical_sha256":"4ded74fead4ea3a282b3690a6b26f2fb599b3cb8fe2d62493359142baaf59a9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:05:41.098798Z","signature_b64":"0Gr0513TaPDpnkVGNjgtbe5wRZCEqcD4s8WIuXjcnappNZ+PY9tMqo8K+to1LnXmtoMOpcouz0lLSLPb/WfiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ded74fead4ea3a282b3690a6b26f2fb599b3cb8fe2d62493359142baaf59a9b","last_reissued_at":"2026-06-03T02:05:41.098304Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:05:41.098304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.16139","source_version":1,"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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MnT2UMTldNtJqf6mQXWCzmBaAh3gxUM05Sp7UQJU2atmyoXxoIG7VKxSl/fKSO5lZ1AXTf0FEuD6MUo8K0NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:47:28.734634Z"},"content_sha256":"bdfba81fda515546dd98a546f82c09ab27bc4c46f80c792f1de6fcaa4ddf5710","schema_version":"1.0","event_id":"sha256:bdfba81fda515546dd98a546f82c09ab27bc4c46f80c792f1de6fcaa4ddf5710"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JXWXJ7VNJ2R2FAVTNEFGWJXS7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andr\\'ea W. Richa, Anya Chaturvedi, Joshua J. Daymude","submitted_at":"2025-05-22T02:32:32Z","abstract_excerpt":"Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and population protocols where interactions among entities are often assumed to be isolated, Daymude, Richa, and Scheideler (SAND`22) introduced a variant of the local mutual exclusion problem that applies to arbitrary dynamic networks: each node, on issuing a lock request, must acquire exclusive locks on itself and all its persistent neighbors, i.e., the neighbors that remain connected to it over the duration of the loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16139","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.16139/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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+6k0toyqhbqa7I+nrZvOpZXjT+vgjFktJKkpOfKyzBsPzX3ZlGKLLrzf6dXgGHpOJbPuzhj1OzxnVvlLQ2UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:47:28.735006Z"},"content_sha256":"6067f90ae1d8e7c2ffc0205178a8bbb4a6399553cad071791c32174d606df164","schema_version":"1.0","event_id":"sha256:6067f90ae1d8e7c2ffc0205178a8bbb4a6399553cad071791c32174d606df164"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/bundle.json","state_url":"https://pith.science/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/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-03T19:47:28Z","links":{"resolver":"https://pith.science/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N","bundle":"https://pith.science/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/bundle.json","state":"https://pith.science/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXWXJ7VNJ2R2FAVTNEFGWJXS7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JXWXJ7VNJ2R2FAVTNEFGWJXS7N","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":"dc49b8cda21d928017df338574c2a43ff6e6f9dcaef3e614aefa63e393b0c8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-22T02:32:32Z","title_canon_sha256":"86b157de32c51104c41a2d784f9c4aa06dcdc128dc2bb6317731c52f9a7a1836"},"schema_version":"1.0","source":{"id":"2505.16139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.16139","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.16139v1","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16139","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"JXWXJ7VNJ2R2","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_16","alias_value":"JXWXJ7VNJ2R2FAVT","created_at":"2026-06-03T02:05:41Z"},{"alias_kind":"pith_short_8","alias_value":"JXWXJ7VN","created_at":"2026-06-03T02:05:41Z"}],"graph_snapshots":[{"event_id":"sha256:6067f90ae1d8e7c2ffc0205178a8bbb4a6399553cad071791c32174d606df164","target":"graph","created_at":"2026-06-03T02:05:41Z","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/2505.16139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and population protocols where interactions among entities are often assumed to be isolated, Daymude, Richa, and Scheideler (SAND`22) introduced a variant of the local mutual exclusion problem that applies to arbitrary dynamic networks: each node, on issuing a lock request, must acquire exclusive locks on itself and all its persistent neighbors, i.e., the neighbors that remain connected to it over the duration of the loc","authors_text":"Andr\\'ea W. Richa, Anya Chaturvedi, Joshua J. Daymude","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-22T02:32:32Z","title":"On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16139","kind":"arxiv","version":1},"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:bdfba81fda515546dd98a546f82c09ab27bc4c46f80c792f1de6fcaa4ddf5710","target":"record","created_at":"2026-06-03T02:05:41Z","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":"dc49b8cda21d928017df338574c2a43ff6e6f9dcaef3e614aefa63e393b0c8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-22T02:32:32Z","title_canon_sha256":"86b157de32c51104c41a2d784f9c4aa06dcdc128dc2bb6317731c52f9a7a1836"},"schema_version":"1.0","source":{"id":"2505.16139","kind":"arxiv","version":1}},"canonical_sha256":"4ded74fead4ea3a282b3690a6b26f2fb599b3cb8fe2d62493359142baaf59a9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ded74fead4ea3a282b3690a6b26f2fb599b3cb8fe2d62493359142baaf59a9b","first_computed_at":"2026-06-03T02:05:41.098304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:05:41.098304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Gr0513TaPDpnkVGNjgtbe5wRZCEqcD4s8WIuXjcnappNZ+PY9tMqo8K+to1LnXmtoMOpcouz0lLSLPb/WfiCg==","signature_status":"signed_v1","signed_at":"2026-06-03T02:05:41.098798Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.16139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdfba81fda515546dd98a546f82c09ab27bc4c46f80c792f1de6fcaa4ddf5710","sha256:6067f90ae1d8e7c2ffc0205178a8bbb4a6399553cad071791c32174d606df164"],"state_sha256":"32511291e218aea33417c29ad6bed19d85e05c23c6e2e943490a57d9f734778d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AG8Ewr8qrZ7tYbevXUmxyxC2sNyApcXewR/DL+6rLBDDbBMCSVaE2SYXgTmp+bE/D834B/KN1Y+qFmllRCgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:47:28.739809Z","bundle_sha256":"2cbfab3016eea637f9a49f1c5ba4fcae3fb17b22127fa759f8e15d14447181b6"}}