{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OVRYACEWFQKSNOPJOKEHMRUSBB","short_pith_number":"pith:OVRYACEW","schema_version":"1.0","canonical_sha256":"75638008962c1526b9e97288764692087a701374531325658c708f9ca0ccdeec","source":{"kind":"arxiv","id":"1706.05193","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Verification of Algorithms for Oblivious Robots on a Ring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LO","cs.RO"],"primary_cat":"cs.DC","authors_text":"Arnaud Sangnier (IRIF), IUF, LINCS), Maria Potop-Butucaru (NPA, Nathalie Sznajder (MoVe), S\\'ebastien Tixeuil (NPA","submitted_at":"2017-06-16T09:38:21Z","abstract_excerpt":"We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the model proposed by Suzuki and Yamashita of anonymous robots evolving in a discrete space with a finite number of locations (here, a ring). A large number of algorithms have been proposed working for rings whose size is not a priori fixed and can be hence considered as a parameter. Handmade correctness proofs of these algorithms have been shown to be error-prone, and recent attention had been given to the application of fo"},"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":"1706.05193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-16T09:38:21Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LO","cs.RO"],"title_canon_sha256":"89ab3e22dae53734a98658162aa38f1f7277582f9bfb6b299a584c99d19ce343","abstract_canon_sha256":"5fa8b173b8166bae785507c24048907d2455785febcbb8d6d6a08a73ec6f3e08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:14.492345Z","signature_b64":"hnK4ChFkb0//MmD+rjc4SiUed2fYegG/MHsc/ioSob0Te0SWUxYS6g8q/5VxgS587qrMcMsF8Rl/FKm5z8tiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75638008962c1526b9e97288764692087a701374531325658c708f9ca0ccdeec","last_reissued_at":"2026-05-18T00:42:14.491791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:14.491791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Verification of Algorithms for Oblivious Robots on a Ring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LO","cs.RO"],"primary_cat":"cs.DC","authors_text":"Arnaud Sangnier (IRIF), IUF, LINCS), Maria Potop-Butucaru (NPA, Nathalie Sznajder (MoVe), S\\'ebastien Tixeuil (NPA","submitted_at":"2017-06-16T09:38:21Z","abstract_excerpt":"We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the model proposed by Suzuki and Yamashita of anonymous robots evolving in a discrete space with a finite number of locations (here, a ring). A large number of algorithms have been proposed working for rings whose size is not a priori fixed and can be hence considered as a parameter. Handmade correctness proofs of these algorithms have been shown to be error-prone, and recent attention had been given to the application of fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05193","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":"1706.05193","created_at":"2026-05-18T00:42:14.491875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05193v1","created_at":"2026-05-18T00:42:14.491875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05193","created_at":"2026-05-18T00:42:14.491875+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVRYACEWFQKS","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVRYACEWFQKSNOPJ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVRYACEW","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/OVRYACEWFQKSNOPJOKEHMRUSBB","json":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB.json","graph_json":"https://pith.science/api/pith-number/OVRYACEWFQKSNOPJOKEHMRUSBB/graph.json","events_json":"https://pith.science/api/pith-number/OVRYACEWFQKSNOPJOKEHMRUSBB/events.json","paper":"https://pith.science/paper/OVRYACEW"},"agent_actions":{"view_html":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB","download_json":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB.json","view_paper":"https://pith.science/paper/OVRYACEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05193&json=true","fetch_graph":"https://pith.science/api/pith-number/OVRYACEWFQKSNOPJOKEHMRUSBB/graph.json","fetch_events":"https://pith.science/api/pith-number/OVRYACEWFQKSNOPJOKEHMRUSBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB/action/storage_attestation","attest_author":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB/action/author_attestation","sign_citation":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB/action/citation_signature","submit_replication":"https://pith.science/pith/OVRYACEWFQKSNOPJOKEHMRUSBB/action/replication_record"}},"created_at":"2026-05-18T00:42:14.491875+00:00","updated_at":"2026-05-18T00:42:14.491875+00:00"}