{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YSNDIS755EQW4IJKPO4WBIDZMB","short_pith_number":"pith:YSNDIS75","schema_version":"1.0","canonical_sha256":"c49a344bfde9216e212a7bb960a0796051bc769337d32c93cc3900dc78de8f06","source":{"kind":"arxiv","id":"1309.6603","version":2},"attestation_state":"computed","paper":{"title":"The Random Bit Complexity of Mobile Robots Scattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.MA","cs.RO"],"primary_cat":"cs.DS","authors_text":"IUF), LINCS, Quentin Bramas (LIP6), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-09-25T18:37:40Z","abstract_excerpt":"We consider the problem of scattering $n$ robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be probabilistic. We investigate the amount of randomness (that is, the number of random bits used by the robots) that is required to achieve scattering. We first prove that $n \\log n$ random bits are necessary to scatter $n$ robots in any setting. Also, we give a sufficient condition for a scattering algorithm to be random bit optimal. As it turns out that previous solutions for scattering satisfy our condition, they are h"},"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":"1309.6603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T18:37:40Z","cross_cats_sorted":["cs.CC","cs.DC","cs.MA","cs.RO"],"title_canon_sha256":"8687ed8ae950a1cdec3d052be296826a6b8ffe1ee18d9481d01bc4a80451ef96","abstract_canon_sha256":"fd4e753b1c9c4a66f487c5a0c562fd65e578cea4a9a4d5764dc32ad96e4de068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:31.989616Z","signature_b64":"/Q7fIYu8HJ1uFkPPbSL+OQ/g8rqrhAT5xcCajKHNgx6GaenreOkw+3lRqPyMhWnwbTLd9kHn3dWDkTn5rKmECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c49a344bfde9216e212a7bb960a0796051bc769337d32c93cc3900dc78de8f06","last_reissued_at":"2026-05-18T02:26:31.989223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:31.989223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Random Bit Complexity of Mobile Robots Scattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.MA","cs.RO"],"primary_cat":"cs.DS","authors_text":"IUF), LINCS, Quentin Bramas (LIP6), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-09-25T18:37:40Z","abstract_excerpt":"We consider the problem of scattering $n$ robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be probabilistic. We investigate the amount of randomness (that is, the number of random bits used by the robots) that is required to achieve scattering. We first prove that $n \\log n$ random bits are necessary to scatter $n$ robots in any setting. Also, we give a sufficient condition for a scattering algorithm to be random bit optimal. As it turns out that previous solutions for scattering satisfy our condition, they are h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6603","kind":"arxiv","version":2},"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":"1309.6603","created_at":"2026-05-18T02:26:31.989282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6603v2","created_at":"2026-05-18T02:26:31.989282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6603","created_at":"2026-05-18T02:26:31.989282+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSNDIS755EQW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSNDIS755EQW4IJK","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSNDIS75","created_at":"2026-05-18T12:28:09.283467+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/YSNDIS755EQW4IJKPO4WBIDZMB","json":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB.json","graph_json":"https://pith.science/api/pith-number/YSNDIS755EQW4IJKPO4WBIDZMB/graph.json","events_json":"https://pith.science/api/pith-number/YSNDIS755EQW4IJKPO4WBIDZMB/events.json","paper":"https://pith.science/paper/YSNDIS75"},"agent_actions":{"view_html":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB","download_json":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB.json","view_paper":"https://pith.science/paper/YSNDIS75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6603&json=true","fetch_graph":"https://pith.science/api/pith-number/YSNDIS755EQW4IJKPO4WBIDZMB/graph.json","fetch_events":"https://pith.science/api/pith-number/YSNDIS755EQW4IJKPO4WBIDZMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB/action/storage_attestation","attest_author":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB/action/author_attestation","sign_citation":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB/action/citation_signature","submit_replication":"https://pith.science/pith/YSNDIS755EQW4IJKPO4WBIDZMB/action/replication_record"}},"created_at":"2026-05-18T02:26:31.989282+00:00","updated_at":"2026-05-18T02:26:31.989282+00:00"}