{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:32SSOWNCACU7E4YYW6ECKYLLQA","short_pith_number":"pith:32SSOWNC","schema_version":"1.0","canonical_sha256":"dea52759a200a9f27318b78825616b80097849414e89c4f87bd7beea8b195c09","source":{"kind":"arxiv","id":"1906.06239","version":1},"attestation_state":"computed","paper":{"title":"Gathering with extremely restricted visibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer, Rachid Guerraoui","submitted_at":"2019-06-14T15:11:45Z","abstract_excerpt":"We consider the classical problem of making mobile processes gather or converge at a same position (as performed by swarms of animals in Nature). Existing works assume that each process can see all other processes, or all processes within a certain radius. In this paper, we introduce a new model with an extremely restricted visibility: each process can only see one other process (its closest neighbor). Our goal is to see if (and to what extent) the gathering and convergence problems can be solved in this setting. We first show that, surprisingly, the problem can be solved for a small number of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.06239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-14T15:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"73b97dbc7221147477077573332652550223d3cc3c2ce4668d6f6b88f4aa0738","abstract_canon_sha256":"6a67132ec00e03225ee05e67855cfa1c7c6b7b2c5f07be756b6cd2b990067e53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:19.245563Z","signature_b64":"BBCaDENm3DINUyRicrO6g3TyIblYIxwCU2HqxT/a22dtEyIozkRZngvJRBJt08FXcLUTsPPTOSSPph1jQwkgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea52759a200a9f27318b78825616b80097849414e89c4f87bd7beea8b195c09","last_reissued_at":"2026-05-17T23:43:19.244889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:19.244889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gathering with extremely restricted visibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer, Rachid Guerraoui","submitted_at":"2019-06-14T15:11:45Z","abstract_excerpt":"We consider the classical problem of making mobile processes gather or converge at a same position (as performed by swarms of animals in Nature). Existing works assume that each process can see all other processes, or all processes within a certain radius. In this paper, we introduce a new model with an extremely restricted visibility: each process can only see one other process (its closest neighbor). Our goal is to see if (and to what extent) the gathering and convergence problems can be solved in this setting. We first show that, surprisingly, the problem can be solved for a small number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06239","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.06239","created_at":"2026-05-17T23:43:19.245010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06239v1","created_at":"2026-05-17T23:43:19.245010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06239","created_at":"2026-05-17T23:43:19.245010+00:00"},{"alias_kind":"pith_short_12","alias_value":"32SSOWNCACU7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"32SSOWNCACU7E4YY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"32SSOWNC","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA","json":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA.json","graph_json":"https://pith.science/api/pith-number/32SSOWNCACU7E4YYW6ECKYLLQA/graph.json","events_json":"https://pith.science/api/pith-number/32SSOWNCACU7E4YYW6ECKYLLQA/events.json","paper":"https://pith.science/paper/32SSOWNC"},"agent_actions":{"view_html":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA","download_json":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA.json","view_paper":"https://pith.science/paper/32SSOWNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06239&json=true","fetch_graph":"https://pith.science/api/pith-number/32SSOWNCACU7E4YYW6ECKYLLQA/graph.json","fetch_events":"https://pith.science/api/pith-number/32SSOWNCACU7E4YYW6ECKYLLQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA/action/storage_attestation","attest_author":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA/action/author_attestation","sign_citation":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA/action/citation_signature","submit_replication":"https://pith.science/pith/32SSOWNCACU7E4YYW6ECKYLLQA/action/replication_record"}},"created_at":"2026-05-17T23:43:19.245010+00:00","updated_at":"2026-05-17T23:43:19.245010+00:00"}