{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F27GYITBEYY33IHRLXVS3C74AQ","short_pith_number":"pith:F27GYITB","schema_version":"1.0","canonical_sha256":"2ebe6c22612631bda0f15deb2d8bfc0419576dc9e27d8bd195b9e84699671ac9","source":{"kind":"arxiv","id":"1405.5902","version":1},"attestation_state":"computed","paper":{"title":"Impossibility of Gathering, a Certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.RO"],"primary_cat":"cs.LO","authors_text":"ENSIIE, ENSIIE), IUF), LINCS, Lionel Rieg (CEDRIC, LRI), Pierre Courtieu (CEDRIC), S\\'ebastien Tixeuil (LIP6, Xavier Urbain (CEDRIC","submitted_at":"2014-05-22T20:34:03Z","abstract_excerpt":"Recent advances in Distributed Computing highlight models and algorithms for autonomous swarms of mobile robots that self-organise and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and proofs of correctness. This paper builds upon a previously proposed formal framework to certify the correctness of impossibility results regarding distributed algorithms that are dedicated to autonomous mobile robots evolving in a continuous space. As a case study, we consider the problem of gathering all robots at a particular location, not known b"},"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":"1405.5902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-22T20:34:03Z","cross_cats_sorted":["cs.DC","cs.RO"],"title_canon_sha256":"b10a74149b09b1c4eb41074cce6806ba6b71185403934988a09d0f35d0551efa","abstract_canon_sha256":"f5e4d255418dd8d00cf9070dfb974968bed09a0ab4196cb25ffdb77e42ac53e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.503891Z","signature_b64":"wE44zDvlB5icFWNj6gapVD2sRlUvb5nXa96nNPH9KHAIwBIIMDUZEkHxU8ArnbIOo9o+VR2WxOEbr3y9npeaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ebe6c22612631bda0f15deb2d8bfc0419576dc9e27d8bd195b9e84699671ac9","last_reissued_at":"2026-05-18T02:51:14.503336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.503336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impossibility of Gathering, a Certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.RO"],"primary_cat":"cs.LO","authors_text":"ENSIIE, ENSIIE), IUF), LINCS, Lionel Rieg (CEDRIC, LRI), Pierre Courtieu (CEDRIC), S\\'ebastien Tixeuil (LIP6, Xavier Urbain (CEDRIC","submitted_at":"2014-05-22T20:34:03Z","abstract_excerpt":"Recent advances in Distributed Computing highlight models and algorithms for autonomous swarms of mobile robots that self-organise and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and proofs of correctness. This paper builds upon a previously proposed formal framework to certify the correctness of impossibility results regarding distributed algorithms that are dedicated to autonomous mobile robots evolving in a continuous space. As a case study, we consider the problem of gathering all robots at a particular location, not known b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5902","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":"1405.5902","created_at":"2026-05-18T02:51:14.503425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5902v1","created_at":"2026-05-18T02:51:14.503425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5902","created_at":"2026-05-18T02:51:14.503425+00:00"},{"alias_kind":"pith_short_12","alias_value":"F27GYITBEYY3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F27GYITBEYY33IHR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F27GYITB","created_at":"2026-05-18T12:28:28.263976+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/F27GYITBEYY33IHRLXVS3C74AQ","json":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ.json","graph_json":"https://pith.science/api/pith-number/F27GYITBEYY33IHRLXVS3C74AQ/graph.json","events_json":"https://pith.science/api/pith-number/F27GYITBEYY33IHRLXVS3C74AQ/events.json","paper":"https://pith.science/paper/F27GYITB"},"agent_actions":{"view_html":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ","download_json":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ.json","view_paper":"https://pith.science/paper/F27GYITB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5902&json=true","fetch_graph":"https://pith.science/api/pith-number/F27GYITBEYY33IHRLXVS3C74AQ/graph.json","fetch_events":"https://pith.science/api/pith-number/F27GYITBEYY33IHRLXVS3C74AQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ/action/storage_attestation","attest_author":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ/action/author_attestation","sign_citation":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ/action/citation_signature","submit_replication":"https://pith.science/pith/F27GYITBEYY33IHRLXVS3C74AQ/action/replication_record"}},"created_at":"2026-05-18T02:51:14.503425+00:00","updated_at":"2026-05-18T02:51:14.503425+00:00"}