{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JHALD5DNI5V3G2PZKSJKZXQXH","short_pith_number":"pith:3JHALD5D","schema_version":"1.0","canonical_sha256":"da4e058fa36a3b5d9b4fcaa49566f0b9d098d56978faad4cb0c4c08fd764d2be","source":{"kind":"arxiv","id":"1706.02474","version":2},"attestation_state":"computed","paper":{"title":"Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alfredo Navarra, Gabriele Di Stefano, Serafino Cicerone","submitted_at":"2017-06-08T08:26:10Z","abstract_excerpt":"Given any multiset F of points in the Euclidean plane and a set R of robots such that |R|=|F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections, uniform scalings. Initially, each robot occupies a distinct position. When active, a robot operates in standard LCM cycles. Robots are asynchronous, oblivious, anonymous, silent and execute the same distributed algorithm. So far, the problem has been mainly ad"},"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":"1706.02474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-08T08:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"8ae5f4001e5832d58ebfdf441440f8e24833233b2c7bf15b448ecf766d7d37f2","abstract_canon_sha256":"3779d2c31d625ef4423e192fe909d605ca8bc457f0002c1a98632c2bb5429935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:17.394179Z","signature_b64":"eeyuG2bHecJQKwzgkm7/F5oBZ5PHJ2oIW6E2b5sZ5PU1C7bT0H00fQajJ5sbw2PAfsF5X9UiU+eL94BxO4veCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4e058fa36a3b5d9b4fcaa49566f0b9d098d56978faad4cb0c4c08fd764d2be","last_reissued_at":"2026-05-18T00:24:17.393519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:17.393519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alfredo Navarra, Gabriele Di Stefano, Serafino Cicerone","submitted_at":"2017-06-08T08:26:10Z","abstract_excerpt":"Given any multiset F of points in the Euclidean plane and a set R of robots such that |R|=|F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections, uniform scalings. Initially, each robot occupies a distinct position. When active, a robot operates in standard LCM cycles. Robots are asynchronous, oblivious, anonymous, silent and execute the same distributed algorithm. So far, the problem has been mainly ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02474","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":"1706.02474","created_at":"2026-05-18T00:24:17.393618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02474v2","created_at":"2026-05-18T00:24:17.393618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02474","created_at":"2026-05-18T00:24:17.393618+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JHALD5DNI5V","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JHALD5DNI5V3G2P","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JHALD5D","created_at":"2026-05-18T12:30:58.224056+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/3JHALD5DNI5V3G2PZKSJKZXQXH","json":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH.json","graph_json":"https://pith.science/api/pith-number/3JHALD5DNI5V3G2PZKSJKZXQXH/graph.json","events_json":"https://pith.science/api/pith-number/3JHALD5DNI5V3G2PZKSJKZXQXH/events.json","paper":"https://pith.science/paper/3JHALD5D"},"agent_actions":{"view_html":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH","download_json":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH.json","view_paper":"https://pith.science/paper/3JHALD5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/3JHALD5DNI5V3G2PZKSJKZXQXH/graph.json","fetch_events":"https://pith.science/api/pith-number/3JHALD5DNI5V3G2PZKSJKZXQXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH/action/storage_attestation","attest_author":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH/action/author_attestation","sign_citation":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH/action/citation_signature","submit_replication":"https://pith.science/pith/3JHALD5DNI5V3G2PZKSJKZXQXH/action/replication_record"}},"created_at":"2026-05-18T00:24:17.393618+00:00","updated_at":"2026-05-18T00:24:17.393618+00:00"}