{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SMCY5E6OKEVALXA7SCHLHOIYBK","short_pith_number":"pith:SMCY5E6O","schema_version":"1.0","canonical_sha256":"93058e93ce512a05dc1f908eb3b9180aa3c2be02ec3525878192fc435bd71818","source":{"kind":"arxiv","id":"1105.5817","version":1},"attestation_state":"computed","paper":{"title":"Robot Networks with Homonyms: The Case of Patterns Formation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anissa Lamani (MIS), Zohir Bouzid (LIP6)","submitted_at":"2011-05-29T19:23:54Z","abstract_excerpt":"In this paper, we consider the problem of formation of a series of geometric patterns [4] by a network of oblivious mobile robots that communicate only through vision. So far, the problem has been studied in models where robots are either assumed to have distinct identifiers or to be completely anonymous. To generalize these results and to better understand how anonymity affects the computational power of robots, we study the problem in a new model, introduced recently in [5], in which n robots may share up to 1 <= h <= n different identifiers. We present necessary and sufficient conditions, r"},"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":"1105.5817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-29T19:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"90b57daa1eade149609d1f4c05106bfce0c077774ba8aa2e6e4edfff88024b89","abstract_canon_sha256":"76524103e03d013595f0c461c204d7c94ed847416babb4f46719e2a277c90f81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:01.465897Z","signature_b64":"nAL1jnA7pwDJIZnjfzdUnWTHeT0ykPYSxw78rklKM2rGNrllYgeF/LjNKFCibpAKKSDg5KvP6onlansBOdZYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93058e93ce512a05dc1f908eb3b9180aa3c2be02ec3525878192fc435bd71818","last_reissued_at":"2026-05-18T04:21:01.465444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:01.465444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robot Networks with Homonyms: The Case of Patterns Formation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anissa Lamani (MIS), Zohir Bouzid (LIP6)","submitted_at":"2011-05-29T19:23:54Z","abstract_excerpt":"In this paper, we consider the problem of formation of a series of geometric patterns [4] by a network of oblivious mobile robots that communicate only through vision. So far, the problem has been studied in models where robots are either assumed to have distinct identifiers or to be completely anonymous. To generalize these results and to better understand how anonymity affects the computational power of robots, we study the problem in a new model, introduced recently in [5], in which n robots may share up to 1 <= h <= n different identifiers. We present necessary and sufficient conditions, r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5817","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":"1105.5817","created_at":"2026-05-18T04:21:01.465520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5817v1","created_at":"2026-05-18T04:21:01.465520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5817","created_at":"2026-05-18T04:21:01.465520+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMCY5E6OKEVA","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMCY5E6OKEVALXA7","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMCY5E6O","created_at":"2026-05-18T12:26:41.206345+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/SMCY5E6OKEVALXA7SCHLHOIYBK","json":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK.json","graph_json":"https://pith.science/api/pith-number/SMCY5E6OKEVALXA7SCHLHOIYBK/graph.json","events_json":"https://pith.science/api/pith-number/SMCY5E6OKEVALXA7SCHLHOIYBK/events.json","paper":"https://pith.science/paper/SMCY5E6O"},"agent_actions":{"view_html":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK","download_json":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK.json","view_paper":"https://pith.science/paper/SMCY5E6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5817&json=true","fetch_graph":"https://pith.science/api/pith-number/SMCY5E6OKEVALXA7SCHLHOIYBK/graph.json","fetch_events":"https://pith.science/api/pith-number/SMCY5E6OKEVALXA7SCHLHOIYBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK/action/storage_attestation","attest_author":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK/action/author_attestation","sign_citation":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK/action/citation_signature","submit_replication":"https://pith.science/pith/SMCY5E6OKEVALXA7SCHLHOIYBK/action/replication_record"}},"created_at":"2026-05-18T04:21:01.465520+00:00","updated_at":"2026-05-18T04:21:01.465520+00:00"}