{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BHXDYVMSDEJ5TSMOK2KBOR7MQ","short_pith_number":"pith:2BHXDYVM","schema_version":"1.0","canonical_sha256":"d04f71e2ac90c89ece4c72b4a0ba3f642823288271d477072fdafcd5b03f5840","source":{"kind":"arxiv","id":"1702.03400","version":3},"attestation_state":"computed","paper":{"title":"Gathering Anonymous, Oblivious Robots on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.DC","authors_text":"Daniel Jung, Friedhelm Meyer auf der Heide, Matthias Fischer","submitted_at":"2017-02-11T09:34:13Z","abstract_excerpt":"We consider a swarm of $n$ autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (not predefined) place. A common local model for extremely simple robots is the following: The robots do not have a common compass, only have a constant viewing radius, are autonomous and indistinguishable, can move at most a constant distance in each step, cannot communicate, are oblivious and do not have flags or states. The only gathering algorithm under this robot model, with known runtime bounds, needs $\\mathcal{"},"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":"1702.03400","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-11T09:34:13Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"c7ce420232ae142571dc8a399218a295756c796fa9c90f2466dc011581f2a966","abstract_canon_sha256":"ee58cf75416955172f5244fc878260ec2eab91898c600f812c3a7041e804dedb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:41.781704Z","signature_b64":"T0ZTJUIuJsa9GAHFGBpDK0RSLOJzx5Jubo+haWFeTc/Y4u/HU+s4xzULAuN7FK8nkCjL50EsE0MKt5mlsKXfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d04f71e2ac90c89ece4c72b4a0ba3f642823288271d477072fdafcd5b03f5840","last_reissued_at":"2026-05-18T00:38:41.781069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:41.781069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gathering Anonymous, Oblivious Robots on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.DC","authors_text":"Daniel Jung, Friedhelm Meyer auf der Heide, Matthias Fischer","submitted_at":"2017-02-11T09:34:13Z","abstract_excerpt":"We consider a swarm of $n$ autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (not predefined) place. A common local model for extremely simple robots is the following: The robots do not have a common compass, only have a constant viewing radius, are autonomous and indistinguishable, can move at most a constant distance in each step, cannot communicate, are oblivious and do not have flags or states. The only gathering algorithm under this robot model, with known runtime bounds, needs $\\mathcal{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03400","kind":"arxiv","version":3},"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":"1702.03400","created_at":"2026-05-18T00:38:41.781178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03400v3","created_at":"2026-05-18T00:38:41.781178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03400","created_at":"2026-05-18T00:38:41.781178+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BHXDYVMSDEJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BHXDYVMSDEJ5TSM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BHXDYVM","created_at":"2026-05-18T12:30:55.937587+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/2BHXDYVMSDEJ5TSMOK2KBOR7MQ","json":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ.json","graph_json":"https://pith.science/api/pith-number/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/graph.json","events_json":"https://pith.science/api/pith-number/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/events.json","paper":"https://pith.science/paper/2BHXDYVM"},"agent_actions":{"view_html":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ","download_json":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ.json","view_paper":"https://pith.science/paper/2BHXDYVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03400&json=true","fetch_graph":"https://pith.science/api/pith-number/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/action/storage_attestation","attest_author":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/action/author_attestation","sign_citation":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/action/citation_signature","submit_replication":"https://pith.science/pith/2BHXDYVMSDEJ5TSMOK2KBOR7MQ/action/replication_record"}},"created_at":"2026-05-18T00:38:41.781178+00:00","updated_at":"2026-05-18T00:38:41.781178+00:00"}