{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZMNW5QC6E237RUGWUOQ7PE5AJW","short_pith_number":"pith:ZMNW5QC6","canonical_record":{"source":{"id":"1602.03303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-10T09:23:55Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ce8da0fb0a1962ae23dfcedd19e4f366aad6fd391fee0c051714713aa59fec07","abstract_canon_sha256":"3f9e1b35bc1e80bb8a73b2a38cfd2e1bf6e937c6bacf166b596c01d941e1fca8"},"schema_version":"1.0"},"canonical_sha256":"cb1b6ec05e26b7f8d0d6a3a1f793a04db65efc7b7bbcaef255d8d93400765ddb","source":{"kind":"arxiv","id":"1602.03303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03303","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03303v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03303","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZMNW5QC6E237","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZMNW5QC6E237RUGW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZMNW5QC6","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZMNW5QC6E237RUGWUOQ7PE5AJW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-10T09:23:55Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ce8da0fb0a1962ae23dfcedd19e4f366aad6fd391fee0c051714713aa59fec07","abstract_canon_sha256":"3f9e1b35bc1e80bb8a73b2a38cfd2e1bf6e937c6bacf166b596c01d941e1fca8"},"schema_version":"1.0"},"canonical_sha256":"cb1b6ec05e26b7f8d0d6a3a1f793a04db65efc7b7bbcaef255d8d93400765ddb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:00.314221Z","signature_b64":"g3Mh5t9Hbv5iR0A9vQz9ha+6JLuAcCTU126KoXhy5lF0JU77u19I9xTyWTNwdRW/1WGCYhTN5d5H80qa88xeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb1b6ec05e26b7f8d0d6a3a1f793a04db65efc7b7bbcaef255d8d93400765ddb","last_reissued_at":"2026-05-18T01:21:00.313763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:00.313763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03303","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-18T01:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObZ+SLM624XXuuBX1H2Jiy7FONEafDmzcDQrqRjvSRhkvWwuyMizrP3cPQnt1xIkfPhKdcJnlYK8t2mfIvW5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:03:41.210360Z"},"content_sha256":"3a68cdef89ac34d902bd6ef00eac893b82e8fddcf41a7f5e9659c8c5c35c49e7","schema_version":"1.0","event_id":"sha256:3a68cdef89ac34d902bd6ef00eac893b82e8fddcf41a7f5e9659c8c5c35c49e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZMNW5QC6E237RUGWUOQ7PE5AJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Gathering on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.DC","authors_text":"Andreas Cord-Landwehr, Daniel Jung, Friedhelm Meyer auf der Heide, Matthias Fischer","submitted_at":"2016-02-10T09:23:55Z","abstract_excerpt":"In this paper, we solve the local gathering problem of a swarm of $n$ indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous $\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a $2\\times 2$-sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03303","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-18T01:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGsKUbieMCputZPOzQ6tyeA54KJo++jNQTu1mHt+BKQfm7mf8DrlQCR2f8LX4Bx57OzCYbRYvTqCSOl6hvqeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:03:41.210715Z"},"content_sha256":"92d34d4efdb7f543cfe8e3f5a38bca195bf789b211f939bf1cdbfb22f42cc335","schema_version":"1.0","event_id":"sha256:92d34d4efdb7f543cfe8e3f5a38bca195bf789b211f939bf1cdbfb22f42cc335"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/bundle.json","state_url":"https://pith.science/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/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-01T13:03:41Z","links":{"resolver":"https://pith.science/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW","bundle":"https://pith.science/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/bundle.json","state":"https://pith.science/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMNW5QC6E237RUGWUOQ7PE5AJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZMNW5QC6E237RUGWUOQ7PE5AJW","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":"3f9e1b35bc1e80bb8a73b2a38cfd2e1bf6e937c6bacf166b596c01d941e1fca8","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-10T09:23:55Z","title_canon_sha256":"ce8da0fb0a1962ae23dfcedd19e4f366aad6fd391fee0c051714713aa59fec07"},"schema_version":"1.0","source":{"id":"1602.03303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03303","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03303v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03303","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZMNW5QC6E237","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZMNW5QC6E237RUGW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZMNW5QC6","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:92d34d4efdb7f543cfe8e3f5a38bca195bf789b211f939bf1cdbfb22f42cc335","target":"graph","created_at":"2026-05-18T01:21:00Z","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 solve the local gathering problem of a swarm of $n$ indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous $\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a $2\\times 2$-sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and","authors_text":"Andreas Cord-Landwehr, Daniel Jung, Friedhelm Meyer auf der Heide, Matthias Fischer","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-10T09:23:55Z","title":"Asymptotically Optimal Gathering on a Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03303","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:3a68cdef89ac34d902bd6ef00eac893b82e8fddcf41a7f5e9659c8c5c35c49e7","target":"record","created_at":"2026-05-18T01:21:00Z","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":"3f9e1b35bc1e80bb8a73b2a38cfd2e1bf6e937c6bacf166b596c01d941e1fca8","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-10T09:23:55Z","title_canon_sha256":"ce8da0fb0a1962ae23dfcedd19e4f366aad6fd391fee0c051714713aa59fec07"},"schema_version":"1.0","source":{"id":"1602.03303","kind":"arxiv","version":1}},"canonical_sha256":"cb1b6ec05e26b7f8d0d6a3a1f793a04db65efc7b7bbcaef255d8d93400765ddb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb1b6ec05e26b7f8d0d6a3a1f793a04db65efc7b7bbcaef255d8d93400765ddb","first_computed_at":"2026-05-18T01:21:00.313763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:00.313763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3Mh5t9Hbv5iR0A9vQz9ha+6JLuAcCTU126KoXhy5lF0JU77u19I9xTyWTNwdRW/1WGCYhTN5d5H80qa88xeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:00.314221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a68cdef89ac34d902bd6ef00eac893b82e8fddcf41a7f5e9659c8c5c35c49e7","sha256:92d34d4efdb7f543cfe8e3f5a38bca195bf789b211f939bf1cdbfb22f42cc335"],"state_sha256":"754c13bc3d274c2d236a93d72c2e5ccda80ffc559487c6f0f5f1c568b3ff30a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtKqy+h2t7+ls5OuGp4cUZRCBTgXowHhscDc3LcTz8RSzQ38ehE4XX5qkRm7Ueb0/4JvXAQOGAlvx6yLd/o6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:03:41.212679Z","bundle_sha256":"3a924ce99ffd83d4d726ca335bc7c837b71f9c86e7f58eea686397e378264967"}}