{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XV5YN5B3CW3VBOW2EDCY3G3AH2","short_pith_number":"pith:XV5YN5B3","schema_version":"1.0","canonical_sha256":"bd7b86f43b15b750bada20c58d9b603e9c1aab6ac8eae8792a62a423804e89d6","source":{"kind":"arxiv","id":"1907.09871","version":1},"attestation_state":"computed","paper":{"title":"Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.DC","authors_text":"Adam Heriban, Koichi Wada, S\\'ebastien Tixeuil, Xavier D\\'efago","submitted_at":"2019-07-23T13:31:39Z","abstract_excerpt":"The paper details the first successful attempt at using model-checking techniques to verify the correctness of distributed algorithms for robots evolving in a \\emph{continuous} environment. The study focuses on the problem of rendezvous of two robots with lights.\n  There exist many different rendezvous algorithms that aim at finding the minimal number of colors needed to solve rendezvous in various synchrony models (e.g., FSYNC, SSYNC, ASYNC). While these rendezvous algorithms are typically very simple, their analysis and proof of correctness tend to be extremely complex, tedious, and error-pr"},"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":"1907.09871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-23T13:31:39Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"f8c0bde9d629295f2e16036a934f6e0c772acc6db1cad33588836792f3ae4d84","abstract_canon_sha256":"3664cd45e7e34c1711bd23592598edebe21355175249167c50efd738e5000a95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.845960Z","signature_b64":"HSdvVHpzm5qOfSzsaICJFGefB/xXoMoZ6K3NfRjd5B/N2t6fzze1RcZGn86mzolsb2uM9ZlkH3eK+mF/ftm0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7b86f43b15b750bada20c58d9b603e9c1aab6ac8eae8792a62a423804e89d6","last_reissued_at":"2026-05-17T23:39:49.845416Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.845416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.DC","authors_text":"Adam Heriban, Koichi Wada, S\\'ebastien Tixeuil, Xavier D\\'efago","submitted_at":"2019-07-23T13:31:39Z","abstract_excerpt":"The paper details the first successful attempt at using model-checking techniques to verify the correctness of distributed algorithms for robots evolving in a \\emph{continuous} environment. The study focuses on the problem of rendezvous of two robots with lights.\n  There exist many different rendezvous algorithms that aim at finding the minimal number of colors needed to solve rendezvous in various synchrony models (e.g., FSYNC, SSYNC, ASYNC). While these rendezvous algorithms are typically very simple, their analysis and proof of correctness tend to be extremely complex, tedious, and error-pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09871","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":"1907.09871","created_at":"2026-05-17T23:39:49.845499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09871v1","created_at":"2026-05-17T23:39:49.845499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09871","created_at":"2026-05-17T23:39:49.845499+00:00"},{"alias_kind":"pith_short_12","alias_value":"XV5YN5B3CW3V","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XV5YN5B3CW3VBOW2","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XV5YN5B3","created_at":"2026-05-18T12:33:33.725879+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/XV5YN5B3CW3VBOW2EDCY3G3AH2","json":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2.json","graph_json":"https://pith.science/api/pith-number/XV5YN5B3CW3VBOW2EDCY3G3AH2/graph.json","events_json":"https://pith.science/api/pith-number/XV5YN5B3CW3VBOW2EDCY3G3AH2/events.json","paper":"https://pith.science/paper/XV5YN5B3"},"agent_actions":{"view_html":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2","download_json":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2.json","view_paper":"https://pith.science/paper/XV5YN5B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09871&json=true","fetch_graph":"https://pith.science/api/pith-number/XV5YN5B3CW3VBOW2EDCY3G3AH2/graph.json","fetch_events":"https://pith.science/api/pith-number/XV5YN5B3CW3VBOW2EDCY3G3AH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2/action/storage_attestation","attest_author":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2/action/author_attestation","sign_citation":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2/action/citation_signature","submit_replication":"https://pith.science/pith/XV5YN5B3CW3VBOW2EDCY3G3AH2/action/replication_record"}},"created_at":"2026-05-17T23:39:49.845499+00:00","updated_at":"2026-05-17T23:39:49.845499+00:00"}