{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RNPXZDWVG3QN5CR6OG4OY42UKS","short_pith_number":"pith:RNPXZDWV","schema_version":"1.0","canonical_sha256":"8b5f7c8ed536e0de8a3e71b8ec735454acfc115341effd76a1379731f4029cff","source":{"kind":"arxiv","id":"1902.10489","version":1},"attestation_state":"computed","paper":{"title":"Dispersion of Mobile Robots: The Power of Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, William K. Moses Jr","submitted_at":"2019-02-27T12:46:14Z","abstract_excerpt":"We consider cooperation among insects, modeled as cooperation between mobile robots on a graph. Within this setting, we consider the problem of mobile robot dispersion on graphs. The study of mobile robots on a graph is an interesting paradigm with many interesting problems and applications. The problem of dispersion in this context, introduced by Augustine and Moses Jr., asks that $n$ robots, initially placed arbitrarily on an $n$ node graph, work together to quickly reach a configuration with exactly one robot at each node. Previous work on this problem has looked at the trade-off between th"},"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":"1902.10489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-27T12:46:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"76214c517aaf8a493416967edaa628ba73f0d9a541a4cb2d0f00f19e4c82c257","abstract_canon_sha256":"4b85acfef66372f59ae09f840b2478f600d9f5be3178cc081a7de23234127bed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:30.750693Z","signature_b64":"DUhDfMLkpOwQ3l4ofmR6445BSt8IH4K2g2k5p0legDUyLMvgKmY2nktSTtNJcsAn9b8E1YrWkJlhgIckUE20Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b5f7c8ed536e0de8a3e71b8ec735454acfc115341effd76a1379731f4029cff","last_reissued_at":"2026-05-17T23:52:30.750281Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:30.750281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dispersion of Mobile Robots: The Power of Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, William K. Moses Jr","submitted_at":"2019-02-27T12:46:14Z","abstract_excerpt":"We consider cooperation among insects, modeled as cooperation between mobile robots on a graph. Within this setting, we consider the problem of mobile robot dispersion on graphs. The study of mobile robots on a graph is an interesting paradigm with many interesting problems and applications. The problem of dispersion in this context, introduced by Augustine and Moses Jr., asks that $n$ robots, initially placed arbitrarily on an $n$ node graph, work together to quickly reach a configuration with exactly one robot at each node. Previous work on this problem has looked at the trade-off between th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10489","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":"1902.10489","created_at":"2026-05-17T23:52:30.750348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10489v1","created_at":"2026-05-17T23:52:30.750348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10489","created_at":"2026-05-17T23:52:30.750348+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNPXZDWVG3QN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNPXZDWVG3QN5CR6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNPXZDWV","created_at":"2026-05-18T12:33:27.125529+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/RNPXZDWVG3QN5CR6OG4OY42UKS","json":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS.json","graph_json":"https://pith.science/api/pith-number/RNPXZDWVG3QN5CR6OG4OY42UKS/graph.json","events_json":"https://pith.science/api/pith-number/RNPXZDWVG3QN5CR6OG4OY42UKS/events.json","paper":"https://pith.science/paper/RNPXZDWV"},"agent_actions":{"view_html":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS","download_json":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS.json","view_paper":"https://pith.science/paper/RNPXZDWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10489&json=true","fetch_graph":"https://pith.science/api/pith-number/RNPXZDWVG3QN5CR6OG4OY42UKS/graph.json","fetch_events":"https://pith.science/api/pith-number/RNPXZDWVG3QN5CR6OG4OY42UKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS/action/storage_attestation","attest_author":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS/action/author_attestation","sign_citation":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS/action/citation_signature","submit_replication":"https://pith.science/pith/RNPXZDWVG3QN5CR6OG4OY42UKS/action/replication_record"}},"created_at":"2026-05-17T23:52:30.750348+00:00","updated_at":"2026-05-17T23:52:30.750348+00:00"}