{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KVXDREPGDZPFFGOOK7G7XQXJL2","short_pith_number":"pith:KVXDREPG","schema_version":"1.0","canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","source":{"kind":"arxiv","id":"1707.05629","version":4},"attestation_state":"computed","paper":{"title":"Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"John Augustine, William K. Moses Jr","submitted_at":"2017-07-18T14:11:02Z","abstract_excerpt":"We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion.\n  Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally,"},"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":"1707.05629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf2f0090401982d97d097a852c6b9bee21e88c25ca19a6dca4e70262c30f8434","abstract_canon_sha256":"156e9f23ad3479ddf392494d92d666e1358f7a1b5b3dd9e4c3c461a5c486bb57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:39.283095Z","signature_b64":"iRAp+14TCWoCCVNGm4/zBUMlZvpMsRTGhB2EFNGmvSVTXi62U9IjW/9+rPGa+oIg3nSrr5rakTWtCoNTtJ0HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","last_reissued_at":"2026-05-18T00:10:39.282540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:39.282540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"John Augustine, William K. Moses Jr","submitted_at":"2017-07-18T14:11:02Z","abstract_excerpt":"We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion.\n  Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05629","kind":"arxiv","version":4},"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":"1707.05629","created_at":"2026-05-18T00:10:39.282618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05629v4","created_at":"2026-05-18T00:10:39.282618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05629","created_at":"2026-05-18T00:10:39.282618+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVXDREPGDZPF","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVXDREPGDZPFFGOO","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVXDREPG","created_at":"2026-05-18T12:31:28.150371+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/KVXDREPGDZPFFGOOK7G7XQXJL2","json":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2.json","graph_json":"https://pith.science/api/pith-number/KVXDREPGDZPFFGOOK7G7XQXJL2/graph.json","events_json":"https://pith.science/api/pith-number/KVXDREPGDZPFFGOOK7G7XQXJL2/events.json","paper":"https://pith.science/paper/KVXDREPG"},"agent_actions":{"view_html":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2","download_json":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2.json","view_paper":"https://pith.science/paper/KVXDREPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05629&json=true","fetch_graph":"https://pith.science/api/pith-number/KVXDREPGDZPFFGOOK7G7XQXJL2/graph.json","fetch_events":"https://pith.science/api/pith-number/KVXDREPGDZPFFGOOK7G7XQXJL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/action/storage_attestation","attest_author":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/action/author_attestation","sign_citation":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/action/citation_signature","submit_replication":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/action/replication_record"}},"created_at":"2026-05-18T00:10:39.282618+00:00","updated_at":"2026-05-18T00:10:39.282618+00:00"}