{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7L2YQ5ZTW67YCN3BLICWC64T55","short_pith_number":"pith:7L2YQ5ZT","canonical_record":{"source":{"id":"1903.02843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T11:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"a4503709cf87bdd78eaf4bd74bb2f0ff179a20bd725535ea4d8a468e3f9cdb62","abstract_canon_sha256":"1d883d6b3afb87e040682f04454c1ba5c7da5a3944f7af9259692029154a9822"},"schema_version":"1.0"},"canonical_sha256":"faf5887733b7bf8137615a05617b93ef5094050d3dfaa189da6841d6ad77e635","source":{"kind":"arxiv","id":"1903.02843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02843","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02843v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02843","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"7L2YQ5ZTW67Y","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7L2YQ5ZTW67YCN3B","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7L2YQ5ZT","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7L2YQ5ZTW67YCN3BLICWC64T55","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T11:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"a4503709cf87bdd78eaf4bd74bb2f0ff179a20bd725535ea4d8a468e3f9cdb62","abstract_canon_sha256":"1d883d6b3afb87e040682f04454c1ba5c7da5a3944f7af9259692029154a9822"},"schema_version":"1.0"},"canonical_sha256":"faf5887733b7bf8137615a05617b93ef5094050d3dfaa189da6841d6ad77e635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:50.959947Z","signature_b64":"0L7qmtd5/ESxIwZVB8ieUrtCE6ofoiUJduFwTcklPs3Xs2ezBzS68nwc9SZMkhF+6AuBnsTk9WSv6yB8ipMeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faf5887733b7bf8137615a05617b93ef5094050d3dfaa189da6841d6ad77e635","last_reissued_at":"2026-05-17T23:51:50.959381Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:50.959381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02843","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-05-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fr6aXzQMmolXVZzqiL0mWOPb1o1iA5qRWSxZJtAYmda80l1twyb7dFn5k02I8NlAHBV3a8isCB6ia/EByq03Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:18:05.626550Z"},"content_sha256":"9fbc9c121a54ca57a9ec5b76031a501df528e4050c5f1fb9469b074dfc2c2a56","schema_version":"1.0","event_id":"sha256:9fbc9c121a54ca57a9ec5b76031a501df528e4050c5f1fb9469b074dfc2c2a56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7L2YQ5ZTW67YCN3BLICWC64T55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fukuhito Ooshita, Koichi Wada, Sayaka Kamei, Shlomi Dolev, Yoshiaki Katayama","submitted_at":"2019-03-07T11:25:37Z","abstract_excerpt":"Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. On the other hand, processes may want to execute some operation simultaneously with the neighbors. Of course, we can use a globally synchronized clock to achieve the task but it is very expensive to realize it in a distributed system in general.\n  In this paper, we define a new concept neighborhood mutual remainder. A distributed algorithm that satisfies the neighborhood mutual remainder requirement should satisfy glo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02843","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":""},"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:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAW4YYgDLS5UIjZj5j83ahU6jYqOrfGnv6PtM2sab/H6wYNqwRIgW9Rb6PMonSO8bM9I1OGViOn9TfyLVn7ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:18:05.627227Z"},"content_sha256":"398c5d2ff26909b6b26d505e90e9706702272e4228a8ac9d243640872ad14e90","schema_version":"1.0","event_id":"sha256:398c5d2ff26909b6b26d505e90e9706702272e4228a8ac9d243640872ad14e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7L2YQ5ZTW67YCN3BLICWC64T55/bundle.json","state_url":"https://pith.science/pith/7L2YQ5ZTW67YCN3BLICWC64T55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7L2YQ5ZTW67YCN3BLICWC64T55/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-05-29T15:18:05Z","links":{"resolver":"https://pith.science/pith/7L2YQ5ZTW67YCN3BLICWC64T55","bundle":"https://pith.science/pith/7L2YQ5ZTW67YCN3BLICWC64T55/bundle.json","state":"https://pith.science/pith/7L2YQ5ZTW67YCN3BLICWC64T55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7L2YQ5ZTW67YCN3BLICWC64T55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7L2YQ5ZTW67YCN3BLICWC64T55","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":"1d883d6b3afb87e040682f04454c1ba5c7da5a3944f7af9259692029154a9822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T11:25:37Z","title_canon_sha256":"a4503709cf87bdd78eaf4bd74bb2f0ff179a20bd725535ea4d8a468e3f9cdb62"},"schema_version":"1.0","source":{"id":"1903.02843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02843","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02843v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02843","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"7L2YQ5ZTW67Y","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7L2YQ5ZTW67YCN3B","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7L2YQ5ZT","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:398c5d2ff26909b6b26d505e90e9706702272e4228a8ac9d243640872ad14e90","target":"graph","created_at":"2026-05-17T23:51:50Z","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":"Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. On the other hand, processes may want to execute some operation simultaneously with the neighbors. Of course, we can use a globally synchronized clock to achieve the task but it is very expensive to realize it in a distributed system in general.\n  In this paper, we define a new concept neighborhood mutual remainder. A distributed algorithm that satisfies the neighborhood mutual remainder requirement should satisfy glo","authors_text":"Fukuhito Ooshita, Koichi Wada, Sayaka Kamei, Shlomi Dolev, Yoshiaki Katayama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T11:25:37Z","title":"Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02843","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:9fbc9c121a54ca57a9ec5b76031a501df528e4050c5f1fb9469b074dfc2c2a56","target":"record","created_at":"2026-05-17T23:51:50Z","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":"1d883d6b3afb87e040682f04454c1ba5c7da5a3944f7af9259692029154a9822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-07T11:25:37Z","title_canon_sha256":"a4503709cf87bdd78eaf4bd74bb2f0ff179a20bd725535ea4d8a468e3f9cdb62"},"schema_version":"1.0","source":{"id":"1903.02843","kind":"arxiv","version":1}},"canonical_sha256":"faf5887733b7bf8137615a05617b93ef5094050d3dfaa189da6841d6ad77e635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faf5887733b7bf8137615a05617b93ef5094050d3dfaa189da6841d6ad77e635","first_computed_at":"2026-05-17T23:51:50.959381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:50.959381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0L7qmtd5/ESxIwZVB8ieUrtCE6ofoiUJduFwTcklPs3Xs2ezBzS68nwc9SZMkhF+6AuBnsTk9WSv6yB8ipMeCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:50.959947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fbc9c121a54ca57a9ec5b76031a501df528e4050c5f1fb9469b074dfc2c2a56","sha256:398c5d2ff26909b6b26d505e90e9706702272e4228a8ac9d243640872ad14e90"],"state_sha256":"afd39aa99db45020e456dce4e97845fa6ce6f26e6716a754b453c46f1f0285a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNo7Nb+Tfz4NaZnNF2rD4zjnNkq9E5adwW6jvazHIRmvaWpsFGMq/mUB5pbEqVeeagd+clycxks0faqbu9MnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:18:05.630745Z","bundle_sha256":"606fd5e3beb620cf39eedadf68b34c706c9393c348f656c5719f31e6d91ab65a"}}