{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RNYABJMZPJF7IC2KT65E5FSJOB","short_pith_number":"pith:RNYABJMZ","canonical_record":{"source":{"id":"1505.07168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-27T01:17:10Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"d309a5e8dfae1abfe7954311edcb60af4dbbd15683a1e481af3796f1d576c025","abstract_canon_sha256":"6b7861688f2499f624e86b4a8065e21ee32fdd7a79c03a95281d5d67e97109a0"},"schema_version":"1.0"},"canonical_sha256":"8b7000a5997a4bf40b4a9fba4e96497065438a597668eb126bb9d59f797c026c","source":{"kind":"arxiv","id":"1505.07168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07168","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07168v1","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07168","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"RNYABJMZPJF7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNYABJMZPJF7IC2K","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNYABJMZ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RNYABJMZPJF7IC2KT65E5FSJOB","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-27T01:17:10Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"d309a5e8dfae1abfe7954311edcb60af4dbbd15683a1e481af3796f1d576c025","abstract_canon_sha256":"6b7861688f2499f624e86b4a8065e21ee32fdd7a79c03a95281d5d67e97109a0"},"schema_version":"1.0"},"canonical_sha256":"8b7000a5997a4bf40b4a9fba4e96497065438a597668eb126bb9d59f797c026c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:07.286364Z","signature_b64":"av9rjW2IEllsP9sDiMYacwoEX3bLrA5kF9qVKAxiEhzs9KDFzqFxU/WwR+XHVyDCaIFZU7cthVGpAziBLNElDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7000a5997a4bf40b4a9fba4e96497065438a597668eb126bb9d59f797c026c","last_reissued_at":"2026-05-18T02:02:07.285756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:07.285756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07168","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-18T02:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmEvZagXDphlDDJJRiK8/TNhK/1TB9l7EhFgZHaJtN6s/boPKeRd2wVXb53VkwgFRCDd0UqDEpjwutZMutytBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:11:32.848757Z"},"content_sha256":"271f4e42b8c0be8b6def3eb2476e28fd9132689f44b96aa36843011ed5e48066","schema_version":"1.0","event_id":"sha256:271f4e42b8c0be8b6def3eb2476e28fd9132689f44b96aa36843011ed5e48066"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RNYABJMZPJF7IC2KT65E5FSJOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Giuseppe Prencipe, Linda Pagli","submitted_at":"2015-05-27T01:17:10Z","abstract_excerpt":"In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the Euclidean plane in Look-Compute-Move (LCM) cycles. In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding with) any other robot. The importance of solving the Near-Gathering problem is that it makes it possible to overcome the restriction of having robots with limited visibility. Hence it allows to exploit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07168","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-18T02:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GO57jO/ASDQH7aQwPZj9rranPzUsO1zEozitqwaIHj/VqnMTAPdHvHnoO0u9JvVVrpOHiDTDWbza3YXoPk8oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:11:32.849458Z"},"content_sha256":"4e3a6e50fcc84d54d2b36fc7d1100a10f6607686414ad58a68beea4c5fc06961","schema_version":"1.0","event_id":"sha256:4e3a6e50fcc84d54d2b36fc7d1100a10f6607686414ad58a68beea4c5fc06961"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNYABJMZPJF7IC2KT65E5FSJOB/bundle.json","state_url":"https://pith.science/pith/RNYABJMZPJF7IC2KT65E5FSJOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNYABJMZPJF7IC2KT65E5FSJOB/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-09T10:11:32Z","links":{"resolver":"https://pith.science/pith/RNYABJMZPJF7IC2KT65E5FSJOB","bundle":"https://pith.science/pith/RNYABJMZPJF7IC2KT65E5FSJOB/bundle.json","state":"https://pith.science/pith/RNYABJMZPJF7IC2KT65E5FSJOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNYABJMZPJF7IC2KT65E5FSJOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RNYABJMZPJF7IC2KT65E5FSJOB","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":"6b7861688f2499f624e86b4a8065e21ee32fdd7a79c03a95281d5d67e97109a0","cross_cats_sorted":["cs.CG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-27T01:17:10Z","title_canon_sha256":"d309a5e8dfae1abfe7954311edcb60af4dbbd15683a1e481af3796f1d576c025"},"schema_version":"1.0","source":{"id":"1505.07168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07168","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07168v1","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07168","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"RNYABJMZPJF7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNYABJMZPJF7IC2K","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNYABJMZ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:4e3a6e50fcc84d54d2b36fc7d1100a10f6607686414ad58a68beea4c5fc06961","target":"graph","created_at":"2026-05-18T02:02:07Z","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":"In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the Euclidean plane in Look-Compute-Move (LCM) cycles. In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding with) any other robot. The importance of solving the Near-Gathering problem is that it makes it possible to overcome the restriction of having robots with limited visibility. Hence it allows to exploit","authors_text":"Giovanni Viglietta, Giuseppe Prencipe, Linda Pagli","cross_cats":["cs.CG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-27T01:17:10Z","title":"Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07168","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:271f4e42b8c0be8b6def3eb2476e28fd9132689f44b96aa36843011ed5e48066","target":"record","created_at":"2026-05-18T02:02:07Z","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":"6b7861688f2499f624e86b4a8065e21ee32fdd7a79c03a95281d5d67e97109a0","cross_cats_sorted":["cs.CG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-27T01:17:10Z","title_canon_sha256":"d309a5e8dfae1abfe7954311edcb60af4dbbd15683a1e481af3796f1d576c025"},"schema_version":"1.0","source":{"id":"1505.07168","kind":"arxiv","version":1}},"canonical_sha256":"8b7000a5997a4bf40b4a9fba4e96497065438a597668eb126bb9d59f797c026c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b7000a5997a4bf40b4a9fba4e96497065438a597668eb126bb9d59f797c026c","first_computed_at":"2026-05-18T02:02:07.285756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:07.285756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"av9rjW2IEllsP9sDiMYacwoEX3bLrA5kF9qVKAxiEhzs9KDFzqFxU/WwR+XHVyDCaIFZU7cthVGpAziBLNElDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:07.286364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:271f4e42b8c0be8b6def3eb2476e28fd9132689f44b96aa36843011ed5e48066","sha256:4e3a6e50fcc84d54d2b36fc7d1100a10f6607686414ad58a68beea4c5fc06961"],"state_sha256":"69c73a6608e618af5e6a3c62d916c8ca8a0263cb9c3acd30c5d6b7e76f4e25d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9bjhJRY5dekwOdHhjPUwyYaR+VeMQoWLW6CbEPtcda+p6r1Sjh3jdpMWTAZ9DIJ7b+6jqB4JC9uzfFFZ9N0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:11:32.853702Z","bundle_sha256":"ed44316a384ef3d1bc6e8f5741fb81c88aa40e1d2ac49839b7fcaab3728cc053"}}