{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OFKBQSVLZRJ7KH7OIOZTMRHLNW","short_pith_number":"pith:OFKBQSVL","schema_version":"1.0","canonical_sha256":"7154184aabcc53f51fee43b33644eb6dbc048151b9f17e968f9dfc648a33f908","source":{"kind":"arxiv","id":"1708.06183","version":1},"attestation_state":"computed","paper":{"title":"Optimally Gathering Two Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.RO"],"primary_cat":"cs.DC","authors_text":"Adam Heriban (NPA), IUF, LINCS), S\\'ebastien Tixeuil (NPA, Xavier D\\'efago (TITECH)","submitted_at":"2017-08-21T12:29:25Z","abstract_excerpt":"We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light, a robot has no memory of its past actions, and its protocol is deterministic. Since, in the same model, gathering is impossible when lights have a single color, our solution is optimal with respect to the number of used colors."},"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":"1708.06183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-21T12:29:25Z","cross_cats_sorted":["cs.CC","cs.DS","cs.RO"],"title_canon_sha256":"d91d01de383f7fc6744d1808ea07e9d6af16c67003ad4c1d785bbfa8bb63a19b","abstract_canon_sha256":"7e2df92a49b002eac79373dceb9f7429fc48e1c4a7e4530536e6454e20c2efa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:42.988534Z","signature_b64":"2oE6fsdYaQaJdGsnMZFtr24EwrzKwH7rOC1PFIyuEtzkYSG+nh6sV92t36wbGO1cq3GkhpvX7fI0qJKwIDb5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7154184aabcc53f51fee43b33644eb6dbc048151b9f17e968f9dfc648a33f908","last_reissued_at":"2026-05-18T00:37:42.987828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:42.987828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Gathering Two Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.RO"],"primary_cat":"cs.DC","authors_text":"Adam Heriban (NPA), IUF, LINCS), S\\'ebastien Tixeuil (NPA, Xavier D\\'efago (TITECH)","submitted_at":"2017-08-21T12:29:25Z","abstract_excerpt":"We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light, a robot has no memory of its past actions, and its protocol is deterministic. Since, in the same model, gathering is impossible when lights have a single color, our solution is optimal with respect to the number of used colors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06183","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":"1708.06183","created_at":"2026-05-18T00:37:42.987925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06183v1","created_at":"2026-05-18T00:37:42.987925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06183","created_at":"2026-05-18T00:37:42.987925+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFKBQSVLZRJ7","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFKBQSVLZRJ7KH7O","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFKBQSVL","created_at":"2026-05-18T12:31:34.259226+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/OFKBQSVLZRJ7KH7OIOZTMRHLNW","json":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW.json","graph_json":"https://pith.science/api/pith-number/OFKBQSVLZRJ7KH7OIOZTMRHLNW/graph.json","events_json":"https://pith.science/api/pith-number/OFKBQSVLZRJ7KH7OIOZTMRHLNW/events.json","paper":"https://pith.science/paper/OFKBQSVL"},"agent_actions":{"view_html":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW","download_json":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW.json","view_paper":"https://pith.science/paper/OFKBQSVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06183&json=true","fetch_graph":"https://pith.science/api/pith-number/OFKBQSVLZRJ7KH7OIOZTMRHLNW/graph.json","fetch_events":"https://pith.science/api/pith-number/OFKBQSVLZRJ7KH7OIOZTMRHLNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW/action/storage_attestation","attest_author":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW/action/author_attestation","sign_citation":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW/action/citation_signature","submit_replication":"https://pith.science/pith/OFKBQSVLZRJ7KH7OIOZTMRHLNW/action/replication_record"}},"created_at":"2026-05-18T00:37:42.987925+00:00","updated_at":"2026-05-18T00:37:42.987925+00:00"}