{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:52ORDAQ7BZ673DKNPREUWN5BCH","short_pith_number":"pith:52ORDAQ7","schema_version":"1.0","canonical_sha256":"ee9d11821f0e7dfd8d4d7c494b37a111c01cc68b2aa6ed481a45253bee8eb2af","source":{"kind":"arxiv","id":"1805.12242","version":1},"attestation_state":"computed","paper":{"title":"Efficient Dispersion of Mobile Robots on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay D. Kshemkalyani, Faizan Ali","submitted_at":"2018-05-30T22:04:57Z","abstract_excerpt":"The dispersion problem on graphs requires $k$ robots placed arbitrarily at the $n$ nodes of an anonymous graph, where $k \\leq n$, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. In addition, an intrinsic application of dispersion has been shown to be the relocation of self-driven electric cars (robots) to recharge stations (nodes). We propose three efficient algorithms to sol"},"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":"1805.12242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T22:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"9e23567d25c133b66e448c53bfae6f4c3cba9e7ad1bbd1b81b7cd3179cdf7279","abstract_canon_sha256":"dd24dd1aa1a7c1c42fb50d4bda9efd24ecdb98ad8521d75c1d30d26c50dd0517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:30.996312Z","signature_b64":"cdTPDnHLFovdAh0szuS4ryaNuLxCCsF0vEBJUk8Dm3GBOy1XdHMU7lxjQYk22i8AHisHyXJnmbztkjXKBu+OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee9d11821f0e7dfd8d4d7c494b37a111c01cc68b2aa6ed481a45253bee8eb2af","last_reissued_at":"2026-05-18T00:14:30.995714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:30.995714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dispersion of Mobile Robots on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay D. Kshemkalyani, Faizan Ali","submitted_at":"2018-05-30T22:04:57Z","abstract_excerpt":"The dispersion problem on graphs requires $k$ robots placed arbitrarily at the $n$ nodes of an anonymous graph, where $k \\leq n$, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. In addition, an intrinsic application of dispersion has been shown to be the relocation of self-driven electric cars (robots) to recharge stations (nodes). We propose three efficient algorithms to sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12242","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":"1805.12242","created_at":"2026-05-18T00:14:30.995793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12242v1","created_at":"2026-05-18T00:14:30.995793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12242","created_at":"2026-05-18T00:14:30.995793+00:00"},{"alias_kind":"pith_short_12","alias_value":"52ORDAQ7BZ67","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"52ORDAQ7BZ673DKN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"52ORDAQ7","created_at":"2026-05-18T12:32:05.422762+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/52ORDAQ7BZ673DKNPREUWN5BCH","json":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH.json","graph_json":"https://pith.science/api/pith-number/52ORDAQ7BZ673DKNPREUWN5BCH/graph.json","events_json":"https://pith.science/api/pith-number/52ORDAQ7BZ673DKNPREUWN5BCH/events.json","paper":"https://pith.science/paper/52ORDAQ7"},"agent_actions":{"view_html":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH","download_json":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH.json","view_paper":"https://pith.science/paper/52ORDAQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12242&json=true","fetch_graph":"https://pith.science/api/pith-number/52ORDAQ7BZ673DKNPREUWN5BCH/graph.json","fetch_events":"https://pith.science/api/pith-number/52ORDAQ7BZ673DKNPREUWN5BCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH/action/storage_attestation","attest_author":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH/action/author_attestation","sign_citation":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH/action/citation_signature","submit_replication":"https://pith.science/pith/52ORDAQ7BZ673DKNPREUWN5BCH/action/replication_record"}},"created_at":"2026-05-18T00:14:30.995793+00:00","updated_at":"2026-05-18T00:14:30.995793+00:00"}