{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LEBUVYJG27UW3E6BMVUJ7XM67Z","short_pith_number":"pith:LEBUVYJG","schema_version":"1.0","canonical_sha256":"59034ae126d7e96d93c165689fdd9efe6366fa6e341baba927e775ce50fb1756","source":{"kind":"arxiv","id":"2108.09403","version":1},"attestation_state":"computed","paper":{"title":"Deadlock and Noise in Self-Organized Aggregation Without Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.RO","authors_text":"Andr\\'ea W. Richa, Joshua J. Daymude, Noble C. Harasha, Ryan Yiu","submitted_at":"2021-08-20T23:37:54Z","abstract_excerpt":"Aggregation is a fundamental behavior for swarm robotics that requires a system to gather together in a compact, connected cluster. In 2014, Gauci et al. proposed a surprising algorithm that reliably achieves swarm aggregation using only a binary line-of-sight sensor and no arithmetic computation or persistent memory. It has been rigorously proven that this algorithm will aggregate one robot to another, but it remained open whether it would always aggregate a system of $n > 2$ robots as was observed in experiments and simulations. We prove that there exist deadlocked configurations from which "},"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":"2108.09403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-08-20T23:37:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"97c871345f6d747e44adb55af7a21843dee4d113731ff43ee94727ba49d3898f","abstract_canon_sha256":"ec8ec882f9003b43cdb147d74d83fd675381cf30eecd102675ac19edd99ac2b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:05:38.508641Z","signature_b64":"W7TMCU9/p4IJGm7Gt+wHaxMik1Hq2gSnW5ZM/+PzFIoZqY8Z5ndmEC00LQbh99FQi8W3d/4GnSL02di5yIG/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59034ae126d7e96d93c165689fdd9efe6366fa6e341baba927e775ce50fb1756","last_reissued_at":"2026-06-03T02:05:38.508159Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:05:38.508159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deadlock and Noise in Self-Organized Aggregation Without Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.RO","authors_text":"Andr\\'ea W. Richa, Joshua J. Daymude, Noble C. Harasha, Ryan Yiu","submitted_at":"2021-08-20T23:37:54Z","abstract_excerpt":"Aggregation is a fundamental behavior for swarm robotics that requires a system to gather together in a compact, connected cluster. In 2014, Gauci et al. proposed a surprising algorithm that reliably achieves swarm aggregation using only a binary line-of-sight sensor and no arithmetic computation or persistent memory. It has been rigorously proven that this algorithm will aggregate one robot to another, but it remained open whether it would always aggregate a system of $n > 2$ robots as was observed in experiments and simulations. We prove that there exist deadlocked configurations from which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09403","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.09403/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.09403","created_at":"2026-06-03T02:05:38.508213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09403v1","created_at":"2026-06-03T02:05:38.508213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09403","created_at":"2026-06-03T02:05:38.508213+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEBUVYJG27UW","created_at":"2026-06-03T02:05:38.508213+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEBUVYJG27UW3E6B","created_at":"2026-06-03T02:05:38.508213+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEBUVYJG","created_at":"2026-06-03T02:05:38.508213+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/LEBUVYJG27UW3E6BMVUJ7XM67Z","json":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z.json","graph_json":"https://pith.science/api/pith-number/LEBUVYJG27UW3E6BMVUJ7XM67Z/graph.json","events_json":"https://pith.science/api/pith-number/LEBUVYJG27UW3E6BMVUJ7XM67Z/events.json","paper":"https://pith.science/paper/LEBUVYJG"},"agent_actions":{"view_html":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z","download_json":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z.json","view_paper":"https://pith.science/paper/LEBUVYJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09403&json=true","fetch_graph":"https://pith.science/api/pith-number/LEBUVYJG27UW3E6BMVUJ7XM67Z/graph.json","fetch_events":"https://pith.science/api/pith-number/LEBUVYJG27UW3E6BMVUJ7XM67Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z/action/storage_attestation","attest_author":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z/action/author_attestation","sign_citation":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z/action/citation_signature","submit_replication":"https://pith.science/pith/LEBUVYJG27UW3E6BMVUJ7XM67Z/action/replication_record"}},"created_at":"2026-06-03T02:05:38.508213+00:00","updated_at":"2026-06-03T02:05:38.508213+00:00"}