{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UJ3VSBPBLT3NCXE2EPJFV52BTD","short_pith_number":"pith:UJ3VSBPB","schema_version":"1.0","canonical_sha256":"a2775905e15cf6d15c9a23d25af74198d4fba3df2ab3e64e95fffe96bf231834","source":{"kind":"arxiv","id":"1605.06093","version":2},"attestation_state":"computed","paper":{"title":"Square Formation by Asynchronous Oblivious Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Marcello Mamino","submitted_at":"2016-05-19T19:40:36Z","abstract_excerpt":"A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration.\n  In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, non-chiral, and non-rigid. For this very elementary type of robots, the feasibility of the Pattern Formation problem has been settled, either in the positive or in the negative"},"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":"1605.06093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-19T19:40:36Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"cafb39be75250adea30108242a612ca87f3c8e1be8d6647a274ee9b7381d6151","abstract_canon_sha256":"10ea1d8f15c1056aac40c372c86413295f454354b9ac49a1c1e8e7a574c4e381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:20.053073Z","signature_b64":"5LCzVrvdG11adQxKxqBdpijCg8cbqCW64h7dxNVcsNp7DESQpyYDm5XN+A24sLBUqxgHCoXzqR0AbFPQayjkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2775905e15cf6d15c9a23d25af74198d4fba3df2ab3e64e95fffe96bf231834","last_reissued_at":"2026-05-18T01:14:20.052337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:20.052337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square Formation by Asynchronous Oblivious Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Marcello Mamino","submitted_at":"2016-05-19T19:40:36Z","abstract_excerpt":"A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration.\n  In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, non-chiral, and non-rigid. For this very elementary type of robots, the feasibility of the Pattern Formation problem has been settled, either in the positive or in the negative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06093","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":"1605.06093","created_at":"2026-05-18T01:14:20.052461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06093v2","created_at":"2026-05-18T01:14:20.052461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06093","created_at":"2026-05-18T01:14:20.052461+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ3VSBPBLT3N","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ3VSBPBLT3NCXE2","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ3VSBPB","created_at":"2026-05-18T12:30:46.583412+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/UJ3VSBPBLT3NCXE2EPJFV52BTD","json":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD.json","graph_json":"https://pith.science/api/pith-number/UJ3VSBPBLT3NCXE2EPJFV52BTD/graph.json","events_json":"https://pith.science/api/pith-number/UJ3VSBPBLT3NCXE2EPJFV52BTD/events.json","paper":"https://pith.science/paper/UJ3VSBPB"},"agent_actions":{"view_html":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD","download_json":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD.json","view_paper":"https://pith.science/paper/UJ3VSBPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06093&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ3VSBPBLT3NCXE2EPJFV52BTD/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ3VSBPBLT3NCXE2EPJFV52BTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD/action/storage_attestation","attest_author":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD/action/author_attestation","sign_citation":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD/action/citation_signature","submit_replication":"https://pith.science/pith/UJ3VSBPBLT3NCXE2EPJFV52BTD/action/replication_record"}},"created_at":"2026-05-18T01:14:20.052461+00:00","updated_at":"2026-05-18T01:14:20.052461+00:00"}