{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MKXT6LW5VAQ6JCVKBCWDOA4RQD","short_pith_number":"pith:MKXT6LW5","canonical_record":{"source":{"id":"1602.08361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T15:16:21Z","cross_cats_sorted":["cs.DS","cs.LO","cs.RO"],"title_canon_sha256":"ca9c6d9400ff152c3883c03dd620305b711b4e38fff4d804d3b53a19a3534fc7","abstract_canon_sha256":"8b19fe7e1dcd82a71f607ed8226c7b13cddaa26d750e5a387f407255e15b1186"},"schema_version":"1.0"},"canonical_sha256":"62af3f2edda821e48aaa08ac37039180f4a82dfcc9927534cef259d02ab93075","source":{"kind":"arxiv","id":"1602.08361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08361","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08361v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08361","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"MKXT6LW5VAQ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKXT6LW5VAQ6JCVK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKXT6LW5","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MKXT6LW5VAQ6JCVKBCWDOA4RQD","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T15:16:21Z","cross_cats_sorted":["cs.DS","cs.LO","cs.RO"],"title_canon_sha256":"ca9c6d9400ff152c3883c03dd620305b711b4e38fff4d804d3b53a19a3534fc7","abstract_canon_sha256":"8b19fe7e1dcd82a71f607ed8226c7b13cddaa26d750e5a387f407255e15b1186"},"schema_version":"1.0"},"canonical_sha256":"62af3f2edda821e48aaa08ac37039180f4a82dfcc9927534cef259d02ab93075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.225894Z","signature_b64":"cA1H+AYxWlj+qSd4/nJGUMxO1pWnK/M1iSNWuw3xii0BX7ZIHgPP9E4SA03qxZBG7y5xxLRbj/IYVw7ID3A+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62af3f2edda821e48aaa08ac37039180f4a82dfcc9927534cef259d02ab93075","last_reissued_at":"2026-05-18T01:19:56.225237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.225237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08361","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuXIOFfbki6lFQEWdDvJlkfrwpki39dNJvE6nkXSWv5dkiZMZ/47MKVW0nHyAicZ3JA1O3KzeLYDkexgG+BYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:35.347186Z"},"content_sha256":"1a399098a2e22ee14e9e56986180e549c97e19e53ab0506e7bc099bda13f6a59","schema_version":"1.0","event_id":"sha256:1a399098a2e22ee14e9e56986180e549c97e19e53ab0506e7bc099bda13f6a59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MKXT6LW5VAQ6JCVKBCWDOA4RQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO","cs.RO"],"primary_cat":"cs.DC","authors_text":"IUF), Lionel Rieg, LRI), NPA, Pierre Courtieu (CEDRIC), S\\'ebastien Tixeuil (LINCS, Xavier Urbain (ENSIIE","submitted_at":"2016-02-26T15:16:21Z","abstract_excerpt":"We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that takes advantage of this formal framework. As a case study, we present the first formally certified protocol for oblivious mobile robots evolving in a two-dimensional Euclidean space. In more details, we provide a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08361","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oK6lwWOdsT/sS+V7O668WvHyZ09e85RmUv7BomsTT++GOqw4Vw3iNODSXcGIigxEQCcVy7TB+zjKpLOk4v+vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:35.347554Z"},"content_sha256":"657bca564d1ff764a1074ef3357fdde4ac5cc102ef2167c28099b836fe6b284f","schema_version":"1.0","event_id":"sha256:657bca564d1ff764a1074ef3357fdde4ac5cc102ef2167c28099b836fe6b284f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/bundle.json","state_url":"https://pith.science/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T06:24:35Z","links":{"resolver":"https://pith.science/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD","bundle":"https://pith.science/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/bundle.json","state":"https://pith.science/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKXT6LW5VAQ6JCVKBCWDOA4RQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MKXT6LW5VAQ6JCVKBCWDOA4RQD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8b19fe7e1dcd82a71f607ed8226c7b13cddaa26d750e5a387f407255e15b1186","cross_cats_sorted":["cs.DS","cs.LO","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T15:16:21Z","title_canon_sha256":"ca9c6d9400ff152c3883c03dd620305b711b4e38fff4d804d3b53a19a3534fc7"},"schema_version":"1.0","source":{"id":"1602.08361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08361","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08361v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08361","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"MKXT6LW5VAQ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKXT6LW5VAQ6JCVK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKXT6LW5","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:657bca564d1ff764a1074ef3357fdde4ac5cc102ef2167c28099b836fe6b284f","target":"graph","created_at":"2026-05-18T01:19:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that takes advantage of this formal framework. As a case study, we present the first formally certified protocol for oblivious mobile robots evolving in a two-dimensional Euclidean space. In more details, we provide a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite numb","authors_text":"IUF), Lionel Rieg, LRI), NPA, Pierre Courtieu (CEDRIC), S\\'ebastien Tixeuil (LINCS, Xavier Urbain (ENSIIE","cross_cats":["cs.DS","cs.LO","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T15:16:21Z","title":"Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08361","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1a399098a2e22ee14e9e56986180e549c97e19e53ab0506e7bc099bda13f6a59","target":"record","created_at":"2026-05-18T01:19:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8b19fe7e1dcd82a71f607ed8226c7b13cddaa26d750e5a387f407255e15b1186","cross_cats_sorted":["cs.DS","cs.LO","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T15:16:21Z","title_canon_sha256":"ca9c6d9400ff152c3883c03dd620305b711b4e38fff4d804d3b53a19a3534fc7"},"schema_version":"1.0","source":{"id":"1602.08361","kind":"arxiv","version":1}},"canonical_sha256":"62af3f2edda821e48aaa08ac37039180f4a82dfcc9927534cef259d02ab93075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62af3f2edda821e48aaa08ac37039180f4a82dfcc9927534cef259d02ab93075","first_computed_at":"2026-05-18T01:19:56.225237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.225237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cA1H+AYxWlj+qSd4/nJGUMxO1pWnK/M1iSNWuw3xii0BX7ZIHgPP9E4SA03qxZBG7y5xxLRbj/IYVw7ID3A+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.225894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a399098a2e22ee14e9e56986180e549c97e19e53ab0506e7bc099bda13f6a59","sha256:657bca564d1ff764a1074ef3357fdde4ac5cc102ef2167c28099b836fe6b284f"],"state_sha256":"6a25eee7e1049653336f5458ffc8bf677584ad4b21c800d8810ab769f0ca9032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzKy7lPyCTcfcGTNI3s9ZU50NQfDLadsbdgcayqgIAQDIeLGWiHigBFbx1NKO+29lC5OWb3IAvIZ40tmKsrDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:24:35.349564Z","bundle_sha256":"d3e2686c250199035cb7d5cb1b690962e0818515e9720f34a185e16331c2aa58"}}